Reduction of space complexity based on symmetric TMVP. Issue 9 (1st April 2015)

• Record Type: Journal Article
• Authors: Yang, Chunsheng; Pan, Jeng‐Shyang; Lee, Chiou‐Yng; Yan, Lijun
• Is Part Of: Electronics letters. Volume 51:Issue 9(2015)
• Page Start: 697
• Page End: 699
• Publication Date: 2015-04-01
• Subjects: computational complexity -- Toeplitz matrices -- matrix decomposition -- vectors; space complexity reduction -- symmetric TMVP decomposition -- symmetric Toeplitz matrix‐vector product decomposition -- high‐precision multiplication algorithms -- Gaussian normal basis multiplication -- GNB multiplication; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2015.0014
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract : Toeplitz matrix–vector product (TMVP) decomposition is one of the high‐precision multiplication algorithms. A symmetric TMVP (STMVP) decomposition is presented and theoretical analysis shows that the space complexity of the proposed STMVP scheme is less compared with the traditional TMVP approach. Gaussian normal basis (GNB) multiplication based on the proposed architecture can be used to reduce the space complexity.