Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform

This publication has 8 references indexed in Scilit:

• Area-time optimal VLSI networks for multiplying matrices
  Information Processing Letters, 1980
• A combinatorial limit to the computing power of V.L.S.I. circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1980
• Information transfer and area-time tradeoffs for VLSI multiplication
  Communications of the ACM, 1980
• The chip complexity of binary arithmetic
  Published by Association for Computing Machinery (ACM) ,1980
• The cube-connected-cycles: A versatile network for parallel computation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• Area-time complexity for VLSI
  Published by Association for Computing Machinery (ACM) ,1979
• Schnelle Multiplikation großer Zahlen
  Computing, 1971
• Parallel Processing with the Perfect Shuffle
  IEEE Transactions on Computers, 1971