Encoder / decoder with serial cascading structure in the communication system

 

The invention relates to a coder/decoder in a communication system, and more particularly to a device for encoding/decoding of linear block codes by analyzing serial concatenated codes. A decoding device for decoding an input bit stream of code words using a generating polynomial, represented by the product of subpoenaed. The decoding device includes multiple serial cascading of decoders, each of which has a different generating polynomial, and the work of different generating polynomials forms mentioned generating polynomial, with different generating polynomials are represented by different subpagename or their work, and the decoder of the first cascade of sequential cascade United decoder accepts mentioned the stream of code words. Each of the decoders performs a software solution, and the codeword is a linear block code. 4 C. and 12 C. p. F.-ly, 9 Il.

Tabletsit

Claims

1. The encoder for encoding input information bits using a generating polynomial, prestation, each of which has a different generating polynomial, and interleaver connected between the coders to interleave the output of the encoder of the previous stage, thus generating polynomial mentioned many coders is the product of the generating polynomials of each of these coders, and a generating polynomial of each encoder seems to be one of the many subpoenaed or piece of subpoenaed, and the encoder of the first cascade of sequential cascading coders accepts mentioned input information bits.

2. A decoding device for decoding an input bit stream of code words using a generating polynomial, represented by the work of many subpoenaed containing many serial cascading of decoders, each of which has a different generating polynomial facing interleaver, inserted between the decoder converts interleave the output of the data decoder of the preceding stage, thus generating polynomial mentioned many decoders is the product of the generating polynomials of each of the decoders and a generating polynomial of each decoder seems to be one of many the prisoners decoder accepts mentioned input bit stream of code words.

3. The decoding device according to p. 2, characterized in that each of the decoders performs software solution.

4. The decoding device according to p. 2, wherein the codeword is a linear block code.

5. A decoding device for decoding a code word consisting of k information bits and r redundant bits that contain many consecutive cascading decoders, in which r redundant bits are grouped into many redundant groups, and each of these groups is served in the appropriate sequential cascading decoder, the decoder first stage decodes the k information bits and r redundant bits and each of the respective decoders decodes the result of decoding of the decoder output of the previous stage and the related excess of the group.

6. The decoding device according to p. 5, characterized in that each of the decoders performs software solution.

7. The decoding device under item 5, wherein the codeword is a linear block code.

8. The decoding device under item 5, wherein the interleaver further comprises, inserted between the decoders for paremesan the each of the decoder outputs to the decoder of the previous cascade after decoding external information for iterative decoding, these external information indicates the reliability of the decoded word and the decoder of the previous cascade controls the gain of the input character bits, depending on the external information.

10. The decoding device according to p. 5, characterized in that the decoder of the first stage receives from the decoder of the last cascade external information indicating the reliability of the encoded words after the second decoding.

11. A decoding device for decoding a code word consisting of k information bits and r redundant bits that contain many consecutive cascading coders, in which r redundant bits are grouped into many redundant groups, and each group is served in the appropriate sequential cascading decoder, the decoder first stage decodes the stream of information bits and the redundancy corresponding to the first group of redundant groups, and each of the respective serial cascading of the decoders decodes the result of decoding of the decoder of the preceding stage and the related excess of the group.

12. The decoding device according to p. 11, characterized in that each of the decoders performs software is hydrated block code.

14. The decoding device according to p. 11, characterized in that it further comprises an interleaver, inserted between the decoders to interleave the output of the encoder of the previous cascade.

15. The decoding device according to p. 11, characterized in that each of the decoders provides external information for iterative decoding, the decoder of the previous cascade after decoding, the external information indicates the reliability of the encoded words and the decoder of the previous cascade controls the gain of the input character bits, depending on the external information.

16. The decoding device according to p. 11, characterized in that the decoder of the first stage receives from the decoder of the last cascade external information indicating the reliability of the decoded words after the second decoding.

 

Same patents:

The invention relates to a receiver of a communication system, in particular to a device and method for decoding an input signal

The invention relates to a code error correction, in particular to a device and method for convolutional coding in a digital system

The invention relates to the field of communication technology

The invention relates to a device and method of channel coding/decoding for communications systems, and more particularly to a device and method of channel coding/decoding to perform software-solved iterative decoding

The invention relates to the field of telemetry and computer engineering and can be used in systems for the transmission and processing of digital data for error correction when the fivefold repetition of messages

FIELD: communications engineering.

SUBSTANCE: proposed device and method for mobile code-division multiple access communication system including device for transferring channel of backward-link transmission speed indicator afford generation of optimal code words ensuring optimal coding for all types of coding procedures from optimal type (24.1) up to optimal coding procedure 24.7 and supporting all optimal-coding devices.

EFFECT: optimized capacity.

74 cl, 21 dwg, 44 tbl

FIELD: communications engineering; network remote measuring and control systems.

SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.

EFFECT: enhanced speed of device.

1 cl, 1 dwg

FIELD: communication systems.

SUBSTANCE: method includes generating sets of sub-codes of quasi-additional turbo-codes with given encoding speeds, and given sub-codes are reorganized as a set of sub-codes with another encoding speed for use in next transfer of sub-code with given encoding speed.

