Iterative receiver design in Rayleigh fading using factor graph

@inproceedings{citeulike:3000990, abstract = {In this paper we develop a novel approach for joint iterative channel estimation and LDPC decoding, based on the factor graph representation and sum-product algorithm. The fast flat fading channel is modeled as an AR process in order to characterize its temporal variation. By approximating the feedback message from the channel decoder as a Gaussian pdf, we show that Kalman smoothing can be employed for channel estimation. We further derive a new bit metric calculation method which consider both channel noise and channel estimation variance. Simulations confirm the effectiveness of our approach.}, author = {Shen, Manyuan and Niu, Huaning and Liu, Hui }, booktitle = {Vehicular Technology Conference, 2003. VTC 2003-Spring. The 57th IEEE Semiannual}, citeulike-article-id = {3000990}, comment = {An example to a factor graph algorithm where a mixture gaussian arises as a part of the computation}, doi = {http://dx.doi.org/10.1109/VETECS.2003.1208863}, journal = {Vehicular Technology Conference, 2003. VTC 2003-Spring. The 57th IEEE Semiannual}, keywords = {factor-graph, gaussian-mixture}, pages = {2604--2608 vol.4}, posted-at = {2008-07-15 06:19:44}, priority = {2}, title = {Iterative receiver design in Rayleigh fading using factor graph}, url = {http://dx.doi.org/10.1109/VETECS.2003.1208863}, volume = {4}, year = {2003} }

TY - CONF ID - citeulike:3000990 L3 - citeulike-article-id:3000990 TI - Iterative receiver design in Rayleigh fading using factor graph T2 - Vehicular Technology Conference, 2003. VTC 2003-Spring. The 57th IEEE Semiannual JF - Vehicular Technology Conference, 2003. VTC 2003-Spring. The 57th IEEE Semiannual VL - 4 SP - 2604 EP - 2608 vol.4 N2 - In this paper we develop a novel approach for joint iterative channel estimation and LDPC decoding, based on the factor graph representation and sum-product algorithm. The fast flat fading channel is modeled as an AR process in order to characterize its temporal variation. By approximating the feedback message from the channel decoder as a Gaussian pdf, we show that Kalman smoothing can be employed for channel estimation. We further derive a new bit metric calculation method which consider both channel noise and channel estimation variance. Simulations confirm the effectiveness of our approach. KW - factor-graph KW - gaussian-mixture N1 - An example to a factor graph algorithm where a mixture gaussian arises as a part of the computation AU - Shen, Manyuan AU - Niu, Huaning AU - Liu, Hui PY - 2003/// UR - http://dx.doi.org/10.1109/VETECS.2003.1208863 ER -