By Topic

Efficient VLSI architectures for recursive Vandermonde QR decomposition in broadband OFDM pre-distortion

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

1 Author(s)
Yuanbin Guo ; Nokia Res. Center, Irving, TX, USA

The Vandermonde system is used in OFDM pre-distortion to enhance the power efficiency dramatically. We study efficient FPGA architectures of a recursive algorithm for the Cholesky and QR factorization of the Vandermonde system. We identify the key bottlenecks of the algorithm for the real-time constraints and resource consumption. Several architecture/resource tradeoffs are studied to find the commonalities in the architectures for a best partitioning. Hardware resources are reused according to the algorithmic parallelism and data dependency to achieve the best timing/area performance in hardware. The architectures are implemented in Xilinx FPGA and tested in an Aptix real-time hardware platform with 11348 cycles in 25 ns clock rate.

Published in:

IEEE Wireless Communications and Networking Conference, 2005  (Volume:1 )

Date of Conference:

13-17 March 2005