López-Martínez et al., 2011 - Google Patents
Iterative-gradient based complex divider FPGA core with dynamic configurability of accuracy and throughputLópez-Martínez et al., 2011
View PDF- Document ID
- 18363269291976993977
- Author
- López-Martínez F
- del Castillo-Sánchez E
- Entrambasaguas J
- Martos-Naya E
- Publication year
- Publication venue
- Journal of Signal Processing Systems
External Links
Snippet
A field programmable gate array (FPGA) implementation of a highly configurable complex divider is presented, based on an iterative gradient algorithm. The proposed architecture allows to configure both the accuracy and the throughput of the division operation, which …
- 230000001186 cumulative 0 description 4
Classifications
-
- 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/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
- 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/4806—Computations with complex numbers
-
- 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/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- 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
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06G—ANALOGUE COMPUTERS
- G06G7/00—Devices in which the computing operation is performed by varying electric or magnetic quantities
- G06G7/12—Arrangements for performing computing operations, e.g. operational amplifiers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Khan et al. | High-Speed and Low-Latency ECC Processor Implementation Over GF ($2^{m}) $ on FPGA | |
Jyothi et al. | ASIC implementation of distributed arithmetic based FIR filter using RNS for high speed DSP systems | |
Derya et al. | CoHA-NTT: A configurable hardware accelerator for NTT-based polynomial multiplication | |
Reddy | Design and implementation of high performance and area efficient square architecture using Vedic Mathematics | |
Christilda et al. | Speed, power and area efficient 2D FIR digital filter using vedic multiplier with predictor and reusable logic | |
Juang et al. | Lower-error and area-efficient antilogarithmic converters with bit-correction schemes | |
Zhao et al. | High performance and resource efficient FFT processor based on CORDIC algorithm | |
Dora et al. | Low complexity implementation of OTFS transmitter using fully parallel and pipelined hardware architecture | |
Choi et al. | Efficient design and performance analysis of a hardware right-shift binary modular inversion algorithm in GF (p) | |
Mopuri et al. | Configurable rotation matrix of hyperbolic CORDIC for any logarithm and its inverse computation | |
Mopuri et al. | Low-complexity and high-speed architecture design methodology for complex square root | |
López-Martínez et al. | Iterative-gradient based complex divider FPGA core with dynamic configurability of accuracy and throughput | |
Joshi et al. | Distributed arithmetic based split-radix FFT | |
Tawalbeh et al. | Efficient FPGA implementation of a programmable architecture for GF (p) elliptic curve crypto computations | |
Nagamani et al. | Design of optimized reversible squaring and sum-of-squares units | |
Singhal et al. | Design and implementation of fast fourier transform (FFT) using VHDL code | |
Irturk et al. | An efficient FPGA implementation of scalable matrix inversion core using QR decomposition | |
Ray et al. | An efficient VLSI architecture for computation of discrete fractional Fourier transform | |
Thampi et al. | Montgomery multiplier for faster cryptosystems | |
Nguyen et al. | An FPGA-based implementation of a pipelined FFT processor for high-speed signal processing applications | |
Bhardwaj et al. | Low-Complex and Low-Power n-dimensional Gram–Schmidt Orthogonalization Architecture Design Methodology | |
Ho | Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF (2 m) | |
Hazarika et al. | Energy efficient VLSI architecture of real‐valued serial pipelined FFT | |
Gupta et al. | A high-speed single-path delay feedback pipeline FFT processor using vedic-multiplier | |
Naga Sravanthi et al. | Design and performance analysis of rounding approximate multiplier for signal processing applications |