| dc.contributor.author | Reisenfeld Sam | en_US |
| dc.contributor.author | Aboutanios Elias | en_US |
| dc.date.accessioned | 2009-12-21T03:53:21Z | |
| dc.date.available | 2009-12-21T03:53:21Z | |
| dc.date.issued | 2003 | en_US |
| dc.identifier | 2003000277 | en_US |
| dc.identifier.citation | Reisenfeld Sam and Aboutanios Elias 2003, 'A new algorithm for the estimation of the frequency of a complex exponential in additive Gaussian noise', IEEE-Inst Electrical Electronics Engineers Inc, vol. 7, no. 11, pp. 549-551. | en_US |
| dc.identifier.issn | 1089-7798 | en_US |
| dc.identifier.other | C1 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10453/5866 | |
| dc.description.abstract | This letter presents a new algorithm for the precise estimation of the frequency of a complex exponential signal in additive, complex, white Gaussian noise. The discrete Fourier transform (DFT)-based algorithm performs a frequency interpolation on the results of an N point complex fast Fourier transform. For large N and large signal to noise ratio, the frequency estimation error variance obtained is 0.063 dB above the Cramer–Rao Bound. The algorithm has low computational complexity and is well suited for real time applications. | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
| dc.relation.isbasedon | http://dx.doi.org/10.1109/LCOMM.2003.815637 | en_US |
| dc.subject | Fast Fourier transform. | en |
| dc.subject | Discrete Fourier transform. | en |
| dc.subject | Frequency estimation. | en |
| dc.subject | Fourier transformations. | en |
| dc.subject | Interpolation. | en |
| dc.title | A new algorithm for the estimation of the frequency of a complex exponential in additive Gaussian noise | en_US |
| dc.parent | IEEE Communications Letters | en_US |
| dc.journal.volume | 7 | en_US |
| dc.journal.number | 11 | en_US |
| dc.publocation | Piscataway, USA | en_US |
| dc.identifier.startpage | 549 | en_US |
| dc.identifier.endpage | 551 | en_US |
| dc.cauo.name | Information and Communication | en_US |