Tail-biting turbo coding to accommodate any information...

Details Tail-biting turbo coding to accommodate any information... Tail-biting turbo coding to accommodate any information...

2007-07-30

2011-12-06

Torres, Joseph D (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S774000, C714S779000

Reexamination Certificate

active

08074155

ABSTRACT:
Tail-biting turbo coding to accommodate any information and/or interleaver block size. The beginning and ending state of a turbo encoder can be made the same using a very small number of dummy bits. In some instances, any dummy bits that are added to an information block before undergoing interleaving are removed after interleaving and before transmission of a turbo coded signal via a communication channel thereby increasing throughput (e.g., those dummy bits are not actually transmitted via the communication channel). In other instances, dummy bits are added to both the information block that is encoded using a first constituent encoder as well as to an interleaved information block that is encoded using a second constituent encoder.

REFERENCES:
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah et al.
patent: 5812601 (1998-09-01), Schramm
patent: 5933462 (1999-08-01), Viterbi 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: 6374386 (2002-04-01), Kim et al.
patent: 6397367 (2002-05-01), Park et al.
patent: 6437714 (2002-08-01), Kim et al.
patent: 6487693 (2002-11-01), Kim et al.
patent: 6516441 (2003-02-01), Kim et al.
patent: 6523146 (2003-02-01), Ishikawa
patent: 6560748 (2003-05-01), Li
patent: 6715120 (2004-03-01), Hladik et al.
patent: 6766489 (2004-07-01), Piret et al.
patent: 6812873 (2004-11-01), Siohan et al.
patent: 6816556 (2004-11-01), Kim
patent: 6940928 (2005-09-01), Cameron
patent: 6950977 (2005-09-01), Lavi et al.
patent: 7146552 (2006-12-01), Kim et al.
patent: RE41498 (2010-08-01), Park et al.
patent: 7797615 (2010-09-01), Zheng
patent: 0 735 696 (1996-10-01), None
patent: 0 735 696 (1999-01-01), None
patent: 91 05278 (1992-10-01), None
patent: 9946862 (1999-09-01), None
European Search Report; EP07010406.2-1247, dated Aug. 24, 2009.
3GPP TS 25.212, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and channel coding (FDD) (Release 7)”, Jun. 2006, 80 pages, V7.1.0, France.
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.
O. Y. Takeshita, “On maximum contention-free interleavers and permutation polynomials over integer rings,” IEEE Trans. Information Theory, vol. 52, No. 3, Mar. 2006, pp. 1249-1253 (5 pages).
HighDimension Ltd., “System impact of Rel'6 turbo coding tail-bits removal,” 3GPP TSG RAN WG1#46, R1-062157 (3 pages).
3GPP TS 25.212 V6.8.0 (Jun. 2006). 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and channel coding (FDD) (Release 6) (84 pages).
C. Weiβ, C. Bettstetter and S. Riedel, “Code Construction and Decoding of Parallel Concatenated Tail-Biting Codes,” IEEE Transactions on Information Theory, vol. 47, No. 1, pp. 366-386, Jan. 2001.
Broadcom, “Tail-biting encoding for 3GPP LTE turbo codes of arbitrary Number of information bits and performance comparison,” 3GPP TSG RAn WG1 #47bis R1-070544 (14 pages).
J. L. Massey and M. K. Sain, “Codes, automata, and continuous systems: Explicit interconnections,” IEEE Trans. Automat. Contr., vol. AC-12, No. 6, pp. 644-650, 1967.
Robert J. McEliece, The Algebraic Theory of Convolutional Codes. In Handbook of Coding Theory, R. Brualdi, W.C. Human and V. Pless (eds.). Elsevier Science Publishers, Amsterdam, The Netherlands, 1998 (82 pages).
J. Rosenthal, and E. V. York, “BCH Convolutional Codes,” IEEE Transactions on Information Theory, vol. 45, No. 6, pp. 1833-1842, Sep. 1999.
H. Gluesing-Luerssen and G. Schneider, “State space realizations and monomial equivalence for convolutional codes”, arXiv:cs.IT/0603049 v1, Mar. 13, 2006 (17 pages).
Claude Berrou, Alain Glavieux, and Punya Thitimajshima. “Near Shannon limit error-correcting coding and decoding: turbo codes”, Proc. of IEEE ICC '93, Geneva, May 1993, pp. 1064-1070.
C. Fragouli and R. Wesel, “Turbo-Encoder Design for Symbol-Interleaved Parallel Concatenated Trellis-Coded Modulation,” IEEE Transactions on Communications, vol. 49, No. 3, pp. 425-435, Mar. 2001.
France Telecom, Orange, HighDimension Ltd., “Duo-Binary Turbo Codes for Evolved UTRA,” 3GPP TSG RAN WG1#46, R1-061973 (10 pages).
Ericsson, Motorola, “QPP interleaver parameters,” 3GPP TSG RAN WG1 #47bis R1-070484 (5 pages).
Motorola, “A contention-free interleaver design for LTE codes,” 3GPP TSG RAN WG1#47 (8 pages).
Ericsson, “Performance Comparison of LTE Turbo Internal Interleaver Proposals,” 3GPP TSG-RAN WG1 #47bis R1-070464 (23 pages).
A. Tarable, S. Benedetto and G. Montorsi “Mapping Interleaving Laws to Parallel Turbo and LDPC Decoder Architectures,” IEEE Trans. on Information Theory, vol. 50, No. 9, pp. 2002-2009, Sep. 2004 (8 pages).

Affiliated with

Also associated with

Rating

Tail-biting turbo coding to accommodate any information... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Tail-biting turbo coding to accommodate any information..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tail-biting turbo coding to accommodate any information... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4258254