Method for detecting information bits processed by concatenated block codes
First Claim
1. Method for detecting information bits in a coded digital signal, within a receiver, the coding of the said digital signal having been performed within a transmitter by applying, to information bits to be transmitted, a block code corresponding to the product of at least two elementary systematic block codes, the method comprising an iterative decoding phase including a number m of decoding cycles, each decoding cycle successively including code word search steps for each elementary block code used in the product code,wherein, at each code word search step, a data matrix and a decision matrix with binary components are received which, before the first search step of the iterative decoding phase consist respectively of an input matrix consisting of samples of the received signal and of a matrix, the components of which are those of the input matrix put into binary form, and a new decision matrix and a new data matrix are produced for the following search step,wherein decoded information bits are extracted from the decision matrix produced during the last code word search step,and wherein each code word search step includes a division of the data matrix received into data vectors each corresponding to a code word of the elementary code and a corresponding division of the decision matrix received into decision vectors, and the following substeps for respectively processing at least some of the data vector/decision vector pairs:
- determining a number p of indices for which the components of the data vector are the least reliable;
constructing a number q of binary words to be decoded from the said p indices and from the decision vector;
obtaining q'"'"' code words on the basis of algebraic decodings of the decision vector of the q binary words to be decoded;
selecting, among the q'"'"' code words obtained, the one having the smallest euclidean distance from the data vector;
calculating a correction vector, each component Wj of the correction vector being calculated respectively by determining a possible concurrent word having a j-th component different from that of the selected code word, and by applying the formula;
##EQU14## when a concurrent word has been determined, Md and Mc respectively designating the euclidean distances, with respect to the data vector, of the selected code word and of the concurrent word, and Cjd and R'"'"'j respectively designating the j-th components of the selected code word and of the date vector;
updating said decision vector by obtaining a new decision vector taken to be equal to the said selected code word; and
updating said data vector, a new data vector being calculated by adding the correction vector multiplied by a first confidence coefficient to a corresponding input vector extracted from the input matrix.
1 Assignment
0 Petitions
Accused Products
Abstract
The transmitted bits are coded according to the product of at least two systematic block codes. An iterative decoding is applied in order to determine, at each code word search step, a data matrix and a decision matrix which are used for the following step. The new decision matrix is determined at each step by decoding the rows or the columns of the input matrix, and the new data matrix is determined by taking account of correction terms which increase the reliability of the decoding at each iteration. The method is especially suited for use with high-efficiency block codes.
250 Citations
31 Claims
-
1. Method for detecting information bits in a coded digital signal, within a receiver, the coding of the said digital signal having been performed within a transmitter by applying, to information bits to be transmitted, a block code corresponding to the product of at least two elementary systematic block codes, the method comprising an iterative decoding phase including a number m of decoding cycles, each decoding cycle successively including code word search steps for each elementary block code used in the product code,
wherein, at each code word search step, a data matrix and a decision matrix with binary components are received which, before the first search step of the iterative decoding phase consist respectively of an input matrix consisting of samples of the received signal and of a matrix, the components of which are those of the input matrix put into binary form, and a new decision matrix and a new data matrix are produced for the following search step, wherein decoded information bits are extracted from the decision matrix produced during the last code word search step, and wherein each code word search step includes a division of the data matrix received into data vectors each corresponding to a code word of the elementary code and a corresponding division of the decision matrix received into decision vectors, and the following substeps for respectively processing at least some of the data vector/decision vector pairs: -
determining a number p of indices for which the components of the data vector are the least reliable; constructing a number q of binary words to be decoded from the said p indices and from the decision vector; obtaining q'"'"' code words on the basis of algebraic decodings of the decision vector of the q binary words to be decoded; selecting, among the q'"'"' code words obtained, the one having the smallest euclidean distance from the data vector; calculating a correction vector, each component Wj of the correction vector being calculated respectively by determining a possible concurrent word having a j-th component different from that of the selected code word, and by applying the formula;
##EQU14## when a concurrent word has been determined, Md and Mc respectively designating the euclidean distances, with respect to the data vector, of the selected code word and of the concurrent word, and Cjd and R'"'"'j respectively designating the j-th components of the selected code word and of the date vector;updating said decision vector by obtaining a new decision vector taken to be equal to the said selected code word; and updating said data vector, a new data vector being calculated by adding the correction vector multiplied by a first confidence coefficient to a corresponding input vector extracted from the input matrix. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. Method for transmitting information bits, comprising:
-
a coding phase in which a block code, corresponding to the product of at least two elementary systematic block codes, is applied to the information bits to be transmitted; a phase of modulation and of transmission of a signal obtained from the coded information bits; a phase of reception of the transmitted signal after propagation and of demodulation; and an iterative decoding phase including a number m of decoding cycles, each decoding cycle successively including code word search steps for each elementary block code used in the product code, wherein, at each code word search step, a data matrix and a decision matrix with binary components are received which, before the first search step of the iterative decoding phase consist respectively of an input matrix consisting of samples of the received signal and of a matrix, the components of which are those of the input matrix put into binary form, and a new decision matrix and new data matrix are produced for the following search step, wherein decoded information bits are extracted from the decision matrix produced during the last code work search step, and wherein each code word search step includes a division of the data matrix received into data vectors each corresponding to a code word of the elementary code and a corresponding division of the decision matrix received into decision vectors, and the following substeps for respectively processing at least some of the data vector/decision vector pairs; determining a number p of indices for which the components of the data vector are the least reliable; constructing a number q of binary words to be decoded from the said p indices and from the decision vector; obtaining q'"'"' code words on the basis of algebraic decodings of the decision vector and of the q binary words to be decoded; selecting, among the q'"'"' code words obtained, the one having the smallest euclidean distance from the data vector; calculating a correction vector, each component Wj of the correction vector being calculated respectively by determining a possible concurrent word having a j-th component different from that of the selected code word, and by applying the formula;
##EQU15## when a concurrent word has been determined, Md and Mc respectively designating the euclidean distances, with respect to the data vector, of the selected code word and of the concurrent word, and Cjd and R'"'"'j respectively designating the j-th components of the selected code word and of the data vector;updating said decision vector by obtaining a new decision vector taken to be equal to the said selected code word; and updating said decision vector, a new data vector being calculated by adding the correction vector multiplied by a first confidence coefficient to a corresponding input vector extracted from the input matrix. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. Method for retrieving information bits stored in coded from in a memory, the coding of the said bits having been performed by applying a block code corresponding to the product of at least two elementary systematic block bodes, the said method comprising a phase of reading in the memory and a phase of iterative decoding, including a number m of decoding cycles, each decoding cycle successively including code word search steps for each elementary block code used in the product code,
wherein, at each code word search step, a data matrix and a decision matrix with binary components are received which, before the first search step of the iterative decoding phase consist respectively of an input matrix consisting of samples of the received signal and of a matrix the components of which are those of the input matrix put into binary form, and a new decision matrix and a new data matrix are produced for the following search step, wherein decoded information bits are extracted from the decision matrix produced during the last code word search step, and wherein each code word search step includes a division of the data matrix received into data vectors each corresponding to a code word of the elementary code and a corresponding division of the decision matrix received into decision vectors, and the following substeps for respectively processing at least some of the data vector/decision vector pair: -
determining a number p of indices for which the components of the data vector are the least reliable; constructing a number q of binary words to be decoded from the said p indices and from the decision vector; obtaining q'"'"' code words on the basis of algebraic decodings of the decision vector and of the q binary words to be decoded; selecting, among the q'"'"' code words obtained, the one having the smallest euclidean distance from the data vector; calculating a correction vector, each component Wj of the correction vector being calculated respectively by determining a possible concurrent word having a j-th component different from that of the selected code word, and by applying the formula;
##EQU16## when a concurrent word has been determined, Md and Mc respectively designating the euclidean distances with respect to the data vector, of the selected code word and of the concurrent word, and Cjd and R'"'"'j respectively designating the j-th components of the selected code word and of the data vector;updating said decision vector by obtaining a new decision vector taken to be equal to the said selected code word; and updating said data vector, a new data vector being calculated by adding the correction vector multiplied by a first confidence coefficient to a corresponding input vector extracted from the input matrix. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31)
-
Specification