Autocorrelation analysis of speech signals using Fermat number transform (FNT)

Xu, Shuiqing; Dai, Liyun; Lee, S.C.

doi:10.1109/78.149994

Cited by 9 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, for the reason that NTT can compute the circular convolutions without truncation error and with only few multiplications, the algorithm named Winograd number theoretic transform algorithm (WNTA) was proposed by Bailey (1977). By exploiting the WNTA, people could significantly extend the length of data sequence as well as the width of data quantisation bit, which must be much larger than those of conventional fast NTTs, such as the Fermat number transform (FNT) (Boussakta & Holt, 1989;Xu, Dai & Lee, 1992). Besides, since WNTA is similar as the WFTA in the arithmetic, we can extend the convolution length in the number theory field by employing the 2-D transform of NTT.…”

Section: Introductionmentioning

confidence: 99%

A low complexity realisation of Winograd number theoretic transform and its application

Hua

Zheng

et al. 2014

International Journal of Electronics

View full text Add to dashboard Cite

This paper investigates a novel structure for the Winograd number theoretic transform algorithm (WNTA) to reduce the computation load. The proposed computing structure exploits the multiple constant multiplication to replace the standard multiplication, then, the multiplication of the WNTA can be realised in a shift-add way, which definitely decreases the complexity of WNTA and maintains the computing accuracy. Typical applications, such as the convolution and the filtering operation, are tested by computer simulations, while the result demonstrates that the proposed scheme is superior to conventional schemes in terms of the trade-off between the complexity.

show abstract

Section: Introductionmentioning

confidence: 99%

A low complexity realisation of Winograd number theoretic transform and its application

Hua

Zheng

et al. 2014

International Journal of Electronics

View full text Add to dashboard Cite

show abstract

“…The FFT architectures for NTT were proposed more than three decades ago [6], and extensively found for DSP applications in the literature [7], [8], [9]. However, the existing methods are not suitable of cryptographic applications.…”

Section: Introductionmentioning

confidence: 99%

Reconfigurable Number Theoretic Transform architectures for cryptographic applications

Yao

Cheung

Koç

et al. 2010

2010 International Conference on Field-Programmable Technology

View full text Add to dashboard Cite

As an important component of Spectral Modular Arithmetic (SMA) cryptographic co-processor, the efficient architectures of Number Theoretic Transforms (NTTs) on FPGA are discussed in this paper. We analyze characteristics of the NTTs for cryptographic applications, compare different arithmetic approaches, introduce an optimized solution for FPGA implementation, and developed several different architectures. Qualitative and quantitative analyses are provided to show the effectiveness of our proposed architectures. ___________________________________ 978-1-4244-8983-1/10/$26.00 ©2010 IEEE

show abstract

Fast algorithm for optimal design of Fermat number transform based block digital filters

Daher¹,

Baghious²,

Khouja³

et al. 2021

Digital Signal Processing

View full text Add to dashboard Cite

Autocorrelation analysis of speech signals using Fermat number transform (FNT)

Cited by 9 publications

References 5 publications

A low complexity realisation of Winograd number theoretic transform and its application

A low complexity realisation of Winograd number theoretic transform and its application

Reconfigurable Number Theoretic Transform architectures for cryptographic applications

Fast algorithm for optimal design of Fermat number transform based block digital filters

Contact Info

Product

Resources

About