US5651032A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for trellis decoder
Assignee: Toshiba Corp
•
Filing: 1994-11-02
•
Granted: 1997-07-22
•
Expires: 2014-11-02
Abstract
Abstract A digital data processing apparatus capable of reducing a circuit scale without deteriorating error-correcting capability, and capable of reducing the bit number of a branch metric calculating circuit. The apparatus includes: a region determining portion which determines an optimal bit number corresponding to the number of representative symbol groups; a delaying portion which delays an output from the region determining portion for as long as a coded bit is decoded by a Viterbi decoding portion; and a decoding portion which inputs and decodes an output from the delaying portion and a coded bit that is decoded by the Viterbi decoding portion so as to be decoded, and which outputs the uncoded bit.
Inventors
- 👤 Shigeru Okita
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 23:43
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/65; H03M13/6502; H03M13/25; H03M13/256; H03M13/37; H03M13/39; H03M13/3961; H03M13/41
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
241 words
A digital data processing apparatus in which a predetermined number of bits of a portion of information symbols constituted by a plurality of bits in a transmitting side, is convolutional-coded so as to produce a plurality of coded bits, whereas a number of bits of a remaining portion of the information symbols are uncoded bits, a combination of the coded bits and the uncoded bits is trellis-coded, and the trellis-coded bits are decoded in a receiving side, so that the uncoded bits are decoded utilizing the coded bits that are decoded in a convolutional decoding portion, the apparatus comprising: region determining means for inputting a received symbol so as to generate at least one uncoded bit and producing regional information corresponding to a group of symbols specified by the received symbol; delaying means for delaying the regional information output from the region determining means for as long as the received symbol is maximum-likelihood-decoded by a maximum-likelihood decoding means; and decoding means for inputting an output from the delaying means and a coded bit that is decoded by the maximum-likelihood decoding means, and for outputting the uncoded bits as a result thereof, wherein the region determining means includes means for determining an optimal bit number in such a manner that the optimal bit number is a minimum bit number while not less than log 2 J, where J indicates a number of groups for the information symbols specified by the received symbol.
Claim 2
Dependent Claim
241 words
A digital data processing apparatus in which a predetermined number of bits of a portion of information symbols constituted by a plurality of bits in a transmitting side, is convolutional-coded so as to produce a plurality of coded bits, whereas a number of bits of a remaining portion of the information symbols are uncoded bits, a combination of the coded bits and the uncoded bits is trellis-coded, and the trellis-coded bits are decoded in a receiving side, so that the uncoded bits are decoded utilizing the coded bits that are decoded in a convolutional decoding portion, the apparatus comprising: region determining means for inputting a received symbol so as to generate at least one uncoded bit and producing regional information corresponding to a group of symbols specified by the received symbol; delaying means for delaying the regional information output from the region determining means for as long as the received symbol is maximum-likelihood-decoded by a maximum-likelihood decoding means; and decoding means for inputting an output from the delaying means and a coded bit that is decoded by the maximum-likelihood decoding means, and for outputting the uncoded bits as a result thereof, wherein the region determining means includes means for determining an optimal bit number in such a manner that the optimal bit number is a minimum bit number while not less than log 2 J, where J indicates a number of groups for the information symbols specified by the received symbol.
Claim 3
Dependent Claim
15 words
The apparatus of claim 1, wherein a T-stage shift register serves as the delaying means.
Claim 4
Dependent Claim
27 words
The apparatus of claim 1, wherein the region determining means includes limiter means for limiting amplitude on the received symbol so as to obtain the regional information.
Claim 5
Dependent Claim
56 words
The apparatus of claim 3, wherein the region determining means further includes means for determining an optimal bit number in such a manner that the optimal bit number is a minimum bit number while not less than log 2 J, where J indicates a number of groups for the information symbols specified by the received symbol.
Claim 6
Dependent Claim
203 words
An uncoded bit decoding device in which a predetermined number of bits of a portion of information symbols constituted by a plurality of bits in a transmitting side, is Viterbi-coded so as to produce at least one coded bit, whereas a number of bits of a remaining portion of the information symbols are uncoded bits, a combination of the at least one coded bit and the uncoded bits is trellis-coded, and the trellis-coded bits are decoded in a receiving side, so that the uncoded bits are decoded utilizing the at least one coded bit that is decoded in a Viterbi decoding portion, the device comprising: region determining means for determining in which one of a plurality of groups each having four adjacent symbols, the received symbol is located and outputting a signal indicative of the one group; delaying means for delaying an output from the region determining means for as long as the at least one coded bit is decoded by the Viterbi decoding portion; and decoding means for inputting and decoding an output from the delaying means and the at least one coded bit that is decoded by the Viterbi decoding means, and for outputting the uncoded bits as a result thereof.
Claim 7
Dependent Claim
203 words
An uncoded bit decoding device in which a predetermined number of bits of a portion of information symbols constituted by a plurality of bits in a transmitting side, is Viterbi-coded so as to produce at least one coded bit, whereas a number of bits of a remaining portion of the information symbols are uncoded bits, a combination of the at least one coded bit and the uncoded bits is trellis-coded, and the trellis-coded bits are decoded in a receiving side, so that the uncoded bits are decoded utilizing the at least one coded bit that is decoded in a Viterbi decoding portion, the device comprising: region determining means for determining in which one of a plurality of groups each having four adjacent symbols, the received symbol is located and outputting a signal indicative of the one group; delaying means for delaying an output from the region determining means for as long as the at least one coded bit is decoded by the Viterbi decoding portion; and decoding means for inputting and decoding an output from the delaying means and the at least one coded bit that is decoded by the Viterbi decoding means, and for outputting the uncoded bits as a result thereof.
Claim 8
Dependent Claim
15 words
The apparatus of claim 5, wherein a T-stage shift register serves as the delaying means.
Claim 9
Dependent Claim
35 words
The apparatus of claim 6, wherein the region determining means determines the one group based on the one group having the least Euclidean distance with respect to the received symbol of all of the groups.
Claim 10
Dependent Claim
43 words
The apparatus of claim 5, wherein the region determining means includes limiter means for limiting amplitude on the received symbol so that the received symbol is moved within a predetermined region in the event that the received symbol lies outside the predetermined region.
Claim 11
Dependent Claim
54 words
The apparatus of claim 5, wherein the region determining means includes means for determining an optimal bit number in such a manner that the optimal bit number is a minimum bit number while not less than log 2 J, where J indicates the number of groups for the symbols specified by the received symbol.
Claim 12
Dependent Claim
55 words
The apparatus of claim 8, wherein the region determining means further includes means for determining an optimal bit number in such a manner that the optimal bit number is a minimum bit number while not less than log 2 J, where J indicates the number of groups for the symbols specified by the received symbol.
Claim 13
Dependent Claim
184 words
A branch metric processing apparatus where a predetermined number of bits of a portion of information symbols constituted by a plurality of bits in a transmitting side, is convolutional-coded so as to produce a plurality of coded bits, whereas a number of bits of a remaining portion of the information symbols are uncoded bits, a combination of the coded bits and the uncoded bits is trellis-coded, and the trellis-coded bits are decoded in a receiving side, so that the uncoded bits are decoded in accordance with a received symbol obtained after soft-decision, utilizing the coded bits that are decoded in a Viterbi decoding portion, the apparatus comprising: limiter means for performing an amplitude limitation on the received symbol obtained by the soft-decision; distance calculating means for producing a branch metric using an output of the Viterbi decoding portion, by calculating a square of Euclidean distance on data obtained from the limiter means in the form of a first number of bits; and approximation means for replacing the first number of bits by a second number of bits fewer than the first number of bits.
Claim 14
Dependent Claim
184 words
A branch metric processing apparatus where a predetermined number of bits of a portion of information symbols constituted by a plurality of bits in a transmitting side, is convolutional-coded so as to produce a plurality of coded bits, whereas a number of bits of a remaining portion of the information symbols are uncoded bits, a combination of the coded bits and the uncoded bits is trellis-coded, and the trellis-coded bits are decoded in a receiving side, so that the uncoded bits are decoded in accordance with a received symbol obtained after soft-decision, utilizing the coded bits that are decoded in a Viterbi decoding portion, the apparatus comprising: limiter means for performing an amplitude limitation on the received symbol obtained by the soft-decision; distance calculating means for producing a branch metric using an output of the Viterbi decoding portion, by calculating a square of Euclidean distance on data obtained from the limiter means in the form of a first number of bits; and approximation means for replacing the first number of bits by a second number of bits fewer than the first number of bits.
Claim 15
Dependent Claim
51 words
The apparatus of claim 11, further comprising: nonlinear processing means, connected to the distance calculating means, for performing a nonlinear processing in the event that an output value of the distance calculating means is greater than a predetermined value, so that the output value is limited to within the predetermined value.
Claim 16
Dependent Claim
29 words
The apparatus of claim 11, further comprising: bit truncating means, connected to the distance calculating means, for truncating the bit of an output value from the distance calculating means.
Claim 17
Dependent Claim
29 words
The apparatus of claim 12, further comprising: bit truncating means, connected to the nonlinear processing means, for truncating the bit of an output value from the nonlinear processing means.
Claim 18
Dependent Claim
51 words
The apparatus of claim 13, further comprising: nonlinear processing means, connected to the bit truncating means, for performing a nonlinear processing in the event that an output value of the bit truncating means is greater than a predetermined value, so that the output value is limited to within the predetermined value.
Claim 19
Dependent Claim
33 words
The apparatus of claim 12, wherein the least Euclidean distance to the received symbol is calculated with respect to a center point equidistant to the respective four adjacent symbols of the one group.
Claim 20
Dependent Claim
19 words
The apparatus of claim 16, wherein the replacement by said approximation means is performed in a nonlinear processing manner.
Claim 21
Dependent Claim
36 words
The apparatus of claim 16, wherein said approximation means rounds down the first number of bits to the second number of bits when the most significant bit of the first number of bits is logic 1.
Claim 22
Dependent Claim
21 words
The apparatus of claim 18, wherein the first number of bits is 8 while the second number of bits is 7.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-07-21 | 2001-01-20 | 2001-07-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-07-21 | 2005-01-20 | 2005-07-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-07-21 | 2009-01-20 | 2009-07-22 | $7700.00 | Window Closed / Lapsed |