Skip to main content
SpringerLink
Log in
Book cover

International Conference on Big Data Computing and Communications

BigCom 2015: Big Data Computing and Communications pp 28–42Cite as

Dynamic Sparse Channel Estimation Using \(\ell _0\)-constrained Kalman Filter in OFDM Systems

  • Conference paper
  • First Online:

  • 2148 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9196))

Abstract

The conventional Compressed Channel Sensing (CCS) methods are concerned with the static sparse channel which is modeled as time invariable path number and path delays, but they fail to work in a dynamic scenario which allows the channel parameters to vary over time. To solve this problem, we introduce a simple Dynamic Sparse Channel Estimation (DSCE) algorithm for Orthogonal Frequency-Division Multiplexing (OFDM) systems. Exact reconstruction is provided by interchanging the constrained part and the optimization part of minimum \(\ell _0 \)-norm recovery, and then minimum \(\ell _0 \)-norm recovery is transformed into a \(\ell _0 \)-norm constrained Kalman Filter (KF) problem. The key idea of the proposed algorithm is the linearization of the non-linear state constraint. In this case, four types of fictitious observations are developed to substitute for the \(\ell _0 \)-norm constraint based on four families of continuous functions which are used to approximate to the discontinuous \(\ell _0 \)-norm. Therefore, DSCE is performed by employing KF in a stand alone manner. Numerical evaluations are presented to demonstrate the effectiveness of the proposed algorithm in practice.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bajwa, W.U., Haupt, J., Sayeed, A.M., Nowak, R.: Compressed channel sensing: A new approach to estimating sparse multipath channels. Proceedings of the IEEE 98(6), 1058–1076 (2010)

    Article  Google Scholar 

  2. Candès, E.J., et al.: Compressive sampling. In: Proceedings of the International Congress of Mathematicians, Madrid, Spain, vol. 3, pp. 1433–1452 (2006)

    Google Scholar 

  3. Carmi, A., Gurfil, P., Kanevsky, D.: Methods for sparse signal recovery using kalman filtering with embedded pseudo-measurement norms and quasi-norms. IEEE Transactions on Signal Processing 58(4), 2405–2409 (2010)

    Article  MathSciNet  Google Scholar 

  4. Dong, M., Tong, L., Sadler, B.M.: Optimal pilot placement for time-varying channels. In: 4th IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2003, pp. 219–223. IEEE (2003)

    Google Scholar 

  5. Gui, G., Adachi, F.: Sparse least mean fourth algorithm for adaptive channel estimation in low signal-to-noise ratio region. International Journal of Communication Systems (2013)

    Google Scholar 

  6. Gui, G., Adachi, F.: Stable adaptive sparse filtering algorithms for estimating mimo channels. IET Communications 8(7), 1032–1040 (2014)

    Article  Google Scholar 

  7. Gui, G., Peng, W., Adachi, F.: Improved adaptive sparse channel estimation based on the least mean square algorithm. In: 2013 IEEE Wireless Communications and Networking Conference (WCNC), pp. 3105–3109. IEEE (2013)

    Google Scholar 

  8. Hu, D., Wang, X., He, L.: A new sparse channel estimation and tracking method for time-varying ofdm systems. IEEE Transactions on Vehicular Technology 62(9), 4648–4653 (2013)

    Article  Google Scholar 

  9. Hwang, T., Yang, C., Wu, G., Li, S., Li, G.Y.: Ofdm and its wireless applications: a survey. IEEE Transactions on Vehicular Technology 58(4), 1673–1694 (2009)

    Article  Google Scholar 

  10. Jagannatham, A.K., Rao, B.D.: Cramer-rao bound based mean-squared error and throughput analysis of superimposed pilots for semi-blind multiple-input multiple-output wireless channel estimation. International Journal of Communication Systems (2012)

    Google Scholar 

  11. Jiang, X., Kirubarajan, T., Zeng, W.J.: Robust sparse channel estimation and equalization in impulsive noise using linear programming. Signal Processing 93(5), 1095–1105 (2013)

    Article  Google Scholar 

  12. Kalman, R.E.: A new approach to linear filtering and prediction problems. Journal of basic Engineering 82(1), 35–45 (1960)

    Article  Google Scholar 

  13. Kalouptsidis, N., Mileounis, G., Babadi, B., Tarokh, V.: Adaptive algorithms for sparse system identification. Signal Processing 91(8), 1910–1919 (2011)

    Article  MATH  Google Scholar 

  14. Kamen, E.W., Su, J.K.: Introduction to optimal estimation. Springer (1999)

    Google Scholar 

  15. Li, W., Preisig, J.C.: Estimation of rapidly time-varying sparse channels. IEEE Journal of Oceanic Engineering 32(4), 927–939 (2007)

    Article  Google Scholar 

  16. Gupta, Sen: A., Preisig, J.: A geometric mixed norm approach to shallow water acoustic channel estimation and tracking. Physical Communication 5(2), 119–128 (2012)

    Article  Google Scholar 

  17. Simon, D.: Kalman filtering with state constraints: a survey of linear and nonlinear algorithms. IET Control Theory & Applications 4(8), 1303–1318 (2010)

    Article  MathSciNet  Google Scholar 

  18. Taubock, G., Hlawatsch, F.: A compressed sensing technique for ofdm channel estimation in mobile environments: Exploiting channel sparsity for reducing pilots. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2008, pp. 2885–2888. IEEE (2008)

    Google Scholar 

  19. Tibshirani, R.: Regression shrinkage and selection via the lasso: a retrospective. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 73(3), 273–282 (2011)

    Article  MathSciNet  Google Scholar 

  20. Vaswani, N.: Kalman filtered compressed sensing. In: 15th IEEE International Conference on Image Processing, ICIP 2008, pp. 893–896. IEEE (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Yanshan University, Qinhuangdao, 066004, Hebei, People’s Republic of China

    Nan Jing & Lin Wang

Authors
  1. Nan Jing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nan Jing .

Editor information

Editors and Affiliations

  1. University of North Carolina at Charlotte, Charlotte, North Carolina, USA

    Yu Wang

  2. Rutgers Business School, Newark, New Jersey, USA

    Hui Xiong

  3. Illinois Institute of Technology, Chicago, Illinois, USA

    Shlomo Argamon

  4. Illinois Institute of Technology, Chicago, Illinois, USA

    XiangYang Li

  5. Harbin Institute of Technology, Harbin, China

    JianZhong Li

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Jing, N., Wang, L. (2015). Dynamic Sparse Channel Estimation Using \(\ell _0\)-constrained Kalman Filter in OFDM Systems. In: Wang, Y., Xiong, H., Argamon, S., Li, X., Li, J. (eds) Big Data Computing and Communications. BigCom 2015. Lecture Notes in Computer Science(), vol 9196. Springer, Cham. https://doi.org/10.1007/978-3-319-22047-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22047-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22046-8

  • Online ISBN: 978-3-319-22047-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation