Source: http://www.google.com/patents/US8074053?dq=7,444,563
Timestamp: 2016-02-09 14:01:56
Document Index: 640065338

Matched Legal Cases: ['Application No. 60', 'art1', 'art2', 'art3', 'art4', 'art3']

Patent US8074053 - Dynamic instruction and data updating architecture - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA memory update engine provides flexible modification of data in memory. A processor may employ the update engine to update filter coefficients, special effects parameters, signal sample processing instructions, or any other instruction or data during processing. The update engine supports dynamic updating...http://www.google.com/patents/US8074053?utm_source=gb-gplus-sharePatent US8074053 - Dynamic instruction and data updating architectureAdvanced Patent SearchPublication numberUS8074053 B2Publication typeGrantApplication numberUS 11/599,967Publication dateDec 6, 2011Filing dateNov 15, 2006Priority dateJul 11, 2006Fee statusPaidAlso published asUS20080016290Publication number11599967, 599967, US 8074053 B2, US 8074053B2, US-B2-8074053, US8074053 B2, US8074053B2InventorsJames D. Pennock, Ronald Baker, Brian R. Parker, Christopher BelcherOriginal AssigneeHarman International Industries, IncorporatedExport CitationBiBTeX, EndNote, RefManPatent Citations (22), Non-Patent Citations (2), Classifications (13), Legal Events (6) External Links: USPTO, USPTO Assignment, EspacenetDynamic instruction and data updating architecture
US 8074053 B2Abstract
A memory update engine provides flexible modification of data in memory. A processor may employ the update engine to update filter coefficients, special effects parameters, signal sample processing instructions, or any other instruction or data during processing. The update engine supports dynamic updating without requiring processor shutdown, thereby allowing the processor to seamlessly continue operation during a live performance.
1. A memory update engine for updating memory accessible to a processor, the memory update engine comprising:
an update instruction register;
an update data memory;
a synchronization input; and
update logic coupled to the update instruction register, the update data memory, and the synchronization input; the update logic operable to:
wait for a frame synchronization signal on the synchronization input;
read an update instruction from the update instruction register; and
perform an update operation specified in the update instruction on the memory using update parameters stored in the update data memory.
2. The memory update engine of claim 1, where the update instruction register comprises a memory specifier bit field.
3. The memory update engine of claim 1, where the update instruction register comprises a sequential/non-sequential update specifier bit field.
4. The memory update engine of claim 1, where the update instruction register comprises a read/update specifier bit field.
5. The memory update engine of claim 4, where the read/update specifier bit field comprises:
a microcode read specifier bit field; and
an address of a microcode data register coupled to the update logic.
6. The memory update engine of claim 1, where the update operation comprises a data memory write operation.
7. The memory update engine of claim 1, where the update operation comprises a microcode write operation.
8. A memory update engine for updating memory accessible to a processor, the memory update engine comprising:
a synchronization input;
a follow-up synchronization output;
an update instruction register; and
update logic coupled to the update instruction register, the synchronization input, and the follow-up synchronization output, the update logic operable to:
read an update instruction from the update instruction register;
perform an update operation specified in the update instruction on the memory; and
issue a follow-up frame synchronization signal to the processor on the follow-up synchronization output after the update operation completes.
9. The memory update engine of claim 8, further comprising:
an update data memory coupled to the update logic; and
an update data register coupled to the update logic.
10. The memory update engine of claim 9, further comprising an update status register coupled to the update logic.
11. The memory update engine of claim 9, where the update data memory is operable to store a microcode update instruction, where the update operation specified in the microcode update instruction comprises a microcode update operation.
12. The memory update engine of claim 11, further comprising a count register coupled to the update logic and operable to specify an update count.
13. The memory update engine of claim 9, further comprising an update load register coupled to the update logic.
14. The memory update engine of claim 9, further comprising an update instruction repetition bit field operable to specify whether to repeat the update operation.
15. A method for updating memory accessible to a processor, the method comprising:
reading a memory update instruction to determine a destination memory in the memory;
waiting for a frame synchronization signal; and
in response to the frame synchronization signal:
reading update parameters from an update data memory;
updating the destination memory according to the update parameters; and
issuing a follow-up frame synchronization signal to the processor when updating completes.
receiving the update parameters from a host interface; and
storing the update parameters in the update data memory.
17. The method of claim 15, where reading update parameters comprises reading microcode instructions; and
where updating the destination memory comprises updating a microcode memory with the microcode instructions.
reading an update instruction from an update instruction register; and
where updating comprises updating the destination memory according to the update parameters and the update instruction.
19. The method of claim 18, where reading an update instruction comprises reading an update instruction comprising a memory specifier field.
20. The method of claim 18, where reading an update instruction comprises reading an update instruction comprising an instruction repetition field.
21. The method of claim 18, where reading an update instruction comprises reading a read/update specifier field.
22. The method of claim 18, where reading an update instruction comprises reading a sequential/non-sequential update field.
23. The method of claim 18, further comprising reading an update address to determine a starting address in the destination memory.
24. The method of claim 18, further comprising reading an update count to determine a number of data units in the destination memory to update.
25. The method of claim 18, further comprising setting an update status bit to ‘busy’ to communicate whether updating is occurring. Description
This application claims the benefit of priority from U.S. Provisional Patent Application No. 60/830,166 filed 11 Jul. 2006.
This disclosure relates to modifying data in memory. In particular, this disclosure relates to an architecture for dynamically updating instructions and data in a memory accessed by a digital signal processor.
Rapid advances in technology, driven by strong market demand, have yielded significant increases in microprocessor capability. Today, microprocessors are a common component of an endless array of devices. In many cases, the devices operate in real time on continuously changing data. For example, a digital signal processor in a music effects system must rapidly apply sophisticated signal processing algorithms to incoming signal samples to deliver a desired sound output by applying special effects, modifying loudness or directionality, performing mixing, filtering, equalization, or dynamic range control, or performing any of a myriad of other types of processing.
The digital signal processor relies almost completely on data in memory, including instructions and processing parameters, to perform its role. Yet, despite the rapid advancements in technology, the interface between the memory, the digital signal processor, and external input was often a limiting factor. For example, providing new processing parameters or instructions typically required the processor to shut down, await provision of the new data, then restart. However, lengthy shutdown and restart procedures compromised the ability of the processor to quickly adapt to new processing roles, such as dynamically shifting between special effects applied to an audio signal during a live performance. In other words, past memory interfaces were not sufficiently adept at providing strong, flexible, and active support of a dynamic processing role for the digital signal processor.
There is a need for an improved memory updating architecture.
A memory update engine provides on-the-fly updating of instruction or data memory. The memory update engine permits dynamic updating of memories while avoiding shutdown of the processor. Accordingly, the memory update engine permits the processor to update filter coefficients, signal processing parameters, program instructions, or any other instruction or data during live processing of input data, such as sound samples received during a live performance.
The memory update engine includes a memory update RAM that stores update data (e.g., received from a host), a master frame synchronization input, and a follow-up frame synchronization output. In addition, the memory update engine includes memory update logic operable to read a memory update instruction to determine a destination memory and wait for a master frame synchronization signal on the master frame synchronization input. Upon master frame synchronization, the memory update logic reads the update data from the memory update RAM, updates the destination memory with the update data, and, when updating is complete, issues a follow-up frame synchronization signal to program restart logic.
The disclosure can be better understood with reference to the following drawings and description in which FIGS. 1-11 show a pipelined processor architecture, and FIGS. 12-17 show a memory update engine. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the disclosure. Moreover, in the figures, like referenced numerals designate corresponding parts throughout the different views.
FIG. 1 shows a pipelined processing architecture that includes a pipelined machine state.
FIG. 2 shows a block diagram of a digital signal processor that incorporates a pipelined processing architecture.
FIG. 3 shows phase 1 of the pipelined processing architecture.
FIG. 4 shows phase 2 of the pipelined processing architecture.
FIG. 5 shows phase 3 of the pipelined processing architecture.
FIG. 6 shows phase 4 of the pipelined processing architecture.
FIG. 7 shows a portion of a machine state pipeline for program counter state data in phase 3 of the pipelined processing architecture.
FIG. 8 shows a portion of a machine state pipeline for program counter state data in phase 4 of the pipelined processing architecture.
FIG. 9 shows portions of a machine state pipeline for program counter state data in phase 1 and phase 2 of the pipelined processing architecture.
FIG. 10 shows additional logic in the machine state pipeline in phase 3 and phase 4 of the pipelined processing architecture.
FIG. 11 shows the acts taken to implement and execute a pipelined processing architecture with a pipelined machine state.
FIG. 12 shows a digital signal processor that includes a memory update engine.
FIG. 13 shows host registers for a memory update engine.
FIG. 14 shows the acts taken by the memory update engine.
FIG. 15 shows a memory update engine interfaced to Z-RAM and C-RAM.
FIG. 16 shows a memory update engine interfaced to microcode memory.
FIG. 17 shows multiplexer logic for selecting between multiple data values to apply to a memory.
The description below generally refers to FIGS. 1-11 in connection with a pipelined processor architecture. In addition, the description below generally refers to FIGS. 12-17 in connection with a dynamic instruction and data updating architecture. While the pipelined processing architecture and the updating architecture may be used in conjunction with one another, either architecture may be implemented without the other.
FIG. 1 shows a pipelined processing architecture 100 (“architecture 100”). The architecture 100 includes an instruction data pipeline 102 and a machine state pipeline 104. The machine state pipeline 104 provides relevant machine state to each of the data pipeline stages in the instruction data pipeline 102. FIG. 1 also shows multiple phases, phases 1 through n, defined in the architecture 100. Each phase may represent a discrete set of pipeline processing in the architecture 100 (e.g., a set of processing that completes in one clock cycle), including the machine state applicable for that processing.
The instruction data pipeline 102 includes ‘n’ data pipeline stages. Three of the data pipeline stages are labeled in FIG. 1: the first data pipeline stage 106, the second data pipeline stage 108, and the nth data pipeline stage 110. Each data pipeline stage may implement any desired processing. As examples, the data pipeline stages may include an instruction fetch pipeline stage, and instruction decode pipeline stage, an address pipeline stage, a multiply pipeline stage, and accumulate pipeline stage, a data pipeline stage, or any other pipeline stage. In general, the data pipeline stages connect in series to provide start to finish processing data as directed by a program instruction. Each data pipeline stage may be established so that the processing implemented by that data pipeline stage completes in one clock cycle. In the example discussed below, stage 1 implements an address generation pipeline stage, stage 2 implements a data access pipeline stage, stage 3 implements a multiply pipeline stage, and stage 4 implements an accumulate pipeline stage. However, the architecture 100 may implement additional, fewer, or different types of processing in the same or different order in additional, fewer, or different data pipeline stages.
The machine state pipeline 104 includes ‘n’ pipelined machine states through which state data propagates down the machine state pipeline 104. Three of the pipelined machine states are labeled in FIG. 1: the first pipelined machine state 112, the second pipelined machine state 114, and the nth pipelined machine state 116. Typically, there are as many pipelined machine states as there are data pipeline stages.
The machine state pipeline 104 connects to the instruction data pipeline 102 to provide the applicable machine state for each program executed in each instruction data pipeline stage. The machine state pipeline 104 includes series connected register sections that propagate the machine state down the machine state pipeline 104 to provide the applicable machine state for each data pipeline stage. As a result, each data pipeline stage becomes an independent pipelined machine.
In one implementation, the instruction data pipeline 102 is a four stage data pipeline. The four data pipeline stages include an address generation pipeline stage, a data access pipeline stage, a multiply pipeline stage, and accumulate pipeline stage. However, additional, fewer, or different data pipeline stages may be implemented.
Each data pipeline stage independently operates on different data and cannot stall because of the unavailability of intermediate results. The intermediate results for each program have propagated through the entire pipeline and are ready for the next instruction for that program. Table 1, below, shows the four stage instruction data pipeline as it initially fills with data flowing through the pipeline. In Table 1, the notation Pij refers to data for the ith program and the jth instruction in that program. In other words, the architecture 100 sequentially loads the four state instruction data pipeline 102 with data for different programs and simultaneously executes instructions from four different programs.
With the pipeline full of data from different programs, the architecture 100 proceeds to add the data for the next instruction of each program to the pipeline on subsequent clocks. Table 2 below shows several iterations of the next several instructions.
Table 2 shows that when the data P12 enters the address phase, the data for the prior instruction from program 1, P11, has exited the pipeline. As a result, the P11 data (e.g., an address calculation performed in the accumulate pipeline stage) are complete and available to the next instruction in the program. Program 1 never stalls because the results of the prior instruction from program 1 are always complete when the subsequent instruction begins execution. The same is true for all four programs. The next instruction in each program always has available the complete results of the prior instruction from that program. The instructions of each of four programs are interleaved in execution, with ‘n’ clocks between subsequent instructions of the same program. The ‘n’ clock interval permits data for each instruction to completely clear the pipeline, so that any subsequent data for an instruction from the same program will have the results it may need from a prior instruction.
One beneficial result is that a programmer, compiler, or assembler need not expend the resources to optimize code to avoid pipeline stalls. The program cannot stall because the architecture 100 coordinates the execution of instructions from three other programs while the data for the instruction from the first program makes its way completely through the pipeline. In this way, the architecture 100 simultaneously executes multiple different programs and implements true interleaved hardware multithreading.
The interleaving and the architecture 100 are not limited to four phases or data pipeline stages. Instead, the architecture 100 may implement additional, fewer, or different phases or data pipeline stages. For example, an additional data pipeline stage may be added to one or both of the multiply pipeline stage or the accumulate pipeline stage.
Tables 1 and 2 show that each data pipeline stage in the architecture 100 changes to data from a different program on each clock. For example, the multiply pipeline stage operates on P12 data, the P22 data, then P32 data, then P42 data. The architecture provides each data pipeline stage with a mechanism for keeping track of the execution state of each program: a pipelined machine state. The machine state flows down the machine state pipeline 104 on each clock. As a result, as each data pipeline stage transitions to processing data for a different program, the pipelined machine state conveys the proper execution context to the data pipeline stage. The data pipeline stage thereby continues executing each program without losing track of the context (e.g., the accumulators, addresses, and program counters) in which each program was executing.
In other words each stage of the instruction data pipeline 102 effectively becomes its own pipelined machine. To that end, the architecture 100 defines, maintains, and makes available a current machine state to each pipelined machine on each clock. In the example shown in the Figures and described below, the first machine does an address fetch while machine two does its data fetch. At the same time, machine three is performing a multiplication, while machine four is performing an accumulate operation (or logical operation). The architecture 100 therefore handles multiple truly simultaneous hardware threads.
The architecture 100 interfaces to a memory system. In one alternative, the memory system includes a data memory and a coefficient memory. However, the memory system may include additional, fewer, or different memories implemented with DRAM, SRAM, or any other memory technology. The discussion below describes an architecture 100 that interfaces to a data memory, termed a Z-RAM, and a coefficient memory, termed a C-RAM. While the Z-RAM and the C-RAM often store data values and coefficients to multiply against the data values, respectively, the Z-RAM and the C-RAM may store any type of data. Below, the data memory index register into the Z-RAM is denoted Zi, while the coefficient memory index register into the C-RAM is denoted Ci.
The pipelined machine state may include a Program Counter (PC) state 118, Address state 120, and Data state 120. The PC state 118 may establish and maintain a program counter for each data pipeline stage. The PC state 118 may further include return addresses, branch addresses, loop size data, loop position data, loop counter data, or other loop implementation data. The Address state 120 may include one or more Z-RAM indices (e.g., a Zi register), one or more C-RAM indices (e.g., a Ci register), or other address data. The Data state 122 may include flags, accumulators, or other data for each pipeline stage. The accumulators in the Data state 122 may include an A accumulator, B accumulator, C accumulator, a shift code register, and a MAC accumulator. Additional, fewer, or different accumulators may be established as part of the pipelined Data state 122.
The pipelined machine state may include additional, different, or fewer states than those identified above. For example, the pipelined machine state may also include a Microcode state 124 and an Intermediate Result state 126. The Microcode State 124 includes microcode instruction bits that propagate down registers in the machine state pipeline 104 for use in subsequent data pipeline stages. The Intermediate Result state 126 includes flags, control bits, or other intermediate results decoded or otherwise determined in one data pipeline stage that propagate down registers in the machine state pipeline 104 for use in subsequent data pipeline stages.
The flags in the pipelined machine state may specify condition codes and the bit inversions of the condition codes. Examples of condition codes include Z (zero), P (positive), N (negative), and O (overflow). The condition codes are set in the accumulate pipeline stage. The Data state may further include shift codes (stored, for example, in a shift code register). The shift codes may specify how many positions to shift, and a direction to shift, any result produced in the accumulate pipeline stage.
FIG. 2 shows a block diagram of a digital signal processor 200 that may incorporate the architecture 100. The processor 200 includes a microcode memory 202, a Z-RAM 204, and a C-RAM 206. The processor 200 also includes a data ALU 208 and an address ALU 210. Host registers 212 implement a bidirectional communication interface between the processor 200 and the host 214. The host 214 may be an onboard microcontroller, an external controller, or remote computer system as examples. In one implementation, the host registers 212 define one or more memory locations that the host 214 reads and the processor 200 writes, and one or more memory locations that the host 214 writes and the processor 200 reads. The host 214 and processor 200 may read and write the host registers 212 at their own independent rates. The host registers 212 may be defined in the host memory space or other memory spaces, and other types of communication interfaces may be implemented between the processor 200 and the host 214. Furthermore, some host registers 212 may provide control bits to the processor 200, rather than, or in addition to, providing general purpose read/write memory storage. Accordingly, on the host side, the host 214 writes to selected host registers to provide, on the architecture side, control signals to the processor 200.
The microcode memory 202 stores the microcode instructions that implement the instruction set supported by the processor 200. The microcode memory 202 may vary widely in size and width. For example, the microcode memory may be 1K-4K by 8-128 bits wide, 2K-3K by 32-64 bits wide, or may adhere to any other organization depending on the implementation desired.
The Z-RAM 204 and the C-RAM 206 are provided for program flexibility in storing and retrieving data. Other implementations may include only the Z-RAM 204, the C-RAM 206, or additional or different memories. Furthermore, the Z-RAM 204 or the C-RAM 206 may be included in memory spaces with other memories, such as the host registers 212, external memory address buffers, external memory data buffers, input/output data buffers, or other memories. Any of the buffers may be implemented using double buffered memory techniques that provide full read and write functionality out of and into the buffer for the circuitry on both “sides” of the buffer.
The Z-RAM 204 and the C-RAM 206 may vary widely in organization. For example, the Z-RAM 204 and the C-RAM 206 may be 1K-4K by 8-128 bits wide, 2K by 32-64 bits wide, or may have any other organization depending on the implementation desired.
The data ALU 208 implements the instruction data pipeline 102. In particular, the data ALU 208 may define four data pipeline stages: an address generation pipeline stage, a data access pipeline stage, a multiply pipeline stage, and an accumulate pipeline stage. The address generation pipeline stage sets up the addresses, as examples, for addressing C-RAM 206 and Z-RAM 204, for saving results in memory or in accumulators, or for any other addressing. Data from the memories is read during the data access pipeline stage. During the multiply pipeline stage, a multiplier in the data ALU 208 forms the product of multiple data elements obtained during the data stage. During the accumulate pipeline stage, the data ALU 208 sums multiple data elements (including, for example, the product formed in the multiply stage), or performs logical operations on data elements.
The address ALU 210 implements a portion of the machine state pipeline 104. In particular, the address ALU implements specific addressing modes and provides a pipeline to track the address portion of the execution context of each program. The addressing modes include a direct addressing mode and indirect addressing modes.
The direct addressing mode allows the microcode instruction to directly specify the address to be accessed. The indirect modes allow the processor 200 to access memory at a base address plus an offset specified in the microcode instruction. For example, the indirect mode may determine an address by adding an offset specified in the microcode instruction to the Zi register or Ci register. In addition, the indirect modes also implement pre-modify and post-modify addressing. Accordingly, the address ALU 210 supports modifying (e.g., incrementing or decrementing by 1) the Zi register and the Ci register before or after the Zi register or Ci register is used.
The architecture 100 may run on a master clock. The master clock may be a selectable multiple of a sampling rate. For example, for audio applications, the master clock may run at a multiple (e.g., 3000) of a 44.1 KHz audio sampling rate or any other sampling rate.
FIG. 3 shows the first phase 300 (“phase 1”) of the architecture 100. Phase 1 includes a portion of the machine state pipeline 104, including a program counter state section 302, a data state section 304 and an address state section 306. Phase 1 also includes a portion of the instruction data pipeline 102, including the address generation pipeline stage 308. The dashed line shows the end of phase 1 in the architecture 100, while the logic to the left of the dashed line shows the logic included in phase 1. In other words, the dashed line shows where an internal clock latches address data into registers or provides the address information to memories in order to begin retrieving data from the memories or store data into the registers to setup for phase 2.
In the program counter state section 302, the program counter reset logic 310 determines whether to restart the program counter, to continue at the next location in the microcode program, or to load a new program counter value. The program counter reset logic may be provided in each phase to coordinate execution of the programs executed in each phase. The microcode program, the host 214, or another entity may provide a program counter restart signal. The program counter state section 302 may define not only a program counter, but also looping registers. The looping registers may track loop size, loop position, a loop counter, a branch position, a return position, or other loop characteristics.
The current microcode instruction provided on the microcode data line 312 provides control bits for the phase 1 logic. Any of the microcode bits or results determined in phase 1 may be stored in microcode pipeline registers or result pipeline registers and passed along down the pipeline for use in subsequent phases. FIG. 3 shows an example of a pipelined microcode register 314 and a result pipeline register 315 for the decoded conditional accumulator load signal.
The microcode instruction provides control bits to the condition code decode logic 316 and at the condition load decode logic 318. The condition code decode logic 316 and the condition load decode logic 318 determine on what conditions and to what registers or other memory spaces results should be written. For example, the microcode control bits may specify no condition, conditional accumulator loading, conditional memory addressing or conditional memory writing. The microcode control bits may also specify that the conditional actions should occur based on a negative or not negative, a positive or not positive, a zero or not zero, or an overflow or not overflow condition.
The address generation pipeline stage 308 includes the multiplexer 320. The multiplexer 320 selects between multiple data elements to provide to the Z-RAM 204 and the C-RAM 206. The microcode instruction provides control bits on the multiplexer selection input 322. The multiplexer 320 selects between a Zi input, a Ci input, an A accumulator input, and a B accumulator input. However in other implementations, the multiplexer 320 may select between additional, fewer, or different inputs. As examples, the multiplexer 320 may also provide a selection between constants such as ‘0’, ‘1’, and ‘−1’, additional or different accumulators, data from the host registers 212, specific bits of other registers or accumulators or any other input data elements. Accordingly, the multiplexer 320, and the microcode control bits, may expand to support any desired number of selectable data elements.
The data state section 304 includes the normalization and shifting logic 324 that feeds the A and B accumulator registers. The normalization and shift logic 324 implements bit shifting of accumulator results to the left or to the right according to the value written into shift register. The normalization and shift logic 324 also implements normalization processing of the accumulator results (e.g., left shifting to remove redundant sign bits).
In other implementations, the normalization and shift logic 324 may be implemented in phase 4, the accumulate phase, along with saturation processing. However, saturation, normalization, and shifting operations tend to be time consuming operations. Therefore, dividing these processing steps into different pipeline phases reduces the time needed in any particular pipeline phase to allow the logic to settle and produce the results. These operations may therefore be distributed between different pipeline phases, so that no single pipeline phase has to incur the logic settling delay for all of the operations. Specifically, implementing the normalization and shift logic 324 in phase 1 allows the pipeline clock to run faster and increase the throughput of the pipeline.
The address state section 306 implements direct and indirect addressing modes. In implementation shown in FIG. 3, direct and indirect addressing modes are present for both the Z-RAM 204 and C-RAM 206 for a Zi register and a Ci register, respectively. In other implementations, multiple index registers (e.g., Z1 and Z2 index registers, and C1 and C2 index registers) may be established and pipelined for each memory. The microcode instruction provides addressing mode control bits on the microcode input 326. The address instruction decode logic 328 determines which addressing mode is selected and responsively outputs multiplexer control signals 330 to implement the addressing mode.
The address offset and segmentation logic 332 may implement special memory addressing modes and are optional features of the architecture 100. In one implementation, the address offset and segmentation logic 332 add an offset (e.g., stored in a register or maintained in a counter) to the address in a manner transparent to the processor. The offset and segmentation logic 332 may thereby turn an absolute address into an indirect address. As a result, the processor 200 gains the efficiency of writing to an absolute address while the hardware automatically adjusts the address with an offset. In addition, the address offset and segmentation logic 332 may include a comparator that compares the current address against a segmentation register to ascertain whether the offset logic and adder should be used to modify the address with the offset. When the address is outside of the segment, the offset logic and adder do not influence the address value. Instead, the address may increment by one. Alternatively or additionally, the architecture 100 may add additional memory index registers in which pre-computed memory offsets are stored for convenient access.
FIG. 4 shows the second phase 400 (“phase 2”) of the architecture 100. The dashed line labeled ‘Phase 1’ passes through the memory elements at the end of phase 1 that store the results of the phase 1 logic. The dashed line labeled ‘Phase 2’ passes through the memory elements at the end of phase 2 that store the results of the phase 2 logic. Some of the data (e.g., the A accumulator value, B accumulator value, and the condition flag bits) from phase 1 flows between registers (e.g., the A, B, and condition flag registers) to phase 2. In addition, the phase 2 logic determines values for the multiply operation performed in phase 3 and that are stored in the registers through which the ‘Phase 2’ dashed line passes. Phase 2 includes a portion of the machine state pipeline 104, including a program counter state section 402, a data state section 404 and an address state section 406. Phase 2 also includes a portion of the instruction data pipeline 102, including the data access pipeline stage 408.
In the data access pipeline stage 408, the X multiplexer 410 and Y multiplexer 412 provide a selection of data inputs to the logic in the next phase (phase 3). The microcode instruction provides bits that control the selection. The control bits are pipelined to phase 3 using pipelined microcode registers (e.g., the register 414). The data inputs shown in FIG. 4 include the A accumulator, B accumulator, Z-RAM data, and C-RAM data.
In other implementations, additional, fewer, or different data inputs may be provided on either or both of the X multiplexer 410 or Y multiplexer 412. For example, the data inputs may include constants such as ‘1’, ‘−1’, ‘2’, ‘0.5’, ‘0.25’, ‘0’, ‘16’, or other constants. The data inputs may further include additional accumulator inputs, inputs from the host registers, portions of the accumulators (e.g., the fractional part or exponent of a number), or other data inputs. The data inputs available on the X multiplexer may be different than the data inputs available on the Y multiplexer.
FIG. 5 shows an example of the third phase 500 (“phase 3”) of the architecture 100. The dashed lines pass through the memory elements that store the results of the phase 2, and phase 3 logic. Some of the data from phase 2 flows between registers to phase 3. In addition, the phase 3 logic generates other data (e.g., the product the data values input to the multiply phase) that the data pipeline stage stores in the registers at the end of phase 3. Phase 3 includes a portion of the machine state pipeline 104, including a program counter state section 502, a data state section 504 and an address state section 506. Phase 3 also includes a portion of the instruction data pipeline 102, including a multiply pipeline stage 508.
A multiplier 510 forms the product of two data inputs previously selected in phase 2, illustrated in FIG. 4. The multiplier 510 may be a fixed point multiplier, two's complement multiplier, floating point multiplier, or other multiplier. Specifically, the outputs of the X multiplexer 410 and Y multiplexer 412, clocked into the registers 416 at the end of phase 2, provide the data inputs to the multiplier 510. While FIG. 5 shows two 32 bit data inputs multiplied to form a 64 bit output, the data inputs and outputs may be of different bit sizes in other implementations.
The B multiplexer 512 sets up one input for the following accumulate pipeline stage. The microcode instruction includes control bits which determine which B multiplexer input is selected. In FIG. 5, the B multiplexer 512 inputs include the A accumulator, the B accumulator, the data retrieved from Z-RAM 204 and the data retrieved from C-RAM 206.
In other implementations, the B multiplexer 512 accepts additional, fewer, or different data inputs. For example, the B multiplexer 512 may accept constants such as ‘1’, ‘−1’, ‘0.5’, ‘0’, or other constants. The data inputs may further include additional accumulator inputs, inputs from the host registers, portions of the accumulators (e.g., the fractional part or exponent of a number), portions of the program counter state (e.g., the program counter or program counter return value), or other data inputs.
FIG. 6 shows the fourth phase 600 (“phase 4”) of the architecture 100. The dashed lines pass through clocked storage elements (e.g., registers, DRAM, SRAM, or other memory) that store the results of the phase 3 logic at the end of that phase, and the phase 4 logic at the end of that phase. Some of the data from phase 3 flows between registers to phase 4. In addition, the phase 4 also generates new data that may be stored in the registers at the end of phase 4. Phase 4 includes a portion of the machine state pipeline 104, including a program counter state section 602, a data state section 604 and an address state section 606. Phase 4 also includes a portion of the instruction data pipeline 102, including the accumulate pipeline stage 608.
The accumulate pipeline stage 608 includes adder/logic decode logic 610, saturation decode logic 612, and accumulator loading decode logic 614. The adder in the accumulate pipeline stage 608 may be a fixed point adder, two's complement adder, floating point adder, or other adder. The adder/logic decode logic 610 decodes microcode bits that specify the operation to perform in the accumulate pipeline stage 608. The adder/logic decode logic 610 provides control outputs to the accumulate circuitry 616. The accumulate logic 616 may include an adder, Boolean logic circuitry (e.g., AND or XOR logic), or other circuitry. In response to the control outputs, the accumulate pipeline stage 608 may add multiple data inputs, or perform logic operations on those inputs as specified by the control outputs. To that end, the microcode bits and the control outputs may specify an Add operation, a Subtract operation, and AND operation, or an XOR operation, as examples.
The microcode bits may further select from between additional inputs (beyond those provided by the B multiplexer 512). For example, an additional multiplexer may be added to the other input of the adder, with additional microcode bits, intermediate results, and/or decoding logic to produce a control signal that chooses the input value to pass through the additional multiplexer. In one implementation, the additional multiplexer may accept a conditional subtract input (e.g., stored in a C accumulator), the output of the multiplier 510, a shifted version of the output of the multiplier (e.g., the output times 16-shifted 4 bits to the left), or other inputs.
The saturation logic 618 implements saturation processing of the accumulator results. The multiplexer 620 selectively provides either the output of the adder or the Boolean logic circuitry to the saturation logic 618. In response to the saturation decode logic 612, the saturation logic 618 limits the output. The saturation logic 618 may limit the output, as examples, to 1, 8, 128, any other magnitude, or perform no saturation. In other words, when saturation is selected, the saturation logic replaces an out-of-bounds value produced by the accumulate pipeline stage with the maximum positive or maximum negative value that is within the specified bounds. A value that the accumulate pipeline stage produces that is already in the specified bounds passes through without change. The saturation logic 618 thereby provides a useful mechanism for limiting the dynamic range of results produced in the accumulate pipeline stage.
The accumulator decode logic 614 responds to microcode instruction bits that specify which accumulator(s) to load. Accordingly, when the accumulate pipeline stage 608 obtains the result, the selected accumulator or accumulators are loaded. To that end, the microcode instruction bits may specify that any combination of one or more of the following should be loaded with the accumulator pipeline stage result: the A accumulator, B accumulator, PC, or any other register.
The accumulator loading is further influenced by the load conditions discussed in the address pipeline stage 300. The flag determination logic 622 determines the conditions associated with the accumulator pipeline stage result (e.g., zero, positive, negative, or overflow). The load conditions may direct the architecture to load the accumulators or to forgo loading the accumulators with a new value, based in part on the flags set or cleared by the flag determination logic 622.
FIG. 6 shows the multiplexers (e.g., the accumulator multiplexers 624) that select the data to load into the accumulators. The data may be the result of the accumulate pipeline stage 608, or the prior accumulator value, as examples. Note that shifting and normalization occurs in phase 1, as noted above in the discussion of phase 3.
FIG. 6 also shows Zi decode logic 626 and Ci decode logic 628. The logic 626, 628 operates on the output of the saturation logic 618. For example, the logic 626, 628 may select specific bits of the 64 bit output to load into the Zi or Ci register. Thus, when the C-RAM memory 216 or Z-RAM memory 214 is smaller than 64 bits of addressable space, the logic 626, 628 may pick the appropriate number of bits (e.g., 10, for a 1024 addressable location Z-RAM) to load. As a result, the Zi and Ci registers may be loaded with the new value provided on the output of the saturation logic 618, or with the prior value of the Ci and Zi registers. The index multiplexers 630 and 631 provide the selection based on the control bits provided on the index selection line 632 by the address ALU instruction decode logic shown in FIG. 3.
The program counter update logic and looping logic 634 coordinates updating of the PC and looping registers. The program counter tracks the current program position for each stage of the pipeline. The looping registers keep track of the looping parameters that determine how many loops to perform, the loop length, and other loop characteristics.
A more detailed view of an implementation of the program counter state sections 302, 402, 502, and 602 is shown in FIGS. 7-10. As noted above, the program counter state sections 302, 402, 502, and 602 implement and maintain the program counters for each independent machine defined by the pipeline and also implement and maintain looping registers for high-speed hardware support of software loops.
FIG. 7 shows a phase 3 section 700 of the machine state pipeline 104 for handling program counter state. The phase 3 section 700 includes a program counter section 702, and a looping control section 704. The looping control section 704 includes a return section 706, a branch section 708, a loop size section 710, a loop position section 712, and a loop counter section 714. FIG. 7 shows program counter state data from logic in phase 4 of the architecture 100 provided on the program counter state data inputs 718. The program counter state data is used in phase 4 (shown in FIG. 8) to load, as examples, the program counter, loop size, and loop count. In other words, rather than loading an accumulator at the end of phase 4, the architecture 100 may load program counter state data using results obtained by the phase 4 logic that would otherwise have been stored in an accumulator.
In one implementation, the program counter state data inputs 718 provide a PC branch value (e.g., 12 bits), a number of lines in the loop (e.g., a 9 bit loop size), the number of loops to execute (e.g., a 10 bit loop count), and a return/subroutine flag (e.g., 1 bit). The return/subroutine flag may determine, in conjunction with the loop size, whether to initiate a jump to a new location, a jump to (or a return from) a subroutine, or a jump to the beginning of a loop. Accumulator loading decode logic in phase 4 provides the load PC control signal 738 that influences loading new program counter state data in phase 4, and as shown in FIG. 8. The program restart logic 736 coordinates the restarting of programs in each hardware thread as described in more detail below.
In the program counter section 702, a two input multiplexer 716 selects between values to load into the phase 3 PC register 720. The values include the value of the current PC, plus 1, provided by the adder 717, or a PC start value from the host register. The restart signal is provided by a frame synchronization signal (e.g., a signal that specifies the arrival of a new sample of data), by the currently executing program, by a restart value written to a host register, or by another mechanism.
The return registers (e.g., the phase 3 return register 722) in the return register section 706 track where the program should return to when the subroutine is complete. The branch registers (e.g., the phase 3 branch register 724) provided in the branch register section 708 track where the program is jumping to, or looping back to. The loop size registers (e.g., the phase 3 loop size register 726) provided in the loop size register section 710 track the size of the loop in terms of the number of instructions. The loop position registers (e.g., the phase 3 loop position register 728) in the loop position section 712 track the current position in the loop (e.g., when the loop position=0, the current iteration of the loop is completed). The loop counter registers (e.g., the phase 3 loop counter register 730) in the loop counter section 714 track the number of additional loops to be performed (e.g., when the loop counter=0, the last iteration of the loop is completed).
The subroutine detection logic 732 determines when a subroutine is called. The subroutine return logic 734 determines when to return from a subroutine. The subroutine detection logic 732 generates a multiplexer control signal that selects between a PC branch value and a PC return value in phase 4. The subroutine return logic 732 generates a multiplexer control signal that is used in selecting between the next line of the PC or a PC return value.
FIG. 8 shows a phase 4 section 800 of the machine state pipeline 104 for handling program counter state. In phase 4, the architecture 100 loads or updates the program counter and looping variables using program counter state data provided on the program counter state data inputs 718. For example, the PC control multiplexers 802 determine whether to update the phase 4 PC register 804 with: 1) the next line in the program, i.e., PC+1; 2) a PC branch value; 3) a PC return value; 4) a PC branch return value; or 5) a new PC start value.
The return register control multiplexer 806 determines whether to update the phase 4 return register 808 with: 1) the next line in the program, i.e., PC+1; or 2) a PC return value. The branch register control multiplexer 810 determines whether to update the phase 4 branch register 812 with: 1) the PC branch value; or 2) the PC branch return value. The loop size register control multiplexer 814 determines whether to update the phase 4 loop size register 816 with: 1) the new loop size value (e.g., for when a new loop is starting); or 2) the current loop size value that is held until the loops are finished and that is reloaded for each loop iteration.
In addition, the loop position control multiplexers 816 determine whether to update the phase 4 loop position register 818 with: 1) the new loop position value (e.g., set to the loop size when a new loop is begun); 2) a current loop size value (e.g., when the current iteration of a loop is finished and the next iteration of the loop is begun); or 3) an updated loop position value (e.g., the prior loop position—1, decremented as the architecture 100 makes its way through the loop). The loop position logic 820 generates a reload loop control signal based on loop position=0 AND loop counter is not equal to 0. Thus, when there are additional loops left to process, and the end of the current loop is reached (e.g., loop position=0), then the loop position is reloaded with the loop size. Furthermore, the loop position logic 820 generates a loop counter enable signal, for example when loop counter is not equal to 0 (e.g., when there are additional loops to process).
The loop counter control multiplexer 822 determines whether to update the phase 4 loop counter 824 with: 1) the loop count value; or 2) a decremented loop count; or 3) a non-decremented loop count. For example, when there are additional loops to process (e.g., loop count is not equal to 0), then the loop count is decremented and loaded into the phase 4 loop count register 824.
FIG. 9 shows phase 1 and phase 2 sections 900 of the machine state pipeline 104 for handling program counter state. The dashed lines pass through the memory elements that propagate the PC and looping data between registers 902, 904, 906, 908, 910, and 912 between phase 1 and phase 2. FIG. 9 also shows the PC loading multiplexers 914 and 916 that selectively load the PC in phase 1 or phase 2 with a new PC start value.
FIG. 10 shows additional logic in the phase 3 and phase 4 sections of the machine state pipeline 104. FIG. 10 illustrates that PC address is applied to the microcode memory 202 in phase 3 to obtain the next microcode instruction for phase 4. The next microcode instruction is clocked into the microcode register 1002 in phase 4. The microcode bits are thereby available to control the execution of the pipelined architecture 100 through subsequent phases 1 to 4.
The machine state pipeline 104 includes program restart logic 736 to determine when to reload the program counter for each pipeline phase (and thus for each independent hardware thread). The program restart logic 736 may implement independent reset control over each program counter register and selected loop registers in each pipeline phase. The PC selection input may specify which program counters to reload. Thus, as shown in FIG. 7, the program restart logic, 736 provides four independent restart signals Restart1, Restart2, Restart3, and Restart4. Each restart signal reloads the particular PC register, and clears the return register, loop position register, and loop counter register for a particular pipeline phase. For example, Restart3 reloads the PC and clears the registers for the third independent hardware thread running in phase 3 of the pipeline. The program restart logic 736 may assert all of the restart signals at the same time. Restarting each of the program counter registers at the same time provides for four synchronized independent hardware threads to execute on the architecture 100.
However, rather than reloading all of the program counter registers at once, the program restart logic 736 may individually determine which of the program counter registers to load in response to a load condition (e.g., a hardware reset, a load request from the host, or a load request from an executing program). The program restart logic 736, for example, may assert the restart signals to provide round-robin restart of the ‘n’ program counter registers in the ‘n’ pipeline stages. In that case, the architecture 100 provides execution of a program that is, effectively, ‘n’ times as long as a program under the circumstance where all the program counter registers are restarted together. When processing audio samples, for example, each pipeline stage may execute an audio processing program which operates on the output of the program executing in the prior pipeline stage. The architecture 100 allows the audio processing program to be effectively ‘n’ times longer than it otherwise could be.
FIG. 11 summarizes the acts taken to implement and execute the pipelined architecture 100. An instruction processing architecture is divided into ‘n’ data pipeline stages (Act 1102). For example, the data pipeline stages may include an address generation pipeline stage, a data access pipeline stage, a multiply pipeline stage, and an accumulate pipeline stage, although additional, fewer, or different data pipeline stages may be implemented. The ‘n’ data pipeline stages provide independent hardware threads that execute ‘n’ programs. Each clock brings an instruction from the next program into the data pipeline. The data pipeline operates in a round-robin manner, returning to obtain the next instruction from the first program after the instruction from program ‘n’ (i.e., the last program) has begun execution.
To support the independent hardware threads, a pipelined machine state is provided (Act 1104). The pipelined machine state may propagate through registers down the machine state pipeline. Each data pipeline stage therefore has the proper context provided for executing each of the ‘n’ programs, as the pipeline stage changes to a new program (of the ‘n’ programs) each clock. The pipelined machine state may include a Program Counter (PC) state 118, Address state 120, and Data state 122. The pipelined machine state may include additional, different, or fewer states, such as a Microcode state 124 and an Intermediate Result state 126.
The architecture 100 clocks in data for an instruction from program 1 into the pipeline (Act 1106). The clock also propagates machine state along the machine state pipeline 104 (Act 1107). Accordingly, the pipeline stage that processes the instruction has the proper execution context (e.g., including PC, accumulator values, and address information) for processing the data for the instruction in that data pipeline stage.
Each clock introduces data for a new instruction from one of the ‘n’ programs into the instruction data pipeline 102. The clocks also propagate the data for the prior instruction down the instruction data pipeline 102. (Acts 1108, 1110, and 1112). At the same time, the machine state flows down the machine state pipeline 104 to provide the proper context for processing the data for each instruction (Acts 1109, 1111, and 1113). The architecture 100 processes new instructions and propagates machine state as long as there are instructions to execute.
The architecture 100 includes microcode updating logic. The microcode updating logic loads the contents of the microcode memory 202 to initially setup, replace, correct, or extend the microcode instructions. FIG. 10 shows that the microcode updating logic provides microcode update data on the data lines 1004. While the microcode is updated, the microcode update logic may also provide a write protect signal on the write protect line 1006 to prevent undesired output from the microcode memory 202 from being written into the microcode register 1002 while updates occur.
FIG. 12 shows an implementation of a digital signal processor 1200 that incorporates a memory update engine 1202. The memory update engine 1202 may be used in conjunction with the instruction processing architecture 100 described above. The memory update engine 1202 obtains update parameters (e.g., addresses, data and instructions) for the microcode memory 202, Z-RAM 204, or C-RAM 206 from a memory update RAM 1204. The host 214 may provide the update parameters to the memory update RAM 1204 through the memory update host registers 1206. The host 214 also writes to the memory update host registers 1206 to provide control bits to the memory update engine 1202, and reads from the memory update host registers 1206 to obtain status information from the memory update engine 1202. Depending on the implementation, the memory update engine 1202 may perform updates on additional, fewer, or different memories.
The memory update engine 1202 provides dynamic updating of microcode instructions or of data in the Z-RAM 204 or C-RAM 206 without requiring the DSP 1200 to shutdown or stop processing for an extended number of clock cycles. As a result, the DSP 1200 effectively continues processing data without interruptions. Thus, for example, a DSP 1200 that processes sound samples may seamlessly change during live performances. As examples, the host 214 may change filter coefficients, special effects parameters, microcode instructions for processing sound samples, or any other parameters on-the-fly.
FIG. 13 shows the memory update host registers 1206 in more detail. The memory update host registers 1206 provide operational parameters and control instructions to the memory update engine 1202 and also provide status bits for the host 214. The memory update host registers 1206 include a busy register 1302, a full register 1303, a start update register 1304, and an update instruction repeat register 1306. In addition, the memory update host registers 1206 include an update instruction register 1308, an update count register 1310, an update address register 1312, and a load data register 1314. An update data register 1316 stores an update parameter provided by the host 214, while a microcode data register 1317 stores a microcode instruction. The memory update engine 1202 reads the microcode instruction from the microcode memory 202 and stores it in the microcode data register 1317 in response to a request from the host 214. Each register 1302-1317 may be implemented as one or more bits in a data unit (e.g., an 8-bit memory location) in the host memory space, or any other memory space. As described in more detail below, the start update register 1304 and the update instruction register 1308 provide different mechanisms for initiating execution of the memory update engine 1202. Other mechanisms may be used, depending on the implementation.
Table 3, below, shows one example of the distribution of the registers 1302-1317 in the host registers 212. In particular, Table 3 shows that the update data register 1316 is implemented as four 8-bit memory locations (32 bits labeled UpdData0-UpdData31), and that the update address register 1312 spans two 8-bit memory locations (12 bits labeled UpdAddr0-UpdAddr11). The update data register 1316 may store instructions that update the microcode memory 202, data that updates data in the Z-RAM 204 or C-RAM 206, memory addresses to update, or any other type of update parameter. In addition, Table 3 shows that several of the registers define status bits. For example, bit 7 of the update address register 1312 provides a ready/busy status bit. Any other distribution or organization of the registers may be established, and additional, fewer, or different control or data registers may be employed.
Memory Load and Update Host Registers
UpdStat
UpdFull
UpdAddr11
UpdAddr10
UpdAddr9
UpdAddr8
UpdAddr7
UpdAddr6
UpdAddr5
UpdAddr4
UpdAddr3
UpdAddr2
UpdAddr1
UpdAddr0
UpdCnt4
UpdCnt3
UpdCnt2
UpdCnt1
UpdCnt0
UpdData31
UpdData30
UpdData29
UpdData28
UpdData27
UpdData26
UpdData25
UpdData24
UpdData23
UpdData22
UpdData21
UpdData20
UpdData19
UpdData18
UpdData17
UpdData16
UpdData15
UpdData14
UpdData13
UpdData12
UpdData11
UpdData10
UpdData9
UpdData8
UpdData7
UpdData6
UpdData5
UpdData4
UpdData3
UpdData2
UpdData1
UpdData0
UpdStat/Ld
UpdInstrRpt
UpdInstr3
UpdInstr2
UpdInstr1
UpdInstr0
Table 4 provides an explanation of the address, data, and status bits shown in Table 3. A status bit, ‘UpdStat’, indicates whether the memory update engine 1202 is ‘busy’ (i.e., performing an update) or ‘ready’ (i.e., ready to perform an update). A full bit, ‘UpdFull’, indicates whether the memory update RAM is full. The host 214 may check the full bit before writing another data unit to the memory update RAM 1204. The status bit, full bit or both may be provided in multiple locations in the host registers for convenient access. Additionally, the status bit and full bit may be combined into a single status bit with a temporal distinction in role. For example, before the host 214 initiates the memory update, the role of the combined status bit may be to reflect whether the memory update RAM 1204 is full. After the host 214 initiates the memory update, the role of the combined status bit may be to reflect whether the memory update engine 1202 is busy performing the memory update. Any particular implementation may define additional, fewer, or different status bits.
Memory Update Address, Data, and Status Bits
Status provided by the update engine, for example, 0 = ready, 1 = busy
UpdAddr[11:0]
The address where updating will start. The address may be relative
to the memory space being updated (e.g., microcode, Z-RAM or C-
RAM). UpdInstr (Table 5) determines the memory space to update.
Indicates whether the memory update RAM is full, for example,
0 = not full, 1 = full.
(Update Full)
UpdCnt[4:0]
Holds the count of units the host will update, minus 1. The units may
(Update Count)
be continuous or may be in any arbitrary order.
UpdData[31:0]
A 32 bit data unit that will update a unit in one of the DSP's memory
(Update Data)
spaces (e.g., microcode, Z-RAM, or C-RAM). Two units may be
written per 64 bit microcode line, with the least significant word
written first.
The host writes a ‘1’ to this bit to instruct the DSP to load the data in
(Update Load)
UpdData[31:0] into the memory update RAM 1204.
To setup the parameters that will update one of the memories, the host 214 writes parameters to the update data register 1316, then sets the load data register 1314 to ‘2’. The memory update engine 1202 responds by writing the parameter in the update data register 1316 into the memory update RAM 1204 and resetting the load data register 1314 to ‘0’. The memory update engine 1202 increments an internal memory counter that specifies the next location in the memory update RAM 1204 to write to. The memory counter may roll over to zero when it reaches the end of the memory update RAM 1204. In addition, when the memory update engine 1202 has written to the last location in the memory update RAM 1204, the memory update engine 1202 may set a full flag in the full register 1303. The host 214 may thereby determine when the memory update RAM 1204 has stored as many update values as it can hold.
The host 214 need not fill the entire memory update RAM 1204 with update values. Instead, the host 214 may store one, two, or any other number of update values in the memory update RAM 1204, subject to the capacity of the memory update RAM 1204. The host 214 writes to the update count register 1310 to specify the number of data units for the memory update engine 1202 to update. As examples, the data unit may be a 64-bit microcode instruction or a 32-bit data word in Z-RAM 204 or C-RAM 206. Other memories in the processor may have different organizations that adhere to different data unit sizes (e.g., 8-bits).
In one implementation, the memory update engine 1202 initiates a memory update after the host 214 writes a valid (e.g., non-zero) update instruction to the update instruction register 1308. Prior to the update instruction, the host 214 therefore provides the update data, update address, update instruction repeat data, and update count to the memory update engine 1202. When the master frame synchronization signal arrives, the memory update engine 1202 executes the memory update when a valid update instruction has been provided. When the update finishes, the memory update engine 1202 clears the update instruction register 1308. In other implementations, the memory update engine 1202 may initiate a memory update after the host 214 writes to the start update register 1304. The memory update engine 1202 then clears the start update register 1304 when the update completes. More generally, the host establishes a start update condition to initiate operation of the memory update engine 1202, and the memory update engine 1202 clears the start update condition when the update is complete. A non-zero update instruction and writing a start update bit are two examples of such start update conditions.
Table 5 provides an explanation of the update instruction register bits shown in Table 3. The host 214 writes to the update instruction register 1308 to specify the particular updating operation that the memory update engine 1202 will perform. The update instruction register 1308 also specifies the memory that the memory update engine 1202 will write to.
The memory update engine 1202 may write update data in a non-sequential or sequential address order. For non-sequential addresses, the host 214 may write a sequence of address and data parameter pairs to the memory update RAM 1204. The addresses specify the locations to write the data. For sequential addresses, the host provides a starting address on the update address register 1312 and the memory update engine 1202 automatically increments by one the last address for each data unit written.
UpdInstr[1:0]
Specifier)
Update Z-RAM
Update C-RAM
Update Microcode Memory
UpdInstr[2]
The memory update engine 1202 reads the memory
(Sequential/
update RAM 1204 to obtain an address, then reads the
next data unit from the memory update RAM to obtain the
data to be written to that address. The memory update
engine 1202 may write to non sequential addresses.
The memory update engine 1202 updates addresses by
incrementing the address after data is written. The update
address is used as the starting address.
UpdInstr[3]
Write to memory, as specified by UpdInstr[1:0]
Read microcode from a location specified by the update
address register. The host may load the address to read
before setting this bit. The memory update engine writes
the data from the microcode memory 202 into the host
registers as Microcode Data[63:0]
The memory update engine 1202 updates the data once.
The memory update engine 1202 repeatedly updates the data at a predetermined
interval (e.g., each frame synchronization) until this register is set to
0. As an alternative, the memory update host registers 1206 may provide multiple
bits for the update instruction repeat register 1306. The update instruction
repeat register 1306 may then specify a count value for the number of times to
repeat the memory update operation using the data loaded into the memory update
RAM 1204. The memory update engine 1202 may load the count into an internal
register and decrement the register after each update. When the count reaches
zero, the memory update engine 1202 may clear the update instruction repeat
register 1206, set a done flag in the memory update host registers 1206, or take
another action.
The host interface, update data register 1316, memory update RAM 1204, microcode memory 202, Z-RAM 204, and/or C-RAM 206 may have different sizes and organizations. Thus, while the update data register 1316 is shown as spanning 32 bits, the update data register may instead be 8 bits wide, 16 bits wide, 64 bits wide, or any other width. Similarly, the memory update RAM 1204 may be organized as 32 words�32 bits per word, 16 words�64 bits per word, or any other organization. Increasing the memory update RAM capacity increases the number of microcode instructions or memory locations that may be updated in one update cycle.
In one implementation, the microcode memory 202 is 64 bits wide while the Z-RAM 204 and C-RAM 206 are 32 bits wide. Accordingly, to update a microcode instruction, the host 214 may write two 32-bit values into the memory update RAM 1204. For example, the two 32-bit values may be written least significant word followed by most significant word. The memory update engine 1202, when updating a microcode instruction, may then read two 32-bit values from the memory update RAM 1204. The memory update engine 1202 holds one 32-bit value internally while retrieving the second 32-bit value in order to obtain the entire 64-bit microcode instruction from the memory update RAM 1204.
In one implementation, the memory update engine 1202 updates the memory specified in the update instruction register 1308 between samples of incoming data. For example, the memory update engine 1202 may initiate the memory update operation upon receipt of a master frame synchronization signal on the master frame synchronization input 1318. The master frame synchronization signal indicates that a new data sample has arrived. When the memory update operation is complete, the memory update engine 1202 may then issue a follow-up frame synchronization signal to other logic in the processor (e.g., the program restart logic 736) on the follow-up frame synchronization output 1320. As noted above with regard to FIG. 7, the program restart logic 736 may use the frame synchronization signal to restart one or more programs that process the next data sample. In other words, the memory update engine 1202 delays program restart until memory updating has finished.
FIG. 14 shows the acts taken by the memory update engine 1202. The memory update engine 1202 may be implemented as a state machine, as a controller operating under program control, or using other logic or circuitry. The memory update engine 1202 waits for the master frame synchronization signal (Act 1402). The memory update engine then checks whether the host 214 has stored a valid (e.g., non-zero) update instruction into the update instruction register 1308 (Act 1404). Alternatively, the memory update engine 1202 may check whether the host 214 has written to the start update register 1304, or the host 214 has established any other start update condition. When no update will be done (e.g., because no valid update instruction has been provided), the memory update engine 1202 issues the follow-up frame synchronization signal (Act 1420).
Otherwise, the memory update engine 1202 loads an internal address counter with the contents of the update address register 1312 (Act 1406). The memory update engine 1202 also places the update count value into a countdown register (Act 1408). The memory update engine 1202 then reads data values from the memory update RAM 1204 and increments the address counter on each read.
For each data unit retrieved from the memory update RAM 1204, the memory update engine writes the data unit to memory specified in the update instruction. For example, for each microcode instruction update, the memory update engine 1202 reads two 32-bit data values from the memory update RAM 1204, and writes the 64-bit microcode instruction to the microcode RAM 202.
When the update instruction specifies sequential addressing, the memory update engine 1202 reads the data unit from the memory update RAM 1204 (Act 1408), writes the data unit to the selected memory (Act 1410), increments the address counter into the selected memory (Act 1412), and decrements the countdown register (Act 1414). The memory update engine 1202 continues to read data units from the memory update RAM 1204 until the countdown register reaches zero.
When the update instruction specifies non-sequential addressing, the memory update engine 1202 reads a first parameter, an address, from the memory update RAM 1204 (Act 1416) followed by a second parameter, a data unit, to write to that address (Act 1418). The memory update engine 1202 writes the data unit to the selected memory (Act 1419). The memory update engine 1202 reads as many data units as the update count value specifies. When the counter is decremented to zero, the update is finished, and the memory update engine 1202 issues the follow-up frame synchronization signal (Act 1420) to restart one or more programs. If it was set to initiate the memory update operation, the memory update engine 1202 also clears the start update condition (e.g., by clearing the update instruction register 1308 or the start update register 1304) (Act 1422).
FIG. 13 shows that the memory update engine 1202 also issues a microcode write protect signal 1322. As shown in FIG. 10, the write protect signal 1322 ensures that the microcode register 1002 is loaded with known data (e.g., all zeros or any other bit pattern representing a NOP instruction) while the memory update engine 1202 is updating memory. According, the instruction pipeline 100 is protected against making unpredictable changes to previously determined results stored in the memories or accumulators.
FIG. 15 shows the memory update engine 1202 interfaced to the Z-RAM 204 and C-RAM 206. The start upload signal 1502 provides a multiplexer control signal that selects the memory update data signals 1504 and the memory update address signals 1506 for application to the C-RAM 206 and Z-RAM 204. In addition, depending on the memory selected by the update instruction register 1308, the memory update engine asserts either the C-RAM write signal 1508 or the Z-RAM write signal 1510.
The C-RAM 206 and the Z-RAM 204 are generally accessible by the pipeline architecture 100 described above. Accordingly, the processor provides a mechanism for passing update data to the C-RAM 206 and Z-RAM 204. In particular, the processor implements multiplexer selection logic for the signals applied to the C-RAM 206 and Z-RAM 204. As shown in FIG. 15, the multiplexer selection logic includes a C-RAM write signal multiplexer 1512, a C-RAM address signal multiplexer 1514, and a C-RAM data multiplexer 1516. The multiplexer selection logic also includes a Z-RAM write signal multiplexer 1518, a Z-RAM address signal multiplexer 1520, and a Z-RAM data multiplexer 1522. The multiplexer selection logic is responsive to the start upload signal 1502 to select address, data, and write signals generated by the memory update engine 1202 for application to the C-RAM 206 and Z-RAM 204.
FIG. 16 illustrates one example of data override logic 1600 for applying the update data on the memory update data signals 1504 to the C-RAM 206 and Z-RAM 204. In the example shown in FIG. 16, the CZ data multiplexer 320 includes multiple inputs 1602, including an input for the memory update data signals 1504. The update data signals 1504 are provided on input 15 of the CZ data multiplexer 320. An OR gate 1604 responds to the start upload signal 1502 by forcing the multiplexer selection input 322 to all ‘1’s, thereby selecting input 15 (i.e., the update data signals 1504) for output to the C-RAM 206 and Z-RAM 204. Thus, the CZ data multiplexer 320 may implement the functionality of the C-RAM data multiplexer 1516 and the Z-RAM data multiplexer 1522.
Similarly, override logic may be provided for the memory update address signals 1506 and for the write signals 1508 and 1510. For example, the address signal multiplexers 350 and 354 and the write signal multiplexers 352 and 356 shown in FIG. 3 may be extended to provide inputs for the memory update address signals 1506 and for the write signals 1508 and 1510. Address and write override logic may be provided to select the memory update address signals 1506 and the write signals 1508 and 1510 for application to the Z-RAM 204 and C-RAM 206 when the memory update engine 1202 asserts the start upload signal 1502.
FIG. 17 shows the memory update engine 1202 interfaced to the microcode memory 202. In particular, FIG. 17 shows that the memory update engine 1202 provides a 64-bit microcode instruction to the microcode memory 202 on the memory update data signals 1504 (for the lower 32-bits of the instruction) and on the supplemental data signals 1702 (for the upper 32-bits of the instruction). The memory update engine 1202 asserts the microcode write signal 1704 to write the 64-bit microcode instruction to the microcode memory 202.
A microcode address selection multiplexer 1706 determines which address signals are applied to the microcode update memory 202. Under control of the start upload signal 1502, the microcode address selection multiplexer 1706 selects between an address generated by the address ALU 210 and the memory update engine 1202. When the memory update engine 1202 is used with the pipeline architecture 100, the address selection multiplexer 1706 may be added prior to the address input to the microcode memory 202 shown in FIG. 10.
The architecture 100 and memory update engine 1202 may be implemented in software, for example, in the form of a hardware emulator program that includes instructions that emulate the operations described above, including the acts discussed with respect to FIGS. 11 and 14. Accordingly, the architecture 100 or engine 1202 may be represented in a machine readable memory such as RAM, ROM, or Compact Disc. For example, a program stored in a machine readable memory may emulate the architecture 100 or engine 1202. The program may be encoded in and/or communicated in an electromagnetic signal to other entities.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4903259 *Jul 21, 1988Feb 20, 1990Nec CorporationTime-division multiplex switching networkUS5226131 *Aug 28, 1991Jul 6, 1993The United States Of America As Represented By The United States Department Of EnergySequencing and fan-out mechanism for causing a set of at least two sequential instructions to be performed in a dataflow processing computerUS5519449 *Sep 17, 1992May 21, 1996Hitachi, Ltd.Image composing and displaying method and apparatus for displaying a composite image of video signals and computer graphicsUS5542059Dec 21, 1994Jul 30, 1996Exponential Technology, Inc.Dual instruction set processor having a pipeline with a pipestage functional unit that is relocatable in time and sequence orderUS5680175 *Aug 9, 1995Oct 21, 1997Hitachi, Ltd.Video signal conversion apparatus having a common frame memory for video signals having different synchronizing signalsUS5927218Jul 24, 1996Jul 27, 1999Siemens AgBuffer circuit on a moduleUS5977881 *Aug 1, 1997Nov 2, 1999Nec CorporationRadio selective calling receiver having battery saving functionUS6052792Aug 8, 1996Apr 18, 2000Mensch, Jr.; William D.Power management and program execution location management system for CMOS microcomputerUS6195665Mar 5, 1996Feb 27, 2001Tomorrow's Software, L.L.C.Digital electrical computer apparatus, and methods for making and using the same, for template building, loading, and viewingUS6278718 *Aug 29, 1996Aug 21, 2001Excel, Inc.Distributed network synchronization systemUS6421274Oct 25, 2001Jul 16, 2002Mitsubishi Denki Kabushiki KaishaSemiconductor memory device and reading and writing method thereofUS6462743Dec 21, 1999Oct 8, 2002Ati International SrlPipeline processing system and methodUS20020056034Oct 1, 1999May 9, 2002Margaret GeartyMechanism and method for pipeline control in a processorUS20050206660 *Mar 9, 2005Sep 22, 2005Canon Kabushiki KaishaController and image display deviceUS20060262965 *May 25, 2005Nov 23, 2006Morio SugitaPupil detection device and iris authentication apparatusUS20070073798Sep 28, 2005Mar 29, 2007Donofrio David DEnhanced floating-point unit for extended functionsUS20070074008Sep 28, 2005Mar 29, 2007Donofrio David DMixed mode floating-point pipeline with extended functionsDE19529718A1Aug 11, 1995Feb 13, 1997Siemens AgAuf einer Baugruppe angeordnete PufferschaltungEP1517331A2Sep 9, 2004Mar 23, 2005Samsung Electronics Co., Ltd.Memory system and control method thereofJPS63107399A * Title not availableWO2003003237A2Jun 27, 2002Jan 9, 2003Eleven Engineering IncSystem on chip architectureWO2005069121A1Dec 29, 2004Jul 28, 2005Koninkl Philips Electronics NvElectronic circuit with a fifo pipeline* Cited by examinerNon-Patent CitationsReference1John L. Hennessy and David A. Patterson, "Enhancing Performance with Pipelining" Chapter 6, pp. 436-536, Computer Organization & Design, Second Edition, 1997.2John L. Hennessy and David A. Patterson, "Pipelining: Basic and Intermediate Concepts" Appendix A, pp. A2-A81, Computer Architecture A Quantitative Approach, Third Edition, 2003.Classifications U.S. Classification712/25, 712/225International ClassificationG06F9/00Cooperative ClassificationG06F9/30014, G06F9/3851, G06F9/3867, G06F9/30094, G06F9/3812European ClassificationG06F9/38B6, G06F9/30B, G06F9/30A1A, G06F9/38P, G06F9/38E4Legal EventsDateCodeEventDescriptionFeb 5, 2007ASAssignmentOwner name: HARMAN INTERNATIONAL INDUSTRIES, INCORPORATED, CALFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PENNOCK, JAMES D.;BAKER, RONALD;PARKER, BRIAN R.;AND OTHERS;REEL/FRAME:018851/0112Effective date: 20061107May 8, 2009ASAssignmentOwner name: JPMORGAN CHASE BANK, N.A.,NEW YORKFree format text: SECURITY AGREEMENT;ASSIGNORS:HARMAN INTERNATIONAL INDUSTRIES, INCORPORATED;BECKER SERVICE-UND VERWALTUNG GMBH;CROWN AUDIO, INC.;AND OTHERS;REEL/FRAME:022659/0743Effective date: 20090331Feb 15, 2011ASAssignmentOwner name: HARMAN BECKER AUTOMOTIVE SYSTEMS GMBH, CONNECTICUTFree format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:025795/0143Effective date: 20101201Owner name: HARMAN INTERNATIONAL INDUSTRIES, INCORPORATED, CONFree format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:025795/0143Effective date: 20101201Feb 17, 2011ASAssignmentOwner name: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENTFree format text: SECURITY AGREEMENT;ASSIGNORS:HARMAN INTERNATIONAL INDUSTRIES, INCORPORATED;HARMAN BECKER AUTOMOTIVESYSTEMS GMBH;REEL/FRAME:025823/0354Effective date: 20101201Nov 14, 2012ASAssignmentOwner name: HARMAN INTERNATIONAL INDUSTRIES, INCORPORATED, CONFree format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:029294/0254Effective date: 20121010Owner name: HARMAN BECKER AUTOMOTIVE SYSTEMS GMBH, CONNECTICUTFree format text: RELEASE;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:029294/0254Effective date: 20121010Jun 8, 2015FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services