Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,720,783 papers from all fields of science
Search
Sign In
Create Free Account
Equally spaced polynomial
Known as:
ESP
An equally spaced polynomial (ESP) is a polynomial used in finite fields, specifically GF(2) (binary). An s-ESP of degree sm can be written as: for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
All one polynomial
Hamming weight
Polynomial
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
A new approach in building parallel finite field multipliers
M. Sharifan
2009
Corpus ID: 215884672
A new method for building bit-parallel polynomial basis finite field multipliers is proposed in this thesis. Among the different…
Expand
2004
2004
Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)
Y. Ting
,
E. Lu
,
Jau-Yien Lee
Integr.
2004
Corpus ID: 26599576
2001
2001
High-speed bit-parallel systolic multipliers for a class of GF(2/sup m/)
Chiou-Yng Lee
,
E. Lu
,
Jau-Yien
International Symposium on VLSI Technology…
2001
Corpus ID: 62557682
Two special operations, called the cyclic shifting and the inner product are defined based on the properties of irreducible all…
Expand
2001
2001
New bit-parallel systolic multipliers for a class of GF(2/sup m/)
Chiou-Yng Lee
,
E. Lu
,
Jau-Yien Lee
ISCAS . The IEEE International Symposium on…
2001
Corpus ID: 39843633
The operations of the cyclic shifting and the inner product are defined based on the properties of irreducible all one…
Expand
2000
2000
Systematic design approach of Mastrovito multipliers over GF(2/sup m/)
Tong Zhang
,
K. Parhi
IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS…
2000
Corpus ID: 122724869
This paper considers the design of low-complexity bit-parallel dedicated finite field multiplier. A systematic design approach of…
Expand
1999
1999
A low time-complexity, hardware-efficient bit-parallel power-sum circuit for finite fields GF(2/sup M/)
Jyh-Huei Guo
,
Chin-Liang Wang
ISCAS'99. Proceedings of the IEEE International…
1999
Corpus ID: 2668586
This paper presents a new hardware-efficient bit-parallel circuit for computing C+AB/sup 2/ over finite fields GF(2/sup M/) with…
Expand
1991
1991
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials
T. Itoh
Information Processing Letters
1991
Corpus ID: 19944648
1990
1990
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals
T. Itoh
SIGAL International Symposium on Algorithms
1990
Corpus ID: 22274241
This paper shows a necessary and sufficient condition for a family of infinitely many Equally Spaced Polynomial (ESP's) to be…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE