5 results about "Viterbi decoder" patented technology

The invention discloses a high-performance flexible multi-user parallel Viterbi decoder and a decoding method thereof, and the decoder comprises an input scheduler module which is used for receiving an input data stream and segmenting and scheduling the data stream to a plurality of parallel decoding cores; each decoding core adopts a bidirectional folding sliding block type structure and is used for independently executing Viterbi decoding operation, and the bidirectional folding sliding block type structure is used for synchronously pushing forward decoding operation and backward decoding operation in a single sliding window; the output collector module is used for collecting and recombining decoding results output by the decoding cores; wherein the plurality of decoding cores can be dynamically divided into one or more decoding groups, and each decoding group is used for independently processing one data stream, so that parallel accelerated decoding of a single high-speed data stream or concurrent decoding of multiple paths of independent data streams is realized. The method has the advantages of low delay, high throughput rate and high flexibility, and adapts to diversified communication protocol and data rate requirements.

A Viterbi traceback processing method, system, and apparatus is provided in which a first Viterbi traceback processing operation (MUX 514) is performed on a first survivor path metric (TMV1) by selecting a first output data bit (Ti1) for the first survivor path metric in response to a reverse tracking state (INDEX 0), in which a plurality of Viterbi traceback processing operations (MUX 512, 513) are performed on respective portions of additional survivor path metrics (TMV2A, TMV2B) by selecting candidate data bits (Tn1, Tn2) for the additional survivor path metrics in response to shifted reverse tracking states (INDEX 1), in which a multiplexer (MUX 518) controlled by the first output data bit selects between the candidate data bits to generate an additional output data bit (Ti2) for the additional survivor path metrics, such that Viterbi traceback processing operations are performed in parallel to produce output data bits.

The application discloses a convolutional decoder, a decoding method and an electronic device, relates to the technical field of communication, and is used for reducing time overhead of convolutional code decoding. The application is used for decoding an encoded sequence, the encoded sequence is divided into P first sub-sequences, tail sequences of the P first sub-sequences are P second sub-sequences, and the convolutional decoder comprises the following steps: for first round decoding, P Viterbi decoders decode the P second sub-sequences respectively, and update cumulative score vectors of the P second sub-sequences; from second round decoding, a pth Viterbi decoder starts to perform cyclic decoding on the encoded sequence from a starting position of a pth first sub-sequence, and update cumulative score vectors of the P first sub-sequences; P comparators compare the cumulative score vectors of two sub-sequences with the same ending position in the last two rounds of decoding, and if the maximum probability state transition paths of the two sub-sequences with the same ending position are the same, the decoding sequence of the maximum probability state transition path is output.

The invention discloses a high-speed parallel Viterbi decoder based on a CUDA (Compute Unified Device Architecture) and a decoding method. The decoder comprises an input cache module, a parallel data de-puncturing module, a parallel measurement calculation module, a backtracking path processing module and an output control module, and multi-level parallel processing is realized by utilizing a CUDA (Compute Unified Device Architecture) of a GPU (Graphics Processing Unit). The method comprises the following steps: segmenting a receiving sequence and then distributing the segmented receiving sequence to GPU thread blocks; rapidly reading a state transition matrix and an output matrix by adopting a pre-calculation table look-up strategy; adopting a parallel prefix scanning algorithm to accelerate state measurement calculation; and reducing the global memory access delay by using the shared memory. According to the invention, the performance bottleneck of the traditional serial Viterbi algorithm is broken through, on the premise of keeping the decoding precision, the throughput rate is obviously improved, the real-time processing of multi-code-rate and multi-code-stream convolutional codes is supported, and a remarkable acceleration effect can be obtained compared with CPU (Central Processing Unit) implementation. The method is especially suitable for high-throughput ACM scenes, such as 5G communication and satellite navigation, requiring real-time processing of multiple code streams and long constraint length convolutional codes.

The invention provides a molecular dynamics simulation atomic bonding state identification method and system based on a conditional random field, and the method comprises the steps: obtaining trajectory data generated through molecular dynamics simulation, and the trajectory data comprises atomic coordinates, atomic types and charge information which change with time; preprocessing the obtained trajectory data, screening a target atom set, and identifying potential bonding atom pairs frame by frame; based on the bonded atom pairs, extracting physical characteristics of the bonded atom pairs in each frame, including an inter-atomic Euclidean distance and a charge product; mapping the physical characteristics into a discrete observation state sequence; constructing a linear chain conditional random field model, and initializing model parameters to define conditional probability distribution between an observation state sequence and a hidden real keying state sequence; and inputting the observation state sequence into a linear chain conditional random field model, solving a hidden state sequence enabling the global probability to be maximum under conditional probability distribution by utilizing a Viterbi decoder, and obtaining an optimal keying state sequence of the atom pair changing along with time.