ADSP-TS201S
The IALUs have hardware support for circular buffers, bit reverse, and
Because the IALU’s computational pipeline is one cycle deep, in most cases integer results are available in the next cycle. Hard- ware (register dependency check) causes a stall if a result is unavailable in a given cycle.
PROGRAM SEQUENCER
The
•A fully interruptible programming model with flexible pro- gramming in assembly and C/C++ languages; handles hardware interrupts with high throughput and no aborted instruction cycles
•A
•Supply of instruction fetch memory addresses; the sequencer’s instruction alignment buffer (IAB) caches up to five fetched instruction lines waiting to execute; the pro- gram sequencer extracts an instruction line from the IAB and distributes it to the appropriate core component for execution
•Management of program structures and program flow determined according to JUMP, CALL, RTI, RTS instruc- tions, loop structures, conditions, interrupts, and software exceptions
•Branch prediction and a
•Compact code without the requirement to align code in memory; the IAB handles alignment
Interrupt Controller
The DSP supports nested and nonnested interrupts. Each inter- rupt type has a register in the interrupt vector table. Also, each has a bit in both the interrupt latch register and the interrupt mask register. All interrupts are fixed as either
The DSP distinguishes between hardware interrupts and soft- ware exceptions, handling them differently. When a software exception occurs, the DSP aborts all other instructions in the instruction pipe. When a hardware interrupt occurs, the DSP continues to execute instructions already in the instruction pipe.
Flexible Instruction Set
The
•CLU instructions for communications infrastructure to govern trellis decoding (for example, Viterbi and Turbo decoders) and despreading via complex correlations
•Algebraic assembly language syntax
•Direct support for all DSP, imaging, and video arithmetic types
•Eliminates toggling DSP hardware modes because modes are supported as options (for example, rounding, satura- tion, and others) within instructions
•Branch prediction encoded in instruction; enables zero- overhead loops
•Parallelism encoded in instruction line
•Conditional execution optional for all instructions
•
DSP MEMORY
The DSP’s internal and external memory is organized into a unified memory map, which defines the location (address) of all elements in the system, as shown in Figure 3.
The memory map is divided into four memory
The
The six internal memory blocks connect to the four
Rev. C Page 5 of 48 December 2006