http://iet.metastore.ingenta.com
1887

Decomposition of symmetric matrix–vector product over GF(2 m )

Decomposition of symmetric matrix–vector product over GF(2 m )

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Toeplitz matrix–vector product (TMVP) decomposition is an important approach for designing and implementing subquadratic multiplier. In this Letter, a symmetric matrix (SM), which is the sum of a symmetric TM and Hankel matrix, is proposed. Applying the symmetry property, 2-way, 3-way and n-way splitting methods of SMVP is presented. On the basis of 2-way splitting method, the recursive formula of SMVP is presented. Using the two cases n = 4 and 8, the SMVP decomposition approach has less space complexity than 2-way TMVP, TMVP block recombination and symmetric TMVP for even-type Gaussian normal basis multiplication.

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
      • 4. Pan, J.S., Meher, P.K., Lee, C.Y., et al: ‘Efficient subquadratic parallel multiplier based on modified SPB of GF(2m)’. IEEE Int. Symp. Circuits and Systems (ISCAS), Lisbon, Portugal, May 2015, pp. 14301433.
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2017.1719
Loading

Related content

content/journals/10.1049/el.2017.1719
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address