LDPC concatenation rules for IEEE 802.11n systems

Error detection/correction and fault detection/recovery – Pulse or data error handling – Data formatting to improve error detection correction...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S776000

Reexamination Certificate

active

07661037

ABSTRACT:
Improved LDPC code structure and concatenation rules for IEEE 802.11n systems, providing two code sets per rate, one longer codeword and one shorter codeword. The longer codeword length is determined by the system parameters, while the shorter codeword length is ⅓ of the longer codeword length. A LDPC concatenation rule is provided, wherein a maximum of one extra OFDM symbol is added in padding in order to reduce the code set granularity. In order to provide improved code performance, more bits are shortened compared with puncturing, by transmitting the extra OFDM symbol. Further, all the required puncturing and shortening bits are distributed across all codewords. This scheme provides a preferred tradeoff between code complexity and over-the-air efficiency.

REFERENCES:
patent: 6633856 (2003-10-01), Richardson et al.
patent: 6718508 (2004-04-01), Lodge et al.
patent: 6789227 (2004-09-01), De Souza et al.
patent: 6847678 (2005-01-01), Berezdivin et al.
patent: 6895547 (2005-05-01), Eleftheriou et al.
patent: 7002900 (2006-02-01), Walton et al.
patent: 7072289 (2006-07-01), Yang et al.
patent: 7173978 (2007-02-01), Zhang et al.
patent: 7178080 (2007-02-01), Hocevar
patent: 7213197 (2007-05-01), Jacobsen et al.
patent: 7260055 (2007-08-01), Wang et al.
patent: 7283499 (2007-10-01), Priotti et al.
patent: 7324605 (2008-01-01), Maltsev et al.
patent: 7418043 (2008-08-01), Shattil
patent: 7526717 (2009-04-01), Kyung et al.
patent: 7543197 (2009-06-01), Palanki et al.
patent: 7562280 (2009-07-01), Eroz et al.
patent: 7573944 (2009-08-01), Chang et al.
patent: 7581159 (2009-08-01), Hocevar
patent: 2002/0042899 (2002-04-01), Tzannes et al.
patent: 2003/0014718 (2003-01-01), De Souza et al.
patent: 2003/0126538 (2003-07-01), Mejean et al.
patent: 2004/0034828 (2004-02-01), Hocevar
patent: 2004/0098659 (2004-05-01), Bjerke et al.
patent: 2004/0141548 (2004-07-01), Shattil
patent: 2005/0034053 (2005-02-01), Jacobsen et al.
patent: 2005/0091570 (2005-04-01), Eroz et al.
patent: 2005/0283707 (2005-12-01), Sharon et al.
patent: 2005/0283708 (2005-12-01), Kyung et al.
patent: 2005/0283709 (2005-12-01), Kyung et al.
patent: 2006/0036923 (2006-02-01), Hedberg et al.
patent: 2006/0087961 (2006-04-01), Chang et al.
patent: 2006/0123241 (2006-06-01), Martinian et al.
patent: 2006/0123277 (2006-06-01), Hocevar et al.
patent: 2006/0140294 (2006-06-01), Hottinen et al.
patent: 2007/0022352 (2007-01-01), Eroz et al.
patent: 2007/0041458 (2007-02-01), Hocevar et al.
patent: 2007/0064828 (2007-03-01), Aldana et al.
patent: 2007/0101229 (2007-05-01), Niu et al.
patent: 2007/0136635 (2007-06-01), Niu et al.
patent: 2007/0143655 (2007-06-01), Niu et al.
patent: 2007/0143656 (2007-06-01), Niu et al.
patent: 2008/0256426 (2008-10-01), Reid et al.
R.G. Gallager, “Low density parity check codes”, IRE Trans. Inform. Theory, Jan. 1962, vol. IT-8, pp. 21-28.
T.J. Richardson, et al., “Design of capacity-approaching irregular low-density parity-check codes”, IEEE Transactions on Information Theory, Feb. 2001, pp. 619-637, vol. 47, No. 2.
T. Zhang et al., “Joint (3, k)-regular LDPC code and decoder/encoder design”, IEEE Transactions on Signal Processing, Apr. 2004, pp. 1065-1079, vol. 52, No. 4.
Yeo et al., “Iterative decoder architectures”, IEEE Communications Magazine, IEEE, Aug. 2003, pp. 132-140, vol. 41, No. 8.
T.J. Richardson et al., “Efficient encoding of low-density parity-check codes”, IEEE Transactions on Information Theory, Feb. 2001, pp. 638-656, vol. 47, No. 2.
Chung et al., “Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation”, IEEE Transactions on Information Theory, Feb 2001, pp. 657-670, vol. 47, No. 2.
Hu et al “Progressive edge-growth Tanner graphs”, IEEE Globecom 2001, pp. 995-1001.
Mackay et al., “Near Shannon limit performance of low density parity check codes,” Electronics Letters, Mar. 13, 1997, p. 457-458, vol. 33, No. 6.
Mujtaba, S.A., “TGN Sync Proposal Technical Specification,” doc.: IEEE 802.11- 041889r0, Aug. 2004, pp. 1-136.
Mujtaba, S.A., “TGn Sync Proposal Technical Specification,” a contribution to IEEE 802.11 11-04-889r4, Mar. 2005, pp. 1-162.
Kose, C.; and Edwards, B., “WWiSE Proposal: High throughput extension to the 802.11 Standard,” a contribution to IEEE 802.11, 11-05-0149r2, Mar. 2005, pp. 1-93.
Livshitz, M., et al., “TGnSync- Shortening Puncturing—Mar. 16,” Nortel's PowerPoint presentation in LDPC subgroup a contribution for 802.11n, Mar. 16, 2005, pp. 1-14.
Van Veen, B.D. and Buckley, K.M., “Beamforming: A Versatile Approach to Spatial Filtering,” ASSP Magazine, IEEE, vol. 5. Issue 2, Apr. 1988, pp. 4-24.
Barton, M., “Unequal Error Protection for Wireless ATM Applications,” 1996, IEEE, pp. 1911-1915.
U.S. Office Action for U.S. Appl. No. 11/313,402 mailed Aug. 15, 2008.
U.S. Office Action for U.S. Appl. No. 11/313,402 mailed Jan. 29, 2009.
U.S. Office Action for U.S. Appl. No. 11/313,906 mailed Aug. 18, 2008.
U.S. Final Office Action for U.S. Appl. No. 11/313,906 mailed Mar. 2, 2009.
U.S. Office Action for U.S. Appl. No. 11/300,211 mailed Mar. 9, 2009.

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

LDPC concatenation rules for IEEE 802.11n systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with LDPC concatenation rules for IEEE 802.11n systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LDPC concatenation rules for IEEE 802.11n systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4162892

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