Memory Intensive Architectures for DSP and Data Communication

dc.contributor.advisorProf. Douglas Reeves, Committee Memberen_US
dc.contributor.advisorProf. Gregory Byrd, Committee Memberen_US
dc.contributor.advisorProf. Tom Conte, Committee Memberen_US
dc.contributor.advisorProf. Paul Franzon, Committee Chairen_US
dc.contributor.authorMehrotra, Pronitaen_US
dc.date.accessioned2010-04-02T19:11:21Z
dc.date.available2010-04-02T19:11:21Z
dc.date.issued2002-09-01en_US
dc.degree.disciplineElectrical Engineeringen_US
dc.degree.leveldissertationen_US
dc.degree.namePhDen_US
dc.description.abstractWe focus on the design of systems where memory performance is the principal bottleneck. Two kinds of systems have been considered, an FFT engine for use in high performance DSP systems and forwarding engines used in high-speed routers. The FFT engine was designed using Seamless High Off-Chip Connectivity (SHOCC), a high-density interconnect and packaging technology. The SHOCC substrate was analyzed for different substrate stack-ups to determine the I/O bandwidth attainable by the technology. The FFT engine was designed to make full use of this available bandwidth. It provides for rotation of data to maintain a constant stride between stages, ensuring a constant data access pattern between different stages of the FFT. Data is twiddled before storing in memory, and an efficient scheduling algorithm allows generation of twiddle factors on-chip in parallel with other operations. The memory controller uses a novel memory-mapping scheme to avoid precharge and refresh penalties in DRAMs and achieves SRAM-like access speeds. Forwarding engines in IP routers need to perform a longest-matching-prefix search on the routing database. Two types of forwarding schemes are presented, a hardware-implementable trie based scheme and software implementations of modified binary searches. The hardware trie-based scheme uses a small amount of on-chip SRAM along with an off-chip DRAM (which stores the complete forwarding table). Only a single DRAM access is required to determine the next hop address. The binary search schemes store an additional field in the forwarding database to avoid any backtracking while searching for prefixes.en_US
dc.identifier.otheretd-05302002-232403en_US
dc.identifier.urihttp://www.lib.ncsu.edu/resolver/1840.16/5304
dc.rightsI hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report.en_US
dc.subjectIP Route Lookupen_US
dc.subjectFast Fourier Transformen_US
dc.subjectAddress Lookupen_US
dc.titleMemory Intensive Architectures for DSP and Data Communicationen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
etd.pdf
Size:
550.7 KB
Format:
Adobe Portable Document Format

Collections