Harshitha et al., 2020 - Google Patents
Design of low complexity high performance LUT based feed-forward FFT architectureHarshitha et al., 2020
- Document ID
- 17987169928404136811
- Author
- Harshitha Y
- Paramasivam C
- Publication year
- Publication venue
- 2020 IEEE International Conference for Innovation in Technology (INOCON)
External Links
Snippet
Rotator with Feed Forward FFT hardware architecture has been proven for many advance industrial application like bio-medical, Digital signal processing it's more suitable for OFDM aplication, wlan and other application. FFT have vast application but characteristic changes …
- 235000019800 disodium phosphate 0 abstract description 3
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
- G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/544—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
- G06F7/5443—Sum of products
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
- G06F1/16—Constructional details or arrangements
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Garrido et al. | The serial commutator FFT | |
Christilda et al. | Speed, power and area efficient 2D FIR digital filter using vedic multiplier with predictor and reusable logic | |
Kumar et al. | Hardware chip performance analysis of different FFT architecture | |
Xiao et al. | VLSI design of low‐cost and high‐precision fixed‐point reconfigurable FFT processors | |
Harshitha et al. | Design of low complexity high performance LUT based feed-forward FFT architecture | |
Kaur et al. | Design of 32-point mixed radix FFT processor using CSD multiplier | |
Akkad et al. | Twiddle factor generation using chebyshev polynomials and hdl for frequency domain beamforming | |
Mukherjee et al. | A novel architecture of area efficient FFT algorithm for FPGA implementation | |
Ajmal et al. | FPGA based area optimized parallel pipelined radix-2 2 feed forward FFT architecture | |
Ma et al. | Simplified addressing scheme for mixed radix FFT algorithms | |
McKeown et al. | Power efficient, FPGA implementations of transform algorithms for radar-based digital receiver applications | |
Chiper | A structured fast algorithm for the VLSI pipeline implementation of inverse discrete cosine transform | |
More et al. | FPGA implementation of FFT processor using vedic algorithm | |
Mukherjee et al. | 2-D Systolic Array architecture of CBNS based Discrete Hilbert Transform Processor | |
Mankar et al. | Multiplier‐less VLSI architectures for radix‐22 folded pipelined complex FFT core | |
Vanmathi et al. | FPGA implementation of fast fourier transform | |
Dawwd et al. | Reduced Area and Low Power Implementation of FFT/IFFT Processor. | |
Wang et al. | A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation | |
Das et al. | Area–time–energy efficient architecture of CBNS‐based fast Fourier transform | |
Varma et al. | VLSI realization of hybrid fast fourier transform using reconfigurable booth multiplier | |
Gilan et al. | Optimized power and speed of Split-Radix, Radix-4 and Radix-2 FFT structures | |
Kannan et al. | FPGA implementation of FFT architecture using modified Radix-4 algorithm | |
Lakshmi et al. | Low latency pipelined CORDIC-like rotator architecture | |
Nafzia et al. | Optimized FPGA Implementation of 64-Point FFT Using Folding Transformation | |
Jones et al. | Background to Research |