|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Dictionary Machines for Different Models of VLSI
May 1985 (vol. 34 no. 5)
pp. 472-475
| ASCII Text | x | ||
| H. Schmeck, H. Schroder, "Dictionary Machines for Different Models of VLSI," IEEE Transactions on Computers, vol. 34, no. 5, pp. 472-475, May, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.1676587, author = {H. Schmeck and H. Schroder}, title = {Dictionary Machines for Different Models of VLSI}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {5}, issn = {0018-9340}, year = {1985}, pages = {472-475}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.1676587}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Dictionary Machines for Different Models of VLSI IS - 5 SN - 0018-9340 SP472 EP475 EPD - 472-475 A1 - H. Schmeck, A1 - H. Schroder, PY - 1985 KW - VLSI hardware models KW - Dictionary machines. are taken as an example to demonstrate the implications the choice of the VLSI hardware model has on the design and analysis of algorithms and special purpose architectures. A systolic search tree and a two-dimensional systolic array are used to implement the dictionary machine. If the wire lengths only affect the area KW - the systolic search tree suggests itself as an efficient realization of a dictionary machine having constant period KW - linear areS KW - and logarithmic execution t KW - Algorithms for VLSI KW - dictionary machine KW - systolic array KW - systolic search tree KW - VLSI complexity VL - 34 JA - IEEE Transactions on Computers ER - | |||
Index Terms:
VLSI hardware models, Dictionary machines. are taken as an example to demonstrate the implications the choice of the VLSI hardware model has on the design and analysis of algorithms and special purpose architectures. A systolic search tree and a two-dimensional systolic array are used to implement the dictionary machine. If the wire lengths only affect the area, the systolic search tree suggests itself as an efficient realization of a dictionary machine having constant period, linear areS, and logarithmic execution t, Algorithms for VLSI, dictionary machine, systolic array, systolic search tree, VLSI complexity
Citation:
H. Schmeck, H. Schroder, "Dictionary Machines for Different Models of VLSI," IEEE Transactions on Computers, vol. 34, no. 5, pp. 472-475, May 1985, doi:10.1109/TC.1985.1676587
Usage of this product signifies your acceptance of the Terms of Use.