A higher radix FFT FPGA implementation suitable for OFDM systems

Jaber, Marwan A.; Massicotte, Daniel; Achouri, Youssef

doi:10.1109/icecs.2011.6122381

Cited by 10 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…High radix FFTs are not very popular as their VLSI implementation is more difficult. Their advantage though, is that the number of multiplications and the number of stages (corresponding to global communication and memory accesses to execute FFTs) decreases [20].…”

Section: Fft Implementation Issuesmentioning

confidence: 99%

Undersampling in Orthogonal Frequency Division Multiplexing Telecommunication Systems

Petrellis¹

2014

Applied Sciences

View full text Add to dashboard Cite

Several techniques have been proposed that attempt to reconstruct a sparse signal from fewer samples than the ones required by the Nyquist theorem. In this paper, an undersampling technique is presented that allows the reconstruction of the sparse information that is transmitted through Orthogonal Frequency Division Multiplexing (OFDM) modulation. The properties of the Discrete Fourier Transform (DFT) that is employed by the OFDM modulation, allow the estimation of several samples from others that have already been obtained on the side of the receiver, provided that special relations are valid between the original data values. The inherent sparseness of the original data, as well as the Forward Error Correction (FEC) techniques employed, can assist the information recovery from fewer samples. It will be shown that up to 1/4 of the samples can be omitted from the sampling process and substituted by others on the side of the receiver for the successful reconstruction of the original data. In this way, the size of the buffer memory used for sample storage, as well as the storage requirements of the Fast Fourier Transform (FFT) implementation at the receiver, may be reduced by up to 25%. The power consumption of the Analog Digital Converter on the side of the receiver is also reduced when a lower sampling rate is used.

show abstract

Section: Fft Implementation Issuesmentioning

confidence: 99%

Undersampling in Orthogonal Frequency Division Multiplexing Telecommunication Systems

Petrellis¹

2014

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…We apply this values in equation (12), we obtain: (14) demonstrates that the implementation of the FFT algorithm for computation of the 256-points FFT (i.e N=16 2 ) involves computation of two 16-points FFTs. This one can be computed by using a radix-16 algorithm as shown in Fig.…”

Section: -Points Fft/ifft Architectural Designmentioning

confidence: 99%

“…2. The first 16-points FFT module computes 16-points of the 256-points FFT on the fitting data slot according to (14) constants coefficients by a multiplier and once again computing the 16-points FFT of the resultant data with the fitting data reordering.…”

Section: -Points Fft/ifft Architectural Designmentioning

confidence: 99%

“…However, the use of algorithms with high radix degree increases the complexity of integration in an integrated circuit such as FPGA [14]. Even if the number of nontrivial multiplications and additions/subtractions present a good clue on the effectiveness of an algorithm, hardware integration considers other performance criteria such as the algorithm regularity as well as the conception complexity and architecture control.…”

Section: -Points Fft/ifft Architectural Designmentioning

confidence: 99%

See 1 more Smart Citation

Low Complexity FFT/IFFT Processor Applied for OFDM Transmission System in Wireless Broadband Communication

Arioua¹,

Hassani²

2014

IJCEE

View full text Add to dashboard Cite

show abstract

“…The Radix-8 algorithm is an attractive algorithm for its requirement of less complex multiplications and additions/subtractions comparing to Radix-2 and Radix-4 algorithms, however, the use of algorithms with high radix degree increase the complexity of integration in an integrated circuit [11], [12].…”

Section: A Architectural Descriptionmentioning

confidence: 99%

A Low Multiplicative Complexity of Proposed FFT/IFFTs Design Applied for OFDM-Based Wireless Communication Systems

Arioua¹,

Hassani²

2014

JACN

View full text Add to dashboard Cite

A higher radix FFT FPGA implementation suitable for OFDM systems

Cited by 10 publications

References 4 publications

Undersampling in Orthogonal Frequency Division Multiplexing Telecommunication Systems

Undersampling in Orthogonal Frequency Division Multiplexing Telecommunication Systems

Low Complexity FFT/IFFT Processor Applied for OFDM Transmission System in Wireless Broadband Communication

A Low Multiplicative Complexity of Proposed FFT/IFFTs Design Applied for OFDM-Based Wireless Communication Systems

Contact Info

Product

Resources

About