Fast Convolution Using Generalized Sliding Fermat Number Transform with Application to Digital Filtering

Hamzé Alaeddine 1 Oussama Bazzi 2 Ali Alaeddine 2 Yasser Mohanna 2 Gilles Burel 1
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance, UBO - Université de Brest
Abstract : This paper is about a new efficient method for the implementation of a Block Proportionate Normalized Least Mean Square (BPNLMS++) adaptive filter using the Fermat Number Transform (FNT). An efficient state space method for implementing the FNT over rectangular windows is used in the cases where there is a large overlap between the consecutive input signals. This is called Generalised Sliding Fermat Number Transform (GSFNT) and is useful for reducing the computational complexity of finite ring convolvers and correlators. In this contribution, we propose, as a first objective, an efficient state algorithm with the purpose of reducing the complexity of inverse FNT. This algorithm, called Inverse Generalised Sliding Fermat Number Transform (IGSFNT) uses the technique of Generalised Sliding, associated to matricial calculations in the Galois Field. The second objective is to realize an implementation of the BPNLMS++ adaptive filter using GSFNT and IGSFNT, which can significantly reduce the computation complexity of the filter implantation on digital processors.
Complete list of metadatas
Contributor : Gilles Burel <>
Submitted on : Saturday, April 13, 2013 - 12:58:34 PM
Last modification on : Thursday, December 19, 2019 - 1:13:00 AM



Hamzé Alaeddine, Oussama Bazzi, Ali Alaeddine, Yasser Mohanna, Gilles Burel. Fast Convolution Using Generalized Sliding Fermat Number Transform with Application to Digital Filtering. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Institute of Electronics, Information and Communication Engineers, 2012, E95-A (6), pp.1007-1017. ⟨10.1587/transfun.E95.A.1007⟩. ⟨hal-00812909⟩



Record views