Pulse or digital communications – Systems using alternating or pulsating current – Plural channels for transmission of a single pulse train
Reexamination Certificate
1998-03-11
2001-08-14
Pham, Chi (Department: 2631)
Pulse or digital communications
Systems using alternating or pulsating current
Plural channels for transmission of a single pulse train
C714S786000
Reexamination Certificate
active
06275538
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to the encoding of data for transmission through digital radio communication channels and more specifically to convolutional feedback encoders.
BACKGROUND OF THE INVENTION
The ultimate purpose of a communication system is to transmit information from an information source to a destination over a communication channel. A communication channel is any medium over which information can be transmitted. In many types of communication channels, such as radio communication channels, noise is inherent. The inherent noise causes errors to occur in the information transmitted over the communication channel. In order to combat the noisy channel, and hence reduce bit errors, digital cellular radio systems typically employ both error-detecting and error-correcting codes. These error control techniques introduce controlled redundancy into the information transmitted over the communication channel which can be used at the destination to detect and possibly correct errors in the channel corrupted signal.
One well-known technique for error-correction uses convolutional codes as described by Andrew Viterbi and Jim Omura in their publication Principles of Digital Communication and Coding published by McGraw-Hill, Inc., New York, N.Y. 1979. With convolutional encoding, information bits are encoded and decoded in such a way as to estimate bits that were corrupted in transmission. Convolutional codes are typically described by the rate of the code, its constraint length, and the parity equations.
In a convolutional code having a rate of k
, n output bits are produced for each set of k information bits. During each coding interval, k information bits are shifted into the shift register and n bits (where n>k) are produced at the output of the shift register. The redundancy bits are combinations (linear algebraic functions) of the contents of the shift register and the most recent input bit, with the specific combinatorial function depending on the convolutional code implemented. The state of the encoder at a given time is defined as the contents of the shift register. In practice, such convolutional codes may be divided into two classes: recursive and non-recursive codes. The implementation of non-recursive codes typically involves the incorporation of a feed-forward type shift register, while recursive codes generally require an encoder with a feedback circuit.
Tail bits and tail-biting are commonly used methods to terminate the trellises or coding paths, of convolutional codes for short block lengths. When tail-bits are used, the encoder is forced to a known state at the end of the block. Tail-biting constrains the encoder to begin and end at the same state, which necessarily depends on the data sequence being transmitted.
For the feed-forward or non-recursive case, it is relatively easy to find the initial state of the encoder which satisfies the tail-biting requirement. In practice, the feed-forward shift register is simply initialized with the last m bits of the input sequence, where m is the memory of the code. However, in the case of recursive codes, it is not as easy to find the initial state of the encoder which satisfies the tail-biting requirement. This is primarily the result of the feedback nature of the recursive encoder.
Therefore, there is and continues to be a need for a practical and efficient technique for determining the initial or starting state of a recursive convolutional feedback encoder to enable the use of tail-biting codes.
SUMMARY OF THE INVENTION
The present invention is a convolutional feedback encoder for encoding short information sequences. The encoder comprises a shift register with a feedback circuit and an output circuit. During each coding interval, k bits from the information sequence are input to the encoder and n coded output bits are generated. Before encoding begins, the encoder is initialized to a starting state selected so that the ending state will be the same as the starting state. Thus, the present invention implements a recursive, tail-biting code.
The present invention employs an input buffer and logic circuit to initialize the convolutional feedback encoder before encoding of the information sequence begins. The information sequence is stored temporarily in an input buffer before it is passed to the convolutional feedback encoder. A logic circuit is connected between the input buffer and the convolutional feedback encoder. The logic circuit forms linear combinations of the input bits in the information sequence. Each linear combination represents one element in the shift register of the convolutional feedback encoder.
REFERENCES:
patent: 4520490 (1985-05-01), Wei
patent: 5327441 (1994-07-01), Kawazoe et al.
patent: 5331665 (1994-07-01), Busschaert et al.
patent: 5349589 (1994-09-01), Chennakeshu et al.
patent: 5721745 (1998-02-01), Hladik et al.
patent: 5982818 (1999-11-01), Krueger et al.
patent: 6023783 (2000-02-01), Divsalar et al.
Cox, Richard V. and Sundberg, Carl-Erik W.; “An Efficient Adaptive Circular Viterbi Algorithm for Decoding Generalized Tailbiting Convolutional Codes”; IEEE Transactions on Vehicular Technology, Feb. 1994, No. 1, pp. 57-68.
Joerssen, O. and Meyr, H.; “Terminating the Trellis of Turbo-Codes”; Electronic Letters, Aug. 4, 1994, vol. 30, No. 16, pp. 1285-1286.
Koorapaty Havish
Ramesh Rajaram
Wang Yi-Pin
Coats & Bennett PLLC
Corrielus Jean B.
Ericsson Inc.
Pham Chi
LandOfFree
Technique for finding a starting state for a convolutional... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Technique for finding a starting state for a convolutional..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for finding a starting state for a convolutional... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2499513