DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kwanghoon | - |
dc.contributor.author | Kang, Yeonsu | - |
dc.contributor.author | Park, Hyuncheol | - |
dc.date.accessioned | 2013-03-18T09:30:39Z | - |
dc.date.available | 2013-03-18T09:30:39Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2005-07-04 | - |
dc.identifier.citation | International Technical Conferences on Circuit/Systems, Computer and Communications (ITC-CSCC 2005), v., no., pp. - | - |
dc.identifier.uri | http://hdl.handle.net/10203/147021 | - |
dc.description.abstract | An improved discrete Fourier transform (DFT)-based channel estimation for orthogonal frequency division multiplexing (OFDM) systems is proposed. Conventional DFT-based channel estimation improves the performance by suppressing time domain noise. However, it requires the accurate estimation on channel length for high reliability and suffers from the performance degradation otherwise. In contrast, proposed channel estimation can improve the performance by deciding significant channel taps without knowing any statistics. Significant channel taps are detected based on a predetermined threshold. We calculate the threshold to minimize the mean-squared error (MSE) of estimation, and confirm it via computer simulation. Simulation results demonstrate that proposed algorithm can improve MSE about 6.5dB comparing to conventional DFT-based estimation, and the MSE floor does not occur in any channel environments. | - |
dc.language | ENG | - |
dc.publisher | IEICE, IEEK, ECTI | - |
dc.title | An Adaptive DFT-Based Channel Estimation for OFDM | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.citation.publicationname | International Technical Conferences on Circuit/Systems, Computer and Communications (ITC-CSCC 2005) | - |
dc.identifier.conferencecountry | South Korea | - |
dc.contributor.localauthor | Kim, Kwanghoon | - |
dc.contributor.localauthor | Park, Hyuncheol | - |
dc.contributor.nonIdAuthor | Kang, Yeonsu | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.