deposit_your_work

Efficient VLSI Architectures for Recursive Vandermonde QR Decomposition in Broadband OFDM Pre-distortion

Files in this item

Files Size Format View
Guo2005Mar5EfficientV.PDF 359.6Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Efficient VLSI Architectures for Recursive Vandermonde QR Decomposition in Broadband OFDM Pre-distortion
Author: Guo, Yuanbin
Type: Conference Paper
Keywords: OFDM; predistorter; QR decomposition; Vandermonde
Citation: Y. Guo,"Efficient VLSI Architectures for Recursive Vandermonde QR Decomposition in Broadband OFDM Pre-distortion," in IEEE Wireless Communications and Networking Conference,
Abstract: The Vandermonde system is used in OFDM predistortion to enhance the power efficiency dramatically. In this paper, 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 Aptix real-time hardware platform with 11348 cycles at 25ns clock rate.
Date Published: 2005-03-01

This item appears in the following Collection(s)

  • ECE Publications [1082 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • CMC Publications [275 items]
    Publications by Rice Faculty and graduate students in multimedia communications