5 research outputs found

    A Low-Latency FFT-IFFT Cascade Architecture

    Full text link
    This paper addresses the design of a partly-parallel cascaded FFT-IFFT architecture that does not require any intermediate buffer. Folding can be used to design partly-parallel architectures for FFT and IFFT. While many cascaded FFT-IFFT architectures can be designed using various folding sets for the FFT and the IFFT, for a specified folded FFT architecture, there exists a unique folding set to design the IFFT architecture that does not require an intermediate buffer. Such a folding set is designed by processing the output of the FFT as soon as possible (ASAP) in the folded IFFT. Elimination of the intermediate buffer reduces latency and saves area. The proposed approach is also extended to interleaved processing of multi-channel time-series. The proposed FFT-IFFT cascade architecture saves about N/2 memory elements and N/4 clock cycles of latency compared to a design with identical folding sets. For the 2-interleaved FFT-IFFT cascade, the memory and latency savings are, respectively, N/2 units and N/2 clock cycles, compared to a design with identical folding sets

    VLSI Architecture for Polar Codes Using Fast Fourier Transform-Like Design

    Get PDF
    Polar code is a novel and high-performance communication algorithm with the ability to theoretically achieving the Shannon limit, which has attracted increasing attention recently due to its low encoding and decoding complexity. Hardware optimization further reduces the cost and achieves better timing performance enabling real-time applications on resource-constrained devices. This thesis presents an area-efficient architecture for a successive cancellation (SC) polar decoder. Our design applies high-level transformations to reduce the number of Processing Elements (PEs), i.e., only log2 N pre-computed PEs are required in our architecture for an N-bit code. We also propose a customized loop-based shifting register to reduce the consumption of the delay elements further. Our experimental results demonstrate that our architecture reduces 98.90% and 93.38% in the area and area-time product, respectively, compared to prior works

    Green Networking: Analyses of Power Consumption of Real and Complex IFFT/FFT used in Next-Generation Networks and Optical Orthogonal Frequency Division Multiplexing

    Get PDF
    The Orthogonal Frequency Division Multiplexing is a promising technology for the Next Generation Networks. This technique was selected because of the flexibility for the various parameters, high spectral efficiency, and immunity to ISI. The OFDM technique suffers from significant digital signal processing, especially inside the Inverse/ Fast Fourier Transform IFFT/FFT. This part is used to perform the orthogonality/De-orthogonality between the subcarriers which the important part of the OFDM system. Therefore, it is important to understand the parameter effects on the increase or to decrease the FPGA power consumption for the IFFT/FFT. This thesis is focusing on the FPGA power consumption of the IFFT/FFT uses in the OFDM system. This research finds a various parameters effect on FPGA power of the IFFT/FFT. In addition, investigate the computer software used to measure and analyse the FPGA power consumption of OFDM transceivers, and selects the target hardware used in the computer software. The researched parameters include the number of bits used in calculating the phase factor precision; Cyclic Prefix length effected on IP core IFFT, Subcarrier modulation type, word length width, Real and Complex Value IFFT, IFFT length, and subcarriers sampling frequency. The real value IFFT is proposed in 1987 and implemented in this thesis. These parameters above are discussed by comparing the result between the Real and Complex value IFFT used inside the OFDM system
    corecore