Efficient design to implement min**/min**- or max**/max**-...

Details Efficient design to implement min**/min**- or max**/max**-... Efficient design to implement min**/min**- or max**/max**-...

2005-06-30

2008-11-04

Chase, Shelly A (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Error/fault detection technique

Reexamination Certificate

active

07447985

ABSTRACT:
Efficient design to implement min**/min**− or max**/max**− functions in LDPC (Low Density Parity Check) decoders. When compared to prior art approaches, the novel and efficient implementation presented herein allows for the use of substantially less hardware and surface area within an actual communication device implemented to perform these calculations. In certain embodiments, the min** processing (and/or max** processing) is implemented to assist in the computationally intensive calculations required to decoded LDPC coded signals. In one instance, this is operable to assist in check node processing when decoding LDPC coded signals. However, the efficient principles and architectures presented herein may be implemented within other communication device types to decode other types of coded signals as well. For example, the processing presented herein may perform calculations within a variety of decoders including LDPC decoders, turbo decoders, TTCM decoders, and/or other decoder types without departing from the scope and spirit of the invention.

REFERENCES:
patent: 3542756 (1970-11-01), Gallagher
patent: 3665396 (1972-05-01), Forney, Jr.
patent: 4295218 (1981-10-01), Tanner
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 6065147 (2000-05-01), Pyndiah et al.
patent: 6119264 (2000-09-01), Berrou et al.
patent: 6122763 (2000-09-01), Pyndiah et al.
patent: 6430233 (2002-08-01), Dillon et al.
patent: 6473010 (2002-10-01), Vityaev et al.
patent: 6567465 (2003-05-01), Goldstein et al.
patent: 6633856 (2003-10-01), Richardson et al.
patent: 6725409 (2004-04-01), Wolf
patent: 7116732 (2006-10-01), Worm et al.
patent: 7209527 (2007-04-01), Smith et al.
patent: 7246304 (2007-07-01), Kim
patent: 0 735 696 (1996-10-01), None
patent: 0 735 696 (1999-01-01), None
patent: 91 05278 (1992-10-01), None
J. Chen and M.P.C. Fossorier, “Near optimum universal belief propagation based decoding of low-density parity-check codes,” IEEE Trans. Commun., vol. 50, No. 3, pp. 406-414, 2002.
R. Gallager, Low-Density Parity-Check Codes, Cambridge, MA: MIT Press, 1963.
M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, “Practical Loss-Resilient Codes”, Proc. 29 th Symp. on Theory of Computing, 1997, pp. 150-159.
T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check code under message-passing decoding,” IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
Draft ETSI EN 302 307 V1.1.1 (Jun. 2004), Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for Broadcasting, Interactive Services, News Gathering and other broadband satellite applications.
ETSI EN 302 307 V1.1.1 (Mar. 2005), Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for Broadcasting, Interactive Services, News Gathering and other broadband satellite applications.
R. G. Gallager, “Low density parity check codes,” IRE Trans. Info. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Transactions on Information Theory, pp. 429-445, Mar. 1996.
Mittelholzer, et al., “Reduced complexity decoding of low density parity check codes for generalized partial response channels,” IEEE Tran. on Magnetics, vol. 37, No. 2, pp. 721-778, Mar. 2001.
P. Robertson, E. Villebrum, and P. Hoeher, “A comparison of optimal and suboptimal MAP decoding algorithms operating in the log domain,” in Proc. Int. Conf. Communications, Seattle, WA, Jun. 1995, pp. 1009-1013.
Andrew J. Viterbi, “Am Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes,” IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, pp. 260-264, Feb. 1998.
Xiao et al. “Efficient implementation of the sum-product algorithm for decoding LDPC,” 2001 IEEE, pp. 1036-1036E.
Seog et al., “State-parallel MAP module design for turbo decoding of 3GPP,” Apr. 2002, Journal of the Korean Physical Society, vol. 40, No. 4, pp. 677-685.
A. Raghupathy, K. J. Ray Liu, “A transformation for computational latency reduction in turbo-MAP decoding,” Circuits and Systems, 1999. ISCAS apos; 99. Proceedings of the 1999 IEEE International Symposium on, vol. 4, Jul. 1999 pp.: 402-405 vol. 4.
Patrick Robertson, Emmanuelle Villebrun, and Peter Hoeher, “A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain,” 1995 IEEE International Conference on Communications, Gateway to Globalization, Seattle 1995, Proccedings of the International Conference on Communications (ICC), vol. 2, Jun. 18-22, 1995, pp. 1009-1013.
J. Chen, A. Dholakia, E. Elefteriou, M. Fossorier, X.-Y. Hu, “Near Optimal Reduced-Complexity Decoding Algorithms for LDPC Codes,” 2002 IEEE International Symposium on Information Theory (ISIT 2002), Lausanne, Switzerland, Jun. 30-Jul. 5, 2002, p. 455.

Affiliated with

Also associated with

Rating

Efficient design to implement min**/min**- or max**/max**-... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient design to implement min**/min**- or max**/max**-..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient design to implement min**/min**- or max**/max**-... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4049822