GSM channel estimator using a fixed-point matrix inversion algorithm

This paper presents a fixed-point matrix inversion implementation of a linear minimum mean square error (LMMSE) channel estimator for GSM receivers. The matrix inversion algorithm uses Cholesky decomposition implemented by a reconfigurable processing element. The fixed-point word length analysis is based on the bit error rate (BER) simulations using standard GSM channel models: TU, HT, and RA. The obtained results are compared to floating point matrix inversion results. Our simulations show that 16 bits fixed-point implementation of matrix inversion in LMMSE estimator gives equal BER performance compared to floating point matrix inversion. The condition number of involved matrices in LMMSE estimator varies depending on the channel model. This variation affects the word length requirements of the matrix inversion engine.

[1]  Wonyong Sung,et al.  Combined word-length optimization and high-level synthesis ofdigital signal processing systems , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Jarmo Takala,et al.  Direct versus iterative methods for fixed-point implementation of matrix inversion , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[3]  Anders Furuskar,et al.  EDGE: enhanced data rates for GSM and TDMA/136 evolution , 1999, IEEE Wirel. Commun..

[4]  M.J. Juntti,et al.  A novel coarse grain reconfigurable processing element architecture , 2003, 2003 46th Midwest Symposium on Circuits and Systems.

[5]  Heinrich Meyr,et al.  Linear MMSE channel estimation for GSM , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[6]  M. Ylinen,et al.  A fixed-point implementation of matrix inversion using Cholesky decomposition , 2003, 2003 46th Midwest Symposium on Circuits and Systems.