Roy, S. C. D. and Minocha, S.
(1992).
| DOI (Digital Object Identifier) Link: | http://dx.doi.org/doi:10.1109/81.257297 |
|---|---|
| Google Scholar: | Look up in Google Scholar |
Abstract
An efficient algorithm for evaluating the matrix polynomial I+A+A2+…+AN-1 is developed. The proposed scheme is simple and eliminates the difficulties encountered in applying a procedure recently reported by D. Westreich (see IEEE Trans. Circuits Syst., vol.36, no.1, p.162-164, Jan. 1989)
| Item Type: | Journal Article |
|---|---|
| Copyright Holders: | 1992 IEEE |
| ISSN: | 1057-7122 |
| Keywords: | addition count; algorithm; matrix polynomial; multiplication count; digital signal processing; |
| Academic Unit/Department: | Mathematics, Computing and Technology > Computing |
| Interdisciplinary Research Centre: | Centre for Research in Computing (CRC) |
| Item ID: | 20844 |
| Depositing User: | Shailey Minocha |
| Date Deposited: | 26 Mar 2010 13:55 |
| Last Modified: | 02 Dec 2010 20:51 |
| URI: | http://oro.open.ac.uk/id/eprint/20844 |
Actions (login may be required)
| View Item | |
| Public: Report issue / request change |




