| Files | Size | Format | View |
|---|---|---|---|
| Guo2005Mar5EfficientV.PDF | 359.6Kb | application/pdf |
|
| dc.contributor.author | Guo, Yuanbin |
dc.creator | Guo, Yuanbin |
|---|---|
| dc.date.accessioned | 2007-10-31T00:46:10Z |
| dc.date.available | 2007-10-31T00:46:10Z |
| dc.date.issued | 2005-03-01 |
| dc.date.submitted | 2005-03-01 |
| dc.identifier.uri | http://hdl.handle.net/1911/19934 |
| dc.description | Conference Paper |
| dc.description.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. | dc.subject | OFDM predistorter QR decomposition Vandermonde |
| dc.title | Efficient VLSI Architectures for Recursive Vandermonde QR Decomposition in Broadband OFDM Pre-distortion |
| dc.type | Conference Paper |
| dc.date.note | 2005-12-05 |
| dc.citation.bibtexName | inproceedings |
| dc.date.modified | 2005-12-09 |
| dc.contributor.center | Center for Multimedia Communications (http://cmc.rice.edu/) |
| dc.subject.keyword | OFDM predistorter QR decomposition Vandermonde |
| dc.citation.conferenceName | IEEE Wireless Communications and Networking Conference |
| dc.identifier.citation | Y. Guo,"Efficient VLSI Architectures for Recursive Vandermonde QR Decomposition in Broadband OFDM Pre-distortion," in IEEE Wireless Communications and Networking Conference, |