Method and apparatus for performing computations and operations on data using data steering

Information

  • Patent Grant
  • 7376811
  • Patent Number
    7,376,811
  • Date Filed
    Tuesday, November 6, 2001
    23 years ago
  • Date Issued
    Tuesday, May 20, 2008
    16 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Breene; John
    • Stevens; Robert
    Agents
    • Haynes Beffel & Wolfeld LLP
Abstract
A data processing system architecture is based upon a hardware engine that includes a plurality of functional units and data routing units that interconnect the functional units. The hardware engine performs operations and computations on data as the data traverses paths through the functional units under control of software. The functional units include logic resources, examples of which are flip-flops, latches, arithmetic logic units, random access memory, and the like. The routing units are responsive to the software control signals that are turned on or off to steer the data through these resources. Operations and computations are accomplished according to the steering of the data through the functional units that control the functions performed.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates to system architectures for data processing, and more particularly to an architecture based upon a hardware engine which performs operations and computations on data as the data traverses paths controlled by software.


2. Description of Related Art


Traditional data processing systems are based on architectures having a pipeline based execution unit, and instruction fetch unit, and a storage unit which are operated in response to decoded instructions. The instructions are decoded to produce microcode that controls the operation of the data processing pipeline. The execution unit is a very complicated general-purpose logic system designed to execute a fixed number of operations under microcode control, and which becomes inflexible and difficult to change as its complexity grows.


This traditional architecture arose because the cost of the manufacture and design of logic has been historically higher than the cost of moving data into the logic system. However, recent advances in manufacturing and design are bringing down the cost of the design and implementation of logic, as compared to the cost of routing signals.


It is an object of the present invention to take advantage of this trend in integrated circuit and data processing system manufacturing and design to provide a data processing architecture that reduces the complexity and inflexibility of data processing systems.


SUMMARY OF THE INVENTION

The present invention provides an architecture based upon a hardware engine that includes a plurality of functional units and data routing units that interconnect the functional units. The hardware engine performs operations and computations on data as the data traverses paths through the functional units under control of software. The functional units include logic resources, examples of which are flip-flops, latches, arithmetic logic units, random access memory, and the like. The routing units are responsive to the software control signals that are turned on or off to steer the data through these resources. Operations and computations are accomplished according to the steering of the data through the functional units, rather than according to decoding of operation commands that control the functions performed on the data by a general purpose execution unit, as typical in the prior art.


Thus, one embodiment of the present invention comprises a data processing system. The data processing system includes a plurality of functional units and a plurality of routing units. The routing units are responsive to respective routing control signals and are coupled to the plurality of functional units. The routing units steer data among the plurality of functional units in response to routing control signals that indicate a source functional unit and a destination functional unit for a data unit being routed. Control word logic supplies the routing control signals to the plurality of routing control units. In one embodiment, the routing units operate synchronously, so that the data words subject of the operations are available to the functional units from the routing control units within timing constraints set up according to the plurality of functional units in the system.


The routing units comprise in various embodiments crossbar switches and multiplexers.


The functional units include in various embodiments storage elements, arithmetic logic units, table lookup units, complex logic units, data word shifter units, memory responsive to addresses, First-In-First-Out FIFO buffers, or any other logical unit designed to perform a function on data supplied on inputs, and to provide data at an output or outputs. In preferred embodiments, the functional units comprise logic dedicated to specific tasks, where the logic may be hardwired or based completely or in part on software.


In other embodiments of the present invention, the architecture is applied in a hierarchical fashion. Thus, one embodiment of the invention comprises a plurality of functional blocks, one or more of the plurality of functional blocks including a plurality of functional units, routing units and control word logic as discussed above. Block level routing units are also applied, along with block level control word logic.


The present invention also provides a new method of processing data in a data processing engine that includes a plurality of functional units. The method includes providing a set of control words that specify a route among the plurality functional units, and routing data among the plurality of functional units according to the set of software control words to produce a result. Also, in some embodiments, the method includes compiling the set of software control words from a high-level programming language specifying the result.


The present invention also provides a new method of processing data in a data processing engine that includes a plurality of functional units. The process includes providing a first set of software control words that specify a first data path according to a first configuration of the plurality of functional units; and providing a second set of software control words that specifies a second data path according to a second configuration of the plurality of functional units, whereby the plurality of functional units is reconfigured to perform a different function.


