Robert H. Dennard, Fritz H. Gaensslen, Hwa-Nien Yu,
V.Leo Rideout, Ernest Bassous, and Andre R. LeBlanc. Design of
Ion-Implanted MOSFET's with Very Small Physical Dimensions. Journal of
Solid-State Circuits, 9(5):256--268, October 1974.
Mark Bohr. MOS Transistors: Scaling and
Performance Trends. Semiconductor International, pages 75--79, June
1995.
Mark Bohr. Interconnect Scaling -- The
Real Limiter to High Performance ULSI. In International Electron Devices
Meeting 1995 Technical Digest, pages 241--244. Electron Devices Society of IEEE, December 1995.
S. Singh, Jonathan Rose, Paul Chow, and David Lewis.
The Effect of Logic Block Architecture on FPGA Performance.
IEEE Journal of Solid-State Circuits, 27(3):281--287, March
1992.
Chuck Hastings, When is a Memory Not a Memory,
In Proceedings of the Electro/87 Mini/Micro Northeast,
page 1132 ff. (4/5/1-18), 1987.
Stephen D. Brown, Robert J. Francis, Jonathan Rose, and Zvonko G. Vranesic.
Field-Programmable Gate Arrays. Kluwer Academic Publishers, 101
Philip Drive, Assinippi Park, Norwell, Massachusetts, 02061 USA, 1992.
Russell Tessier and Heather Giza. Balancing Logic Utilization and Area Efficiency in FPGAs.
In Conference on Field Programmable Logic and Applications (FPL '2000),
pages 535--544, August 28--30, 2000.
Sandeep Bhatt and Frank Thomson Leighton.
A Framework for Solving VLSI Graph Layout Problems.
In Journal of Computer System Sciences v28p300-343, 1984.
André DeHon. Entropy, Counting, and Programmable Interconnect.
(Shorter version in FPGA'96). [HTML] [TR PS]n.b. The switching requirements for the m choose k switching block
is detailed in the appendix in this TR.
Aditya A. Agarwal and David Lewis. Routing Architectures for
Hierarchical Field Programmable Gate Arrays. In Proceedings 1994 IEEE
International Conference on Computer Design, pages 475--478. IEEE,
October 1994.
Vi Cuong Chan and David M. Lewis. Area-Speed Tradeoffs for
Hierarchical Field-Programmable Gate Arrays. In Proceedings of the 1996
International Symposium on Field-Programmable Gate Arrays, pages
51--57. ACM/SIGDA, February, 1996.
Ronald I. Greenberg and Charles E. Leiserson.
A Compact Layout for the Three-Dimensional Tree of Meshes.
In Applied Math Letters v1n2p171--176, 1988.
André DeHon.
Compact, Multilayer Layout for Butterfly Fat-Tree.
In
Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), pages 206--215, July 9-12, 2000.
[abstract, paper links].
Vaughn Betz and Jonathan Rose, ``How Much Logic Should Go in an FPGA Logic Block?'', in IEEE Design & Test Magazine, Vol. 15, No. 1,
Jan-March 1998, pp. 10-15. [PDF]
Stephen D. Brown, Robert J. Francis, Jonathan Rose, and Zvonko G. Vranesic.
Field-Programmable Gate Arrays. Kluwer Academic Publishers, 101
Philip Drive, Assinippi Park, Norwell, Massachusetts, 02061 USA, 1992.
Vaughn Betz, Jonathan Rose, and Alexander Marquardt. Architecture
and CAD for Deep-Submicron FPGAs, Kluwer Academic
Publishers, 1999.
Frank Thomson Leighton.
``New lower bound techniques for VLSI,'' in
Proceedings of the Twenty-Second Annual Symposium on the Foundations of
Computer Science, 1981.
Steve Trimberger, Dean Carberry, Anders Johnson, and Jennifer Wong. A Time Multiplexed FPGA. In Proceedings of the 1997 International
Symposium on Field-Programmable Custom Computing Machines. April, 1997.
M. J. Wirthlin, B. L. Hutchings. ``Improving Functional Density
Through Run-Time Constant Propagation'', in ACM/SIGDA International
Symposium on Field Programmable Gate Arrays, pp. 86-92 (1997).
[PS]
John Villasenor, Brian Schoner, Kang-Ngee Chia, and Charles Zapata,
``Configurable Computer Solutions for Automatic Target Recognition'',
in Proceedings of the IEEE Workshop on FPGAs for Custom
Computing Machines, April, 1996.