VLSI Algorithms and Architectures for Complex Householder Transformation with Applications to Array Processing

dc.contributor.authorTang, C.F.T.en_US
dc.contributor.authorLiu, K.J. Rayen_US
dc.contributor.authorHsieh, S.F.en_US
dc.contributor.authorYao, K.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:48:39Z
dc.date.available2007-05-23T09:48:39Z
dc.date.issued1991en_US
dc.description.abstractThe Householder transformation is considered to be desirable among various unitary transformations due to its superior computational efficiency and robust numerical stability. Specifically, the Householder transformation outperforms the Givens rotation and the modified Gram-Schmidt methods in numerical stability under finite-precision implementations, as well as requiring fewer arithmetical operations. Consequently, the QR decomposition based on the Householder transformation is promising for VLSI implementation and real-time high throughput modern signal processing. In this paper, a recursive complex Householder transformation with a fast initialization algorithm is proposed and its associated parallel/pipelined architecture is also considered. Then, a complex Householder transformation based recursive least-squares algorithm with a fast initialization is presented. Its associated systolic array processing architecture is also considered.en_US
dc.format.extent894551 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5131
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1991-84en_US
dc.subjectsignal processingen_US
dc.subjectparallel architecturesen_US
dc.subjectVLSI architecturesen_US
dc.subjectSystems Integrationen_US
dc.titleVLSI Algorithms and Architectures for Complex Householder Transformation with Applications to Array Processingen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_91-84.pdf
Size:
873.58 KB
Format:
Adobe Portable Document Format