Abstract
Partial Unit Memory (PUM) codes have excellent distance properties and we show how to construct recursive code matrices for application into turbo schemes. An iterative max-log-MAP decoding scheme is proposed for the resulting trellises with multi-input labels.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G S Lauer, “Some Optimal Partial Unit-Memory Codes,” IEEE Trans. Inf. Theory, Vol. IT-25, No. 2, pp. 240–243, March 1979.
L N Lee, “Short, unit-memory, byte-oriented, binary convolutional codes having maximal free distance,” IEEE Trans. Inf. Theory, vol. IT-22, pp. 349–352, May 1976
L Fagoonee, B Honary and C Williams. “Error Protection Using PUM Turbo Codes for Future Mobile Communication Systems,” 2nd Int. Conf. on 3G Mobile Communication Technologies, London, March 2001.
C Berrou, A Glavieux and P Thitimajshima, “Near Shannon Limit Error Correcting Coding and Decoding: Turbo Codes (1),” Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, pp. 1740–1745, May 1993.
R Johannesson and K S Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, 1999.
J Hagenauer, “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Trans. Info. Theory, Vol. 42, No. 2, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Fagoonee, L., Honary, P.B., Williams, C. (2002). PUM-Based Turbo Codes. In: Wysocki, T.A., Darnell, M., Honary, B. (eds) Advanced Signal Processing for Communication Systems. The International Series in Engineering and Computer Science, vol 703. Springer, Boston, MA. https://doi.org/10.1007/0-306-47791-2_15
Download citation
DOI: https://doi.org/10.1007/0-306-47791-2_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7202-4
Online ISBN: 978-0-306-47791-1
eBook Packages: Springer Book Archive