Intra-row permutation for turbo code

Details Intra-row permutation for turbo code Intra-row permutation for turbo code

1999-04-14

2003-04-01

Decady, Albert (Department: 2133)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Data formatting to improve error detection correction...

C714S762000, C714S788000

Reexamination Certificate

active

06543013

ABSTRACT:

FIELD OF THE INVENTION
This invention relates generally to communication systems and, more particularly to interleavers for performing code modulation.
BACKGROUND OF THE INVENTION
Techniques for encoding communication channels, known as coded modulation, have been found to improve the bit error rate (BER) of electronic communication systems such as modem and wireless communication systems. Turbo coded modulation has proven to be a practical, power-efficient, and bandwidth-efficient modulation method for “random-error” channels characterized by additive white Gaussian noise (AWGN) or fading. These random-error channels can be found, for example, in the code division multiple access (CDMA) environment. Since the capacity of a CDMA environment is dependent upon the operating signal to noise ratio, improved performance translates into higher capacity.
An aspect of turbo coders which makes them so effective is an interleaver which permutes the original received or transmitted data frame before it is input to a second encoder. The permuting is accomplished by randomizing portions of the signal based upon one or more randomizing algorithms. Combining the permuted data frames with the original data frames has been shown to achieve low BERs in AWGN and fading channels. The interleaving process increases the diversity in the data such that if the modulated symbol is distorted in transmission the error may be recoverable with the use of error correcting algorithms in the decoder.
A conventional interleaver collects, or frames, the signal points to be transmitted into an array, where the array is sequentially filled up row by row. After a predefined number of signal points have been framed, the interleaver is emptied by sequentially reading out the array column by column for transmission. As a result, signal points in the same row of the array that were near each other in the original signal point flow are separated by a number of signal points equal to the number of rows in the array. Ideally, the number of columns and rows would be picked such that interdependent signal points, after transmission, would be separated by more than the expected length of an error burst for the channel.
Non-uniform interleaving achieves “maximum scattering” of data and “maximum disorder” of the output sequence. Thus the redundancy introduced by the two convolutional encoders is more equally spread in the output sequence of the turbo encoder. The minimum distance is increased to much higher values than for uniform interleaving. A persistent problem for non-uniform interleaving is how to practically implement the interleaving while achieving sufficient “non-uniformity,” and minimizing delay compensations which limit the use for applications with real-time requirements.
Finding an effective interleaver is a current topic in the third generation CDMA standard activities. It has been determined and generally agreed that, as the frame size approaches infinity, the most effective interleaver is the random interleaver. However, for finite frame sizes, the decision as to the most effective interleaver is still open for discussion. Decreasing the amount of memory space (RAM or ROM) needed to store the information required to carry out an interleaving scheme is also a subject of current discussion.
Accordingly there exists a need for systems and methods of interleaving codes that improve non-uniformity for finite frame sizes.
There also exists a need for such systems and methods of interleaving codes which are relatively simple to implement, including having relatively low memory space requirements.
It is thus an object of the present invention to provide systems and methods of interleaving codes that improve non-uniformity for finite frame sizes.
It is also an object of the present invention to provide systems and methods of interleaving codes which are relatively simple to implement and which have relatively low memory space requirements.
These and other objects of the invention will become apparent to those skilled in the art from the following description thereof.
SUMMARY OF THE INVENTION
The foregoing objects, and others, may be accomplished by the present invention, which includes an interleaver for interleaving these data frames. The interleaver includes a storage area containing an array large enough to store the largest expected data frame. A frame of size L elements to be interleaved is stored in N
r
(l)
rows and N
c
(l)
columns of the array, where N
r
(l)
is a predetermined integer and N
c
(l)
is a prime number which satisfy the inequality
N
r
(l)
×N
c
(l−1)
<L<N
r
(l)
×N
c
(l)
where N
c
(l−1)
is the highest prime number less than N
c
(l)
. The elements of each row are permuted according to a predetermined mathematical relationship, and the rows are permuted according to predetermined mapping.


REFERENCES:
patent: 4394642 (1983-07-01), Currie et al.
patent: 4907233 (1990-03-01), Deutsch et al.
patent: 5042033 (1991-08-01), Costa
patent: 5357606 (1994-10-01), Adams
patent: 5483541 (1996-01-01), Linsky
patent: 5572532 (1996-11-01), Fimoff et al.
patent: 5675585 (1997-10-01), Bonnot et al.
patent: 5742612 (1998-04-01), Gourgue et al.
patent: 5812288 (1998-09-01), Curtis et al.
patent: 5991857 (1999-11-01), Koetje et al.
patent: 6064664 (2000-05-01), Kim
patent: 6108745 (2000-08-01), Gupta et al.
patent: 6119264 (2000-09-01), Berrou et al.
patent: 6304991 (2001-10-01), Rowitch et al.
patent: 6334197 (2001-12-01), Eroz et al.
patent: 6347385 (2002-02-01), Cui et al.
patent: EP 0300139 (1989-01-01), None
patent: WO 00/08770 (2000-02-01), None
patent: WO 00/10257 (2000-02-01), None
Error Detection and Correction for Storage Members to Correct Long and Short Error Bursts Publication-Data: IBM Technical Disclosure Bulletin, Nov. 1989, US; vol. No.: 32; Issue No.: 6B; Page No.: 387-389; Publication-Date: Nov. 1, 1989.*
Blaum, M.; Bruck, J. and Vardy, A.; Interleaving schemes for multidimensional cluster errors; IEEE Transactions on Information Theory, vol.: 44 Issue: 2; Mar. 1998 pp.: 730-743.*
Raghavan, R. and Hayes, J.P.; On randomly interleaved memories; Proceedings of Supercomputing '90; pp.: 49-58.*
Shibutani, et al “Complexity Reduction of Turbo Decoding”, IEEE VTS 50th Vehicular Technology Conference, vol. 3, Sep. 19-22, 1999, pp. 1570-1574.

Affiliated with

Also associated with

Rating

Intra-row permutation 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 Intra-row permutation for turbo code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intra-row permutation for turbo code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3092482