A polynomial matrix QR decomposition with application to MIMO channel equalisation
An algorithm for computing the QR decomposition of a polynomial matrix is introduced. The algorithm proceeds to perform the decomposition by following the same strategy in eliminating entries of the matrix as is used in the Givens method for a QR decomposition of a scalar matrix, however polynomial...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/5627 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|