Low computational complexity FFT-based Blind Channel Identification Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A low computational complexity blind channel identification algorithm based on FFT was proposed for short burst signal. This algorithm was expoliting the property of the MCR algorithm only requiring minimum redundancy information to obtain the channel vector,then made the linear equations established by MCR algorithm through FFT to get the channel vector, a fast order estimation algorithm was proposed by expoliting the rank information of matrix .The simulation proved that the proposed algorithm could overcome the shortcoming of the traditional identification algorithms in condition of small observed data and reduce the computational complexity of the original FFT-based algorithm with improved robustness to order.

    Reference
    Related
    Cited by
Get Citation

Sun Youming, Liu Luokun, Yang Zhengju, Guo Hong. Low computational complexity FFT-based Blind Channel Identification Algorithm[J].,2014,29(3):378-383.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: June 25,2014
  • Published:
Article QR Code