This patent application is related to U.S. Patent Publication Number US 2001/0049816 to Adaptive Silicon, Inc., entitled “Multi-Scale Programmable Array,” which is incorporated herein by reference in its entirety for all purposes.
1. Field of the Invention
The present invention relates generally to processors, and more particularly to programmable microprocessor systems.
2. Background of the Invention
Designing processor systems can be a daunting task. Moreover, the suitability of a processor for a given application is not always ideal. Unfortunately, it is a difficult and expensive task to modify an existing processor design. Also, redesigning a processor to have additional features to cover a plurality of applications is a difficult and costly endeavor. Additionally, it is not always possible to know all of the target applications that a processor may be architected for when the processor is designed.
Instead of attempting to modify a processor, many designers choose to execute a pure software solution for certain aspects of various applications. However, using software typically results in a lower performing final solution.
Other designers opt to instill some of the processing special purpose hardware, such as a coprocessor, that they design for the application(s). However, this approach costs valuable time in transferring data to and from the special purpose hardware.
Prior art attempts at extending processor instruction sets pre-silicon (before fabrication) have been made. One example is the Intel MMX processor. Other examples include media processing, graphics processing, digital signal and image processing (DSP), and networks processors. Many different processors must be designed for many different applications, and this is an expensive endeavor.
Thus, an improved system and method for designing processors is desired that exhibits valuable performance gains when targeting a variety of applications.
The present invention provides, in various embodiments, an extension adapter. In one embodiment, a processor system comprises a processor having a first set of instructions associated therewith. The processor system also comprises a programmable logic device and an extension adapter coupled to the processor and the programmable logic device. The extension adapter allows the programmable logic device to implement a second set of reconfigurable instructions for the processor.
In another embodiment, a method is provided of interfacing a processor with a programmable logic device. The method comprises coupling the processor to the programmable logic device via an extension adapter. The processor has a first set of instructions associated therewith. The method further comprises programming a second set of reconfigurable instructions for the processor. The second set of reconfigurable instructions are contained in the programmable logic device. The method also comprises programming the extension adapter to facilitate an interaction between the processor and the second set of reconfigurable instructions.
A further understanding of the nature and advantages of the inventions herein may be realized by reference to the remaining portions of the specification and the attached drawings.
As shown in the exemplary drawings wherein like reference numerals indicate like or corresponding elements among the figures, embodiments of a system and method according to the present invention will now be described in detail. The following description sets forth an example of an extension adapter and related method.
Detailed descriptions of various embodiments are provided herein. It is to be understood, however, that the present invention may be embodied in various forms. Therefore, specific details disclosed herein are not to be interpreted as limiting, but rather as a basis for the claims and as a representative basis for teaching one skilled in the art to employ the present invention in virtually any appropriately detailed system, structure, method, process or manner.
As previously mentioned, designing processors can be problematic. For example, it may not be feasible to optimize for every potential application when designing a processor. It is desirable to create a processor that can be customized post-silicon to meet specific application needs.
Referring now to the drawings,
ISEF 116 includes programmable logic and provides instruction extension capabilities. This programmable logic array houses user-functionality that can be altered post-silicon. This functionality effectively extends the instruction set of embedded processor 112 by adding new instructions that are tailored to a user's specific needs. The logic in ISEF 116 typically runs at a slower clock speed than embedded processor 112. Typically, the cycle length is a multiple of the embedded processor 112 clock cycle.
One purpose of extension adapter 114 is to interface embedded processor 112 with ISEF 116. Extension adapter 114 can be implemented in ASIC logic. Extension adapter 114 includes logic that bridges the gap between embedded processor 112 and ISEF 116. ISEF 116 has further interface(s) 118 for purposes such as testability. Extension adapter 114 plus ISEF 116 provide logic that allows users to modify the base functionality of the system within which it is being used. The modification is in the form of new instructions that extend the base instruction set defined by embedded processor 112. It is noteworthy that the instruction execution itself is implemented in one or more of ISEF 116, which are programmable logic similar to FPGAs in one embodiment. Extension adapter 114 interfaces one or more ISEFs 116 to embedded processor 112 and controls dataflow.
Embedded processor 112 has a built-in knowledge of what instructions exist and are valid. This would include typical add instructions, subtract instructions, multiply instructions, load instructions, store instructions, other load/store module 210 functionality, etc. These instructions are hard-coded into the silicon and require no software adaptation.
Referring to
Load/store module 210 is created via a compiler, such as, for example, the Tensilica Instruction Extension (TIE) compiler, which can be obtained from Tensilica, Inc., of Santa Clara, Calif. TIE is a language that allows a user to describe the functionality of new extended instructions. A designer uses TIE to create a standard set of functions that extend the normal functionality of embedded processor 112. The TIE code that a designer writes describes the functionality of a series of resources that aid in the interface between embedded processor 112 and ISEF 116. Users can therefore add new instructions pre-silicon. Extension adapter 114 functions so that embedded processor 112 treats user-defined post-silicon instructions as if they were legal TIE pre-silicon (for example) instructions.
Load/store module 210 interfaces with embedded processor 112 via interface 214. Register file 220 is coupled to interface 214 via embedded processor control and data interface 221 and via ISEF 116 control and data interface 223. Adapter controller 212 interfaces with embedded processor 112 via interface 216. Adapter controller 212 interfaces with ISEF 116 via interface 218.
In an exemplary embodiment according to the present invention, load/store module 210 comprises register file 220. Register file 220 is a register file, or collections of registers, that is added by using, for example, the TIE compiler. Register file 220 interfaces with adapter controller 212 via interface 224. In one embodiment, register file 220 is 128 bits wide. In another embodiment, register file 220 is 64 bits wide. However, register file 220 can be of varying widths. It is contemplated that the system can comprise one or more than one register file 220. Adapter controller 212 accesses register file 220. Adapter controller 212 is then used to interface with ISEF 116.
Load/store module 210 provides fixed instruction functionality. A set of fixed instructions includes instructions for moving data to and from external memory into and out of register file 220. This collection of functionality is defined in the TIE language, and run through Tensilica's TIE compiler, in one embodiment. It is contemplated that languages other than TIE can be used with the present system. Load/store module 210 contains one or more register files 220 and a set of fixed instructions that give register files 220 access to external memory via load and store instructions. Again, these instructions will be fixed once the silicon is created, and are fully implemented using the standard TIE flow. It is a function of the extension adapter 114 to encapsulate the fixed functionality and manage it with the configurable interface logic.
A purpose of load/store module 210 includes declaring the functionality of register file 220, which is basically temporary storage for data that is going to end up being transferred from embedded processor 112 to ISEF 116. Load/store module 210 defines not only register file 220, but also how to load and store generic instructions (e.g., Tensilica instructions) of embedded processor 112 into register file 220.
Adapter controller 212 performs the function of interfacing with register file 220. Adapter controller 212 also operates on the data from register file 220 and interfaces register file 220 with ISEF 116.
In one exemplary methodology, a user uses standard embedded processor 112 load and store instructions to load data into register file 220. A user then uses ISEF 116 instructions, controlled by extension adapter 114, to bring the data out of register file 220, send the data to ISEF 116 (computations take place here that are managed by extension adapter 114 in terms of control and managed by ISEF 116 in terms of functionality), and then take the data that comes back from ISEF 116 at some time later and send the data into register file 220. Subsequently, store instructions are used to send the data out to memory via interface 214.
What ISEF 116 and adapter controller 212 do to extend ISEF 116 is allow a user to add new instructions that change with software on different implementations of the same silicon. For example, a user can add specialized instructions to perform video or audio encoding/decoding. These instructions are not hard-wired into embedded processor 112. Therefore, a purpose of extension adapter 114 is to bridge the gap between what embedded processor 112 knows at the time of silicon (e.g., adds, subtracts, loads, stores, etc.) and new instructions that a user (e.g., customer, etc.) adds after receiving the silicon and may in fact change over time, while still using the same piece of silicon. These new instructions are managed in adapter controller 212 of extension adapter 114.
It is noteworthy that extension adapter 114 handles the multiplexing of data among register file(s) 220 and ISEF(s) 116. Extension adapter 114 manages the timing relationships between register reads and register writes, which are functions of instruction execution length.
It is also noteworthy that the processor system comprises means for ensuring proper configuration of ISEF 116 before use of ISEF 116. In one example, if the system tries to execute an instruction not included in the instruction set of embedded processor 112 that has yet to be configured in ISEF 116, the means for ensuring, which comprises hardware in one embodiment, generates an exception. It is also envisioned that the means for ensuring can comprise software or a combination of hardware and software.
In keeping with some embodiments according to the present invention,
Configuration memory 310 then outputs configuration information about the instruction. If the instruction description describes a normal add, subtract, etc., then configuration memory 310 does not do anything with the instruction because the instruction is part of the normal instruction space of embedded processor 112. However, if the instruction is one of the specialized instructions that ISEF 116 is to perform then configuration memory returns configuration information 314 back to embedded processor 112 to indicate this is a valid instruction and extension adapter 114 in the future will take care of the data manipulation so that to embedded processor 112 it appears that the instruction is identical in form to a standard instruction of embedded processor 112.
Information 314 is a series of information coming out of configuration memory 310, some of which goes to embedded processor 112 via interface 316. Some of information 314 goes into register file 220. Information 314 going into register file 220 as ReadAddr 510 (read address) is carried on interface 224. The information coming out of register file 220 as ReadData 516 (read data) is also carried on interface 224. In this example, configuration information 314 includes the address to the register file for the data that a new instruction needs to receive to be sent out to ISEF 116 via interface 218. So configuration information 314 provides the address and the data goes out to ISEF 116 in the next instruction/cycle. Interface 316 is a collection of outputs leading back to embedded processor 112.
In further keeping with some embodiments according to the present invention,
Exemplary timing related to interface 214, 216 between embedded processor 112 and extension adapter 114 is highlighted by InstrValid (instruction valid) 410 and InstrEnc (instruction encoding) 412. InstrValid 410 indicates whether or not embedded processor 112 is providing a valid instruction. If there is a valid instruction then InstrEnc 412 indicates the instruction number. In one embodiment, there is only one instruction per cycle within embedded processor 112. Other embodiments of embedded processor 112 can issue multiple instructions per cycle.
In one embodiment, the first thing extension adapter 114 does is look in its configuration memory 310 and determine whether or not this instruction is in fact destined for ISEF 116. If the instruction is destined for ISEF 116, then extension adapter 114 drives a response back on a bus to embedded processor 112 in the form of a signal XadInstrMatch 414 (extension adapter instruction match) that indicates this is a valid instruction. The signal XadInstrMatch 414 indicates that the instruction is an instruction that extension adapter 114 is going to handle and that the results will go back to embedded processor 112.
Referring to
In operation according to one embodiment, ReadData 516 is sent to ISEF 116 and some period of time occurs before WriteData 518 is returned. It is noteworthy that this period of time can be of varying lengths. The system prepares for that write (which will be written at a future time) by setting the define cycle number (WriteDef 512) and the address (WriteAddr 514) and sending WriteAddr 514 to register file 220. Register file 220 then takes ReadAddr 510 and retrieves ReadData 516 from register file 220. After ReadData 516 is sampled it is sent to ISEF 116.
Referring to
Typically, ReadData and ReadAddr each comprise multiple pieces of data. In other words, there are typically multiple read addresses and multiple read data. Instead of there being just one piece of data, there are multiple entries in configuration memory 310 that correspond to particular addresses for register file 220. Data corresponding to particular addresses is sent to ISEF 116. In one embodiment, ReadData and ReadAddr are not restricted to describe simply one transfer. First, a plurality of read buses can be defined connecting the register files to ISEFs 116. Second, each data bus can be subdivided into a plurality of segments, each independently controlled with separate addresses (alternatively, they can be managed as a whole). The read data of the segments is gathered together on a bus and delivered as a unit. Similarly, a plurality of write buses can each be subdivided and controlled as independent segments or as a whole. Write operations in ISEF 116 take a variable amount of time, defined by WriteDef 512. When the data returns from ISEF 116 it is delivered to the register files, managed at a subdivided level or as a whole. Therefore, one purpose of extension adapter 114 is to monitor this interface, monitor the timing and align data such that data gets sent back to the register files (e.g., register file 220) at the appropriate time.
Referring to
Configuration memory 310 also comprises information to control register file 220. For example, three bits of information are shown in
Instruction 710 creates a configuration memory 310 address and a lookup is performed to determine the contents of configuration memory 310. If the Configuration Valid bit, ConfigValid 712, is true, as well as some other fields (bits) 719 of instruction 710 are true, as determined by logic, then we know that instruction 710 is a valid instruction going back to embedded processor 112 via feedback XadlnstrMatch 414. It is noteworthy that the instruction extension language used herein may be, for example, the TIE language.
There is a predefined space in opcode for any instruction that could potentially be an ISEF 116 instruction. Every bit has a value of either true, false or “don't care” for the instruction that has to be satisfied. For example, each of 24 bits of an instruction has to be either true, false or “don't care.” If bits 719 are true then the opcode space is enabled stating that this instruction is a legal ISEF-type instruction. So the configuration valid bit, ConfigValid 712, comes into AND gate 724 and gets ANDed, via AND gate 724, with bits 719. However, utilization of AND gate 724 is not necessary. A match between the opcode bits and ConfigValid 712 bit should be true for XadInstrMatch 414 to be true.
Bits 719 being true indicate that the output space is enabled for ISEF 116 and ConfigValid 712 being true means configuration memory 310 indicates instruction 710 is a valid instruction. In one embodiment, 64 instructions are allocated in the opcode space for ISEF 116. However, more or fewer instructions are contemplated. Whether or not a particular instruction is true is determined by ConfigValid bit 712 in combination with logic (the decoding of space enable—the opcode space being enabled).
At least one (e.g., three, etc.) ReadAddr (read address) 510 value comes from instruction 710 and is coupled to control register file 220. At least one ReadData (read data) 516 value comes out of register file 220 and is coupled to ISEF 116.
Two important pieces of data that come out of configuration memory 310 for each instruction include WriteDef 716 (at what cycle this particular write is going to be completed) and WriteAddr 514 (where the data is to be written back into register file 220). In this example there are three write ports for register file 220; however, it is contemplated that there can be more or fewer write ports. We have to have some amount of control to remember the cycle in which the data is coming back from ISEF 116 so that the system inserts the data into write data pipeline 730 for register file 220. Write pipeline 730 is shown as a series of registers 732 coupled to one another via a series of pipeline MUXs 734 that control either the value passing down write data pipeline 730 or the value, ISEF write data 736, coming back from ISEF 116.
Write data pipeline 730 is advanced every cycle with the data marching down the pipeline appropriately as the data is only inserted into the pipeline when the data is valid coming back from ISEF 116. Moreover, insertion of that data is managed by write data control module 738 whose output is managing selection of MUXs 734. This pipeline depth is a fixed number of registers 732. The number of registers 732 can vary between different embodiments according to the present invention. The data is inserted in the appropriate place but it is marched down to a fixed number and then written to register file 220. The ability to flexibly control the insertion point of write data into a register file pipeline by software, as contemplated herein, is not known in the prior art. Typically, in the prior art, pipeline depths of coprocessors and functional units are fixed at design time and are not configurable post-silicon. It is envisioned that, in the present system, pipeline depths of coprocessors and functional units are not necessarily fixed at design time and are configurable post-silicon.
In keeping with some embodiments according to the present invention, in coordination with the advancing of write data pipeline 730 is write address pipeline 740. Write address pipeline 740 comprises registers 742. WriteAddr 514 is coming out of configuration memory 310 and is inserted into write address pipeline 740. In this case there are no MUXs because there is no new information that comes along. The address is known at the beginning of the instruction.
It is noteworthy that both a two-port (one embedded processor 112 and one ISEF 116) solution and a three-port (one embedded processor 112 and two ISEFs 116) solution will work. Other numbers of ports are contemplated as well.
Arriving data, on either pipeline, enters the pipeline at the appropriate stage, then marches through the pipeline until it reaches the maximum for that pipe. At the end of the pipeline, the data is actually written into register files 721 (the register file core). The dual pipeline facilitates forwarding a result from a first instruction to a second instruction.
This implementation involves two write ports to register files 721, where only one was involved in the past. This is because there is no guarantee, with this design, that there will not be two writes into embedded processor 112 simultaneously.
What is not shown is the control that surrounds the write pipeline. This control includes pipelining the following information: the control for the arrival of write data; the write enable for the pipe; and the write address.
It is noteworthy with respect to control flow that, when switching control information from embedded processor 112 clock domain to ISEF 116 clock domain, control information is latched and created in embedded processor 112 clock domain. The information is staged two cycles, according to one embodiment, before it can “enter” ISEF 116 clock domain.
It is also noteworthy to examine the write enable for ISEF 116 domain. Since, in one embodiment, embedded processor 112 pipeline is substantially shorter than ISEF 116 pipeline (note that the true depth difference is not known without knowing the clock ratio, which is programmable), a write that is posted on embedded processor 112 pipeline after a write posted on ISEF 116 pipeline will likely be written into the register files 721 before the ISEF 116 pipeline write has committed. This means that ISEF 116 write data should be quashed before it enters register files 721. This mechanism is handled by special control logic, referred to as suppress logic, which checks ISEF 116 pipeline for an address match with an embedded processor 112 pipeline write (at the time of its commit). If there is a match, then the ISEF 116 pipeline write is nullified before it reaches the embedded processor 112.
Prior art solutions require that data from a PLD be integrated into a single pipeline, which is managed by a processor clock. Although there need not be any suppress logic, there are disadvantages to the prior art techniques, described herein.
In the current embodiment, functional differences from the prior art include the ability to aggregate data in an environment where the data arrives from two different, but related, clock domains.
Structural differences from the prior art include two split pipelines of different lengths and with different clocks. Suppress logic is used to account for the different lengths.
One disadvantage of prior art techniques is that the attach point for PLD data is a function of the clock ratio. The processor clock cycle for data entering the write pipeline must be calculated with the ratio in mind, in the prior art. This means that changing the ratio must be architected up front. The current system does not suffer from this drawback.
Another disadvantage of the prior art relates to the depth of the pipeline. For a ratio of three processor clock cycles to one PLD cycle, for example, three processor clock registers are required for each new piece of data in the pipeline, in the prior art.
Another advantage of the present system is speed. The read data that is sent into the datapath will come from either the output of the register file read ports, or the write pipelines themselves. It will come from the write pipeline if the data that is being requested has not been written into embedded processor 112 yet. This implies a MUX in front of each read port. The width of this MUX can be calculated to be the depth of the write pipeline plus one (for embedded processor 112 read port). Prior art designs (with a 31-stage write pipeline) would require a 32:1 MUX for this purpose. The present system, in one embodiment, implements a 13:1 MUX (nine for ISEF 116 pipeline, plus three for embedded processor 112 pipeline, plus one for embedded processor 112 read port), which should be approximately twice as fast.
In further keeping with some embodiments according to the present invention,
Referring to
Referring to
Subsystems within computer system 1106 are directly interfaced to an internal bus 1110. The subsystems include an input/output (I/O) controller 1112, a system random access memory (RAM) 1114, a central processing unit (CPU) 1116, a display adapter 1118, a serial port 1120, a fixed disk 1122 and a network interface adapter 1124. The use of bus 1110 allows each of the subsystems to transfer data among the subsystems and, most importantly, with CPU 1116. External devices can communicate with CPU 1116 or other subsystems via bus 1110 by interfacing with a subsystem on bus 1110.
One embodiment according to the present invention is related to the use of an apparatus, such as computer system 1106, for implementing a system according to embodiments of the present invention. CPU 1116 can execute one or more sequences of one or more instructions contained in system RAM 1114. Such instructions may be read into system RAM 1114 from a computer-readable medium, such as fixed disk 1122. Execution of the sequences of instructions contained in system RAM 1114 causes the CPU 1116 to perform process steps, such as the process steps described herein. One or more processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in the memory. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The terms “electronically-readable medium,” “electronically-readable media,” “computer-readable medium” and “computer-readable media” as used herein refer to any medium or media that participate in providing instructions to CPU 1116 for execution. Such media can take many forms, including, but not limited to, non-volatile media, volatile media and transmission media. Non-volatile media include, for example, optical or magnetic disks, such as fixed disk 1122. Volatile media include dynamic memory, such as system RAM 1114. Transmission media include coaxial cables, copper wire and fiber optics, among others, including the wires that comprise one embodiment of bus 1110. Transmission media can also take the form of acoustic or light waves, such as those generated during radio frequency (RF) and infrared (IR) data communications. Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, a hard disk, magnetic tape, any other magnetic medium, a CD-ROM disk, digital video disk (DVD), any other optical medium, punch cards, paper tape, any other physical medium with patterns of marks or holes, a RAM, a PROM, an EPROM, a FLASHEPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer can read.
Various forms of computer-readable media may be involved in carrying one or more sequences of one or more instructions to CPU 1116 for execution. Bus 1110 carries the data to system RAM 1114, from which CPU 1116 retrieves and executes the instructions. The instructions received by system RAM 1114 can optionally be stored on fixed disk 1122 either before or after execution by CPU 1116.
The above description is illustrative and not restrictive. Many variations of the invention will become apparent to those of skill in the art upon review of this disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the appended claims along with their full scope of equivalents.
Number | Name | Date | Kind |
---|---|---|---|
4635261 | Anderson et al. | Jan 1987 | A |
4766569 | Turner et al. | Aug 1988 | A |
4783738 | Li et al. | Nov 1988 | A |
4893311 | Hunter et al. | Jan 1990 | A |
5055997 | Sluijter et al. | Oct 1991 | A |
5247689 | Ewert | Sep 1993 | A |
5258668 | Cliff et al. | Nov 1993 | A |
5260610 | Pedersen et al. | Nov 1993 | A |
5260611 | Cliff et al. | Nov 1993 | A |
5274581 | Cliff et al. | Dec 1993 | A |
5274782 | Chalasani et al. | Dec 1993 | A |
5293489 | Furui et al. | Mar 1994 | A |
5299317 | Chen et al. | Mar 1994 | A |
5343406 | Freeman et al. | Aug 1994 | A |
5357152 | Jennings, III | Oct 1994 | A |
5361373 | Gilson | Nov 1994 | A |
5414377 | Freidin | May 1995 | A |
5426378 | Ong | Jun 1995 | A |
5436574 | Veenstra | Jul 1995 | A |
5471628 | Phillips et al. | Nov 1995 | A |
5488612 | Heybruck | Jan 1996 | A |
5517627 | Petersen | May 1996 | A |
5535406 | Kolchinsky | Jul 1996 | A |
5619665 | Emma | Apr 1997 | A |
5636224 | Voith et al. | Jun 1997 | A |
5652875 | Taylor | Jul 1997 | A |
5682493 | Yung et al. | Oct 1997 | A |
5684980 | Casselman | Nov 1997 | A |
5696956 | Razdan et al. | Dec 1997 | A |
5726584 | Freidin | Mar 1998 | A |
5742180 | DeHon et al. | Apr 1998 | A |
5784636 | Rupp | Jul 1998 | A |
5794062 | Baxter | Aug 1998 | A |
5819064 | Razdan et al. | Oct 1998 | A |
5822588 | Sterling et al. | Oct 1998 | A |
5828835 | Isfeld et al. | Oct 1998 | A |
5847578 | Noakes et al. | Dec 1998 | A |
5850564 | Ting et al. | Dec 1998 | A |
5920202 | Young et al. | Jul 1999 | A |
5926036 | Cliff et al. | Jul 1999 | A |
5943150 | Deri et al. | Aug 1999 | A |
5956518 | DeHon et al. | Sep 1999 | A |
5963050 | Young et al. | Oct 1999 | A |
5977793 | Reddy et al. | Nov 1999 | A |
5982195 | Cliff et al. | Nov 1999 | A |
5986465 | Mendel | Nov 1999 | A |
5999734 | Willis et al. | Dec 1999 | A |
6026478 | Dowling | Feb 2000 | A |
6092174 | Roussakov | Jul 2000 | A |
6167502 | Pechanek et al. | Dec 2000 | A |
6219628 | Kodosky et al. | Apr 2001 | B1 |
6237079 | Stoney | May 2001 | B1 |
6292388 | Camarota | Sep 2001 | B1 |
6343337 | Dubey et al. | Jan 2002 | B1 |
6353841 | Marshall et al. | Mar 2002 | B1 |
6374403 | Darte et al. | Apr 2002 | B1 |
6415424 | Arimilli et al. | Jul 2002 | B1 |
6418045 | Camarota | Jul 2002 | B2 |
6426648 | Rupp | Jul 2002 | B1 |
6467009 | Winegarden et al. | Oct 2002 | B1 |
6505241 | Pitts | Jan 2003 | B2 |
6557092 | Callen | Apr 2003 | B1 |
6622233 | Gilson | Sep 2003 | B1 |
6633181 | Rupp | Oct 2003 | B1 |
6698015 | Moberg et al. | Feb 2004 | B1 |
6721884 | De Oliveira Kastrup Pereira et al. | Apr 2004 | B1 |
6732354 | Ebeling et al. | May 2004 | B2 |
6744274 | Arnold et al. | Jun 2004 | B1 |
6795900 | Miller et al. | Sep 2004 | B1 |
6799236 | Dice et al. | Sep 2004 | B1 |
6817013 | Tabata et al. | Nov 2004 | B2 |
6831690 | John et al. | Dec 2004 | B1 |
6857110 | Rupp et al. | Feb 2005 | B1 |
6874110 | Camarota | Mar 2005 | B1 |
6883084 | Donohoe | Apr 2005 | B1 |
6954845 | Arnold et al. | Oct 2005 | B2 |
6968544 | Schneider | Nov 2005 | B1 |
6986127 | Newlin et al. | Jan 2006 | B1 |
6996709 | Arnold et al. | Feb 2006 | B2 |
7000211 | Arnold | Feb 2006 | B2 |
7062520 | Rupp | Jun 2006 | B2 |
7086047 | Edwards et al. | Aug 2006 | B1 |
7178062 | Dice | Feb 2007 | B1 |
7254142 | Hagsand et al. | Aug 2007 | B2 |
20010049816 | Rupp | Dec 2001 | A1 |
20030046513 | Furuta et al. | Mar 2003 | A1 |
20030097546 | Taylor | May 2003 | A1 |
20030108119 | Mohebbi et al. | Jun 2003 | A1 |
20030120889 | Roussel et al. | Jun 2003 | A1 |
20030196058 | Ramagopal et al. | Oct 2003 | A1 |
20040019765 | Klein, Jr. | Jan 2004 | A1 |
20040186872 | Rupp | Sep 2004 | A1 |
20040193852 | Johnson | Sep 2004 | A1 |
20040208602 | Plante | Oct 2004 | A1 |
20050027970 | Arnold et al. | Feb 2005 | A1 |
20050027971 | Williams et al. | Feb 2005 | A1 |
20050166038 | Wang et al. | Jul 2005 | A1 |
20050268271 | Gutberlet et al. | Dec 2005 | A1 |
Number | Date | Country |
---|---|---|
0 507 507 | Jul 1992 | EP |
0 668 659 | Aug 1995 | EP |
1 443 417 | Aug 2004 | EP |
478252 | Mar 2002 | TW |
480818 | Mar 2002 | TW |
152355 | Jul 2002 | TW |
152994 | Jul 2002 | TW |
509798 | Nov 2002 | TW |
168210 | Apr 2003 | TW |
Number | Date | Country | |
---|---|---|---|
20040193852 A1 | Sep 2004 | US |