article · 2002

Wavefront decoding of trellis codes

Cited by 0Abstract and details only

Abstract

A novel reduced-complexity trellis decoding algorithm is described. The new algorithm, called wavefront decoding (WD), avoids the throughput bottleneck caused by metric and state-information feedback, which characterizes previously known breadth-first decoding algorithms. The error performance of WD for trellis-coded 8PSK on AWGN and Rayleigh fading channels is investigated by simulation. The results indicate that for a given number of survivor paths, the performance of WD is comparable, although necessarily inferior, to that of the M-algorithm, However, in contrast to the M-algorithm, WD exhibits a high degree of temporal parallelism, rendering it suitable for high speed applications.

Cite this paper

APA 7

Larsson, T. (2002). Wavefront decoding of trellis codes. https://doi.org/10.1109/isit.1995.531153

MLA 9

Larsson, Torbjörn. “Wavefront decoding of trellis codes.” 2002, p. 51, https://doi.org/10.1109/isit.1995.531153.

Chicago

Larsson, Torbjörn. 2002. “Wavefront decoding of trellis codes.” https://doi.org/10.1109/isit.1995.531153.

Harvard

Larsson, T. (2002) ‘Wavefront decoding of trellis codes’. Available at: https://doi.org/10.1109/isit.1995.531153.

BibTeX

@article{larsson2002wavefront,
  title = {{Wavefront decoding of trellis codes}},
  author = {Larsson, Torbjörn},
  pages = {51},
  year = {2002},
  doi = {10.1109/isit.1995.531153}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.