Address generation for contention-free memory mappings of...

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

C714S795000

Reexamination Certificate

active

07831894

ABSTRACT:
Address generation for contention-free memory mappings of turbo codes with ARP (almost regular permutation) interleaves. A novel means is presented by which anticipatory address generation is employed using an index functionthat is based on an address mappingwhich corresponds to an interleave inverse order of decoding processing (π−1). In accordance with parallel turbo decoding processing, instead of performing the natural order phase decoding processing by accessing data elements from memory bank locations sequentially, the accessing of addresses is performed based on the index functionthat is based on an mapping and the interleave (π) employed within the turbo coding. In other words, the accessing data elements from memory bank locations is not sequential for natural order phase decoding processing. The index functionalso allows for the interleave (π) order phase decoding processing to be performed by accessing data elements from memory bank locations sequentially.

REFERENCES:
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5721745 (1998-02-01), Hladik et al.
patent: 5734962 (1998-03-01), Hladik et al.
patent: 6023783 (2000-02-01), Divsalar 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: 6392572 (2002-05-01), Shiu et al.
patent: 6580767 (2003-06-01), Koehler et al.
patent: 6594792 (2003-07-01), Hladik et al.
patent: 6678843 (2004-01-01), Giulietti et al.
patent: 6715120 (2004-03-01), Hladik et al.
patent: 6775800 (2004-08-01), Edmonston et al.
patent: 6789218 (2004-09-01), Edmonston et al.
patent: 6983412 (2006-01-01), Fukumasa
patent: 7113554 (2006-09-01), Dielissen et al.
patent: 7180843 (2007-02-01), Furuta et al.
patent: 7281198 (2007-10-01), Yagihashi
patent: 7302621 (2007-11-01), Edmonston et al.
patent: 7530011 (2009-05-01), Obuchii et al.
patent: 7720017 (2010-05-01), Khan
patent: 2006/0101319 (2006-05-01), Park et al.
patent: 0 735 696 (1996-10-01), None
patent: 0 735 696 (1999-01-01), None
patent: 91 05278 (1992-10-01), None
patent: 10-2004-0034607 (2004-04-01), None
patent: 02/093755 (2002-11-01), None
Blankenship, T. Keith, et al., “High-Throughput Turbo Decoding techniques for 4G”, in Proc. Int. Conf. 3G Wireless and Beyond, San Francisco, CA, May 2002, pp. 137-142.
3GPP TS 25.212 V6.8.0 (Jun. 2006), 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and channel coding (FOO) (Release 6) (84 pages).
Libero Dinoi, Alberto Tarable, Sergio Benedetto, “A permutation decomposition based algorithm for the design of prunable interleavers for parallel turbo decoder architectures,” Communications, 2006. ICC apos;06. IEEE International Conference on, vol. 3, Issue , Jun. 2006 pp. 1148-1153, Digital Object Identifier 10.1109/ICC.2006.254902.
C. Berrou, Y. Saouter, C. Douillard, S. Kerouédan, and M. Jézéquel, “Designing good permutations for turbo codes: towards a single model,” 2004 IEEE International Conference on Communications (ICC), vol. 1, pp. 341-345, Jun. 20-24, 2004.
France Telecom, GET, “Enhancement of Rel. 6 turbo Code,” 3GPP TSG RAN WG1#43, R1-051310, 2005 (6 pages).
Motorola, “A contention-free interleaver design for LTE codes,” 3GPP TSG RAN WG1#47 (8 pages).
A. Nimbalker, T. E. Fuja, D. J. Costello, Jr. T. K. Blankenship and B. Classon, “Contention-Free Interleavers,” IEEE ISIT 2004, Chicago, USA, Jun. 27-Jul. 2, 2004.
France Telecom, GET, “Enhancement of Rel. 6 turbo Code,” 3GPP TSG RAN WG1#43, Seoul, Korea, Nov. 7-11, 2005, R1-051310, (6 pages).
A. Nimbalker, T. E. Fuja, D. J. Costello, Jr., T. K. Blankenship, and B. Classon, “Contention-Free Interleavers,” IEEE ISIT 2004, Chicago, USA, Jun. 27-Jul. 2, 2004, p. 52.
C. Berrou, Y. Saouter, C. Douillard, S. Kerouédan, and M. Jézéquel, “Designing good permutations for turbo codes: towards a single model,” 2004 IEEE International Conference on Communications (ICC), vol. 1, pp. 341-345, Jun. 20-24, 2004.
Bruno Bougard, Alexandre Giulietti, Liesbet Van der Perre, F. Catthoor, “A Class of Power Efficient VLSI Architectures for High Speed Turbo-Decoding,” GLOBECOM '02. 2002—IEEE Global Telecommunications Conference, Conference Proceedings. Taipei, Taiwan, Nov. 17-21, 2002; [IEEE Global Telecommunications Conference], New York, NY : IEEE, US, vol. 1, Nov. 17, 2002, pp. 549-553, XP010636011 ISBN: 978-0-7803-7632-8.
Bruno Bougard, Alexandre Giulietti, et al., “A Scalable 8.7nJbit 75.6Mb/s Parallel Concatenated Convolutional (Turbo-) CODEC,” 2003 IEEE International Solid-State Circuits Conference, 2003, Digest of Technical Papers. ISS CC. 2003, IEEE International San Francisco, CA, USA, Feb. 9-13, 2003, Piscataway, NJ, USA,IEEE, US, Feb. 9, 2003, pp.1-10, XP010661601, ISBN: 978-0-7803-7707-3.
Alberto Tarable, S. Benedetto, “Mapping Interleaving Laws to Parallel Turbo Decoder Architectures,” IEEE Communications Letters, vol. 8, No. 3, Mar. 2004, pp. 162-164.
Libero Dinoi, Sergio Benedetto, “Variable-size interleaver design for parallel turbo decoder architectures,” IEEE Communications Society Globecom 2004, GLOBECOM '04. IEEE Dallas, TX. USA, Nov. 29-Dec. 3, 2004, pp. 3108-3112.
Michael J. Thul, Norbert Wehn, “FPGA Implementation of Parallel Turbo-Decoders,” SBCCI '04, Sep. 7-11, 2004, Pernambuco, Brazil, pp. 198-203.
Zhiyong He, Sebastien Roy, and Paul Fortier, “High-Speed and Low-Power Design of Parallel Turbo Decoder,” Circuits and Systems, 2005, ISCAS 2005, IEEE International Symposium on Kobe, Japan May 23-26, 2005, pp. 6018-6021.
Xiang He, Han Wen Luo, HaiBin Zhang, “A Novel Storage Scheme for Parallel Turbo Decoder,” Vehicular Technology Conference, 2005, VTC-2005-FALL, 2005 IEEE 62nd Dallas, TX, USA Sep. 25-28, 2005, Piscataway, NJ, USA, IEEE, vol. 3, Sep. 25, 2005, pp. 1950-1954.
Alberto Tarable, Sergio Benedetto, and Guido Montrosi, “Mapping Interleaving Laws to Parallel Turbo and LDPC Decoder Architectures,” IEEE Trans. Information Theory, vol. 50, No. 9, Sep. 2004, pp. 2002-2009.
Jun Ma, Ali Saidi, “High-Speed Parallel Turbo Decoding for Max-Logmap Kernel Operation Algorithm,” IP.Com Journal, IP.Com Inc., West Henrietta, NY, US, Mar. 2, 2001, XP013000274, ISSN: 1533-0001, 4 pages.
Libero Dinoi, Alberto Tarable, Sergio Benedetto, “A permutation decomposition based algorithm for the design of prunable interleavers for parallel turbo decoder architectures,” Communications, 2006, ICC '06, IEEE International Conference on, IEEE, PI, Jun. 1, 2006, pp. 1148-1153.
Ke Wan, Qingchen Chen, Pingzhi Fan, “A Novel Parallel Turbo Coding Technique Based on Frame Split and Trellis Terminating,” Parallel AN0 Distributed Computing, Applications and Technologies, 200 3. PDCAT '2003, Proceedings of the Fourth International Conference on Aug. 27-29, 2003, Piscataway, NJ, USA, IEEE, Aug. 27, 2003, pp. 927-930.
A. Giulietti, L. van der Perre, and M. Strum, “Parallel turbo coding interleavers: avoiding collisions in accesses to storage elements,” Electronics Letters, Feb. 28, 2002, vol. 38 No. 5, pp. 232-234.

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

Address generation for contention-free memory mappings of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Address generation for contention-free memory mappings of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Address generation for contention-free memory mappings of... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4175002

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