Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/68987
DC FieldValue
dc.titleA novel subspace-based blind channel estimation for cyclic prefixed single-carrier transmissions
dc.contributor.authorGao, F.
dc.contributor.authorNallanathan, A.
dc.date.accessioned2014-06-19T02:55:32Z
dc.date.available2014-06-19T02:55:32Z
dc.date.issued2006
dc.identifier.citationGao, F.,Nallanathan, A. (2006). A novel subspace-based blind channel estimation for cyclic prefixed single-carrier transmissions. IEEE Wireless Communications and Networking Conference, WCNC 3 : 1537-1542. ScholarBank@NUS Repository.
dc.identifier.isbn1424402700
dc.identifier.issn15253511
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/68987
dc.description.abstractBlind channel estimation for cyclic prefixed single-carrier (CP-SC) systems via second order statistics (SOS) is considered in this paper. By fixing one or more symbols in the transmitted block to be real, we develop a simple technique for blind channel estimation that does not need redundant precoding or virtual carriers. A side-benefit, yet a novel contribution of the proposed algorithm, is that the phase ambiguity, an inherent problem in traditional blind channel estimation, is also resolved. The elimination of phase ambiguity facilitates signal detection for digital communications where symbols are usually taken from the finite alphabet. The results of the computer simulations clearly show the effectiveness of our proposed algorithm. ©2006 IEEE.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleIEEE Wireless Communications and Networking Conference, WCNC
dc.description.volume3
dc.description.page1537-1542
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

98
checked on Dec 2, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.