Optimal circular buffer rate matching for turbo code

Details Optimal circular buffer rate matching for turbo code Optimal circular buffer rate matching for turbo code

2008-06-04

2011-11-29

Chaudry, Mujtaba K (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S755000

Reexamination Certificate

active

08069400

ABSTRACT:
Optimal circular buffer rate matching for turbo code. An offset index, δ, of 3 and a skipping index, σ, of 3 is employed in accordance with circular buffer rate matching. This allows less puncturing of information bits and more puncturing of redundancy/parity bits (e.g., which can provide for a higher rate). Multiple turbo codes may be generated from a mother code such that each generated turbo code can be employed to encode information bits. For example, a first turbo coded signal can be generated using a first turbo code generated from the mother code, and a second turbo coded signal can be generated using a second turbo code generated from the mother code. Any of these turbo coded signal can be decoded using parallel decoding processing or a single turbo decoder (when each turbo coded signal undergoes processing to transform it back to the mother code format).

REFERENCES:
patent: 5406570 (1995-04-01), Berrou et al.
patent: 5446747 (1995-08-01), Berrou
patent: 5563897 (1996-10-01), Pyndiah 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: 6314289 (2001-11-01), Eberlein et al.
patent: 6798826 (2004-09-01), Shiu et al.
patent: 2007/0189248 (2007-08-01), Chang et al.
patent: 2008/0320353 (2008-12-01), Blankenship 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
3GPP TS 36.212 V2.0.0 (Sep. 2007), Technical Specification, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (Release 8)”, (30 pages).
Ericsson, “Decoder Performance of CBRM Algorithms,” 3GPP TSG-RAN WG1#49bis, Orlando, USA, Jun. 25-29, 2007, R1-073163 (5 pages).

Affiliated with

Also associated with

Rating

Optimal circular buffer rate matching for turbo code does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimal circular buffer rate matching for turbo code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal circular buffer rate matching for turbo code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4299778