DC Field | Value | Language |
---|---|---|
dc.contributor.author | Noh, Minseok | ko |
dc.contributor.author | Lee, Yusung | ko |
dc.contributor.author | Park, Hyuncheol | ko |
dc.date.accessioned | 2013-03-08T03:26:50Z | - |
dc.date.available | 2013-03-08T03:26:50Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2006-10 | - |
dc.identifier.citation | IEE PROCEEDINGS-COMMUNICATIONS, v.153, no.5, pp.645 - 650 | - |
dc.identifier.issn | 1350-2425 | - |
dc.identifier.uri | http://hdl.handle.net/10203/92006 | - |
dc.description.abstract | The authors propose low complexity versions of a linear minimum mean square error (LMMSE) channel estimator for orthogonal frequency division multiplexing (OFDM) systems. They partition the channel autocorrelation matrix in the LMMSE estimator into small sub-matrices. The size of sub-matrix is determined by channel coherence bandwidth, a range of highly correlated channel frequency responses. Since the proposed estimator uses small sub-matrices instead of the whole channel auto-correlation matrix, the complexity is significantly reduced in spite of slight performance degradation. The performance of mean square error (MSE) has been evaluated in an exponential decay channel model through computer simulation to verify the validities of proposed schemes. | - |
dc.language | English | - |
dc.publisher | INSTITUTION ENGINEERING TECHNOLOGY-IET | - |
dc.title | Low Complexity LMMSE Channel Estimation for OFDM | - |
dc.type | Article | - |
dc.identifier.wosid | 000242000800011 | - |
dc.type.rims | ART | - |
dc.citation.volume | 153 | - |
dc.citation.issue | 5 | - |
dc.citation.beginningpage | 645 | - |
dc.citation.endingpage | 650 | - |
dc.citation.publicationname | IEE PROCEEDINGS-COMMUNICATIONS | - |
dc.identifier.doi | 10.1049/ip-com:20050026 | - |
dc.contributor.localauthor | Park, Hyuncheol | - |
dc.contributor.nonIdAuthor | Noh, Minseok | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.