arXiv 1806.045722018-06-10eess.SPcs.AR

Characteristic Analysis of 1024-Point Quantized Radix-2 FFT/IFFT Processor

Rozita Teymourzadeh, Memtode Jim, Mok Vee hong

备注：: ICSE2012 Proc.International Conference on Semiconductor Electronics (ICSE-2012). Pp 664-668.ISBN: 978-1-4673-2395-6
DOI：: 10.1109/SMElec.2012.6417231

英文摘要：

The precise analysis and accurate measurement of harmonic provides a reliable scientific industrial application. However, the high-performance DSP processor is the important method of electrical harmonic analysis. Hence, in this research work, the effort was taken to design a novel high-resolution single 1024-point fast Fourier transform (FFT) and inverse fast Fourier transform (IFFT) processors for improvement of the harmonic measurement techniques. Meanwhile, the project is started with design and simulation to demonstrate the benefit that is achieved by the proposed 1024-point FFT/IFFT processor. The pipelined structure is incorporated in order to enhance the system efficiency. As such, a pipelined architecture was proposed to statically scale the resolution of the processor to suite adequate trade-off constraints. The proposed FFT makes use of programmable fixed-point/floating-point to realize higher precision FFT.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Static Quantized Radix-2 FFT/IFFT Processor for Constraints Analysis

This research work focuses on the design of a high-resolution fast Fourier transform (FFT) /inverse fast Fourier transform (IFFT) processors for constraints analysis purpose. Amongst the major setbacks associated with such high resolution, FFT processors are the high power consumption resulting from the structural complexity and computational inefficiency of floating-point calculations. As such, a parallel pipelined architecture was proposed to statically scale the resolution of the processor to suite adequate trade-off constraints. The quantization was applied to provide an approximation to a…

2018-06-10cs.AReess.SP

一种低延迟的 FFT-IFFT 级联架构

A Low-Latency FFT-IFFT Cascade Architecture

本文提出一种无需中间缓冲器的部分并行级联 FFT-IFFT 架构，通过为 IFFT 设计唯一的折叠集以尽快处理 FFT 输出，有效降低了延迟并节省了面积，且可扩展至多通道交错处理。

2023-09-16cs.AReess.SP

通过补零与FFT/IFFT实现快速信号插值

Fast Signal Interpolation Through Zero-padding and FFT/IFFT

本研究受DFT与离散时间傅里叶变换的采样关联启发，提出基于补零和FFT/IFFT的快速信号插值算法，可逼近理想插值，还揭示了其与理想sinc插值的差异源于sinc与Dirichlet函数的联系。

2024-07-09eess.SP

Novel Architecture of Pipeline Radix 2 power of 2 SDF FFT Based on Digit-Slicing Technique

The prevalent need for very high-speed digital signals processing in wireless communications has driven the communications system to high-performance levels. The objective of this paper is to propose a novel structure for efficient implementation for the Fast Fourier Transform (FFT) processor to meet the requirement for high-speed wireless communication system standards. Based on the algorithm, architecture analysis, the design of pipeline Radix 2power of 2 SDF FFT processor based on digit-slicing Multiplier-Less is proposed. Furthermore, this paper proposed an optimal constant multiplication …

2018-06-10cs.AReess.SP

面向 FALCON 后量子密码的面积与功耗高效 FFT/IFFT 处理器

Area and Power Efficient FFT/IFFT Processor for FALCON Post-Quantum Cryptography

针对 FALCON 后量子签名在环上 FFT/IFFT 的硬件实现难题，提出融合旋转因子压缩与无冲突调度的超低功耗紧凑处理器，并在 22 nm ASIC 中验证其面积、功耗及 2.3× 加速优势。

2024-01-19eess.SP

FPGA Implementation of pipeline Digit-Slicing Multiplier-Less Radix 2 power of 2 DIF SDF Butterfly for Fourier Transform Structure

The need for wireless communication has driven the communication systems to high performance. However, the main bottleneck that affects the communication capability is the Fast Fourier Transform (FFT), which is the core of most modulators. This paper presents FPGA implementation of pipeline digit-slicing multiplier-less radix 22 DIF (Decimation In Frequency) SDF (single path delay feedback) butterfly for FFT structure. The approach is taken, in order to reduce computation complexity in butterfly multiplier, the digit-slicing multiplier-less technique was utilized in the critical path of pipeli…

2018-06-09cs.AReess.SP

更多相关论文收起更多论文

Optimal Radix-2 FFT Compatible Filters for GFDM

For a linear waveform, a finite condition number of the corresponding modulation matrix is necessary for the waveform to convey the message without ambiguity. Based on the Zak transform, this letter presents an analytical approach to compute the condition number of the modulation matrix for the multi-carrier waveform generalized frequency division multiplexing (GFDM). On top, we further propose a filter design that yields non-singular modulation matrices for an even number of subcarriers and subsymbols, which is not achievable for any previous work. Such new design has significant impact on im…

2018-06-20eess.SP

A 128-point Multi-Path SC FFT Architecture

This paper presents a new radix-2^k multi-path FFT architecture, named MSC FFT, which is based on a single-path radix-2 serial commutator (SC) FFT architecture. The proposed multi-path architecture has a very high hardware utilization that results in a small chip area, while providing high throughput. In addition, the adoption of radix-2^k FFT algorithms allows for simplifying the rotators even further. It is achieved by optimizing the structure of the processing element (PE). The implemented architecture is a 128-point 4-parallel multi-path SC FFT using 90 nm process. Its area and power consu…

2020-07-29eess.SP

Optimized Signal Distortion for PAPR Reduction of OFDM Signals with IFFT/FFT Complexity via ADMM Approaches

In this paper, we propose two low-complexity optimization methods to reduce peak-to-average power ratio (PAPR) values of orthogonal frequency division multiplexing (OFDM) signals via alternating direction method of multipliers (ADMM). First, we formulate a non-convex signal distortion optimization model based on minimizing data carrier distortion such that the constraints are placed on PAPR and the power of free carriers. Second, to obtain the model's approximate optimal solution efficiently, we design two low-complexity ADMM algorithms, named ADMM-Direct and ADMM-Relax respectively. Third, we…

2018-10-29cs.ITeess.SPmath.IT

Unified Low Complexity Radix-2 Architectures for Time and Frequency-domain GFDM Modem

Most of the conventional multicarrier waveforms explicitly or implicitly involve a generalized frequency division multiplexing (GFDM)-based modem as a core part of the baseband processing. Some are based on GFDM with a single prototype filter, e.g. orthogonal frequency division multiplexing (OFDM) and others employ multiple filters such as filter bank multicarrier (FBMC). Moreover, the GFDM degrees of freedom combined with multiple prototype filters design allow the development and optimization of new waveforms. Nevertheless, GFDM has been widely considered as a complex modulation because of t…

2018-11-09eess.SP

Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming

The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) algorithms, thus reducing chip area, power consumption, processing time, and consumption of other hardware resources. This paper proposes three new hybrid DFT 1024-point DFT approximations and their respective fast algorithms. These approximate DFT (ADFT) algorithms have significantly reduced circuit complexity and power consumption compared to traditional FFT approaches while trading off a subtle loss in computationa…

2022-07-12cs.NAcs.SYeess.SP