Fast convergence with q-expectation in EM-based blind iterative detection

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2006, Pages 458-462

  Guo, Wenbin ^a   Cui, Shuguang ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE SPEEDS; E M ALGORITHMS; EXPECTATION MAXIMIZATION (EM); FAST CONVERGENCE; FREQUENCY SELECTIVE (FS) CHANNELS; INCOMPLETE OBSERVATIONS; ITERATIVE DETECTION; ITERATIVE SCHEMES; JOINT CHANNEL ESTIMATION AND SIGNAL DETECTION; PARAMETER GENERALIZATION; PARAMETERIZED; Q VALUES; SIMULATION RESULTS; SYSTEM PERFORMANCES; TSALLIS ENTROPIES;

BOOLEAN FUNCTIONS; CHANNEL ESTIMATION; ESTIMATION; FREQUENCY ESTIMATION; ITERATIVE METHODS; MODEL STRUCTURES; SIGNAL PROCESSING; STANDARDS;

PARAMETER ESTIMATION;

EID: 47049131059     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2006.354789     Document Type: Conference Paper

References (15)

1. J. G. Proakis, Digital Communications, 4th Edition. New York, McGraw-Hill, 2000.
2. M. A. Khalighi and J. Boutros,"Channel Estimation in Turbo-BLAST Deteotors Using EM algorithm," Proc. IEEE ICASSP, 2005.
3. Q. Li, C. N. Georghiades, and X. Wang,"Blind Multiuser Deoteotion in Uplink CDMA with Multipath Fading: A Sequential EM Approach," IEEE Transactions on Communications, Vol. 52. No, 1, January 2004, pp. 71-81.
4. R. Otnes and M. Tüchler, "Iterative Channel Estimation for Turbo Equalization of Time-Varying Frequency-Selective Channels," IEEE Transactions on Wireless Communications, Vol. 3, No .6, November 2004, pp. 1918-1923.
5. A. O. Berthet, B. S. Unal, and R. Visoz, "Iterative Deooding of Convolutionally Encoded Signals over Multipath Rayleigh Fading Channels," IEEE Journals on Selected Areas in Communications, Vol. 19, No. 9, September 2001, pp. 1729-1743.
6. S. Furuiohi, "On Uniqueness Theorems for Tsallis Entropy and Tsallis Relative Entropy," IEEE Transactions on Information Theory, Vol. 51, No. 10, Ootober 2005, pp. 3638-3645.
7. A. R Dempster, N. M. Laird, and D. B. Rubin, "Maximum Likelihood from Incomplete Data via the EM Algorithm," J. Royal Statistical Soc. Ser. B, Vol. 39, No. 1, 1977, pp. 1-38.
8. T. K. Moon, "The Expectation-Maximization Algorithm," IEEE Signal Processing Magazine, Vol. 13, No. 6, Nov. 1996, pp. 47-60.
9. Ghassan Kawas Kaleh and Robert Vallet, "Joint Parameter Estimation and Symbol Detection for Linear or Nonlinear Unknown Channels," IEEE Transactions on Communications, Vol.7, July 1994, pp. 2406-2413.
10. T. M. Cover and J. A. Thomas, Elements of Information Theory, John WIley&Sons, 1991.
11. G.Mclachlan and T. Krishnan, The EM Algorithm and Extensions. New York: John Wiley&Sons, 1997.
12. Mario A.T. Figueiredo and Anil K. Jain, "Unsupervised Learning of Finite Mixture Models". IEEE Trans. on Patten Analysis and Machine Intelligence, Vol.24, No.3, Maroh 2002, pp.381-396.
13. A. Piastino and A. R. Piastino, "Tsallis Entropy and Jaynes' Information Theory Formalism," Brazilian Journal of Physics, Vol. 29. No. 1, March 1999, pp. 50-60.
14. Sumiyoshi Abe and Yuko Okamoto (Edit),Nonextensive Statistical Mechanics and Its Applications. Berlin Heidelberg: Springer-Verlag, 2001.
15. H. D. Pfister and P. H. Siegel, "The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers," IEEE Transactions on Information Theory, Vol. 49, No. 6, June 2003, pp. 1425-1438.