Other aspects and advantages of the present invention can be seen upon review of the figures, detailed description and the claims, which follow.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 a simplified architectural diagram for a data processing system according to the present invention.



FIG. 2 is a logic diagram of a data processing system implemented according to the present invention.



FIG. 3 is a simplified architectural diagram of a data processing system showing variations on the architecture of the present invention.



FIG. 4 is a simplified architectural diagram of a data processing system showing other variations on the architecture of the present invention.



FIG. 5 is an architectural diagram of a data processing system according to the present invention implementing a hierarchical approach.





DETAILED DESCRIPTION

A detailed description of embodiments of the present invention is provided with respect to FIGS. 1 through 5. In FIG. 1, the data processing system according to the present invention includes a plurality of functional units 10-16, and a plurality of routing units 20-23. The routing units are controlled by respective control signals 30-33 from control word logic 35. The control signals combined define a software control word by which a data path is defined through the plurality of functional units 10-16.


Each of the control signals, e.g. control signal 31 applied to routing unit 21, indicate both a source and a destination for a data unit traversing the routing unit. Thus, routing unit 21 includes inputs 40-42 and outputs 43-46. The control signal indicates an input and an output, such as input 41 and output 45, uniquely specifying a path through the routing unit. According to the control signal 31 having a value 41:45, the routing unit accepts data on line 41 from functional unit 11 and routes the data to functional unit 12. Also, for some types of functional units, such as memory, the control signals include indicators of a source and destination, as well as other control signals like a write strobe or a read strobe to be used by the destination or the source functional unit.


The functional units 10-16 are made up of typical logic units, including storage elements, memory arrays, arithmetic logic units, shifters, inverters, concatenating logic, counters, adders, floating point arithmetic units, timers and others. Also, functional units 10-16 comprise special-purpose logic in some embodiments.


The routing units 20-23 are made up of typical routing circuitry, including multiplexers, buses, crossbar switches, local area network switches, and the like. Also, routing units 20-23 comprise special purpose routing units in some embodiments.


The control words are provided by software without decoding in preferred systems. These control words are generated by compilers, which transform high-level programming languages like Java, C, and C++, into the control word language of the architecture. The compilers provided for this function are given a specification of the functional units, the routing units and the interconnection of the functional units and routing units. Also, the compilers are provided with the format of the control signals used for specifying a source and a destination for each of the routing units.



FIG. 2 illustrates a simple data processing system having the architecture of the present invention. In this data processing system, the functional units include a plurality of registers R0 through R7, arithmetic logic unit ALU1 which performs multiple functions and provides output for each, arithmetic logic unit ALU2 (not shown) and a memory 50. The routing units include a set of multiplexers 51-54, and associated routing logic of the functional units such as read strobes, write strobes, and addresses.


The control word 55 includes control signals Rc which operate as strobes for the registers, M1 which controls multiplexer 51, M2 which controls multiplexer 52, Ac which selects one of four results available as output from the arithmetic logic unit ALU1, M3 which controls multiplexer 53, wr which operates as a write strobe for the memory 50, Addr which provides an address to the memory 50, and M4 which controls multiplexer 54. Control word logic applies the control word 55 to the plurality of routing units synchronously so that timing constraints of the plurality of dedicated functional units are observed.


In order to understand the present invention, consider how an addition would get done according to a prior art reduced instruction set RISC architecture. In a RISC architecture, an add instruction appears as follows:

    • ADD R1, R4, R5 or as ADD R1, R4, Addr[9:0]


      for the cases in which the result is stored back to a register and the result is stored into memory, respectively. This ADD instruction would get decoded and the necessary signals generated internally to send the data through various pipeline stages of an execution unit to execute the add operation. According to the present invention however, the control words would be generated so that data from registers R1 and R4 would be steered by the multiplexers 51 and 52 to the inputs of ALU1. The control signal Ac[1:0] operates to select as the output of ALU1, a result (e.g. the result generated by an addition of its inputs) of the four results generated by the four available functions of the ALU1. The output of ALU1 gets steered into the register R5 by the multiplexer 54. To write the value to the register R5, the control signal Rc corresponding to the register R5 would be activated so that the register will store the value. For the case in which the value is to be written to the memory 50, the control signal wr would be activated along with the address Addr[9:0] to write the data into the correct location in the memory 50.


