Fast H-ARQ acknowledgement generation method using a...

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

Reexamination Certificate

active

07467345

ABSTRACT:
A stopping rule for Turbo decoding that is applied for both good and bad code blocks is disclosed. If the iteration either converges or diverges, decoding is terminated. In an alternative embodiment, the result of the stopping rule testing may be used for hybrid automatic repeat-request (HARQ) acknowledgement generation: if the iteration converges, an acknowledgment (ACK) is generated and if the iteration diverges, a negative acknowledgement (NACK) is generated. Optionally, the maximum number of decoding iterations may be dynamically selected based on modulation and coding scheme (MCS) levels.

REFERENCES:
patent: 6182261 (2001-01-01), Haller et al.
patent: 6266795 (2001-07-01), Wei
patent: 6377589 (2002-04-01), Knight et al.
patent: 6393257 (2002-05-01), Holtzman
patent: 6487694 (2002-11-01), Bajwa
patent: 6518892 (2003-02-01), Shen et al.
patent: 6557139 (2003-04-01), Böhnke
patent: 6857096 (2005-02-01), Braneci et al.
patent: 6898254 (2005-05-01), Wolf et al.
patent: 2001/0052104 (2001-12-01), Xu et al.
patent: 2002/0053058 (2002-05-01), Lee et al.
patent: 2004/0006734 (2004-01-01), Shin et al.
patent: 11-017555 (1999-01-01), None
patent: 2001-127647 (2001-05-01), None
patent: 2002-111512 (2002-04-01), None
patent: 00/27037 (2001-09-01), None
patent: 03/069824 (2003-08-01), None
Matache et al., “Stopping Rules for Turbo Decoders”, TMO Progress Report, No. 42-142, Aug. 15, 2002, pp. 1-22.
Barbulescu et al., “Turbo Codes: a Tutorial on a New Class of Powerful Error Correcting Coding Schemes, Part 1 and Part 2”, Small World Communications, Oct. 26, 1998, pp. 1-48.
Chen et al., “An Adaptive Hybrid FEC/ARQ Protocol Using Turbo Codes”, IEEE International Conference on Universal Personal Communications, vol. 2, Conf. 6, Oct. 12, 1997, pp. 541-545.
Al-Mohandes, I.A. et al., “Iteration Reduction of Turbo Decoders Using an Efficient Stopping/Cancellation Technique,” IEEE International Symposium on Circuits and Systems, ISCAS 2002, vol. 1, May 26-29, 2002, pp. I-609 - I-612.
Barbulescu, S.A. et al., “Turbo Codes: a Tutorial on a New Class of Powerful Error Correcting Coding Schemes, Part 1 and Part 2”, Small World Communications, Oct. 26, 1998, pp. 1-48.
Chan, W. et al., “An Adaptive Hybrid FEC/ARQ Protocol Using Turbo Codes”, IEEE International Conference on Universal Personal Communications, vol. 2, Conf. 6, Oct. 12, 1997, pp. 541-545.
Matache, A. et al., “Stopping Rules for Turbo Decoders”, TMO Progress Report, No. 42-142, Aug. 15, 2002, pp. 1-22.
Shao, R.Y. et al., “Two Simple Stopping Criteria for Turbo Decoding,” IEEE Transactions on Communications, vol. 47, No. 8, Aug. 1999, pp. 1117-1120.
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; High Speed Downlink Packet Access; Physical Layer Aspects (Release 5),” 3GPP TR 25.858 V1.0.0 (Dec. 2001).
Third Generation Partnership Project, “Technical Specification Group Radio Access Network; High Speed Downlink Packet Access; Physical Layer Aspects (Release 5),” 3GPP TR 25.858 V5.0.0 (Mar. 2002).
Wu, Y. et al., “A Simple Stopping Criterion for Turbo Decoding,” IEEE Communications Letters, vol. 4, No. 8, Aug. 2000, pp. 258-260.

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

Fast H-ARQ acknowledgement generation method using a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast H-ARQ acknowledgement generation method using a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast H-ARQ acknowledgement generation method using a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4039281

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