By Topic

Digital oscillators over finite fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chren, W.A., Jr. ; Carnegie Mellon Univ., Pittsburgh, PA, USA ; Ridley, J.N.

This paper shows how the error-free computational property of finite fields can be used to eliminate aperiodicity and SNR degradation problems in digital oscillators. Galois fields are used to eliminate representation and truncation errors in the computation of sinusoid samples. Theorems are presented that characterize those fields that admit all operands necessary for sample generation at a given phase resolution. Two finite field oscillator architectures, exponential feedback, and direct forms are presented, and various design issues associated with operand representation and arithmetic are discussed. It is also shown how field arithmetic can be replaced by arithmetic in the direct product ring associated with a set of specially chosen small fields. This is important in high-speed applications where the loop delay must be minimized. We also present analytical estimates of clocking frequency, latency, and phase and frequency resolution for both architectures. Finally, we present an example ASIC design of a finite ring digital oscillator in 2μ CMOS technology

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 8 )