Parallel Memory Architecture for TTA Processor
نویسندگان
چکیده
A conflict resolving parallel data memory system for Transport Triggered Architecture (TTA) is described. The architecture is generic and reusable to support various application specific designs. With parallel memory, more area and power consuming multi-port memory can be replaced with single-port memory modules. Number of ports can be increased over what is available on a design library for multi-port memories. In an FFT TTA example, dual-port data memory was replaced by the proposed architecture. To avoid memory conflicts, the original code was rescheduled and the TTA core was regenerated for the new schedule. The original memory required an area higher by a factor of 3.38 and energy higher by a factor of 1.70. In this case, the energy consumption of the processor core increased so that system energy consumption remained about the same. However, the original system required an area higher by a factor of 1.89.
منابع مشابه
Ultra-Low-Energy DSP Processor Design for Many-Core Parallel Applications
Background and Objectives: Digital signal processors are widely used in energy constrained applications in which battery lifetime is a critical concern. Accordingly, designing ultra-low-energy processors is a major concern. In this work and in the first step, we propose a sub-threshold DSP processor. Methods: As our baseline architecture, we use a modified version of an existing ultra-low-power...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملArchitecture Design and Evaluation of Ldpc Decoder on Tta Based Codesign Environment
High quality digital video transmission requires efficient and reliable data communication over broadcasting channels as there is a risk of data corruption associated during transmission. The near channel performance of Low Density Parity Check Codes (LDPC) has motivated its use in second generation Digital Video Broadcasting (DVB) standards for mobile, cable, satellite and terrestrial channels...
متن کاملASIP Architecture for Future Wireless Systems: Flexibility and Customization
Processors for mobile handsets in 3G cellular systems [1] require: high speed, flexibility and low power dissipation. In addition, computationally very demanding algorithms are needed to remove high levels of multiuser interference especially in MIMO case. Traditional architecture solutions are ASIC and DSP processors. While computationally efficient, ASIC processors are often not flexible enou...
متن کامل