Scalable and Systolic Montgomery Multipliers over GF(2^m)

スポンサーリンク

概要

• 論文の詳細を見る

• This work presents a novel scalable and systolic Montgomerys algorithm in GF (2m). The proposed algorithm is based on the Toeplitz matrix-vector representation, which obtains the scalable and systolic Montgomery multiplier in a flexible manner, and can adapt to the required precision. Analytical results indicate that the proposed multiplier over the generic field of GF (2m) has a latency of d+n(2n+1), where n=[m/d], and d denotes the selected digital size. The latency is reduced to d+n(n+1) clock cycles when the field is constructed from generalized equally-spaced polynomials. Since the selected digital size is d≥5 bits, the proposed architectures have lower time-space complexity than traditional digit-serial multipliers. Moreover, the proposed architectures have regularity, modularity and local interconnect ability, making them very suitable for VLSI implementation.

• （社）電子情報通信学会の論文
• 2008-07-01

著者

• Lu Erl-huei

  Department Of Electrical Engineering Chang Gung University

• Lee Chiou-yng

  Lunghwa University Of Science And Technology

• CHEN Chin-Chin

  Department of Electrical Engineering, Chang Gung University

• Chen Chin-chin

  Department Of Electrical Engineering Chang Gung University

関連論文

• Concurrent Algorithm and Hardware Implementation for Low-Latency Turbo Decoder Using a Single MAP Decoder
• Scalable and Systolic Montgomery Multipliers over GF(2^m)

スポンサーリンク