116 results about "Tail-biting" patented technology

A method of building systematically a multi-dimensional (n, D, L) circular trellis coded modulation (CTCM) encoder with properties of optimal energy efficiency, strong tail biting and maximum minimum distance (d_min) of trellis paths is disclosed. In addition, a communication system for use in a power limited channel application is disclosed comprising a circular trellis coded modulation (CTCM) encoder with permuted state structure for encoding based on a circular trellis path associated with a sequence of digital information bits and a set of simplexes identified for the path from a multi-dimensional signal constellation; a transmitter coupled to said CTCM encoder for transmitting said sequence of channel symbols over said channel; a receiver for receiving a transmission from said transmitter including said sequence of channel symbols and any noise induced therein; and a CTCM decoder coupled to said receiver for decoding the received transmission without knowledge of the starting state of the circular trellis path of the CTCM encoder to recover the sequence of information bits. Apparatus and methods of encoding and decoding are also disclosed utilizing a combination of circular trellis-coded modulation with permuted state structure and simplex signal constellation techniques for use in the digital communication system.

A method for hard-decision channel decoding of tail-biting convolutional codes includes the step of receiving from a channel an input bit stream encoded by a tail-biting convolutional channel encoder. The encoder includes a number of memory elements and a rate. The input bit stream includes a series of symbols; each symbol includes a number of bits; the number of bits is related to the rate of the encoder. The method further includes the step of assuming a probability for each possible initial state of the encoder. The method further includes the step of decoding each symbol of the input bit stream using majority logic, with reference to a trellis structure corresponding to the encoder. The trellis structure represents: a number of states related to the number of memory elements of the encoder; a plurality of transitional branches; and a number of stages related to the number of symbols in the input bit stream.

A method for generating candidate used in TCOFDM (turbo coded orthogonal frequency-division multiplexing) with SLM (selective mapping) technique, a user data is combined with a plurality of seeds to generate corresponding a plurality of message vectors. The method is characterized in performing tail-biting turbo encoding on the message vectors to generate corresponding turbo codewords used for generating candidates, and the seed of each message vector is different from the seeds of other message vectors.

A system and method for the quantization of channel state vectors is provided. A method for communications node operation includes measuring a communications channel between the communications node and a controller, generating channel state information based on the measurement, computing a bit representation of the channel state information, transmitting the bit representation to the controller, and receiving a transmission from the controller. The computing makes use of tail-biting trellis decoding, and the transmission makes use of the channel state information transmitted by the communications node.

The invention provides a channel decoding method which comprises the following steps: calculating output values of all states of a tail biting convolutional encoder and correlation values of data to be decoded as branch measurement values; accumulating measurement values of corresponding states and the branch measurement values according to a state transition diagram, selecting a larger accumulated value as a new measurement value of a next state and storing selection results until the data to be decoded end up; backtracking from a final state of a maximum measurement value according to the selection results so as to obtain a decoding result. The invention also provides a channel decoding device. The invention ensures that the decoding has fewer occupied resources and high calculating speed.

The invention comprises the following steps: with the accumulating metrics of the initial window, an incorrect initial path is merged into a correct path, and a state of optimal node at the end of initial window is used as a decoding initial state of the tail-biting convolution code; in term of said decoding initial state and a delay window, through whole decoding trace-back, a Viterbi decoding is made for the tail-biting convolution code.

The invention discloses a rapid PBCH (physical broadcast channel) decoding method for LTE (long term evolution). The rapid PBCH decoding method includes the steps of recording corresponding address relation before and after one hundred and twenty data sub-blocks are interleaved to obtain the position of a to-be-interleaved datum after sub-block interleaving and rate matching and a PBCH deblocked sub-block interleaved corresponding relation table indicating positions of one hundred and twenty bits of an encoded tail biting convolution code after the sub-block interleaving; performing deblocked rate matching and deblocked sub-block interleaving, wherein in the PBCH deblocked sub-block interleaved corresponding relation table, the first column indicates the positions of the first to the eighth encoded bits after the sub-blocking interleaving, the second column indicates the ninth to the sixteenth encoded bits after the sub-blocking interleaving, and so on, and the fifteenth column indicates the one hundred and thirteenth to the one hundred and twentieth encoded bits after the sub-blocking interleaving. The rapid PBCH decoding method for the LTE and a structure for decoding a PBCH of the LTE are simplified, PBCH decoding time on the premise of reaching maximum likelihood decoding performance is shortened, resource consumption for PBCH decoding is saved and realizing complexity is reduced.

Embodiment of the present invention discloses a decoding method and apparatus for tail-biting convolution code. The method includes the steps of implementing Viterbi decode to a sequence obtained by repeating a transmission block end-to-end for multiple times, wherein after decoding each transmission block of the sequence, judging whether meeting output condition based on a maximum path obtained by the decode; when meeting output condition, outputting decode data of the sequence using the maximum path as backtracking path. In the embodiment of the invention, judging the Viterbi decode of a long sequence obtained by linking a plurality of transmission blocks based on the head end status of the maximum path, when meeting presetting output condition, a decode data can be obtained directly without calculating all transmission blocks, thus it is able to obtain right decode output using less transmission blocks, and computational complexity and decode time delay are all saved.

The embodiment of the invention provides a decoding processing method and a decoder. The method comprises the steps that union generator matrixes G of tail biting convolution code generator matrixes GTBCC and unit matrixes I are obtained, and pre-decoding soft value sequences and hard judgment sequences output by the soft output decoder are obtained; according to the union generator matrixes G, the pre-decoding soft value sequences and the hard judgment sequences, sorting statistics and decoding are carried out on tail biting convolution codes, and decoding processing results are obtained. The method can improve the decoding performance.

