Abstract
It is well known that redundant filter bank precoders can be used for blind identification as well as equalization of FIR channels. Several algorithms have been proposed in the literature exploiting trailing zeros in the transmitter. In this paper we propose a generalized algorithm of which the previous algorithms are special cases. By carefully choosing system parameters, we can jointly optimize the system performance and computational complexity. Both time domain and frequency domain approaches of channel identification algorithms are proposed. Simulation results show that the proposed algorithm outperforms the previous ones when the parameters are optimally chosen, especially in time-varying channel environments. A new concept of generalized signal richness for vector signals is introduced of which several properties are studied.
Highlights
Wireless communication systems often suffer from a problem due to multipath fading which makes the channels frequency-selective
We propose a generalized algorithm of which the SGB algorithm proposed in [3] and the MNP algorithm in [5] are both special cases
In this paper we proposed a generalized algorithm for blind channel identification with linear redundant precoders
Summary
Wireless communication systems often suffer from a problem due to multipath fading which makes the channels frequency-selective. In the literature many blind methods have been proposed based on the knowledge of second-order statistics (SOS) or higher-order statistics of the transmitted symbols [1, 2] These methods often need to accumulate a large number of received symbols until channel coefficients can be estimated accurately. An algorithm based on viewing the channel identification problem as finding the greatest common divisor (GCD) of two polynomials is proposed in [5] (which we will call the MNP method). Eventhough it greatly reduces the number of received blocks needed for channel identification, the algorithm has much more computational complexity especially when the block size M is large. Some of the results in the paper have been presented at a conference [6]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
