Reduced Complexity Sliding Window BCJR Decoding Algorithms for Turbo Codes

@inproceedings{Gwak1999ReducedCS,
  title={Reduced Complexity Sliding Window BCJR Decoding Algorithms for Turbo Codes},
  author={Jihye Gwak and Sooyoung Kim Shin and Hyung-Myung Kim},
  booktitle={IMA Int. Conf.},
  year={1999}
}
In decoding the turbo codes, the sliding window BCJR algorithm, derived from the BCJR algorithm, permits a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes and uses reduced memory span. However, the number of computations required is greater than that of BCJR algorithm. In this paper, we propose an efficient sliding window type scheme which maintains the advantages of the conventional sliding window algorithm, reduces its computational… CONTINUE READING
6 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes,

  • S. Benedetto, D.Divsalar, G. Montorsi, F. Pollara
  • in Proc. ICC,
  • 1996
Highly Influential
5 Excerpts

and D

  • S. Li
  • J. Costello, Jr., Error Control Coding. Prentice…
  • 1983

Similar Papers

Loading similar papers…