Patent US6452985B1 successfully refreshed from Google Patents.
US6452985B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Viterbi decoding apparatus and Viterbi decoding method
Assignee: Sony Corp
•
Filing: 1999-03-16
•
Granted: 2002-09-17
•
Expires: 2019-03-16
Abstract
Abstract A Viterbi decoding apparatus sets the initial path metric value of each state to a value weighted based on the initial value of a convolutional encoder, and decodes a data string one bit by one bit whenever performing tracing-back for one step with a fixed state determined based on a value of a tail bit as a start-point state when a path metric operation has reached the final operation. Moreover, the Viterbi decoding apparatus selects a maximum-likelihood state out of prospective states determined based on the value of the tail bit and performs tracing-back, until the path metric operation reaches the final operation after it has exceeded the number of data strings. Thus, it is possible to improve the decoding accuracy and the decoding speed.
Inventors
- 👤 Izumi Hatakeyama
- 👤 Masahiko Naito
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 02:36
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/23; H03M13/37; H03M13/39; H03M13/3961; H03M13/41; H03M13/4123; H03M13/413; H03M13/4138; H03M13/4146; H03M13/4161; H03M13/4169
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
270 words
A Viterbi decoding apparatus for adding a tail bit constituted with a predetermined value of (k−1) bits to a tail of a predetermined-length data string by assuming a constraint length of a convolutional encoder as “k”, receiving a symbol string generated by setting an initial value of each register of a plurality of registers of a shift register device of said convolutional encoder to a predetermined value, convolutionally encoding said data string to which said tail bit is added with said convolutional encoder, and decoding said data string from said symbol string, said Viterbi decoding apparatus comprising: decoding means for setting a path metric value weighted based on said initial value of each register of said plurality of shift registers as an initial path metric value of a respective state of a plurality of states, successively computing a path metric value of each state of said plurality of states whenever said symbol string is received based on said initial path metric value in order to store surviving paths in a path memory, decoding said data string one bit by one bit whenever tracing-back by a length of said path memory with a maximum-likelihood state determined based on said path metric value of each state as a start-point state until a path metric operation reaches a final operation for said symbol string is performed, and decoding said data string one bit by one bit whenever tracing-back for one-step with a fixed state determined based on a value of said tail bit as said start-point state when said path metric operation has reached said final operation for said symbol string is performed.
Claim 2
Dependent Claim
270 words
A Viterbi decoding apparatus for adding a tail bit constituted with a predetermined value of (k−1) bits to a tail of a predetermined-length data string by assuming a constraint length of a convolutional encoder as “k”, receiving a symbol string generated by setting an initial value of each register of a plurality of registers of a shift register device of said convolutional encoder to a predetermined value, convolutionally encoding said data string to which said tail bit is added with said convolutional encoder, and decoding said data string from said symbol string, said Viterbi decoding apparatus comprising: decoding means for setting a path metric value weighted based on said initial value of each register of said plurality of shift registers as an initial path metric value of a respective state of a plurality of states, successively computing a path metric value of each state of said plurality of states whenever said symbol string is received based on said initial path metric value in order to store surviving paths in a path memory, decoding said data string one bit by one bit whenever tracing-back by a length of said path memory with a maximum-likelihood state determined based on said path metric value of each state as a start-point state until a path metric operation reaches a final operation for said symbol string is performed, and decoding said data string one bit by one bit whenever tracing-back for one-step with a fixed state determined based on a value of said tail bit as said start-point state when said path metric operation has reached said final operation for said symbol string is performed.
Claim 3
Dependent Claim
46 words
The Viterbi decoding apparatus according to claim 1 , wherein said decoding means includes a memory for storing said initial path metric value of each state of said plurality of states and sets said initial path metric value based on data read out from said memory.
Claim 4
Dependent Claim
25 words
The Viterbi decoding apparatus according to claim 1 , wherein said initial value of each register of said shift register device is set to “0”.
Claim 5
Dependent Claim
18 words
The Viterbi decoding apparatus according to claim 1 , wherein said tail bit is fully composed of “0”.
Claim 6
Dependent Claim
81 words
The Viterbi decoding apparatus according to claim 1 , wherein said decoding means selects said maximum-likelihood state from a plurality of prospective states determined based on said value of said tail bit and decodes said data string one bit by one bit whenever tracing-back by a length of said path memory is performed, with said maximum-likelihood state as said start-point state, until said path metric operation reaches said final operation for said symbol string after exceeding a number of data strings.
Claim 7
Dependent Claim
206 words
A Viterbi decoding apparatus for adding a tail bit constituted with a predetermined value of (k−1) bits to a tail of a predetermined-length data string by assuming a constraint length of a convolutional encoder as “k”, receiving a symbol string generated by convolutionally encoding said data string to which said tail bit is added with said convolutional encoder, and decoding said data string from said symbol string, said Viterbi decoding apparatus comprising: a decoder for performing a path metric operation of successively computing a path metric value of a plurality of states whenever said symbol string is received to store surviving paths in a path memory, for decoding said data string one bit by one bit whenever tracing-back by a length of said path memory with a maximum-likelihood state determined based on said path metric value of each state as a start-point state is performed until said path metric operation reaches a final operation for said symbol string, and for decoding said data string one bit by one bit whenever tracing-back by one step is performed with a fixed state determined based on a value of said tail bit as said start-point state when said path metric operation reaches said final operation for said symbol string.
Claim 8
Dependent Claim
206 words
A Viterbi decoding apparatus for adding a tail bit constituted with a predetermined value of (k−1) bits to a tail of a predetermined-length data string by assuming a constraint length of a convolutional encoder as “k”, receiving a symbol string generated by convolutionally encoding said data string to which said tail bit is added with said convolutional encoder, and decoding said data string from said symbol string, said Viterbi decoding apparatus comprising: a decoder for performing a path metric operation of successively computing a path metric value of a plurality of states whenever said symbol string is received to store surviving paths in a path memory, for decoding said data string one bit by one bit whenever tracing-back by a length of said path memory with a maximum-likelihood state determined based on said path metric value of each state as a start-point state is performed until said path metric operation reaches a final operation for said symbol string, and for decoding said data string one bit by one bit whenever tracing-back by one step is performed with a fixed state determined based on a value of said tail bit as said start-point state when said path metric operation reaches said final operation for said symbol string.
Claim 9
Dependent Claim
18 words
The Viterbi decoding apparatus according to claim 6 , wherein said tail bit is fully composed of “0”.
Claim 10
Dependent Claim
82 words
The Viterbi decoding apparatus according to claim 6 , wherein said decoder selects said maximum-likelihood state from a plurality of prospective states determined based on said value of said tail bit and decodes said data string one bit by one bit whenever said tracing-back by said length of said path memory using said maximum-likelihood state as said start-point state is performed, until said path metric operation reaches said final operation for said symbol string after exceeding a number of said data strings.
Claim 11
Dependent Claim
271 words
A Viterbi decoding method of adding a tail bit constituted with a predetermined value of (k−1) bits to a tail of a predetermined-length data string by assuming a constraint length of a convolutional encoder as “k”, receiving a symbol string generated by setting an initial value of each register of a plurality of registers of a shift register device of said convolutional encoder to a predetermined value and convolutionally encoding said data string to which said tail bit is added with said convolutional encoder, and decoding said data string from said symbol string, said Viterbi decoding method comprising the steps of: setting a path metric value weighted based on said initial value of each register of said plurality of registers as an initial path metric value of a respective state of a plurality of states; successively computing said path metric value of each state of said plurality of states when said symbol string is received based on said initial path metric value to store surviving paths in a path memory; decoding said data string one bit by one bit in order to perform tracing-back by a length of said path memory with a maximum-likelihood state determined based on said path metric value of each state as a start-point state until a path metric operation reaches a final operation for said symbol string; and decoding said data string one bit by one bit in order to perform tracing-back for one step with a fixed state determined based on a value of said tail bit as said start-point state when said path metric operation has reached said final operation for said symbol string.
Claim 12
Dependent Claim
271 words
A Viterbi decoding method of adding a tail bit constituted with a predetermined value of (k−1) bits to a tail of a predetermined-length data string by assuming a constraint length of a convolutional encoder as “k”, receiving a symbol string generated by setting an initial value of each register of a plurality of registers of a shift register device of said convolutional encoder to a predetermined value and convolutionally encoding said data string to which said tail bit is added with said convolutional encoder, and decoding said data string from said symbol string, said Viterbi decoding method comprising the steps of: setting a path metric value weighted based on said initial value of each register of said plurality of registers as an initial path metric value of a respective state of a plurality of states; successively computing said path metric value of each state of said plurality of states when said symbol string is received based on said initial path metric value to store surviving paths in a path memory; decoding said data string one bit by one bit in order to perform tracing-back by a length of said path memory with a maximum-likelihood state determined based on said path metric value of each state as a start-point state until a path metric operation reaches a final operation for said symbol string; and decoding said data string one bit by one bit in order to perform tracing-back for one step with a fixed state determined based on a value of said tail bit as said start-point state when said path metric operation has reached said final operation for said symbol string.
Claim 13
Dependent Claim
74 words
The Viterbi decoding method according to claim 9 , wherein said maximum-likelihood state is selected from a plurality of prospective states based on said value of said tail bit, and said data string is decoded one bit by one bit in order to perform tracing-back by said length of said path memory with said maximum-likelihood state as said start-point state, until said path metric operation reaches said final operation for said symbol string after
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) | 2005-09-16 | 2006-03-18 | 2006-09-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-09-16 | 2010-03-18 | 2010-09-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-09-16 | 2014-03-18 | 2014-09-17 | $7700.00 | Window Closed / Lapsed |