Generalized discrete Fourier transform with nonlinear phase

Authors:
Ali N. Akansu;Handan Agirman-Tosun
Affiliations:
Department of Electrical and Computer Engineering, New Jersey Institute of Technology, University Heights, Newark, NJ;Department of Electrical and Computer Engineering, New Jersey Institute of Technology, University Heights, Newark, NJ
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 6
Cited 2

The fast generalized discrete Fourier transforms: a unified approach to the discrete sinusoidal transforms computation

Signal Processing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Multi-Carrier and Spread Spectrum Systems

Multi-Carrier and Spread Spectrum Systems
Properties of the Multidimensional Generalized Discrete Fourier Transform

IEEE Transactions on Computers
Generalized discrete Fourier transform: theory and design methods

SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Walsh-Like Nonlinear Phase Orthogonal Codes for Direct Sequence CDMA Communications

IEEE Transactions on Signal Processing - Part II

Sequency-ordered generalized Walsh-Fourier transform

Signal Processing
Signal-adaptive discrete evolutionary transform as a sparse time-frequency representation

Digital Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

Constant modulus transforms like discrete Fourier transform (DFT), Walsh transform, and Gold codes have been successfully used over several decades in several engineering applications, including discrete multi-tone (DMT), orthogonal frequency division multiplexing (OFDM) and code division multiple access (CDMA) communications systems. In this paper, we present a generalized framework for DFT called Generalized DFT (GDFT) with nonlinear phase by exploiting the phase space. We show that GDFT offers sizable correlation improvements over DFT, Walsh, Oppermann and Gold codes, leading to better performance in all multi-carrier communications scenarios investigated. We also highlight how known constant modulus orthogonal transforms are special solutions of the proposed GDFT framework. Moreover, we introduce practical design methods offering computationally efficient implementations of GDFT as enhancements to DFT. We conclude the paper with examples of communications applications where GDFT is shown to outperform DFT and other known constant modulus bases.