Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2002-08-15
2004-02-03
Jeanglaude, Jean (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
C341S067000, C714S760000, C714S786000
Reexamination Certificate
active
06686853
ABSTRACT:
BACKGROUND OF THE INVENTION
A significant amount of interest has recently been paid to channel coding. For example a recent authoritative text states: “Channel coding refers to the class of signal transformations designed to improve communications performance by enabling the transmitted signals to better withstand the effects of various channel impairments, such as noise, interference, and fading. These signal-processing techniques can be thought of as vehicles for accomplishing desirable system trade-offs (e.g., error-performance versus bandwidth, power versus bandwidth). Why do you suppose channel coding has become such a popular way to bring about these beneficial effects? The use of large-scale integrated circuits (LSI) and high-speed digital signal processing (DSP) techniques have made it possible to provide as much as 10 dB performance improvement through these methods, at much less cost than through the use of most other methods such as higher power transmitters or larger antennas.” From “Digital Communications” Fundamentals and Applications Second Edition by Bernard Sklar, page 305 © 2000 Prentice Hall PTR.
There are multiple modern decoding methods that involve iterative probabilistic decoding methods. Among the list of iterative probabilistic methods are methods such as MAP decoding, soft output Viterbi decoding and others. Because of the use of iterative decoding techniques, there is a need for improved iterative decoding methods in the art.
SUMMARY OF THE DISCLOSURE
In a first aspect of the invention a method of generating a stopping criteria for an iterative decoder is disclosed. The method includes, performing an Nth iteration of decoding, forming a signature from extrinsic values of the Nth iteration, comparing the signature of the Nth iteration to a signature of the N−1st iteration and stopping the process of iteration decoding if the signature of the N−1st iteration is equal to the signature of the Nth iteration.
In a second aspect of the invention a method of generating a stopping criteria for an iterative decoder is disclosed. The method includes performing an Nth iteration of decoding, forming a signature from extrinsic values of the Nth iteration, comparing the signature of the Nth iteration to a signature of the N−2 iteration and stopping the process of iteration decoding if the signature of the N−2 iteration is equal to the signature of the Nth iteration.
In a third aspect of the invention a method of generating a stopping criteria for an iterative decoder is disclosed. The method includes, determining the variance (VAR
k
) of extrinsic information on a k'th iteration of the iterative decoder and halting the decoder if VAR
k
<T
1
, where T
1
is a first threshold and D
k
(Differential Variance)<T
2
, where T
2
is a second threshold.
In a fourth aspect of the invention a method of determining a threshold T
1
for a particular encoding is disclosed. The method includes selecting a value for E
b
/N
0
, creating a signal having the particular encoding, adding a noise vector to the signal to create a corrupted signal, iteratively decoding the corrupted signal until the iteration converges and assigning a value less than VAR
k
to T
1
.
REFERENCES:
patent: 4677625 (1987-06-01), Betts et al.
patent: 4677626 (1987-06-01), Betts et al.
patent: 4979175 (1990-12-01), Porter
patent: 5181209 (1993-01-01), Hagenauer et al.
patent: 5349608 (1994-09-01), Graham et al.
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5666378 (1997-09-01), Marchetto et al.
patent: 5675585 (1997-10-01), Bonnot et al.
patent: 5703911 (1997-12-01), Lin et al.
patent: 5721745 (1998-02-01), Hladik et al.
patent: 5734962 (1998-03-01), Hladik et al.
patent: 5742612 (1998-04-01), Gourgue et al.
patent: 5761248 (1998-06-01), Hagenauer et al.
patent: 5784300 (1998-07-01), Neumeier et al.
patent: 5841818 (1998-11-01), Lin et al.
patent: 5907582 (1999-05-01), Yi
patent: 5933462 (1999-08-01), Viterbi et al.
patent: 5970085 (1999-10-01), Yi
patent: 5978365 (1999-11-01), Yi
patent: 5983384 (1999-11-01), Ross
patent: 5983385 (1999-11-01), Khayrallah et al.
patent: 5996104 (1999-11-01), Herzberg
patent: 6016568 (2000-01-01), Wolf et al.
patent: 6182261 (2001-01-01), Haller et al.
patent: 6304996 (2001-10-01), Van Stralen et al.
patent: 6518892 (2003-02-01), Shen et al.
patent: 0 843 437 (1998-05-01), None
patent: 0891656 (1999-09-01), None
patent: 0940957 (1999-09-01), None
patent: 0973292 (2000-01-01), None
patent: 0986181 (2000-03-01), None
patent: 1 009 098 (2000-06-01), None
patent: 1030457 (2000-08-01), None
patent: 2724522 (1996-03-01), None
patent: 2346782 (2000-08-01), None
patent: 028690 (2001-01-01), None
patent: WO-99/19994 (1999-04-01), None
patent: WO-01/43310 (2001-06-01), None
patent: WO-01/43384 (2001-06-01), None
patent: WO 02/19552 (2002-03-01), None
patent: WO-02/21702 (2002-03-01), None
patent: WO-02/23738 (2002-03-01), None
patent: WO-02/23739 (2002-03-01), None
patent: WO-02/23739 (2002-03-01), None
patent: WO 02/37691 (2002-05-01), None
patent: WO 02/41563 (2002-05-01), None
Shen et al. “Stopping Criteria For iterative decoding” US Application No. 09/900,222 filed on Jul. 6, 2001.*
Clark, G.C., et al.; “Error-Correction Coding for Digital Communications”; Error Correction Coding for Digital Communication; 1981; pp. 349-352; XP002131001.
Shoemake, Mathew B., et al.; “Turbo Codes for High Order Constellations”; Information Theory Workshop; Jun. 22, 1998; pp. 6-7; XP010297309; IEEE; USA.
Wang, Zhongfeng, et al.; “VLSI Implementation Issues of Turbo Decoder Design for Wireless Applications”; Signal Processing Systems; Oct. 20, 1999; pp. 503-512; XP010370879.
Battail, G., et al.; “Suboptimum decoding using Kullback principle,” in Lecture Notes in Computer Science, No. 313, B. Bouchon et al. Eds., 1988, pp. 93-101.
Benedetto, S., et al.; “Parallel Concatenated Trellis Coded Modulation,” Jet Propulsion Laboratory, California Institute of Technology, 5 pages. (no date).
Berrou, Claude; “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes,”IEEE Transactions on Communications, Oct. 1996, pp. 1261-1271, vol. 44, No. 10.
Berrou, Claude, et al.; “Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes,”IEEE International Conference on Communications '93, Geneva Switzerland, May 23, 1993, pp. 1064-1070, Technical Program, Conference Record, vol. 2/3.
Collins, O. M., et al.; “Iterative Decoding of Non-Systematic Turbo-Codes”; 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, Jun. 25-30, 2000, p. 172, ISBN: 0-7803-5857-0.
Divsalar, D., et al.; “Effective Free Distance of Turbo Codes,”Electronics Letters, Feb. 29, 1996, pp. 445-446, vol. 32, No. 5.
Dolinar, S., et al.; “Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations,” TDA Progress Report 42-122, Jet Propulsion Laboratory, Aug. 1995, pp. 56-65.
Fazel, K., et al.; “Combined Multilevel Turbo-Code with 8PSK Modulation,”Global Telecommunications Conference, 1995. Conference Record. Communication Theory Mini-Conference, GLOBECOM '95. IEEE Singapore, Nov. 13, 1995, pp. 649-653.
Gross, W.J., et al.; “Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders,”Electronics Letters, Aug. 6, 1998, pp. 1577-1578, vol. 34, No. 16.
Hagenauer, J., et al.; “Iterative decoding of binary block and convolutional codes,” IEEE Trans. on Information theory, vol. 42, Mar. 1996, pp. 429-445.
Heegard, Chris, et al.;Turbo Coding, 1999, Kluwer Academic Publishers, Norwell, Massachusetts (entire book).
Hsu, Jah-Ming, et al.; “A Parallel Decoding Scheme for Turbo Codes,”ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, Monterey, CA, May 31, 1998, pp. 445-448.
Kim, B., et al., “Reduction of the number of iterations in turbo decoding using extrinsic information,” 1999 IEEE TENCON, pp. 494-497.
Langlais, Charlotte, et al.; “Synchronisation in the Carrier Recovery of a Satellite Link Using Turbo-Codes with the He
Cameron Kelly B.
Jaffe Steven T.
Shen Ba-Zhong
Broadcom Corporation
Christie Parker & Hale LLP
Jeanglaude Jean
LandOfFree
Method and apparatus for iterative decoding does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for iterative decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for iterative decoding will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3351933