Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
1999-06-07
2002-05-07
Decady, Albert (Department: 2784)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S790000, C714S795000
Reexamination Certificate
active
06385753
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a punctured Viterbi decoding method for use with a digital mobile communication apparatus or the like.
2. Description of the Related Art
In an information transmission system using a high accuracy decoding method such as the Viterbi decoding method, a punctured process for thinning out convolutional code at a predetermined ratio is performed on the transmission side so as to increase information amount per data transmission unit. When two bits are thinned out from six bits of convolutional code by the punctured process, the information amount per transmission data unit can be increased by 1.5 times.
When convolutional code encoded data that has been punctured-processed is maximum-likelihood decoded by the Viterbi algorithm, regardless of whether a branch metric is generated with or without a punctured data portion, the following decoding process is performed.
In other words, after a decoding process including an ACS calculation is started, a trace-back process is performed from the maximum likelihood state at a predetermined process time point. Decoded data is generated corresponding to the data that is obtained at the traced back time point as a result of calculation. Such a process sequence is successively performed at each process time point so as to obtain required decoded data.
In such a decoding process, if convolutional code encoded data that has been punctured contains many errors, data to be calculated for generating a branch metric corresponding to the punctured data may become inaccurate. Thus, a branch metric value corresponding to the punctured data may become inaccurate. Consequently, the maximum likelihood state obtained as the result of the ACS calculation corresponding to the branch metric value may become inaccurate.
To allow the trace-back process to converge a particular path to a correct path and improve the decoding accuracy, the length of the path memory that performs a trace-back process should be increased. However, when such a path memory is used, the circuit scale becomes large and a high speed clock is required. Alternatively, the process speed decreases.
OBJECTS AND SUMMARY OF THE INVENTION
Therefore, an object of the present invention is to provide a punctured Viterbi decoding method that allows the decoding accuracy to be improved without need to increase the length of the path memory that performs the trace-back process.
The present invention is a punctured Viterbi decoding method that performs maximum-likelihood decoding using the Viterbi algorithm for data that has been generated as a result of an operation that thins out data at predetermined intervals of a convolutional code, comprising the steps of (a) detecting whether or not received data has been thinned out for each decoding process unit composed of a predetermined number of symbols, (b) calculating the value of a branch metric for each decoding process unit corresponding to the received data, (c) performing ACS calculation for calculating values of path metrics for a plurality of states corresponding to the result of step (b), the number of states having been predetermined corresponding to convolutional code encoding process, selecting the maximum likelihood state transition corresponding to the values of the calculated path metrics, and generating path selection information that represents the selected result, (d) performing a trace-back process for generating decoded data corresponding to the values of the path metrics and the path selection information, (e) setting an initial value corresponding to the decoding process unit and prohibiting step (d) when the decoding process unit has been thinned out as the determined result of step (a), and (f) setting an initial value corresponding to the decoding process unit and executing step (d) when the decoding process unit has not been thinned out as the determined result of step (a).
According to the present invention, the trace-back process is prohibited with an initial value that is set corresponding to punctured data.
Since the trace-back process is not performed with an initial value corresponding to punctured data, an incorrect maximum likelihood path corresponding to an error of convolutional code is not used. Consequently, a decoded error can be prevented or suppressed.
These and other objects, features and advantages of the present invention will become more apparent in light of the following detailed description of a best mode embodiment thereof, as illustrated in the accompanying drawings.
REFERENCES:
patent: 4777636 (1988-10-01), Yamashita et al.
patent: 5208816 (1993-05-01), Seshardi et al.
patent: 5408502 (1995-04-01), How
patent: 5469452 (1995-11-01), Zehavi
patent: 5742622 (1998-04-01), Claydon et al.
patent: 5949796 (1999-09-01), Kumar
patent: 5987637 (1999-11-01), Thomas
patent: 6094465 (2000-07-01), Stein et al.
patent: 6154871 (2000-11-01), Claydon et al.
patent: 6246698 (2001-01-01), Kumar
patent: 6199190 (2001-03-01), Wan
patent: 0409205 (1991-01-01), None
patent: 2315001 (1998-01-01), None
Haccoun, D. and Begin, G.; High-rate punctured convolutional codes for Viterbi and sequential decoding; IEEE Transactions on Communications, vol: 37, Issue: 11, Nov. 1989, pp.: 1113-1125.*
Lee, L.H.C.; New rate-compatible punctured convolutional codes for Viterbi decoding; IEEE Transactions on Communications, vol.: 42 Issue: 12, Dec. 1994; pp: 3073-3079.*
Hagenauer, J.; Rate-compatible punctured convolutional codes (RCPC codes) and their applications; IEEE Transactions on Communications; vol: 36 Issue: 4, Apr. 1988; pp: 389-400.*
Cypher, R. and Shung, C.B.; Generalized trace back techniques for survivor memory management in the Viterbi algorithm; IEEE Global Telecommunications Conference, 1990, and ‘Communications: Connecting the Future’ Exhibition, GLOBECOM '90; pp: 1318-132.*
Pellizzoni, R.; Sandri, A.; Spalvieri, A. and Biglieri, E.; Analysis and implementation of an adjustable-rate multilevel coded modulation system; IEE Proceedings-Communications, vol: 144 Issue: 1, Feb. 1997, pp: 1-5.*
Min-Goo Kim; On systematic punctured convolutional codes; IEEE Transactions on Communications, vol.: 45 Issue: 2, Feb., 1997, pp. 133-139.*
Seshadri, N. and Sundberg, C.-E.W.; List Viterbi decoding algorithms with applications; IEEE Transactions on Communications, vol: 42 Issue: 2 Part: 1, Feb -Apr. 1994; pp: 313-323.*
T.K. Truong et al. “A VLSI Design for a Trace-Back Viterbi Decoder,” IEEE Transactions on Communications, vol. 40, No. 3, Mar. 1992.*
Rate-Compatible Punctured Convolutional Codes (RCPC Codes) And Their Applications, Joachim Hagenhauer, IEEE Transactions on Communications, vol. 36, No. 4, pp. 389-400, Apr. 1988.
Development of Variable-Rate Viterbi Decoder And Its Performance Characteristics, Tutaka Yusuda et al., Publication No. XP-000794033.
De'cady Albert
Maioli Jay H.
Torres Joseph D.
LandOfFree
Punctured Viterbi decoding method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Punctured Viterbi decoding method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Punctured Viterbi decoding method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2876459