Thus, the data is steered through the resources using a sequence of control words provided by the control word logic 55 acting as distribution cicuitry. The control words each provide the control signals that specify the source and destination for data being routed by the routing units 51-54, the associated routing functions in the registers, and a memory 50. In the preferred systems, there are no operation commands that affect the function performed on the data by the functional units. Rather, the function performed on the data is hardwired in, or otherwise provided in, the dedicated functional units.


The example in FIG. 2 illustrates some diversity in the manner in which the functional units and routing units could be interconnected and implemented. For example, the routing unit 54 routes data from the ALU1 back to the inputs of the registers to set up a recursive path. The routing unit 53 accepts inputs from other functional units not shown, such as a second arithmetic logic unit ALU2. Also, the routing unit 54 is able to route data from the memory 50 back to the registers.


Another feature shown in the example of FIG. 2 is the use of immediate data for the addresses and control signals, like a write strobe. That is, the addresses and write strobe are part of the control word 55. In alternative systems, one of the functional units may be employed to generate addresses, or other types of control signals used by the routing units. Also, offset addressing might be utilized by providing an offset as a part of the control word with a base address provided by functional unit, or vice versa.



FIGS. 3 and 4 show other architectural variations that are possible. Thus, in FIG. 3 the use of a functional unit for the purposes of providing a routing signal is illustrated. In FIG. 3, the plurality of routing units include routing units 60-63 and the plurality of functional units include functional units 65-67. Functional units 66 and 67 have multiple inputs, while functional unit 65 has a single input. The output of functional unit 65 is applied as a control signal to the routing unit 63. Also, FIG. 3 illustrates that more than one routing unit, such as routing units 61 and 62 may apply inputs to a single functional unit, such as functional unit 63.


In FIG. 4, the data processing system includes routing units 70-72 and functional units 75-76. Both functional units 75 and 76 include multiple inputs and single outputs. The output of functional unit 76 is applied as an input to a routing unit 71 which has its output coupled to the input of functional unit 76. Thus, functional unit 76 is able to operate in a direct feedback, iterative loop. Also, in FIG. 4, output of the routing unit 72 is applied as an input to the routing unit 70, illustrating feedback across multiple levels of routing.


As the complexity of data processing systems implemented according to the present architecture increases, hierarchical designs are available. Thus, any of the functional units in an architecture, such as that shown in FIG. 1, may comprise its own data processing system having a plurality of functional units and routing units operating according to its own control word logic.


One hierarchical design is shown in FIG. 5. In FIG. 5, block level routing units 80-82 interconnect functional blocks 85 and 86. The functional blocks 85 and 86 each comprise a hardware engine including a plurality of functional units and unit level routing units, which are controlled by control words as described above with respect to FIGS. 1-4. Thus, each of the functional blocks 85 and 86 includes control word logic, which applies control words according to a compiled program at the functional unit level. The entire system in FIG. 5 is likewise controlled by control words provided by a compiled program at the functional block level. The hierarchical design can be applied in many levels, to facilitate higher level programming approaches.


CONCLUSION

Accordingly, the present invention provides an architecture based upon a new paradigm for design and implementation of data processing systems. Control words are generated by compiling high level programming language, and consist of control signals for routing units. The control signals synchronously steer data among a plurality of functional units which are optimized for particular functions. No decoding of operation commands is required, vastly simplifying implementation and design of the hardware engine.


In embodiments of the present invention, the data gets steered among the functional units and functional blocks, and in the process of traversing through the different paths, the desired operations are performed.


The foregoing description of embodiments of the invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations will be apparent. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others to understand the invention for various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims.

