Over twelve years of experience in: - IT-system administration, maintenance and project management - Digital signal filtering, signal and data processing / retrieval from noise - Voice, image, audio
This article describes a new approach for higher radix butterflies suitable for pipeline implemen... more This article describes a new approach for higher radix butterflies suitable for pipeline implementation. Based on the butterfly computation introduced by Cooley-Tukey [1], we will introduce a novel approach for the Discrete Fourier Transform (DFT) factorization, by redefining the butterfly computation, which is more suitable for efficient VLSI implementation. The proposed factorization motivated us to present a new concept of
This paper proposes a robust adaptive algorithm for adjusting coefficients of an adaptive filter,... more This paper proposes a robust adaptive algorithm for adjusting coefficients of an adaptive filter, which is used in active noise canceller (ANC). The filtered LMS algorithm, which is widely used in digital signal processing, is deployed to reduce the effect of acoustic interference in a noisy environment. In this paper the zero noise output of the proposed one and two
The Fast Fourier Transform (FFT) is a key role in signal processing applications that is useful f... more The Fast Fourier Transform (FFT) is a key role in signal processing applications that is useful for the frequency domain analysis of signals. The FFT computation requires an indexing scheme at each stage to address input/output data and coefficient multipliers properly. Most of these indexing schemes are based on bit-reversal techniques that are boosted by a look-up table requiring extra
ABSTRACT The Discrete Fourier Transform (DFT) is a mathematical procedure at the core of processi... more ABSTRACT The Discrete Fourier Transform (DFT) is a mathematical procedure at the core of processing inside a Digital Signal Processor. Speed and low complexity are crucial in the FFT process; they can be achieved by avoiding trivial multiplications through a proper handling of the input/output data and the twiddle factors. Accordingly, this paper presents an innovative approach for handling the input/output data efficiently by avoiding trivial multiplications. This approach consists of a simple mapping of the three indices (FFT stage, butterfly and element) to the addresses of the input/output data with their corresponding coefficient multiplier. A self-sorting algorithm that reduces the amount of memory accesses to the coefficient multipliers' memory can also reduce the computational load by avoiding all trivial multiplications. Compared with the most-recent work [5], performance evaluation in terms of the number of cycles on the general-purpose TMS320C6416 DSP shows a reduction of 29% (FFT of size 4096) and a 50% memory reduction to stock twiddle factors. The algorithm has also shown a speed gain of 24% on the FFTW platform for a FFT of size 4096.
Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing, Mar 1, 2008
The FFT process is an operation that could be performed through different stages. In each stage, ... more The FFT process is an operation that could be performed through different stages. In each stage, the butterfly operation is computed in which the accessed data is multiplied by certain Walpha, added or subtracted and finally it is stored or held for further processing. This process is repeated to each stage until the final stage where the processed data is
This article describes a new approach for higher radix butterflies suitable for pipeline implemen... more This article describes a new approach for higher radix butterflies suitable for pipeline implementation. Based on the butterfly computation introduced by Cooley-Tukey [1], we will introduce a novel approach for the Discrete Fourier Transform (DFT) factorization, by redefining the butterfly computation, which is more suitable for efficient VLSI implementation. The proposed factorization motivated us to present a new concept of
This paper proposes a robust adaptive algorithm for adjusting coefficients of an adaptive filter,... more This paper proposes a robust adaptive algorithm for adjusting coefficients of an adaptive filter, which is used in active noise canceller (ANC). The filtered LMS algorithm, which is widely used in digital signal processing, is deployed to reduce the effect of acoustic interference in a noisy environment. In this paper the zero noise output of the proposed one and two
The Fast Fourier Transform (FFT) is a key role in signal processing applications that is useful f... more The Fast Fourier Transform (FFT) is a key role in signal processing applications that is useful for the frequency domain analysis of signals. The FFT computation requires an indexing scheme at each stage to address input/output data and coefficient multipliers properly. Most of these indexing schemes are based on bit-reversal techniques that are boosted by a look-up table requiring extra
ABSTRACT The Discrete Fourier Transform (DFT) is a mathematical procedure at the core of processi... more ABSTRACT The Discrete Fourier Transform (DFT) is a mathematical procedure at the core of processing inside a Digital Signal Processor. Speed and low complexity are crucial in the FFT process; they can be achieved by avoiding trivial multiplications through a proper handling of the input/output data and the twiddle factors. Accordingly, this paper presents an innovative approach for handling the input/output data efficiently by avoiding trivial multiplications. This approach consists of a simple mapping of the three indices (FFT stage, butterfly and element) to the addresses of the input/output data with their corresponding coefficient multiplier. A self-sorting algorithm that reduces the amount of memory accesses to the coefficient multipliers' memory can also reduce the computational load by avoiding all trivial multiplications. Compared with the most-recent work [5], performance evaluation in terms of the number of cycles on the general-purpose TMS320C6416 DSP shows a reduction of 29% (FFT of size 4096) and a 50% memory reduction to stock twiddle factors. The algorithm has also shown a speed gain of 24% on the FFTW platform for a FFT of size 4096.
Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing, Mar 1, 2008
The FFT process is an operation that could be performed through different stages. In each stage, ... more The FFT process is an operation that could be performed through different stages. In each stage, the butterfly operation is computed in which the accessed data is multiplied by certain Walpha, added or subtracted and finally it is stored or held for further processing. This process is repeated to each stage until the final stage where the processed data is
Uploads
Papers by Marwan Jaber