A decoder and method for decoding a tail-biting convolutional encoded signal using Viterbi decoding scheme performs a traceback operation for a first portion of a total code block, which includes a code block of the tail-biting convolutional encoded signal and a padded block. During the traceback operation for the first portion, a particular state at a predefined position within the first portion is stored as a circular state. The circular state is used as a traceback starting state for at least one subsequent portion of the total code block to produce a decoded signal of the code block.

The invention discloses a tail-biting convolutional code decoding checking method and an apparatus thereof. The method and the apparatus are used to solve a current problem of reducing tail-biting convolutional code decoding checking processing time delay. The structure characteristic of the tail-biting convolutional code is fully used. A log-likelihood ratio (LLR) input to a decoder is reordered. Through reforming and deriving a generator polynomial of the convolutional code, the decoder can perform serial output according to a positive sequence of an information bit during a backtracking process. Thus, a first bit of an information sequence can be firstly decoded successfully, which can start cyclic redundancy check (CRC) verification as soon as possible so that parts of the backtracking process and the CRC verification can be executed in parallel. Therefore, a purpose of reducing the tail-biting convolutional code decoding checking processing time delay can be achieved. According to the invention, hardware cost is not increased; improvement can be achieved with low cost and degradation of any decoding performance can not be caused.

Techniques to increase the capacity of a W-CDMA wireless communications system. In an exemplary embodiment, early termination (400) of one or more transport channels on a W-CDMA wireless communications link is provided. In particular, early decoding (421, 423) is performed on slots as they are received over the air, and techniques are described for signaling (431, 432) acknowledgment messages (ACK's) for one or more transport channels correctly decoded to terminate the transmission of those transport channels. The techniques may be applied to the transmission of voice signals using the adaptive multi-rate (AMR) codec. Further exemplary embodiments describe aspects to reduce the transmission power and rate of power control commands sent over the air, as well as aspects for applying tail-biting convolutional codes (1015) in the system.

The invention discloses a method for decoding tail-biting convolutional codes, which comprises the following steps: carrying out backtracking decoding from a state point corresponding to the maximum cumulative metric of a code sequence to be decoded so as to obtain a first decoding result, and judging whether the initial state and final state of the first decoding result are same; if not, carrying out backtracking decoding from the initial state point of the first decoding result so as to obtain a second decoding result, and comparing the inconsistent bit quantity in the first decoding resultand the second decoding result with a preset threshold; and outputting a decoding result according to the comparison result. The method and the device of the invention solve the technical problem of large bit error rate caused by weak channel environment, thereby achieving the purpose of reducing the bit error rate of decoding.

The invention discloses a method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution). A tail biting convolution decoder starts computing path metric from the starting position of a CRC (cyclic redundancy check) field, and a start state for computation of the path metric is zero constantly, and the computation of the path metric is separated into two situations: when SFN (system frame number) in an MIB (master information block) is unknown, computation of the path metric is ended at the sixth bit of a Spare bit field, a starting state of tracing back is zero, thirty-six decoding results are generated by the tail biting convolution decoder, and a PBCH decoding result finally with forty bits is formed by adding four '0' at the tail end of the thirty-six decoding results; when the SFN in the MIB is given, computation of the path metric is ended at the sixth bit of an SFN bit field, a starting state of tracing back is determined by the first six bits in the SFN field, twenty-eight decoding results are generated by the tail biting convolution decoder, and the PBCH decoding result finally with forty bits is formed by adding the last two bits of the SFN and ten '0' at the tail end of the twenty-eight decoding results.

Techniques are provided for decoding tail-biting convolutional codes by using information within the received data stream that traditionally has not been used or been available to the convolutional decoder, e.g., cyclic redundancy check (CRC) and bit information known by both the transmitter and receiver. Further, a single parallel trace-back is used that reduces implementation complexity. In addition, the least reliable decisions made during forward processing may be reversed in order to generate additional possible codeword candidates. These techniques can be used to reduce false detection rates (FDRs) and/or detection error rates (DERs).

The invention claims a CVA-based tail-biting convolutional code channel decoding method, which relates to the field of mobile communication technology. In order to reduce the decoding complexity and increase the decoding efficiency, the present invention proposes a decoding algorithm based on the Circular Viterbi Algorithm (CVA). The decoding start position of the highest reliability is determinedbased on the likelihood ratio information of a received information sequence. The Viterbi decoding is modified from the start position, by adding a comparison and selection process, impossible statepositions are deleted, and after several iterations of search, less surviving states converge in surviving paths, the state of the largest measurement value is selected as the start position of the final decoding, and a decoding result is estimated according to its corresponding surviving path. The algorithm has a faster convergence speed, the decoding efficiency is further improved, and the decoding delay is reduced.

The invention discloses an improved soft output tail biting convolution code decoding method. The method comprises the following steps of (1) acquiring a logarithmic likelihood ratio sequence; (2) calculating a branch metric; (3) calculating a forward metric; (4) calculating a backward metric; (5) calculating an information-bit logarithmic likelihood ratio to form the logarithmic likelihood ratio sequence; and (6) deciding. In the invention, the branch metric is calculated for one time, the forward metric and the backward metric are calculated for twice, and through using splicing, combination calculating is performed on a logarithmic likelihood ratio, a complexity is low and decoding performance is increased. In the invention, the information-bit logarithmic likelihood ratio sequence is calculated and is served as soft output, a tail biting convolution code can be served as an internal code which can carry out iteration with an external code in a whole system and an application value is expanded.