Karhunen-Loève-Based Reduced-Complexity Representation of the Mixed-Density Messages in SPA on Factor Graph and Its Impact on BER. (3rd January 2011)

• Record Type: Journal Article
• Authors: Prochazka, Pavel; Sykora, Jan
• Other Names: Nicoli Monica Academic Editor.
• Is Part Of: EURASIP journal on wireless communications and networking. Volume 2010(2010)
• Publication Date: 2011-01-03
• Subjects: Wireless communication systems -- Periodicals; Signal processing -- Periodicals; 621.38405
• DOI: 10.1155/2010/574607
• Languages: English
• ISSNs: 1687-1499

Abstract

Abstract : The sum product algorithm on factor graphs (FG/SPA) is a widely used tool to solve various problems in a wide area of fields. A representation of generally-shaped continuously valued messages in the FG/SPA is commonly solved by a proper parameterization of the messages. Obtaining such a proper parameterization is, however, a crucial problem in general. The paper introduces a systematic procedure for obtaining a scalar message representation with well-defined fidelity criterion in a general FG/SPA. The procedure utilizes a stochastic nature of the messages as they evolve during the FG/SPA processing. A Karhunen-Loève Transform (KLT) is used to find a generic canonical message representation which exploits the message stochastic behavior with mean square error (MSE) fidelity criterion. We demonstrate the procedure on a range of scenarios including mixture-messages (a digital modulation in phase parametric channel). The proposed systematic procedure achieves equal results as the Fourier parameterization developed especially for this particular class of scenarios.