Sequential Coding Algorithms: A Survey and Cost Analysis

Abstract

SENIOR MEMBER, IEEE, AND SESHADRI MOHAN, MEMBER, IEEE Absrracr-The cost of a number of sequential coding search algorithms is analyzed in a systematic manner. These algorithms search code trees, and find use in data compression, error correction, and maximum likelihood sequence estimation. The cost function is made up of the size of and number of accesses to storage. It is found that algorithms that utilize sorting are much more expensive to use than those that do not; metric-first searching regimes are less efficient than breadth-first or depth-first regimes. Cost functions are evaluated using experimental data obtained from data compression and error correction studies.

Equalization of Time-Varying Channels

“…Tree search algorithms (whether optimal or suboptimal) can be categorized as breadthfirst, depth-first, or best-first [AM84,MEDC06]. Breadth-first search algorithms include, e.g., the M-algorithm [AM84], the T-algorithm [Sim90], statistical pruning algorithms [GH03], the Wozencraft sequential decoder [WR61], and the Pohst sphere decoder [FP85].…”

“…Breadth-first search algorithms include, e.g., the M-algorithm [AM84], the T-algorithm [Sim90], statistical pruning algorithms [GH03], the Wozencraft sequential decoder [WR61], and the Pohst sphere decoder [FP85]. Depth-first search algorithms include, e.g., the Schnorr-Euchner sphere decoder and its variants [VB99,AEVZ02,DEC03].…”

Group-SMA Algorithm Based Joint Estimation of Train Parameter and State

“…SMA [24] is more efficient than RBPF for the state estimation of the hybrid system. SMA originally grows from the stochastic Malgorithm [25], based on a random sampling. In the SMA algorithm, the unknown parameter is discrete in several values and each discrete value corresponds to a system mode.…”

Low-complexity and high-performance soft MIMO detection based on distributed M-algorithm through trellis-diagram

“…In this paper, we propose a new soft MIMO detection method using the M-algorithm [6]. In [7], we introduced a greedy algorithm to achieve high throughput MIMO detection.…”