This invention relates to a technique for providing configurable instruction sequence generation, and more particularly to a technique for using virtual instructions to generate a sequence of instructions to be executed by a processor.
Reduced instruction set computer (RISC) architectures were developed as industry trends tended towards larger, more complex instruction sets. By simplifying instruction set designs, RISC architectures make it easier to use techniques such as pipelining and caching, thus increasing system performance. By focusing on speed and simplicity of design, rather than instruction semantics, RISC architectures often result in larger executable code size than comparable complex instruction set computer (CISC) architecture machines. For example, a task that may be represented as one complex instruction in a CISC architecture may take two or more instructions in a RISC architecture. However, the performance gains resulting from increased clock speeds and increased pipelining that may be attained with a RISC architecture usually outweigh any increase in executable code size.
RISC architectures usually have fixed-length instructions (e.g., 16-bit, 32-bit, or 64-bit), with few variations in instruction format. For example, each instruction in an instruction set architecture (ISA) may have the source registers in the same location. For example, a 32-bit ISA may have source registers specified always by bits 16-20 and 21-25. This allows the specified registers to be fetched for every instruction without requiring any complex instruction decoding.
In one general aspect, an instruction set architecture includes a virtual instruction for generating a sequence of underlying machine instructions. A virtual instruction includes an opcode that identifies the instruction as a virtual instruction. The virtual instruction, having zero or more virtual parameters, is associated with a sequence of instructions.
Implementations may include a virtual instruction index within a virtual instruction code. The index may identify one virtual instruction from multiple available virtual instructions. Some implementations may provide virtual parameters, each of which includes a predetermined number of bits; or each of which includes either a first predetermined number of bits or a second predetermined number of bits. For example, one implementation may provide three-bit and five-bit virtual parameters.
Each virtual instruction is associated with a sequence of instructions to execute. Each instruction in the sequence may include an instruction template identifying an instruction to be performed, a parameter selector identifying a dynamic parameter substitution, and other control information relating to the execution of that instruction within the sequence. Implementations may include one or more of the following substitutions: a parameter field, such as a register specifier, may be replaced by a virtual parameter; an opcode field may be replaced by a virtual parameter; an immediate field may be replaced by a virtual parameter; an immediate field may be replaced with a sign-extension of a virtual parameter; and an immediate field may be replaced with sign-extended or unextended concatenations of one or more virtual parameters.
The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features and advantages will be apparent from the description and drawings, and from the claims.
A virtual instruction is an instruction that is not executed directly by a processor. Rather, a virtual instruction causes a sequence of one or more instructions to be generated. The generated instructions then are executed by the processor. Virtual instructions may be used to provide more complex instructions in an ISA.
For example, a standard ISA may not have an operation for adding three numbers together and storing the result in a register. A particular application using the ISA may repeatedly add three numbers. The developers of a processor for the particular application may not wish to modify the processor entirely, yet significant code compaction may be obtained by providing an instruction for adding three numbers. A virtual instruction called “ADD3” that adds three numbers may be provided. Whenever the “ADD3” instruction is fetched, the system identifies the instruction as a virtual instruction and generates a corresponding sequence of instructions to add three numbers.
Virtual instructions provide a mechanism to implement a configurable instruction set architecture so that application-specific instructions or other specialized instructions may be added to an instruction set without redesigning or modifying a processor core.
Referring to
Because some operations, such as floating point calculations and integer multiply/divide, cannot be performed in a single clock cycle, some instructions merely begin execution of an operation. After sufficient clock cycles have passed, another instruction may be used to retrieve a result. For example, an integer multiply instruction may take, for example, five clock cycles. One instruction may initiate the multiplication calculation, and another instruction may load the results of the multiplication into a register.
Virtual instructions help to offset costs that may be associated with the simplicity, elegance, and adherence to design principles provided by RISC architectures. Because multiple RISC instructions often are used instead of a single complex instruction, the overall size of executables is larger for RISC architectures than for others. Because computer storage is usually inexpensive, the increased storage costs are rarely a factor. However, in some applications, such as smart cards and application specific integrated circuits (ASICs), the available memory may be limited. In applications such as these, virtual instructions provide a mechanism for reducing the size of executables without significantly reducing pipeline efficiency.
Virtual instructions also offer benefits in consumer electronics, such as wireless telephones, global positioning system receivers, electronic games, and personal digital assistants, which have contributed to the growth of the embedded CPU market. Instead of building devices from commercially available, general-purpose components, manufacturers have increasingly turned to designs based on application-specific integrated circuits (ASICs). When CPU cores are embedded on chips complete with on-board caches and memory, the amount of storage space may be limited. Virtual instructions help to decrease the size of executables by adding the capability of executing complex instructions.
For example, a developer may need a compact code solution for embedded control applications. Some CISC products may include 32-bit instructions capable of setting, clearing, or testing a single bit in memory or input/output (I/O) space. While it generally may not be desirable to include such operations within a RISC processor core, virtual instructions provide a general mechanism in a RISC ISA that allows developers to add complex instructions appropriate to specific applications.
Referring to
In
Instruction expansion store 220 may be implemented as a data structure containing one or more rows of data. Each row within the data structure may include an instruction to be executed as well as a dynamic parameter selector and other control information. For example, the exemplary instruction expansion store 220 shown in
A virtual program counter (PC) 230 stores the address or offset of the current instruction within the instruction expansion store 220. For example, when a virtual instruction begins execution, the start address for the corresponding instruction sequence is loaded into the virtual PC 230. As each instruction is executed, virtual PC 230 may be updated to step through the instruction expansion store 220 until the last instruction within a sequence is generated.
The last instruction within a virtual instruction expansion may be indicated in many ways. For example, information stored along with the dynamic parameter selector may be used to indicate the end of an instruction sequence. For example, if a 32-bit word is used to direct dynamic parameter substitution, one or more bits may be used to indicate that the instruction is the last within an expansion. Additionally, a new instruction may be used to indicate that the last instruction has been reached.
Substitution logic 240 is used to substitute parameters from virtual instruction 200 into instruction templates from instruction expansion store 220. The resulting instruction then may be passed on to the decode stage 250 of the processor.
Additional implementations may not use a virtual start table 210. If only a single virtual instruction is provided, or if virtual instruction expansion information is stored in a fixed or known location, then the extra level of indexing provided by virtual start table 210 may be unnecessary. In such implementations, index 201 also may not be needed, and an opcode may be sufficient to identify a particular virtual instruction and to locate the beginning of corresponding instructions within instruction expansion store 220.
Referring to
During execution of a virtual instruction, the virtual instruction is held in the instruction fetch stage of the pipeline, and the PC, as opposed to the virtual PC, remains fixed at the address of the virtual instruction, while the fetch logic passes a fixed sequence of instructions to the decode stage of the pipe. When the last instruction has been issued, the PC can advance. As the entire sequence takes place at the same PC, conventional branches which manipulate the PC may not take place internal to the virtual instruction sequence—though a virtual instruction sequence could conceivably terminate with a control transfer. Conditional execution within a virtual instruction may be handled in terms of conditional moves or other predicated execution mechanisms. In the simplest implementation, any exceptions taken during the execution of the virtual instruction sequence use the address of the virtual instruction as the value of the exception return address (EPC) register or error PC, and restart the virtual instruction sequence from the beginning after completion of any exception handling. For this reason, it may be desirable to use virtual instructions that are fully restartable at any point in their execution.
Additional implementations may allow branching within a virtual instruction expansion. For example, one virtual instruction implementation may provide specific instructions for branching within a virtual instruction sequence, allowing branching within the expansion of a virtual instruction. Another implementation may redefine the semantics of branch instructions so that when conventional branch instructions are encoded within a virtual instruction expansion they exhibit different behavior. Other virtual instruction branching schemes will be apparent.
In the following discussion, “VINSTR” is used as the name for application-specific virtual instructions. Generic compiler tools may assemble and disassemble the instruction by that name, but tools also may give application-specific names to various VINSTR instantiations. For example, the generic VINSTR instruction includes the parameters as shown in
Additional implementations may encode a virtual instruction using a code to specify the virtual instruction expansion to be performed, and one or more parameters. As will be discussed below with reference to parameter selection, there is a trade-off between compactness, complexity, and flexibility of parameter substitutions.
Referring to
Next, the system uses the start address referenced by virtual PC 230 to lookup an instruction within instruction expansion store 220 (step 4006). For example, the virtual PC 230 shown in
In some implementations, the parameter selector may support predicated execution of instructions within a virtual instruction expansion. Predicated execution may be implemented by using a parameter selector to indicate whether an instruction should be suppressed based on, for example, one or more virtual instruction parameters. In such an implementation, an instruction template, such as the “ADDI $7, 0” shown in
The resulting instruction is returned as the result of IF stage 1001. The processor then executes this instruction (step 4009). Finally, the system determines if this was the last instruction within a virtual instruction sequence (step 4010). If there are additional instructions, the virtual PC is updated (step 4011) and the next instruction is loaded (step 4006). If there are no additional instructions, then the PC is updated (step 4012). In this implementation, the PC is not updated until the entire virtual instruction sequence is complete.
To support dynamic parameter substitution, the virtual instruction expansion store may contain more than just the sequence of 32-bit instructions to be presented to the pipeline. Additional information may be provided to indicate when, and how, parameters should be substituted for the literal content of fields within each 32-bit instruction.
Implementations may support any combination of the following dynamic parameter substitutions: (1) replacement of a parameter field with a translated or untranslated VINSTR parameter field; (2) replacement of an immediate field with a sign-extension of a VINSTR parameter field; (3) replacement of a portion of an immediate field with a VINSTR parameter field; (4) replacement of an immediate field with sign-extended or unextended concatenations of parameter fields; and/or (5) replacement of an instruction opcode or subopcode with a translated or untranslated VINSTR parameter.
One dynamic parameter substitution that may be provided is to replace a selected register field with a virtual instruction parameter. For example, an “ADD” instruction may have three parameters: “RS”, “RT”, and “RD”. The instruction causes the contents of the register specified by RS to be added to the contents of the register specified by RT and then stored in the register specified by RD. In virtual instruction 200, two parameters are specified, one parameter 202 having 3 bits and one parameter 203 having 5 bits. One implementation provides 32 registers, each register specified by 5 bits. In this example, parameter 202 may be translated to a 5-bit register specification. For example, one translation may be to append “00” to the beginning of the three-bit value, allowing only registers 0 to 8 to be specified.
Additional translations may be used. However, it may be necessary to limit certain expansions to certain parameter fields in order to reduce the combinatorial explosion of specifier data. There is a trade off between the increase in virtual instruction size and the decrease in virtual instruction capability that results from more restricted substitution.
Another dynamic parameter substitution that may be performed is the replacement of an immediate field with a sign-extension of a VINSTR parameter field. For example, the “ADDI” instruction allows an immediate value to be added to the contents of a register. This substitution allows the immediate value field to be specified by one of the virtual instruction parameter fields. The immediate field may be 16 bits, while the virtual instruction parameter may be only five bits. However, the 5-bit value may be sign extended to 16 bits. Sign extension may not be needed if the instructions are stored initially with zeros in the immediate field.
Another dynamic parameter substitution includes the replacement of immediate fields with sign-extended or unextended concatenations of parameter fields. For example, 8-bit immediate values may be created by concatenating 3-bit and 5-bit virtual instruction parameter fields. Additionally, dynamic parameter substitution may include the replacement of an instruction opcode or sub-opcode with a translated or untranslated VINSTR parameter field. This allows, for example, one or more instructions in a virtual instruction sequence to be selected by one or more VINSTR parameters.
In addition to virtual instruction implementations using hardware, (e.g., within a microprocessor or microcontroller) implementations also may be embodied in software disposed, for example, in a computer usable (e.g., readable) medium configured to store the software (i.e., a computer readable program code). The program code causes the enablement of the functions or fabrication, or both, of the systems and techniques disclosed herein. For example, this can be accomplished through the use of general programming languages (e.g., C, C++), hardware description languages (HDL) including Verilog HDL, VHDL, AHDL (Altera HDL) and so on, or other available programming and/or circuit (i.e., schematic) capture tools. The program code can be disposed in any known computer usable medium including semiconductor, magnetic disk, optical disk (e.g., CD-ROM, DVD-ROM) and as a computer data signal embodied in a computer usable (e.g., readable) transmission medium (e.g., carrier wave or any other medium including digital, optical, or analog-based medium). As such, the code can be transmitted over communication networks including the Internet and intranets.
It is understood that the functions accomplished and/or structure provided by the systems and techniques described above can be represented in a core (e.g., a microprocessor core) that is embodied in program code and may be transformed to hardware as part of the production of integrated circuits. Also, the systems and techniques may be embodied as a combination of hardware and software. Accordingly, other implementations are within the scope of the following claims.
This application is a continuation of U.S. patent application Ser. No. 09/788,682, filed Feb. 21, 2001 (now U.S. Pat. No. 7,162,621 B2) which is incorporated herein by reference in its entirety. This application is related to the following commonly owned applications, each of which is incorporated herein by reference in its entirety: U.S. application Ser. No. 09/788,683, filed Feb. 21, 2001 (now U.S. Pat. No. 7,237,097 B2); U.S. application Ser. No. 09/788,670, filed Feb. 21, 2001; U.S. application Ser. No. 09/788,684, filed Feb. 21, 2001; and U.S. application Ser. No. 09/788,685, filed Feb. 21, 2001 (now U.S. Pat. No. 7,181,484 B2).
Number | Name | Date | Kind |
---|---|---|---|
3614406 | Brown | Oct 1971 | A |
3642744 | Moberly et al. | Feb 1972 | A |
3654621 | Bock et al. | Apr 1972 | A |
3916388 | Shrimp et al. | Oct 1975 | A |
4023023 | Bourrez et al. | May 1977 | A |
4109310 | England et al. | Aug 1978 | A |
4126896 | Yamazaki | Nov 1978 | A |
4128880 | Cray, Jr. | Dec 1978 | A |
4130880 | Nutter | Dec 1978 | A |
4173041 | Dvorak et al. | Oct 1979 | A |
4219874 | Gusev et al. | Aug 1980 | A |
4302820 | Struger et al. | Nov 1981 | A |
4307445 | Tredennick et al. | Dec 1981 | A |
4317170 | Wada et al. | Feb 1982 | A |
4394736 | Bernstein et al. | Jul 1983 | A |
4396982 | Wada et al. | Aug 1983 | A |
4434462 | Guttag et al. | Feb 1984 | A |
4491910 | Caudel et al. | Jan 1985 | A |
4495598 | Vahlstrom et al. | Jan 1985 | A |
4507731 | Morrison et al. | Mar 1985 | A |
4511990 | Hagiwara et al. | Apr 1985 | A |
4520439 | Liepa | May 1985 | A |
4538239 | Magar | Aug 1985 | A |
4583199 | Boothroyd et al. | Apr 1986 | A |
4586130 | Butts, Jr. et al. | Apr 1986 | A |
4763246 | Holt et al. | Aug 1988 | A |
4771463 | Beeman | Sep 1988 | A |
4773006 | Kinoshita et al. | Sep 1988 | A |
4809212 | New et al. | Feb 1989 | A |
4811215 | Smith | Mar 1989 | A |
4814976 | Hansen et al. | Mar 1989 | A |
4825363 | Baumann et al. | Apr 1989 | A |
4829380 | Iadipaolo | May 1989 | A |
4847801 | Tong | Jul 1989 | A |
4852037 | Aoki | Jul 1989 | A |
4860192 | Sachs et al. | Aug 1989 | A |
4868777 | Nishiyama et al. | Sep 1989 | A |
4878174 | Watkins et al. | Oct 1989 | A |
4879676 | Hansen | Nov 1989 | A |
4884197 | Sachs et al. | Nov 1989 | A |
4891781 | Omura | Jan 1990 | A |
4899275 | Sachs et al. | Feb 1990 | A |
4924435 | Brunvand et al. | May 1990 | A |
4928223 | Dao et al. | May 1990 | A |
4949250 | Bhandarkar et al. | Aug 1990 | A |
4992934 | Portanova et al. | Feb 1991 | A |
5005118 | Lenoski | Apr 1991 | A |
5073864 | Methvin et al. | Dec 1991 | A |
5136696 | Beckwith et al. | Aug 1992 | A |
5150290 | Hunt | Sep 1992 | A |
5177701 | Iwasa | Jan 1993 | A |
5181183 | Miyazaki | Jan 1993 | A |
5185713 | Kobunaya | Feb 1993 | A |
5193202 | Jackson et al. | Mar 1993 | A |
5220656 | Itomitsu et al. | Jun 1993 | A |
5222244 | Carbine et al. | Jun 1993 | A |
5235686 | Bosshart | Aug 1993 | A |
5280439 | Quek et al. | Jan 1994 | A |
5280593 | Bullions, III et al. | Jan 1994 | A |
5299147 | Holst | Mar 1994 | A |
5321821 | Itomitsu et al. | Jun 1994 | A |
5392228 | Burgess et al. | Feb 1995 | A |
5392408 | Fitch | Feb 1995 | A |
5396502 | Owsley et al. | Mar 1995 | A |
5418915 | Matuda et al. | May 1995 | A |
5452241 | Desrosiers et al. | Sep 1995 | A |
5479620 | Kiyohara et al. | Dec 1995 | A |
5499299 | Takenaka et al. | Mar 1996 | A |
5502829 | Sachs | Mar 1996 | A |
5513366 | Agarwal et al. | Apr 1996 | A |
5517438 | Dao-Trong et al. | May 1996 | A |
5537562 | Gallup et al. | Jul 1996 | A |
5537629 | Brown et al. | Jul 1996 | A |
5550768 | Ogilvie et al. | Aug 1996 | A |
5559974 | Boggs et al. | Sep 1996 | A |
5560028 | Sachs et al. | Sep 1996 | A |
5581773 | Glover | Dec 1996 | A |
5590345 | Barker et al. | Dec 1996 | A |
5598571 | Gallup et al. | Jan 1997 | A |
5664136 | Witt et al. | Sep 1997 | A |
5666298 | Peleg et al. | Sep 1997 | A |
5669010 | Duluk, Jr. | Sep 1997 | A |
5671401 | Harrell | Sep 1997 | A |
5673407 | Poland et al. | Sep 1997 | A |
5696937 | White et al. | Dec 1997 | A |
5713035 | Farrell et al. | Jan 1998 | A |
5717910 | Henry | Feb 1998 | A |
5721892 | Peleg et al. | Feb 1998 | A |
5726927 | Wolrich et al. | Mar 1998 | A |
5729554 | Weir et al. | Mar 1998 | A |
5729724 | Sharangpani et al. | Mar 1998 | A |
5729728 | Colwell et al. | Mar 1998 | A |
5734600 | Dieffenderfer et al. | Mar 1998 | A |
5734874 | Van Hook et al. | Mar 1998 | A |
5740340 | Purcell et al. | Apr 1998 | A |
5748979 | Trimberger | May 1998 | A |
5752071 | Tubbs et al. | May 1998 | A |
5758176 | Agarwal et al. | May 1998 | A |
5761523 | Wilkinson et al. | Jun 1998 | A |
5768172 | Derby | Jun 1998 | A |
5774709 | Worrell | Jun 1998 | A |
5778241 | Bindloss et al. | Jul 1998 | A |
5781457 | Cohen et al. | Jul 1998 | A |
5784602 | Glass et al. | Jul 1998 | A |
5790827 | Leung | Aug 1998 | A |
5793661 | Dulong et al. | Aug 1998 | A |
5794003 | Sachs | Aug 1998 | A |
5796973 | Witt et al. | Aug 1998 | A |
5798923 | Laskowski | Aug 1998 | A |
5809294 | Ando | Sep 1998 | A |
5812147 | Van Hook et al. | Sep 1998 | A |
5815695 | James et al. | Sep 1998 | A |
5815723 | Wilkinson et al. | Sep 1998 | A |
5819117 | Hansen et al. | Oct 1998 | A |
5822606 | Morton | Oct 1998 | A |
5838984 | Nguyen et al. | Nov 1998 | A |
5838986 | Garg et al. | Nov 1998 | A |
5848255 | Kondo | Dec 1998 | A |
5848269 | Hara | Dec 1998 | A |
5850452 | Sourgen et al. | Dec 1998 | A |
5852726 | Lin et al. | Dec 1998 | A |
5864703 | Van Hook et al. | Jan 1999 | A |
5867682 | Witt et al. | Feb 1999 | A |
5875336 | Dickol et al. | Feb 1999 | A |
5875355 | Sidwell et al. | Feb 1999 | A |
5880984 | Burchfiel et al. | Mar 1999 | A |
5881307 | Park et al. | Mar 1999 | A |
5887183 | Agarwal et al. | Mar 1999 | A |
5892960 | Seide | Apr 1999 | A |
5918031 | Morrison et al. | Jun 1999 | A |
5922066 | Cho et al. | Jul 1999 | A |
5926642 | Favor | Jul 1999 | A |
5933650 | Van Hook et al. | Aug 1999 | A |
5936872 | Fischer et al. | Aug 1999 | A |
5944776 | Zhang et al. | Aug 1999 | A |
5953241 | Hansen et al. | Sep 1999 | A |
5960012 | Spracklen | Sep 1999 | A |
5961629 | Nguyen et al. | Oct 1999 | A |
5996056 | Volkonsky | Nov 1999 | A |
5996062 | Sachs | Nov 1999 | A |
5996066 | Yung | Nov 1999 | A |
6006316 | Dinkjian | Dec 1999 | A |
6009261 | Scalzi et al. | Dec 1999 | A |
6009450 | Dworkin et al. | Dec 1999 | A |
6026420 | DesJardins et al. | Feb 2000 | A |
6035120 | Ravichandran | Mar 2000 | A |
6035316 | Pelleg et al. | Mar 2000 | A |
6035317 | Guy | Mar 2000 | A |
6041403 | Parker et al. | Mar 2000 | A |
6058465 | Nguyen | May 2000 | A |
6058500 | DesJardins et al. | May 2000 | A |
6065115 | Sharangpani et al. | May 2000 | A |
6066178 | Bair et al. | May 2000 | A |
6067615 | Upton | May 2000 | A |
6073154 | Dick | Jun 2000 | A |
6075937 | Scalzi et al. | Jun 2000 | A |
6078941 | Jiang et al. | Jun 2000 | A |
6088783 | Morton | Jul 2000 | A |
6122738 | Millard | Sep 2000 | A |
6128726 | LeComec | Oct 2000 | A |
6138229 | Kucukcakar et al. | Oct 2000 | A |
6141421 | Takaragi et al. | Oct 2000 | A |
6141786 | Cox et al. | Oct 2000 | A |
6145077 | Sidwell et al. | Nov 2000 | A |
6154834 | Neal et al. | Nov 2000 | A |
6172494 | Feuser | Jan 2001 | B1 |
6181729 | O'Farrell | Jan 2001 | B1 |
6185668 | Arya | Feb 2001 | B1 |
6192491 | Cashman et al. | Feb 2001 | B1 |
6199087 | Blake et al. | Mar 2001 | B1 |
6199088 | Weng et al. | Mar 2001 | B1 |
6233597 | Tanoue et al. | May 2001 | B1 |
6243732 | Arakawa et al. | Jun 2001 | B1 |
6263429 | Siska | Jul 2001 | B1 |
6266758 | Van Hook et al. | Jul 2001 | B1 |
6279023 | Weng et al. | Aug 2001 | B1 |
6282635 | Sachs | Aug 2001 | B1 |
6292883 | Augusteijn et al. | Sep 2001 | B1 |
6295599 | Hansen et al. | Sep 2001 | B1 |
6298438 | Thayer et al. | Oct 2001 | B1 |
6314445 | Poole | Nov 2001 | B1 |
6336178 | Favor | Jan 2002 | B1 |
6349318 | Vanstone et al. | Feb 2002 | B1 |
6349377 | Lindwer | Feb 2002 | B1 |
6397241 | Glaser et al. | May 2002 | B1 |
6421817 | Mohan et al. | Jul 2002 | B1 |
6425124 | Tominaga et al. | Jul 2002 | B1 |
6453407 | Lavi et al. | Sep 2002 | B1 |
6480605 | Uchiyama et al. | Nov 2002 | B1 |
6480872 | Choquette | Nov 2002 | B1 |
6513054 | Carroll | Jan 2003 | B1 |
6523054 | Kamijo | Feb 2003 | B1 |
6587939 | Takano | Jul 2003 | B1 |
6615366 | Grochowski et al. | Sep 2003 | B1 |
6625726 | Clark et al. | Sep 2003 | B1 |
6625737 | Kissell | Sep 2003 | B1 |
6651160 | Hays | Nov 2003 | B1 |
6658561 | Benayoun et al. | Dec 2003 | B1 |
6711602 | Bhandal et al. | Mar 2004 | B1 |
6760742 | Hoyle | Jul 2004 | B1 |
6892293 | Sachs et al. | May 2005 | B2 |
6952478 | Lee et al. | Oct 2005 | B2 |
6976178 | Kissell | Dec 2005 | B1 |
7003715 | Thurston | Feb 2006 | B1 |
7142668 | Kogure | Nov 2006 | B1 |
7162621 | Kissell | Jan 2007 | B2 |
7181484 | Stribaek et al. | Feb 2007 | B2 |
7237097 | Kissell et al. | Jun 2007 | B2 |
20010052118 | Steinbusch | Dec 2001 | A1 |
20020013691 | Warnes | Jan 2002 | A1 |
20020062436 | Van Hook et al. | May 2002 | A1 |
20020069402 | Nevill et al. | Jun 2002 | A1 |
20020116428 | Stribaek et al. | Aug 2002 | A1 |
20020116603 | Kissell | Aug 2002 | A1 |
20020178203 | Stribaek et al. | Nov 2002 | A1 |
20030172254 | Mandavilli et al. | Sep 2003 | A1 |
20060190518 | Ekner et al. | Aug 2006 | A1 |
Number | Date | Country |
---|---|---|
196 44 688 | Apr 1998 | DE |
0 681 236 | Nov 1995 | EP |
0 757 312 | Feb 1997 | EP |
0 681 236 | Nov 2000 | EP |
07-182142 | Jul 1995 | JP |
10-11289 | Jan 1998 | JP |
11-003226 | Jan 1999 | JP |
11-174955 | Jul 1999 | JP |
2000-293507 | Oct 2000 | JP |
2000-321979 | Nov 2000 | JP |
WO 9707450 | Feb 1997 | WO |
WO 9708608 | Mar 1997 | WO |
Number | Date | Country | |
---|---|---|---|
20070106889 A1 | May 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09788682 | Feb 2001 | US |
Child | 11644001 | US |