Volder J.E., "The CORDIC Trigonometric Computing Technique", IRE Transactions on Electronic Computers, Vol. EC-8, No. 3, September 1959 3.4.1 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Symmetric Table Addition Methods for Neural Network - Approximations Nihal Koc-Sahan (Correct)
....functions. These methods take advantage of symmetry and leading sign bits in the table entries to drastically reduce the size of the tables. STAMs require significantly less memory than direct table lookups and are faster than either piecewise polynomial approximations [12] 13] or CORDIC [14], 15] This paper investigates the application of STAMs to the sigmoid function and its derivative, and demonstrates that STAMs are effective methods for approximating these functions. Section 2 discusses the sigmoid function and its derivative. Section 3 describes how STAMs are applied to these ....
J. E. Volder, "The CORDIC Trigonometric Computing Technique," IRE Transactions on Electronic Computers EC-8, pp. 330--334, 1959.
Linear Prediction: Mathematics And Engineering - Bultheel, Van Barel (1994) (Correct)
....speech transmission, the computations have to be performed in real time. The computations should then be done by specially designed hardware. A CORDIC chip (coordinate rotation for digital computing) can perform such a hyperbolic rotation in a few clock cycles. The concept dates back to 1959 [54]. See also [51] 9 Orthogonal polynomials We have seen before that the backward predictors A # n = # n are monic polynomials of degree n orthogonal with respect to the spectral measure supported on the unit circle of the complex plane. For a recent survey see [17] These polynomials were ....
J.E. Volder. The CORDIC trigonometric computing technique. IRE Trans. Electronic Computers, 8(3):330--340, 195 Department of Computing Science K.U. Leuven, Belgium e-mail : Adhemar.Bultheel@cs.kuleuven.ac.be
Smart Antenna Receiver Based on a Single Chip.. - Girola, Picciriello, .. (2000) (Correct)
....z(n) Figure 1. JSTE Chip The Cholesky and the FBS processors use pipelining; while the first processor update the Cholesky factor, the second processor compute h opt (n) and w opt (n) from the previous update of the matrix # . The Cholesky processor (figure 2) is based on cordic algorithm [7] that performs the Givens rotation [8] by using three cordic cells. The q cordic makes the first rotation in order to cancel the imaginary part of the input vector, the two f cordic makes the second rotation that cancel the real part of the input vector and update a column of the Cholesky ....
J.E. Volder, "The CORDIC Trigonometric Computing Techniques", IRE Trans. Electron. Comput., EC-8(3), 1959.
Channelization for Software Defined Base-Stations - Hentschel (2002) (Correct)
....signal x (kT) as these complex numbers, and rotating the phase of these samples according to (2# f IF kT) the CORDIC algorithm directly performs the digital down conversion without the need of explicit multipliers. 3.2. 3 The CORDIC Algorithm The CORDIC algorithm was developed by Volder [7] in 1959 for converting between cartesian and polar coordinates. It is an iterative algorithm that solely requires shift, add, and subtract operations. In the circular rotation mode the CORDIC calculates the cartesian coordinates of a vector which is rotated by an arbitrary angle. To rotate the ....
....depends on the total number of iterations. Hence, the result of the CORDIC iteration is a scaled version of the rotated vector. In order to overcome the restriction regarding ## an initial rotation by can be performed if necessary before starting the CORDIC iterations. For details see [7, 8]. 3.3 Digital Down Conversion with the CORDIC Algorithm Interpreting each complex sample of the signal x dig,IF (kT) of Equation (6) as a complex number v 0 , and the angle ##(k) 2# f IF kT as z 0 , the CORDIC can be used to continuously rotate the complex phase of the signal x dig,IF (kT) ....
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Transactions on Electronic Computers, vol. EC--8, pp. 330--334, Sept. 1959.
Comparison Of Low Complexity Clipping Algorithms For Ofdm - Gavin Hill Mike (2002) (1 citation) (Correct)
.... optimum method where the clipped signal has amplitude distortion and no phase distortion, and an implementationally simple clipping method called square clipping where the I and Q channels are clipped independantly (introducing phase distortion and overclipping) The other methods are the CORDIC [1] algorithm, a recent Lucent patent [2] and two new algorithms. These are a) vector subtraction, a variation of the Lucent algorithm with less hardware complexity but introducing a small amount of phase error and, b) a sector clipping method which is the least complex and requires only a few ....
....number of iterations. The main advantage of CORDIC is the use of shift and add operations which can be used in place of multiplications, thereby reducing the hardware requirements. The scaling operation is the same as the Lucent method described in section A. The reader is directed to reference [1] for a detailed description of the CORDIC algorithm. A. Lucent algorithm The Lucent [2] algorithm produces good estimates of the magnitude in N iterations. First the complex sample, q i jx x x = is folded into the first octant to give, q i q i x x j x x x , min . max = 1) x is ....
Volder, J. E., "The CORDIC Trigonometric Computing Technique", IRE Trans. Electron. Comput. EC:330-334, 1959.
Dynamic Circuit Specialization of a CORDIC Processor - Keller (2000) (1 citation) (Correct)
....similar structure. 2 CORDIC Background CORDIC is an iterative algorithm that can be used to perform a wide variety of functions, including, but not limited to, sine, cosine, arc tangent, and square root. CORDIC, which stands for COordinate Rotation DIgital Computer, was rst introduced by Volder [3] and can be used to eciently nd solutions to functions in hardware. Calculators such as the HP 35 have a CORDIC processor built in [5] Walther [8] and others provide extensions that provide solutions to several functions not cited by Volder. 2.1 Variations There are several types of operation ....
J. Volder, \The CORDIC Trigonometric Computing Technique," IRE Trans. on Electronic Computing, Vol EC-8, Num. 3, pp 330-334, Sept 1959.
Implementation and Analysis of Numerical.. - Ligon, III, Monn, .. (1999) (Correct)
....future work are presented. CORDIC is a collection of iterative shift and add algorithms which form an extremely efficient means of computing trigonometric functions and other complex elementary functions, such as square root, natural log and exponential. They were originally introduced by Volder [9] and were later expanded by Walther [10] A number of machines have implemented CORDIC. The base set of equations is as follows: 7 12276 464 (1) # (2) 3) CORDIC operates by performing multiple iterations of the above equations. This has ....
J. Volder, "The cordic trigonometric computing technique, " IRE Trans. Electronic Computing, pp. 330--334, 1959.
VHDL-Based Design and Design Methodology for Reusable.. - Janiszewski, Hoppe.. (2001) (Correct)
....to the first octant of the unit circle. LUT size may be further compressed [3] implying additional hardware, which also may introduce additional spurious contributions to the output spectrum. High resolution FGs may be implemented with LUT free hardware, by means of the CORDIC algorithms [4 6]. Here the amplitudes are obtained by iteratively rotating the vector (x , y ) in the polar plane. Increments or decrements of the rotation angle, z i , in steps of = arctg(2 ) amount to successive binary shifts (i.e. divisions by 2) of x and y i . The algorithm thus computes the set of ....
Volder, J. E., The CORDIC trigonometric computing technique. IRE Trans. Electron. Comput., vol. 8, (1957), 330 334
Digital Down Conversion In Software Radio Terminals - Löhning, Hentschel, Fettweis (2000) (Correct)
....I Q DDC using the ROM table approach nique requires a large look up table ( 2 n bit) resulting in large chip area, high power consumption, lower speed, and increased costs. An approach to overcome this drawback is the calculation of the corresponding sine and cosine values by means of CORDIC [2, 3, 4] with the main advantage of using only a small look up table ( n n bit) The major drawback of the CORDIC approach is the increased circuit complexity. However, if used in the context of digital down conversion or frequency synchronization, the additional hardware effort is partly compensated ....
....context of digital down conversion or frequency synchronization, the additional hardware effort is partly compensated because there is no need for explicit multipliers as will be shown in this paper. 2 THE CORDIC ALGORITHM The CORDIC (COordinate Rotation Digital Computer) was developed by Volder [2] in 1959 as an iterative algorithm to convert between polar and cartesian coordinates using shift, add, and subtract operations only. In the circular rotation mode the CORDIC computes the cartesian coordinates of the target vector v n = x n y n ] by rotating the input vector v 0 = x 0 y 0 ] ....
[Article contains additional citation context not shown here]
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Transactions on Electronic Computers, vol. EC--8, pp. 330--334, Sept. 1959.
Advances in Adaptive Computer Technology - Koch (2004) (Correct)
No context found.
Volder J.E., "The CORDIC Trigonometric Computing Technique", IRE Transactions on Electronic Computers, Vol. EC-8, No. 3, September 1959 3.4.1
MOS Current Mode Logic for Low Power, Low Noise - Cordic Computation In (Correct)
No context found.
J.E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Comput., vol. EC-8, p. 330-334, Sept. 1959
Architectures for Efficient Implementation of Particle Filters - Bolic (2004) (Correct)
No context found.
J. Volder, "The CORDIC Trigonometric Computing Technique," IRE Trans. Electronic Computing, Vol EC-8, pp330-334, Sept 1959.
Online Stereo Calibration using FPGAs - Niklas Pettersson Complex (Correct)
No context found.
J. Volder, "The cordic trigonometric computing technique," IRE Trans. Electron. Comput., 1959.
Programmable Numerical Function Generators: Architectures And - Synthesis Method Tsutomu (2005) (Correct)
No context found.
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electronic Comput., Vol. EC-820, No. 3, pp. 330--334, Sept. 1959. 6
A VHDL Implementation of a CORDIC Arithmetic Processor Chip - Hampson, Paplinski (1994) (Correct)
No context found.
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Transactions on Electronic Computing, vol. EC-8, no. 3, pp. 330--334, 1959.
Hybrid Multiplier/cordic Unit For Online Handwriting Recognition - McInerney, Reilly (1999) (Correct)
No context found.
J. Volder, "The CORDIC Trigonometric Computing Technique" IRE Trans Electronic Computers, vol. 8, pp. 330-334, 1959.
Low Power VLSI CMOS Design - An Image Processing Chip for.. - Schwarzbacher, Foley (2001) (Correct)
No context found.
J.E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Comput., vol. EC-8, no. 3, pp. 330-334, Sept. 1959
Adaptive Explicitly Parallel Instruction Computing - Surendranath Talla Of (2000) (4 citations) (Correct)
No context found.
Jack E. Volder. The CORDIC Trigonometric Computing Technique. IRE Transactions on Electronic Computers, EC-8:330--334, 1959.
Optimisation and Implementation of the Arctan.. - Schwarzbacher.. (1999) (Correct)
No context found.
J.E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Comput., vol. EC-8, no. 3, pp. 330-334, Sept. 1959
Algorithmic Level Low-Power VLSI Design Applied to the .. - Schwarzbacher, Foley, .. (2001) (Correct)
No context found.
J.E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Computer, vol. EC-8, no. 3, pp. 330-334, September 1959.
Real-Time Sound Localization Using Field-Programmable Gate.. - Duy Nguyen Parham (Correct)
No context found.
J.E. Volder. The CORDIC trigonometric computing technique. IRE Transactions, EC-8:330:334, 1959.
Parallel Reduction of Bordered Diagonal Matrices - Van Huffel, Park (1994) (Correct)
No context found.
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Comput. , Vol. EC-8, pp. 330-334, 1959.
Computing Discrete Hartley Transform Using Algebraic Integers - Vassil Dimtrov And (Correct)
No context found.
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. on Electronic Computers, vol. EC8, no. 3, pp. 330-334, Sept. 1959.
Parallel Tri- And Bi-Diagonalization Of Bordered Bidiagonal.. - Van Huffel, Park (1994) (Correct)
No context found.
J. E. Volder, The CORDIC trigonometric computing technique, IRE Trans. Electron. Comput. EC-8 (1959) 330-334.
Cordic Realization Of The Transversal Adaptive Filter - Using Trigonometric Lms (2001) (Correct)
No context found.
J. E. Volder, "The CORDIC trigonometric computing technique," IRE Trans. Electron. Comput., vol. EC-8, no. 3, pp. 330-334, Sept. 1959.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC