A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform

Lu, Haibing; Lee, S.C.

doi:10.1109/78.136538

Cited by 15 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea which he developed was to use a transform which exploited the properties of the field Z M , for some choice of a prime M. Rader termed his transform a ''Mersenne Transform,'' since he focused on the Mersenne prime numbers, which are primes of the form 2 t 2 1. The idea was then further developed by Agarwal and Burrus [16,20], and has since continued to be developed in the literature [21][22][23].…”

Section: Fast Number Theoretic Transformmentioning

confidence: 99%

See 1 more Smart Citation

A Fast Number-theoretic Transform Approach to a GPS Receiver

et al. 2010

View full text Add to dashboard Cite

This paper describes the application of the Fast Number-theoretic Transform (FNT) to the processing of GNSS signals. This FNT is an alternative to Fast Fourier Transform (FFT) techniques and efficiently provides bit-for-bit identical results to a traditional time-domain correlator without the need for word-length growth or the quantization of irrational complex roots of unity. We document a prototype single channel GPS C/A code receiver with a continuously operating correlator that computes hundreds of lags. The design is implemented with an inexpensive Field Programmable Gate Array (FPGA) programmed to implement the FNT. As an initial application, we present a multipath investigation using this receiver in which we were able to localize and then identify the source of the multipath signal.

show abstract

Section: Fast Number Theoretic Transformmentioning

confidence: 99%

“…We do not intend this to be a complete discussion of the FNT, but rather hope that this discussion will provide some insight into this unique tranform. The reader is directed to references [16,[20][21][22][23] for a more complete discussion.…”

Section: Fast Number Theoretic Transformmentioning

confidence: 99%