Claims
  • 1. A data processing system, comprising: a plurality of functional units having respective inputs and outputs, and adapted to perform respective tasks using input data at the respective inputs and to supply output data at the respective outputs, within a cycle;a plurality of routing units, responsive to respective routing control signals, by which data is steered among inputs and outputs of the plurality of functional units, routing units in the plurality of routing units being coupled to respective subsets of functional units in the plurality of functional units, wherein at least one of said respective subsets is different than another of said respective subsets; andcontrol word distribution circuitry which supplies the routing control signals in parallel to the plurality of routing units to establish a route for a cycle, where the route includes applying data output in the cycle by a first functional unit in the plurality of functional units as input in the cycle to a second functional unit in the plurality of functional units, and applying data output by the second functional unit in the cycle as input in the cycle to a third functional unit in the cycle.
  • 2. The data processing system of claim 1, wherein said plurality of routing units includes at least one multiplexer having a plurality of inputs and coupled to respective functional units in the plurality of functional units and at least one output coupled to a functional unit in the plurality of functional units, and the routing control signal for the multiplexer specifies one of a plurality of inputs to indicate a source functional unit, and one of the at least one outputs to indicate a destination functional unit.
  • 3. The data processing system of claim 1, wherein said plurality of routing units includes at least one crossbar switch.
  • 4. The data processing system of claim 1, wherein said plurality of functional units includes at least one storage element.
  • 5. The data processing system of claim 1, wherein said plurality of functional units includes at least one logic block which performs a plurality of available functions, and includes logic to select an output from one of the plurality of available functions in response to a routing control signal.
  • 6. The data processing system of claim 1, wherein said plurality of functional units includes a memory responsive to addresses, write control signals, and read control signals, and the control word distribution circuitry supplies at least one of the write control signals and read control signals.
  • 7. The data processing system of claim 6, wherein the control word distribution circuitry supplies an address for said memory.
  • 8. The data processing system of claim 6, wherein an address for said memory is supplied by one of the plurality of functional units.
  • 9. The data processing system of claim 1, wherein functional units in the plurality of functional units comprise logic dedicated to specific processing tasks.
  • 10. The data processing system of claim 1, wherein functional units in the plurality of functional units comprise hardwired logic dedicated to specific processing tasks.
  • 11. The data processing system of claim 1, wherein said control word distribution circuitry supplies said routing control signals synchronously to the plurality of routing units.
  • 12. A data processing system, comprising: a plurality of processing blocks having respective inputs and outputs, and adapted to perform respective processes using input data at the respective inputs and to supply output data at the respective outputs, within a cycle;a plurality of routing units, responsive to respective routing control signals for the plurality of processing blocks, by which data is steered among the inputs and outputs of the plurality of processing blocks, routing units in the plurality of routing units being coupled to respective subsets of processing blocks in the plurality of processing blocks, wherein at least one of said respective subsets of processing blocks is different than another of said respective subsets processing blocks; andblock level control word distribution circuitry which supplies control words for respective cycles to the plurality of routing units, said control words including the routing control signals for the plurality of routing units; wherein processing blocks in said plurality of processing blocks respectively include a plurality of functional units having respective inputs and outputs, and adapted to perform respective processes using input data at the respective inputs and to supply output data at the respective outputs, within a block cycle;a plurality of unit level routing units, coupled to the plurality of functional units and responsive to respective routing control signals for the plurality of unit level routing units, by which data is steered among the inputs and outputs of the plurality of functional units, unit level routing units in the plurality of unit level routing units being coupled to respective subsets of functional units in the plurality of functional unit, wherein at least one of said respective subsets of functional units is different than another of said respective subsets of functional units; andfunctional unit level control word distribution circuitry which supplies control words for respective block cycles to the plurality of unit level routing units, said control words including the routing control signals to establish a route in the block cycle for the plurality of unit level routing units, where the route includes applying data output in the block cycle by a first functional unit in the plurality of functional units as input in the block cycle to a second functional unit in the plurality of functional units, and applying data output by the second functional unit in the block cycle as input in the block cycle to a third functional unit in the block cycle.
  • 13. The data processing system of claim 12, wherein said plurality of unit level routing units includes at least one multiplexer having a plurality of inputs and coupled to respective functional units in the plurality of functional units and at least one output coupled to a functional unit in the plurality of functional units, and the routing control signal for the multiplexer specifies one of a plurality of inputs to indicate a source functional unit, and one of the at least one outputs to indicate a destination functional unit.
  • 14. The data processing system of claim 12, wherein said plurality of block level routing units includes at least one crossbar switch.
  • 15. The data processing system of claim 12, wherein said plurality of functional units includes at least one storage element.
  • 16. The data processing system of claim 12, wherein said plurality of functional units includes at least one logic block which performs a plurality of available functions, and includes logic to select an output from one of the plurality of available functions in response to a routing control signal in the control word.
  • 17. The data processing system of claim 12, wherein said plurality of functional units includes a memory responsive to addresses, write control signals, and read control signals, and the function unit level control word distribution circuitry supplies includes at least one of the write control signals and read control signals.
  • 18. The data processing system of claim 17, wherein said function unit level control word distribution circuitry supplies includes an address for said memory.
  • 19. The data processing system of claim 17, wherein an address for said memory is supplied by one of the plurality of functional units.
  • 20. The data processing system of claim 12, wherein functional units in the plurality of functional units comprise logic dedicated to specific processing tasks.
  • 21. The data processing system of claim 12, wherein functional units in the plurality of functional units comprise hardwired logic dedicated to specific processing tasks.
  • 22. The data processing system of claim 12, wherein at least one of said block level control word distribution circuitry and functional level control word distribution circuitry supplies said control words synchronously.
  • 23. A method of processing data, in a data processing engine that includes a plurality of functional units, comprising: providing a set of software routing control signals in parallel to a set of routing units in the data processing engine to specify a route for a cycle among the plurality of functional units; androuting data among the plurality of functional units according to the set of software routing control signals and performing tasks in the plurality of functional units using the route to produce a result, wherein routing units in the set of routing units are coupled to respective subsets of functional units in the plurality of functional units, wherein at least one of said respective subsets of functional units is different than another of said respective subsets of functional units, where the route includes applying data output in the cycle by a first functional unit in the plurality of functional units as input in the cycle to a second functional unit in the plurality of functional units, and applying data output by the second functional unit in the cycle as input in the cycle to a third functional unit in the cycle.
  • 24. The method of claim 23, including: compiling a high level programming language specifying the result to produce the set of software routing control signals.
  • 25. The method of claim 23, wherein functional units in the plurality of functional units comprise logic dedicated to specific processing tasks.
  • 26. The method of claim 23, wherein functional units in the plurality of functional units comprise hardwired logic dedicated to specific processing tasks.
  • 27. The method of claim 23, wherein the routing units in the data processing engine comprise a plurality of switches interconnecting the plurality of functional units, and said set of routing control signals specify data paths through the plurality of switches.
  • 28. The method of claim 23, including synchronously routing said data among the plurality of functional units.
  • 29. A method of processing data in a data processing engine that includes a plurality of functional units, comprising; providing a first set of software routing control signals in parallel to a set of routing units in the data processing engine to specify a first data path according to a first configuration of the plurality of functional units for a first cycle, wherein routing units in the set of routing units are coupled to respective subsets of functional units in the plurality of functional units, wherein at least one of said respective subsets of functional units is different than another of said respective subsets of functional units, where the first data path includes applying data output in the first cycle by a first functional unit in the plurality of functional units as input in the first cycle to a second functional unit in the plurality of functional units, and applying data output by the second functional unit in the first cycle as input in the first cycle to a third functional unit in the first cycle;performing tasks in said plurality of functional units using the first data path in the first cycle;providing a second set of software routing control signals in parallel to said set of routing units to specify a second data path according to a second configuration of the plurality of functional units for a second cycle, whereby the plurality of functional units is reconfigured to perform a different function; andperforming tasks in said plurality of functional units using the second data path to accomplish said different function in the second cycle.
  • 30. The method of claim 29, wherein functional units in the plurality of functional units comprise logic dedicated to specific processing tasks.
  • 31. The method of claim 29, wherein functional units in the plurality of functional units comprise hardwired logic dedicated to specific processing tasks.
  • 32. The method of claim 29, wherein the routing units in the data processing engine comprises a plurality of switches interconnecting the plurality of functional units, and said first and second sets of routing control signals specify data paths through the plurality of switches.
  • 33. The method of claim 29, including: compiling a high level programming language specifying the result to produce the first and second sets of software routing control signals.
