000007925 001__ 7925 000007925 005__ 20250424233305.0 000007925 0247_ $$2DOI$$a10.6083/M4RR1WH3 000007925 037__ $$aETD 000007925 245__ $$aAn information theoretic rents rule 000007925 260__ $$bOregon Health and Science University 000007925 269__ $$a2004-04-01 000007925 336__ $$aThesis 000007925 502__ $$bM.S. 000007925 520__ $$aIn complex VLSI with circuits approaching 1 billion transistors, the major limiting factor to performance is interconnect. With continued scaling of semiconductors, this problem is becoming ever more serious. Potential new technologies such as molecular scale implementation have very limited interconnect capacity, making it a bottleneck to performance. The purpose of interconnect is communication, more specifically communication between distant points with a small latency. This thesis looks at the interconnect requirements of a circuit from an information theory perspective, considering the information rate of each connection in the circuit as opposed to physical connectivity. 000007925 542__ $$fIn copyright - single owner 000007925 650__ $$aInformation Theory$$020808 000007925 650__ $$aSemiconductors$$025858 000007925 6531_ $$ainterconnect 000007925 691__ $$aOGI School of Science and Engineering$$041365 000007925 692__ $$aOGI Department of Electrical and Computer Engineering$$041409 000007925 7001_ $$aNarasimhadevara, Hema$$uOregon Health and Science University$$041354 000007925 7201_ $$aHammerstrom, Dan$$uOregon Health and Science University$$041354$$7Personal$$eAdvisor 000007925 8564_ $$9e8425fb1-ce4f-4a0b-9a36-e6e86f699878$$s4665427$$uhttps://digitalcollections.ohsu.edu/record/7925/files/200404.narasimhadevara.hema.pdf$$ePublic$$29ccddc3851a7573975f1a8c6887df7db$$31 000007925 905__ $$a/rest/prod/x9/20/fx/45/x920fx45x 000007925 909CO $$ooai:digitalcollections.ohsu.edu:7925$$pstudent-work 000007925 980__ $$aTheses and Dissertations