Patent US2329561A successfully refreshed from Google Patents.
Patent US5369671A successfully refreshed from Google Patents.
US5369671A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for decoding tail-biting code especially applicable to digital cellular base stations and mobile units
Assignee: Raytheon Co
•
Filing: 1992-05-20
•
Granted: 1994-11-29
•
Expires: 2012-05-20
Abstract
Abstract A digital cellular system (10) employs a decoder that decodes control messages encoded by a convolutional tail-biting encoding procedure. The control messages (57) contain 65 bits that are encoded in a 260 bit data frame (59). The decoder reads (112) the first x quadruple bits and writes them also at the end of the data frame bit stream. A Viterbi decoding algorithm (114) is applied to the modified bit stream for x plus 65 steps. A bit stream of (65+x) bits is selected (116) from a best value path and y first bits are discarded from the selected stream. The output decoded message (118) includes bits (y+1) through (y+65).
Inventors
- 👤 Moshe Yehushua
- 👤 John Watson
- 👤 Michael Parr
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 07:07
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/41; H03M13/4123; H03M13/03; H03M13/23
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
178 words
A decoder for B bit control messages each of which is encoded in a stream of E data bits in a data frame prior to transmission by a convolutional tail-biting encoding procedure, said decoder comprising: means for modifying the stream of E data bits in the input data frame carrying the encoded message by placing a plurality of bits corresponding to x first quadruple bits in the stream of E bits in the message carrying data frame at the end of the stream of E bits; means for applying a Viterbi decoding algorithm to the modified stream of bits with predetermined starting states for a number of steps equal to B plus x; means for selecting another bit stream having a number of bits equal to B plus x from a best value path generated by said algorithm; means for discarding y first bits from said other bit stream; and means for generating an output decoded message having a number of bits equal to the remaining bits in said other bit stream from bit y+1 through bit y+B.
Claim 2
Dependent Claim
178 words
A decoder for B bit control messages each of which is encoded in a stream of E data bits in a data frame prior to transmission by a convolutional tail-biting encoding procedure, said decoder comprising: means for modifying the stream of E data bits in the input data frame carrying the encoded message by placing a plurality of bits corresponding to x first quadruple bits in the stream of E bits in the message carrying data frame at the end of the stream of E bits; means for applying a Viterbi decoding algorithm to the modified stream of bits with predetermined starting states for a number of steps equal to B plus x; means for selecting another bit stream having a number of bits equal to B plus x from a best value path generated by said algorithm; means for discarding y first bits from said other bit stream; and means for generating an output decoded message having a number of bits equal to the remaining bits in said other bit stream from bit y+1 through bit y+B.
Claim 3
Dependent Claim
13 words
The decoder of claim 1 wherein B equals 65 and E equals 260.
Claim 4
Dependent Claim
16 words
The decoder of claim 2 wherein x has a value in the range 2 to 100.
Claim 5
Dependent Claim
16 words
The decoder of claim 2 wherein y has a value in the range 1 to 50.
Claim 6
Dependent Claim
16 words
The decoder of claim 4 wherein x has a value in the range 2 to 100.
Claim 7
Dependent Claim
9 words
The decoder of claim 5 wherein x equals 31.
Claim 8
Dependent Claim
9 words
The decoder of claim 5 wherein y equals 12.
Claim 9
Dependent Claim
9 words
The decoder of claim 7 wherein x equals 31.
Claim 10
Dependent Claim
67 words
The decoder of claim 1 further comprising means for receiving and downconverting radio signals that carry the encoded control messages, means for demodulating data signals representing the encoded control messages from the downconverted radio signals, and means for processing each decoded control message to implement commands in the control message and wherein the means for modifying modifies the demodulated data signals generated by the means for demodulating.
Claim 11
Independent Claim
183 words
A system for decoding messages encoded in an E bit data frame prior to transmission by a convolutional tail-biting encoding procedure, said receiving and decoding system comprising: means for decoding each input encoded message including means for modifying the stream of E data bits in the input data frame carrying the encoded message; said modifying means placing a plurality of bits corresponding to x first quadruple bits in the stream of E bits in the message carrying data frame at the end of the bit stream; said decoding means further including means for applying a Viterbi decoding algorithm to the modified stream of bits with predetermined starting states for a number of steps equal to B plus x; means for selecting another bit stream having a number of bits equal to B plus x from a best value path generated by said algorithm; means for discarding y first bits from said other bit stream; and means for generating an output decoded message having a number of bits equal to the remaining bits in said other bit stream from bit y+1 through bit y+B.
Claim 12
Independent Claim
183 words
A system for decoding messages encoded in an E bit data frame prior to transmission by a convolutional tail-biting encoding procedure, said receiving and decoding system comprising: means for decoding each input encoded message including means for modifying the stream of E data bits in the input data frame carrying the encoded message; said modifying means placing a plurality of bits corresponding to x first quadruple bits in the stream of E bits in the message carrying data frame at the end of the bit stream; said decoding means further including means for applying a Viterbi decoding algorithm to the modified stream of bits with predetermined starting states for a number of steps equal to B plus x; means for selecting another bit stream having a number of bits equal to B plus x from a best value path generated by said algorithm; means for discarding y first bits from said other bit stream; and means for generating an output decoded message having a number of bits equal to the remaining bits in said other bit stream from bit y+1 through bit y+B.
Claim 13
Dependent Claim
23 words
The system of claim 10 wherein B equals 65, E equals 260, and x has a value in the range 2 to 100.
Claim 14
Dependent Claim
16 words
The system of claim 11 wherein y has a value in the range 1 to 50.
Claim 15
Independent Claim
165 words
A method for decoding B bit control messages each of which is encoded in an E bit data frame prior to transmission by a convolutional tail-biting encoding procedure, the steps of said method comprising: modifying the stream of E data bits in the input data frame carrying the encoded message by placing a plurality of bits corresponding to x first quadruple bits in the stream of E bits in the message carrying data frame at the end of the bit stream; applying a Viterbi decoding algorithm to the modified stream of bits with predetermined starting states for a number of steps equal to B plus x; selecting another bit stream having a number of bits equal to B plus x from a best value path generated by the algorithm; discarding y first bits from the other bit stream; and generating an output decoded message having a number of bits equal to the remaining bits in the other bit stream from bit y+1 through bit y+B.
Claim 16
Independent Claim
165 words
A method for decoding B bit control messages each of which is encoded in an E bit data frame prior to transmission by a convolutional tail-biting encoding procedure, the steps of said method comprising: modifying the stream of E data bits in the input data frame carrying the encoded message by placing a plurality of bits corresponding to x first quadruple bits in the stream of E bits in the message carrying data frame at the end of the bit stream; applying a Viterbi decoding algorithm to the modified stream of bits with predetermined starting states for a number of steps equal to B plus x; selecting another bit stream having a number of bits equal to B plus x from a best value path generated by the algorithm; discarding y first bits from the other bit stream; and generating an output decoded message having a number of bits equal to the remaining bits in the other bit stream from bit y+1 through bit y+B.
Claim 17
Dependent Claim
33 words
The method of claim 13 wherein B equals 65, E equals 260, x has a value in the range 2 to 100 and y has a value in the range 1 to 50.
Claim 18
Dependent Claim
100 words
The method of claim 13 wherein the steps of said method further include: comparing state y with state (y+B) in said other bit stream of the best value; if no match is found in the comparing step repeating the decoding and comparing steps on said other bit stream to subsequent path nodes until a state match is obtained or until a predetermined number of nodes have been processed; and discarding the first y bits from said other bit stream after any comparing step for which states y and (y+B) match or after the predetermined number of nodes has been processed.
Claim 19
Dependent Claim
78 words
The method of claim 13 further comprising the steps of: receiving and downconverting radio signals that carry the encoded control messages; demodulating data signals representing the encoded control messages from the downconverted radio signals; processing each decoded control message to implement commands in the control messages; and wherein the step of modifying comprises modifying the stream of E data bits in the input data frame by acting on the demodulated data signals generated in the step of demodulating.
References Cited (Backward Citations)
US5199031A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-11-28 | 1998-05-30 | 1998-11-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-11-28 | 2002-05-30 | 2002-11-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-11-28 | 2006-05-30 | 2006-11-29 | $7700.00 | Window Closed / Lapsed |