Parametric sequential decoding
A decoder and decoding tree technology, applied in the direction of encoding, code conversion, encoding components, etc., can solve the problems of insufficient flexibility of performance/complexity and achieve the effect of optimizing performance/complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0050] Embodiments of the present invention provide for sequencing data signals received via a communication channel by searching for candidate nodes in the decoding tree according to a nearest grid point search problem and populating in parallel a sorted list or stack of previously explored paths of different lengths. Method and device for decoding. For purposes of illustration, the following description will be made with reference to a "stack", but equivalent data structures may be used.
[0051] The sequential decoding algorithm is a tree search based decoding algorithm based on a tree representation of the ML optimization problem (represented by a decoding tree) and on a tree search according to a best-first strategy. The sequential decoding algorithm uses a stack to store the best candidate grid points.
[0052] Sequential decoding techniques take into account the metrics determined for each expanded node of the decoding tree. Each node (component of candidate grid poin...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


