Division Algorithms and Implementations
IEEE Transactions on Computers
Evaluation of CORDIC Algorithms for FPGA Design
Journal of VLSI Signal Processing Systems
Novel Optimizations for Hardware Floating-Point Units in a Modern FPGA Architecture
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Tradeoffs of Designing Floating-Point Division and Square Root on Virtex FPGAs
FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A Hybrid Approach for Mapping Conjugate Gradient onto an FPGA-Augmented Reconfigurable Supercomputer
FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Advanced Components in the Variable Precision Floating-Point Library
FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A Tool for Unbiased Comparison between Logarithmic and Floating-point Arithmetic
Journal of VLSI Signal Processing Systems
On Division by Functional Iteration
IEEE Transactions on Computers
A Dual-Purpose Real/Complex Logarithmic Number System ALU
ARITH '09 Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic
Architecture and FPGA design of dichotomous coordinate descent algorithms
IEEE Transactions on Circuits and Systems Part I: Regular Papers
FPGA Implementation of an Iterative Receiver for MIMO-OFDM Systems
IEEE Journal on Selected Areas in Communications
Low Complexity Time Synchronization Algorithm for OFDM Systems with Repetitive Preambles
Journal of Signal Processing Systems
Hi-index | 0.00 |
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 makes it suitable for diverse applications with different requirements. Results show how various throughputs can be achieved under different maximum error and iteration limit configurations. Besides, the resource occupation is considerably small, compared with previous solutions.