Low complexity channel decoders

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S794000, C714S795000

Reexamination Certificate

active

10829075

ABSTRACT:
A packet of encoded data is received and decoded using a look-up table that stores information approximating output of an algorithmic decoding process.

REFERENCES:
patent: 4393276 (1983-07-01), Steele
patent: 4558350 (1985-12-01), Murakami
patent: 5191548 (1993-03-01), Balkanski et al.
patent: 5297170 (1994-03-01), Eyuboglu et al.
patent: 5319707 (1994-06-01), Wasilewski et al.
patent: 5381425 (1995-01-01), Bitzer et al.
patent: 5563660 (1996-10-01), Tsukagoshi
patent: 5974181 (1999-10-01), Prieto
patent: 5983384 (1999-11-01), Ross
patent: 6009552 (1999-12-01), Ariel et al.
patent: 6029264 (2000-02-01), Kobayashi et al.
patent: 6253185 (2001-06-01), Arean et al.
patent: 6393072 (2002-05-01), Ross et al.
patent: 6516437 (2003-02-01), Van Stralen et al.
patent: 6516444 (2003-02-01), Maru
patent: 6725409 (2004-04-01), Wolf
patent: 2002/0194567 (2002-12-01), Yellin et al.
patent: 1286533 (2001-03-01), None
Fischer, T.R.; Marcellin, M.W.; Wang, M.; Trellis-coded vector quantization, IEEE Transactions on Information Theory, vol. 37, Issue 6, Nov. 1991 pp. 1551-1566.
Bayazit, U.; Pearlman, W.A.; Improving the performance of optimal joint decoding, Proceedings International Conference on Image Processing, vol. 1, Oct. 23-26, 1995 pp. 113-116 vol. 1.
Goo-Hyun Park; Suk-Hyun Yoon; Ik-Soo Jin; Chong-Eon Kang; A block-wise MAP decoder using a probability ratio for branch metrics, IEEE VTS 50th Vehicular Technology Conference, vol. 3, Sep. 19-22, 1999 pp. 1610-1614 vol. 3.
Afikel, I.F.; Implementation issues for high rate turbo codes on BPSK/QPSK channels, Global Telecommunications Conference vol. 1A, 1999 pp. 148-152 vol. 1a.
Benedetto et al., “Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Interactive Decoding”, IEEE Transactions On Information Theory, vol. 44, No. 3, May 1998, pp. 909-926.
Berrou, “Near Optimum Error Correcting Coding And Decoding: Turbo-Codes”, IEEE Transactions On Communications, vol. 44, No. 10, Oct. 1996, pp. 1261-1271.
Berrou et al., “Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes (1)”, ICC'93, Geneva, Switzerland, May 1993, pp. 1064-1070.
Hsu C-P et al., “A soft decision syndrome decoding algorithm for convultional codes.” IEEE MILCOM 1990, vol. 1, Sep. 30, 1990, pp. 375-379.
Tajima, M. “On the Structure of an SST Viterbi Decoder for General Rate (n-1)
Convolutional Codes Viewed in the Light of Syndrome Decoding,” IEICE Trans. Fundamentals, E79-A (9):1447-1449, 1996.
Bahl, L.R., et al., “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”,IEEE Trans. Inform. Theory, pp. 248-287, Mar. 1974.
Forney, G.D., “The Viterbi Algorithm”,Proc. IEEE, 61(3):268-278, Mar. 1973.
Smit, G., et al., “Mapping the SISO module of the Turbo decoder to a FPFA”,Proc. of Second International Symposium on Mobile Multimedia Systems & Appplications(MMSA2000), pp. 165-172, Nov. 2000.
Yeo, E., et al., “VLSI Architecture for Iterative Decoders in Magnetic Recording Channels”,IEEE Transactions on Magnetics, 37(2):748-755, Mar. 2000.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Low complexity channel decoders does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low complexity channel decoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low complexity channel decoders will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3811724

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.