Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2007-03-27
2007-03-27
Lamarre, Guy (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S796000, C714S786000, C375S341000, C375S262000, C375S265000
Reexamination Certificate
active
10875979
ABSTRACT:
Decoding an encoded signal (for example, a turbo encoded signal, a block encoded signal or the like) is performed by demodulating the received encoded signal to produce soft information, and iteratively processing the soft information with one or more soft-in/soft-output (SISO) modules. At least one of the SISO modules uses a tree structure to compute forward and backward state metrics. More generally, iterative detection is performed by receiving an input signal corresponding to one or more outputs of a module whose soft-inverse can be computed by running the forward-backward algorithm on a trellis representation of the module, and determining the soft inverse of the module by computing forward and backward state metrics of the received input signal using a tree structure.
REFERENCES:
patent: 4853930 (1989-08-01), Shimada
patent: 5014276 (1991-05-01), Bush et al.
patent: 5233349 (1993-08-01), Moulsley
patent: 5930272 (1999-07-01), Thesling
patent: 5933462 (1999-08-01), Viterbi et al.
patent: 6233290 (2001-05-01), Raphaeli
patent: 6304996 (2001-10-01), Van Stralen et al.
patent: 6343103 (2002-01-01), Lou et al.
patent: 6484283 (2002-11-01), Stephen et al.
patent: 6507927 (2003-01-01), Kalliojarvi
patent: 6769007 (2004-07-01), Sutherland et al.
Wiberg, “Codes and Decoding on General Graphs”, Dept. of Electrical Engineering, Sinkoping University, S-581 83 Sinkoping, Sweden, Dissertation No. 440 (1996).
Chugg et al., “Efficient architectures for soft-output algorithms”, Communications, ICC 98, Conference Record, 1998 IEEE International Conference, vol. 1, pp. 126-130 (1998).
Divsalar et al., “Hybrid Concatenated Codes and Iterative Decoding”, TDA Progress Report 42-130, Aug. 15, 1997.
Berrou et al., “An IC for Turbo-Codes Encoding and Decoding”, IEEE Solid-State Circuits Conference, Digest of Technical Papers, ISSCC 95, Session 5, Paper WP 5.7 (1995).
Hamkins, “Performance of Binary Turbo-Coded 256-ary Pulse-Position Modulation”, TMO Progress Report 42-138, Aug. 15, 1999.
Berrou et al., “Near Shannon limit error-correcting coding and decoding: Turbo-codes”, Communications, ICC 93 Geneva, Technical Program, Conference Record, IEEE International Conference, vol. 2, pp. 1064-1070 (1993).
Yiin et al., “MLSE and Soft-Output Equalization for Trellis-Coded Continuous Phase Modulation”, IEEE Transactions on Communications, vol. 45, No. 6, Jun. 1997, pp. 651-659.
Berrou et al., “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes”, IEEE Transactions on Communications, vol. 44, No. 10, Oct. 1996, pp. 1261-1271.
Forney, “The Forward-Backward Algorithm”, Proceedings of the Thirty-fourth Annual Allerton Conference on Communication, Control and Computing, Oct. 2-Oct. 4, 1996, pp. 432-446.
Aji, et al., “The Generalized Distributive Law”, IEEE Trans. Inform. Theory, 46(2):325-343, Mar. 2000.
Cormen, et al., “Introduction to Algorithms”, The MIT Press, Cambridge, Mass., 1990.
Brent, et al., “A Regular Layout for Parallel Adders”, IEEE Transactions on Computers, C-31:260-264, Mar. 1982.
Despain, Chapter 2: “Notes on computer architecture for high performance”, in New Computer Architectures, Academic Pres, 1984.
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes, TDA progress Report 42-124, Feb. 15, 1996.
D. Divsalar and F. Pollara, Hybrid Concatenated Codes and Iterative Decoding, TDA progress Report 42-130, Aug. 15, 1997.
Arjhan et al., “A Novel Scheme for Irregular Parallel-Prefix Adders”, IEEE Proceedings, 12-14, 1997, pp. 74-78.
Gurkaynak et al., “Higher Radix Kogge-Stone Parallel Prefix Adder Architectures”, IEEE International Symposium on Circuits and Systems, May 28-31, 2000, Geneva, Switzerland, pp. V609-V612.
Dimitrakopoulos et al., “High-Speed Parallel-Prefix VLSI ling Adders”, IEEE Transactions on Computers, vol. 54, No. 2, Feb. 2005.
Janik et al., “VLSI Implementation of a 32-Bit Kozen Formulation Ladner/Fischer Parallel Prefix Adder”, IEEE Proceedings, 1995, pp. 57-59.
Hagenauer et al., “A Viterbi Algorithm with soft-decision outputs and its applications”, IEEE GLOBECOM, Nov. 27-30, 1989, vol. 3, pp. 1680-1686.
Leighton, “Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes”, Morgan Kaufmann Publishers, Inc., 1992, pp. 1-3, 36-45, 238 and 239.
Hsu, et al., “A Parallel Decoding Scheme for Turbo Codes”, IEEE International Symposium on Circuits and Systems, Mar. 1998, vol. 4, pp. IV445-448.
Ochi et al., “A High-Speed Decoding Method for Turbo-Code by Means of parallel Processing of Map Algolithms”, Engineering Research Report of the Institute of Electronics, Information, and Communication Engineers, Jan. 27, 1998, vol. 97, No. 511, pp. 1-6.
Brent et al., “A Regular Layout for Parallel Adders”, IEEE Transactions on Computers, Mar. 1982, vol. C-31, No. 3, pp. 260-264.
Beerel Peter A.
Chugg Keith M.
Dimou Georgios D.
Thiennviboon Phunsak
Alphonse Fritz
Lamarre Guy
University of Southern California
LandOfFree
Reduced-latency soft-in/soft-out module does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Reduced-latency soft-in/soft-out module, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced-latency soft-in/soft-out module will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3781350