|
iDEA: Drexel E-repository and Archives >
Drexel Academic Community >
College of Engineering >
Department of Electrical and Computer Engineering >
Faculty Research and Publications (ECE) >
Optimality and duality of the turbo decoder
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1860/2542
|
| Title: | Optimality and duality of the turbo decoder |
| Authors: | Regalia, Phillip A. Walsh, John MacLaren |
| Keywords: | Dual Optimization Free Energy Minimization Information Geometry Maximum Likelihood Estimation Turbo Decoder |
| Issue Date: | Jun-2007 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Citation: | Proceedings of the IEEE, 95(6): pp. 1362-1377. |
| Abstract: | The near-optimal performance of the turbo
decoder has been a source of intrigue among communications
engineers and information theorists, given its ad hoc origins
that were seemingly disconnected from optimization theory.
Naturally one would inquire whether the favorable performance
might be explained by characterizing the turbo decoder
via some optimization criterion or performance index. Recently,
two such characterizations have surfaced. One draws from
statistical mechanics and aims to minimize the Bethe approximation
to a free energy measure. The other characterization
involves constrained likelihood estimation, a setting perhaps
more familiar to communications engineers. The intent of
this paper is to assemble a tutorial overview of these recent
developments, and more importantly to identify the formal
mathematical duality between the two viewpoints. The paper
includes tutorial background material on the information
geometry tools used in analyzing the turbo decoder, and the
analysis accommodates both the parallel concatenation and
serial concatenation schemes in a common framework. |
| URI: | http://dx.doi.org/10.1109/JPROC.2007.896495 http://hdl.handle.net/1860/2542 |
| Appears in Collections: | Faculty Research and Publications (ECE)
|
Items in iDEA are protected by copyright, with all rights reserved, unless otherwise indicated.
|