US Referenced Citations (96)
Number Name Date Kind
3487370 Goshorn et al. Dec 1969 A
4445172 Peters et al. Apr 1984 A
4811214 Nosenchuck et al. Mar 1989 A
4891787 Gifford Jan 1990 A
4943909 Huang Jul 1990 A
5146606 Grondalski Sep 1992 A
5151996 Hillis Sep 1992 A
5212773 Hillis May 1993 A
5245705 Swaney Sep 1993 A
5247613 Bromley Sep 1993 A
5265207 Zak et al. Nov 1993 A
5274782 Chalasani et al. Dec 1993 A
5313590 Taylor May 1994 A
5379444 Mumme Jan 1995 A
5388214 Leiserson et al. Feb 1995 A
5418970 Gifford May 1995 A
5481743 Baxter Jan 1996 A
5481749 Grondalski Jan 1996 A
5530814 Wong et al. Jun 1996 A
5559970 Sharma Sep 1996 A
5561761 Hicok et al. Oct 1996 A
5574930 Halverson et al. Nov 1996 A
5590283 Hillis et al. Dec 1996 A
5598410 Stone Jan 1997 A
5617549 DeLano Apr 1997 A
5671435 Alpert Sep 1997 A
5680550 Kuszmaul et al. Oct 1997 A
5689508 Lyles Nov 1997 A
5717871 Hsieh et al. Feb 1998 A
5726586 Chan et al. Mar 1998 A
5734334 Hsieh et al. Mar 1998 A
5751955 Sonnier et al. May 1998 A
5771362 Bartkowiak et al. Jun 1998 A
5790821 Pflum Aug 1998 A
5805477 Perner Sep 1998 A
5805875 Asanovic Sep 1998 A
5822606 Morton Oct 1998 A
5828858 Athanas et al. Oct 1998 A
5845102 Miller et al. Dec 1998 A
5867724 McMahon Feb 1999 A
5905723 Varghese et al. May 1999 A
5907485 Van Loo et al. May 1999 A
5930492 Lynch Jul 1999 A
5941968 Mergard et al. Aug 1999 A
6023742 Ebeling et al. Feb 2000 A
6044080 Antonov Mar 2000 A
6055599 Han et al. Apr 2000 A
6065070 Johnson May 2000 A
6078990 Frazier Jun 2000 A
6081884 Miller Jun 2000 A
6088783 Morton Jul 2000 A
6112294 Merchant et al. Aug 2000 A
6142683 Madduri Nov 2000 A
6157955 Narad et al. Dec 2000 A
6182206 Baxter Jan 2001 B1
6185633 Johnson Feb 2001 B1
6223242 Sheafor et al. Apr 2001 B1
6226735 Mirsky May 2001 B1
6230175 Okamoto et al. May 2001 B1
6253313 Morrison et al. Jun 2001 B1
6256740 Muller et al. Jul 2001 B1
6263415 Venkitakrishnan Jul 2001 B1
6272619 Nguyen et al. Aug 2001 B1
6279100 Tremblay et al. Aug 2001 B1
6304568 Kim Oct 2001 B1
6314487 Hahn et al. Nov 2001 B1
6330242 Ogawa et al. Dec 2001 B1
6378021 Okazawa et al. Apr 2002 B1
6378061 Carbine et al. Apr 2002 B1
6412061 Dye Jun 2002 B1
6438585 Mousseau et al. Aug 2002 B2
6438680 Yamada et al. Aug 2002 B1
6473827 McMillen et al. Oct 2002 B2
6519695 Kostic et al. Feb 2003 B1
6594698 Chow et al. Jul 2003 B1
6597692 Venkitakrishnan Jul 2003 B1
6636933 MacLellan et al. Oct 2003 B1
6651131 Chong et al. Nov 2003 B1
6661788 Angle et al. Dec 2003 B2
6675283 Cichon Jan 2004 B1
6690659 Ahmed et al. Feb 2004 B1
6728777 Lee et al. Apr 2004 B1
6799252 Bauman Sep 2004 B1
6836815 Purcell et al. Dec 2004 B1
6842104 Osaka et al. Jan 2005 B1
6874079 Hogenauer Mar 2005 B2
7028134 Wang et al. Apr 2006 B2
7043596 McWilliams et al. May 2006 B2
7127590 Lindquist Oct 2006 B1
20010042193 Fleck et al. Nov 2001 A1
20020009095 Van Doren et al. Jan 2002 A1
20020038339 Xu Mar 2002 A1
20020116715 Apostolopoulos Aug 2002 A1
20020122428 Fan et al. Sep 2002 A1
20030191879 Marmash Oct 2003 A1
20050076194 Kanapathippillai et al. Apr 2005 A1
Foreign Referenced Citations (6)
Number Date Country
0 410 435 Jan 1991 EP
0 456 201 Nov 1991 EP
06-274459 Sep 1994 JP
09-294069 Nov 1997 JP
10-111790 Apr 1998 JP
11-219279 Aug 1999 JP
Related Publications (1)
Number Date Country
20030088826 A1 May 2003 US