Bidirectional sequential decoding

Li, Kaiping; KaIlel, S.

doi:10.1109/18.605602

Cited by 22 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To address this challenge, we are exploring techniques for incorporating bidirectional stack processing in both the turbo and original BMLSD receivers. Bidirectional stack schemes have been shown to reduce the likelihood of erasures by allowing simultaneous tree searches in the forward and reverse directions [13]. Such an approach allows for the generation of priors on a larger number of bits, thereby facilitating faster convergence in the turbo-BMLSD.…”

Section: Conclusion and Open Questionsmentioning

confidence: 99%

Iterative Stack-Based Detection for Unknown ISI Channels

Nelson

2007

2007 IEEE/SP 14th Workshop on Statistical Signal Processing

View full text Add to dashboard Cite

We propose a turbo-style receiver for detecting convolutionallyencoded data transmitted over multiple unknown dispersive channels. The receiver employs two Bayesian maximum likelihood sequence detectors (BMLSD), each of which uses a stack-based tree search algorithm to generate an estimate of the transmitted data. The detectors exchange soft information about the underlying bits, thereby reducing the number of branch explorations required to detect a transmitted block. The proposed structure is particularly attractive when receiver memory is limited, as the iterative exchange of priors can overcome the erasures typically associated with small stack size in tree search algorithms. Simulation results show that the turbo-BMLSD receiver achieves significant performance gains over the original BMLSD algorithm and approaches the performance of MLSD for a known channel.

show abstract

Section: Conclusion and Open Questionsmentioning

confidence: 99%

Iterative Stack-Based Detection for Unknown ISI Channels

Nelson

2007

2007 IEEE/SP 14th Workshop on Statistical Signal Processing

View full text Add to dashboard Cite

show abstract

“…However, it was shown that this scheme could not improve the computational performance much. K. Li and S. Kallel [17] introduced an efficient bidirectional sequential decoding technique based on the Stack algorithm. It was shown that the proposed algorithm could double the Pareto exponent 1 and the reduced computational variability can decrease the erasure probability substantially.…”

Section: A Bidirectional Sequential Decoding Algorithmsmentioning

confidence: 99%

“…Independently, V. Senk and P. Radivojac also proposed a bidirectional stack algorithm in [20]. An improved version was demonstrated in [21], which was not only faster than the bidirectional sequential decoding in [17] but also than that introduced in [20].…”

Section: A Bidirectional Sequential Decoding Algorithmsmentioning

confidence: 99%

Bidirectional Fano algorithm for high throughput sequential decoding

Koçak

Woodward

et al. 2009

2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

Various techniques, such as bidirectional search, have been employed in sequential decoding to reduce the decoding delay. In this paper, a bidirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction simultaneously. It is shown that the proposed BFA can reduce the average decoding delay by at least 50% compared to the unidirectional Fano algorithm (UFA). Due to the reduction in the variability of the computational effort by using bidirectional search, there is even higher decoding throughput improvement at low signal-to-noiseratio (SNR). For example at Eb/No=3dB, there is 300% throughput improvement by using the BFA decoding compared to the conventional UFA decoding. The proposed BFA decoding technique can be employed in very high throughput wireless communication systems with low hardware complexity and power consumption.

show abstract

“…In [14], a bidirectional decoding algorithm was proposed in order to reduce the complexity of decoding through a noise burst. Two decoders are working, where one works from the start of the block forward and the other moves from the end of the block backward.…”

Section: B Bidirectional Stack Decodingmentioning

confidence: 99%

Closest point search in lattices using sequential decoding

Sommer

Feder²,

Shalvi³

2005

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

View full text Add to dashboard Cite

The problem of finding the closest lattice point arises in several communication problems, and is known to be NP-hard. Existing methods to solve the problem are based on the sphere decoder, which searches for all the lattice points in a sphere around the received point. The sphere decoder is general and does not exploit the noise properties of the communication channel. In this paper we suggest to use sequential decoding algorithms for this problem. In particular, we propose an algorithm based on the well known Fano algorithm that naturally exploits the noise structure, hence offers a significant complexity reduction with respect to the sphere decoder with only a small penalty in error performance. Two further improvements are suggested. The first is bidirectional stack decoding, where the stack is implemented using a heap data structure to avoid sorting. The second is interleaved decoding, where the possibility to choose an arbitrary search order along the lattice coordinates is used to interleave noise bursts at the receiver. Finally, a lower bound is found for the computational cutoff rate of sequential lattice decoding.

show abstract

Bidirectional sequential decoding

Cited by 22 publications

References 18 publications

Iterative Stack-Based Detection for Unknown ISI Channels

Iterative Stack-Based Detection for Unknown ISI Channels

Bidirectional Fano algorithm for high throughput sequential decoding

Closest point search in lattices using sequential decoding

Contact Info

Product

Resources

About