EFFECT: higher efficiency.

9 cl, 13 dwg

FIELD: data transfer technologies.

SUBSTANCE: method includes segmentation of length N of quasi-complementary turbo-codes on preset amount of sections, determining identifiers of sub-code packets appropriate for segmented portions, setting of said packets separated for initial transfer of sub-code, calculation of number of remaining symbols in form N-Fs, where N - length of quasi-complementary turbo-codes, and Fs - position of start symbol of sub-code of quasi-complementary turbo-codes, determining position of symbol of remaining symbols in amount equal to sub-codes amount, which have to be sent and serial transfer of sub-code symbols from position of starting symbol Fs to position of last symbol Ls.

EFFECT: higher efficiency.

5 cl, 17 dwg

FIELD: communications engineering.

SUBSTANCE: method includes selecting one combination among given combinations, appropriate for several or every generated symbols of code word to transmit generated symbols of code word with length of sub-packet, determined in accordance to data transfer speed, information, appropriate for data transfer speed, is read, also based on length of sub-packet and chosen combination, from a table, wherein identification information, pointing at data transfer speed, sub-packet length and selected combination, is, is previously displayed for given information, and generated code word symbols are transmitted in accordance to read information and in accordance to selected combination.

EFFECT: possible check transmission of information by means of hybrid automatic repeat query for increasing carrying capacity during high-speed information transfer.

4 cl, 16 dwg, 6 tbl

FIELD: communication systems.

SUBSTANCE: coder encodes series of information bits at given encoding speed and outputs encoded symbols. Controller control coder so that when length of frame of series of information bits is first length, coder outputs encoded symbols, and when length of frame of series of information bits is second length, coder outputs partial symbols from encoded symbols, while second length is less than first length.

EFFECT: higher precision.

3 cl, 10 dwg, 2 tbl

FIELD: communication engineering.

SUBSTANCE: method includes encoding input information at transmitting side with interference-resistant code, to which symbols of synchronizing series are added and received symbols series is sent to communication channel, at receiving side in received series of symbols synchronizing series is detected and cyclic synchronization of received series of symbols is performed, then interference-resistant code is singled out, decoded with detection and correction of errors in interference-resistant code and decoded information is given to message receiver, while tat transferring side symbols of synchronizing series are formed by transformation of symbols of checking portion of interference-resistant code, and at receiving side detection of synchronizing series is performed by checking match of functional dependence of synchronizing series and checking portion of interference-resistant code.

EFFECT: higher trustworthiness.

2 cl, 1 dwg

FIELD: mobile telecommunication systems.

SUBSTANCE: transferred data are divided on separate frames, each of which contains mN bits, and each frame is additionally segmented on N blocks, each of which contains m bits. N blocks are transformed to N non-binary Galois field elements, GF(2m). Aforementioned N non-binary symbols are repeated with repeat coefficient r. rN symbols are multiplied by weight coefficients, being non-zero elements of GF(2m). rN estimated symbols are alternated and accumulated. rN of accumulated symbols are transferred to receiver, or, prior to transfer, reverse imaging of each of rN accumulated symbols to m bits is performed.

EFFECT: higher reliability.

2 cl, 5 dwg

FIELD: information transfer technologies.

SUBSTANCE: in the method, via channel with non-zero conductive ability a set of M stochastic (n,k,q) codes is used with correction of errors with guaranteed in any channel upper limit of decoding error possibility due to use for all codes of same code base q, each of codes is optimal for certain quality of channel, prior to information transfer conductive ability of channel is checked by transferring testing set, in form of q-base stochastic (n,1,q) code, conductive ability of channel is determined by pair-wise comparison of q-based symbols of received block of (n,1,q) code and counting number of matching symbols N, parameters n and k of optimal (n,k,q) code are selected with correction of errors, information exchange is performed by code blocks of selected code with correction of errors and detection of blocks with error repetition factor exceeding correcting ability of code, blocks are transferred again with uncorrected errors, share of blocks with uncorrected errors is calculated within range of analysis with length G of last received blocks, compliance of this share to range of optimality criterion of effective code is checked on basis of current state of channel, on exit beyond limits of code optimality code parameters n and k and checking matrix H are altered synchronously for sending and receiving sides of channel.

EFFECT: higher speed of operation, higher resistance to interference, higher trustworthiness, higher efficiency.

FIELD: data transfer using various noise-immune codes; signal receivers of digital communication systems using noise-immune coding for data transfer.

SUBSTANCE: proposed method for automatic choice of source noise-immune code out of given set of noise-immune codes according to adopted code realization includes calculation of syndromes of adopted code realization (probably including sequence of erasing operations or including sequence of slack solutions) followed by counting number of other-than-zero syndromes for each of noise-immune codes out of given set, source noise-immune code being chosen as that for which this counted number of other-than-zero syndromes is lower than threshold value.

EFFECT: ability of selecting source noise-immune code automatically.

4 cl, 1 dwg

FIELD: communications engineering; network remote measuring and control systems.

SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.

EFFECT: enhanced speed of device.

1 cl, 1 dwg

Up!