A design of time-optimum and register-number-minimum systolic convolvers (Q582105): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
We present an optimum bit-parallel/world-sequential systolic convolver. Our design is the best one among the previous many convolvers in the sense that its optimality in time and space performances is simultaneously attained without augmenting any global control, broadcasting, initial-data-preloading, and/or multi-sequential or parallel I/O ports which were allowed in most of the previous designs. As an application of our convolver we give a systolic polynomial divider which can compute the polynomial division in exactly \(n+O(1)\) optimum steps on \([\min (n-m,m)/2]+O(1)\) systolic cells for the devition of any degree n polynomial by any degree m polynomial (n\(\geq m)\). | |||
Property / review text: We present an optimum bit-parallel/world-sequential systolic convolver. Our design is the best one among the previous many convolvers in the sense that its optimality in time and space performances is simultaneously attained without augmenting any global control, broadcasting, initial-data-preloading, and/or multi-sequential or parallel I/O ports which were allowed in most of the previous designs. As an application of our convolver we give a systolic polynomial divider which can compute the polynomial division in exactly \(n+O(1)\) optimum steps on \([\min (n-m,m)/2]+O(1)\) systolic cells for the devition of any degree n polynomial by any degree m polynomial (n\(\geq m)\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q80 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4130024 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
VLSI design | |||
Property / zbMATH Keywords: VLSI design / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
real-time pattern matcher | |||
Property / zbMATH Keywords: real-time pattern matcher / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
systolic array | |||
Property / zbMATH Keywords: systolic array / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
systolic algorithm | |||
Property / zbMATH Keywords: systolic algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
systolic convolver | |||
Property / zbMATH Keywords: systolic convolver / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polynomial divider | |||
Property / zbMATH Keywords: polynomial divider / rank | |||
Normal rank |
Revision as of 18:03, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A design of time-optimum and register-number-minimum systolic convolvers |
scientific article |
Statements
A design of time-optimum and register-number-minimum systolic convolvers (English)
0 references
1989
0 references
We present an optimum bit-parallel/world-sequential systolic convolver. Our design is the best one among the previous many convolvers in the sense that its optimality in time and space performances is simultaneously attained without augmenting any global control, broadcasting, initial-data-preloading, and/or multi-sequential or parallel I/O ports which were allowed in most of the previous designs. As an application of our convolver we give a systolic polynomial divider which can compute the polynomial division in exactly \(n+O(1)\) optimum steps on \([\min (n-m,m)/2]+O(1)\) systolic cells for the devition of any degree n polynomial by any degree m polynomial (n\(\geq m)\).
0 references
VLSI design
0 references
real-time pattern matcher
0 references
systolic array
0 references
systolic algorithm
0 references
systolic convolver
0 references
polynomial divider
0 references