Concurrent turbo-decoding

B.J. Frey; F.R. Kschischang; P.G. Gulak

Found an issue? Give us feedback

https://doi.org/10.1...arrow_drop_down

https://doi.org/10.1109/isit.1...

Article . 2002 . Peer-reviewed

Data sources: Crossref

https://dx.doi.org/10.1109/isi...

Article

Data sources: Microsoft Academic Graph

Concurrent turbo-decoding

descriptionPublicationkeyboard_double_arrow_right Article 22 Nov 2002Publisher:IEEEJournal:Proceedings of IEEE International Symposium on Information Theory

Authors: B.J. Frey; F.R. Kschischang; P.G. Gulak;

doi: 10.1109/isit.1997.613368

Concurrent turbo-decoding

- Summary
- Metrics

Abstract

The turbo-decoding algorithm can be viewed as a message passing procedure on a graph. We contrast the standard "forward-backward" turbo-decoding algorithm with a new "concurrent" algorithm that is suited to parallel implementation.

Related Organizations

University of Toronto
Canada

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%