By Topic

On the SFDR Upperbound in DDFS Utilizing Polynomial Interpolation Methods

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
$31 $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

1 Author(s)
Ashrafi, A. ; Dept. of Electr. & Comput. Eng., San Diego State Univ., San Diego, CA, USA

In this brief, the theoretical analysis that obtains the upperbound of the spurious free dynamic range (SFDR) of the direct digital frequency synthesizers (DDFSs) with phase-to-sine mapper (PSM) structured by polynomial interpolation is revisited. A complete analysis of the SFDR upperbound of these DDFS architectures was provided by Ashrafi and Adhami in 2007, where the authors formulated the SFDR upperbound as the Chebyshev minimax solution to an overdetermined system of linear equations. However, some issues in finding the Chebyshev minimax solution were not made clear in that paper regarding the minimax error at the fundamental harmonic of the output sinusoid. These issues, along with the erroneous behavior of numerical computation packages used for solving the Chebyshev minimax problem, misled Chau and Chen to claim that the results of the aforementioned paper were wrong. This brief clarifies the issues with the original paper, exhibits the problems with some of the available numerical computation packages, and refutes the claims that Chau and Chen made.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:59 ,  Issue: 5 )