text:
|Publication number
|Publication type
|Application number
|Publication date
|19 Jul 2011
|Filing date
|15 Oct 2008
|Priority date
|22 Nov 2002
|Fee status
|Also published as
|Publication number
|Fredrick Curtis Furtek, Paul L. Master
|Original Assignee
|Qst Holdings Llc
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (434), Non-Patent Citations (127), Referenced by (6), Classifications (14), Legal Events (3)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims priority from U.S. Provisional Patent Application No. 60/428,646, filed on Nov. 22, 2002. This application is a continuation from U.S. patent application Ser. No. 12/115,843 filed May 6, 2008, which is a continuation of U.S. patent application Ser. No. 11/803,998 filed May 16, 2007, which is a continuation of U.S. patent application Ser. No. 10/719,921, now U.S. Pat. No. 7,225,301 filed Nov. 20, 2003 which claims priority from U.S. Provisional Application No. 60/428,646. Priority is claimed from all of these applications and these applications are hereby incorporated by reference as if set forth in full in this application for all purposes.
This application is related to the following U.S. patent applications, each of which is hereby incorporated by reference as if set forth in full in this document for all purposes:
Ser. No. 09/815,122, entitled "Adaptive Integrated Circuitry with Heterogeneous and Reconfigurable Matrices of Diverse and Adaptive Computational Units having Fixed, Application Specific Computational Elements," filed on Mar. 22, 2001;
Ser. No. 10/443,554, entitled "Uniform Interface for a Functional Node in an Adaptive Computing Engine," filed on May 21, 2003.
The present invention is related in general to memory controllers and more specifically to the design of a memory controller for use in an adaptive computing environment.
The advances made in the design and development of integrated circuits ("ICs") have generally produced information-processing devices falling into one of several distinct types or categories having different properties and functions, such as microprocessors and digital signal processors ("DSPs"), application specific integrated circuits ("ASICs"), and field programmable gate arrays ("FPGAs"). Each of these different types or categories of information-processing devices have distinct advantages and disadvantages.
Microprocessors and DSPs, for example, typically provide a flexible, software-programmable solution for a wide variety of tasks. The flexibility of these devices requires a large amount of instruction decoding and processing, resulting in a comparatively small amount of processing resources devoted to actual algorithmic operations. Consequently, microprocessors and DSPs require significant processing resources, in the form of clock speed or silicon area, and consume significantly more power compared with other types of devices.
ASICs, while having comparative advantages in power consumption and size, use a fixed, "hard-wired" implementation of transistors to implement one or a small group of highly specific tasks. ASICs typically perform these tasks quite effectively; however, ASICs are not readily changeable, essentially requiring new masks and fabrication to realize any modifications to the intended tasks.
FPGAs allow a degree of post-fabrication modification, enabling some design and programming flexibility. FPGAs are comprised of small, repeating arrays of identical logic devices surrounded by several levels of programmable interconnects. Functions are implemented by configuring the interconnects to connect the logic devices in particular sequences and arrangements. Although FPGAs can be reconfigured after fabrication, the reconfiguring process is comparatively slow and is unsuitable for most real-time, immediate applications. Additionally, FPGAs are very expensive and very inefficient for implementation of particular functions. An algorithmic operation implemented on an FPGA may require orders of magnitude more silicon area, processing time, and power than its ASIC counterpart, particularly when the algorithm is a poor fit to the FPGA's array of homogeneous logic devices.
An adaptive computing engine (ACE) or adaptable computing machine (ACM) allows a collection of hardware resources to be rapidly configured for different tasks. Resources can include, e.g., processors, or nodes, for performing arithmetic, logical and other functions. The nodes are provided with an interconnection system that allows communication among nodes and communication with resources such as memory, input/output ports, etc. One type of valuable processing is memory access services. In order to provide memory access services to access external memory, an external memory controller is typically needed.
Thus, there is a desire to provide a memory controller that provides memory access services in an adaptive computing engine.
Embodiments of the present invention generally relate to using a memory controller to provide memory access services in an adaptive computing engine.
In one embodiment, a memory controller in an adaptive computing engine (ACE) is provided. The controller includes a network interface configured to receive a memory request from a programmable network; and a memory interface configured to access a memory to fulfill the memory request from the programmable network, wherein the memory interface receives and provides data for the memory request to the network interface, the network interface configured to send data to and receive data from the programmable network.
In another embodiment, a memory controller includes a network interface configured to receive a memory request for a memory access service from a network; and one or more engines configured to receive the memory request and to provide the memory access service associated with the memory request.
In yet another embodiment, a memory controller includes one or more ports configured to receive memory requests, wherein each port includes one or more parameters; an engine configured to receive a memory request from a port in the one or more ports; and a data address generator configured to generate a memory location for a memory based on the one or more parameters associated with the port, wherein the engine is configured to perform a memory operation for the memory request using the generated memory location.
In another embodiment, a memory controller includes one or more ports configured to receive memory requests from requesting nodes, wherein each port includes one or more parameters, the one or more parameters configurable by information in the memory requests; a point-to-point engine configured to receive a memory request from a port in the one or more ports; a data address generator configured to generate a memory location for a memory based on the one or more parameters associated with the port, wherein the point-to-point engine performs a memory operation using the generated memory location while adhering to a point-to-point protocol with the requesting node.
In another embodiment, a system for processing memory service requests in an adaptable computing environment is provided. The system comprises: a memory; one or more nodes configured to generate a memory service request; a memory controller configured to receive the memory service request, the memory controller configured to service the memory service request, wherein the memory controller reads or writes data from or to the memory based on the memory service request.
A further understanding of the nature and the advantages of the inventions disclosed herein may be realized by reference of the remaining portions of the specification and the attached drawings.
A preferred embodiment of the invention uses an adaptive computing engine (ACE) architecture including an external memory controller (XMC) node. Details of an exemplary ACE architecture are disclosed in the U.S. patent application Ser. No. 09/815,122, entitled "Adaptive Integrated Circuitry with Heterogeneous and Reconfigurable Matrices of Diverse and Adaptive Computational Units having Fixed, Application Specific Computational Elements," referenced, above.
In general, the ACE architecture includes a plurality of heterogeneous computational elements coupled together via a programmable interconnection network.
A plurality of heterogeneous computational elements (or nodes), including computing elements 120, 122, 124, and 126, comprise fixed and differing architectures corresponding to different algorithmic functions. Each node is specifically adapted to implement one of many different categories or types of functions, such as internal memory, logic and bit-level functions, arithmetic functions, control functions, and input and output functions. The quantity of nodes of differing types in an ACE device can vary according to the application requirements.
Because each node has a fixed architecture specifically adapted to its intended function, nodes approach the algorithmic efficiency of ASIC devices. For example, a binary logical node may be especially suited for bit-manipulation operations such as, logical AND, OR, NOR, XOR operations, bit shifting, etc. An arithmetic node may be especially well suited for math operations such as addition, subtraction, multiplication, division, etc. Other types of nodes are possible that can be designed for optimal processing of specific types.
Programmable interconnection network 110 enables communication among a plurality of nodes such as 120, 122, 124 and 126, and interfaces 102, 104, 106, and 108. The programmable interconnection network can be used to reconfigure the ACE device for a variety of different tasks. For example, changing the configuration of the interconnections between nodes can allow the same set of heterogeneous nodes to implement different functions, such as linear or non-linear algorithmic operations, finite state machine operations, memory operations, bit-level manipulations, fast-Fourier or discrete-cosine transformations, and many other high level processing functions for advanced computing, signal processing, and communications applications.
In one embodiment, programmable interconnection network 110 comprises a network root 130 and a plurality of crosspoint switches, including switches 132 and 134. In one embodiment, programmable interconnection network 110 is logically and/or physically arranged as a hierarchical tree to maximize distribution efficiency. In this embodiment, a number of nodes can be clustered together around a single crosspoint switch. The crosspoint switch is further connected with additional crosspoint switches, which facilitate communication between nodes in different clusters. For example, cluster 112, which comprises nodes 120, 122, 124, and 126, is connected with crosspoint switch 132 to enable communication with the nodes of clusters 114, 116, and 118. Crosspoint switch is further connected with additional crosspoint switches, for example crosspoint switch 134 via network root 130, to enable communication between any of the plurality of nodes in ACE device 100.
The programmable interconnection network (PIN) 110, in addition to facilitating communications between nodes within ACE device 100, also enables communication with nodes within other ACE devices via network inputs and outputs interfaces 104 and 108, respectively, and with other components and resources through other interfaces such as 102 and 106.
In accordance with embodiments of the present invention, a memory controller is used to provide memory access services in an ACE architecture.
Nodes 301 can be any nodes, (e.g., computational elements or resources) in a computing device. Nodes 301 initiate memory service requests to memory controller 302. For example, nodes 301 can initiate read and write commands. If a read command is initiated, the requesting node is considered a "consumer" in that it consumes data read from memory 304 and if a write command is initiated, the requesting node is considered a "producer" in that it produces data to be written to memory 304. The read and write commands may be in the form of different memory access services that are described below.
PIN 110 receives memory service requests from nodes 301 in the ACE device. Additionally, PIN 110 receives and/or sends data from/to memory controller 302 and receives and/or sends the data from/to the requesting nodes in the ACE device.
Memory controller 302 receives memory access service requests from PIN 110 and processes the requests accordingly. In one embodiment, the services provided by memory controller 302 include a peek and poke service, a memory random access (MRA) service, a direct memory access (DMA) service, a point-to-point (PTP) service, a real-time input (RTI) service and a message service. The peek and poke service allows a requesting node to peek (retrieve) data and poke (write) data found in memory controller 302. A memory random access (MRA) service allows a requesting node to do a read and write to memory 304. A direct memory access (DMA) service allows a requesting node to request large blocks of data from memory 304. A point-to-point (PTP) service allows a requesting node to read and write data, and update port parameters, in a process that conforms to a point-to-point protocol. In one embodiment, the PTP service is used to read and write real-time streaming data. The real-time input (RTI) service performs the same service as to PTP service but uses a reduced acknowledgement protocol. Additionally, memory controller 304 provides messaging to nodes in the ACE device. For example, memory controller 302 can provide confirmation acknowledgement messages to requesting nodes that may be used for flow control.
In one embodiment, memory 304 is an external memory for an ACE device. Memory 304 receives memory service requests from memory controller 302 and provides data to memory controller 302 when a read operation is requested. Additionally, memory controller 302 may provide data to memory 304 that is to be written to memory 304. Memory 304 may be any memory, such as, a synchronous dynamic random access memory (SDRAM), a flash memory, static random access memory (SRAM) and the like.
The above-mentioned services that may be provided by memory controller 302 will now be described. Although the following memory services are described, it will be understood that a person skilled in the art will appreciate other memory services that memory controller 302 may provide.
Flow control is provided for a poke request in that a requesting poke waits for a poke acknowledgement before initiating a new poke to the same memory. In the case where multiple services are provided in memory 304, multiple requests to different memories may be allowed.
PIN interface 400 is configured to receive memory service requests from PIN 110. Additionally, PIN interface 400 is configured to send data or any other messages to PIN 110. In one embodiment, PIN interface 400 includes a distributor, input arbiter, and an aggregator. The distributor and arbiter facilitate distributing data to one or more engines 402. The aggregator aggregates words that will be sent to nodes. When a request is received at PIN interface 400, PIN interface 400 determines which engine in engines 402 to send the request to.
In one embodiment, PIN interface 400 also provides a priority system for memory service requests. For example, one memory priority system may give a peek/poke memory service request the highest priority. Random read requests that are received with a fast track or higher priority indication are then given the next highest priority. All other requests are given a lowest priority. For example, random memory access requests are placed on a 132 entry first come first serve queue, DMA and PTP requests are placed on a single 64 entry first come first serve queue and these two queues are serviced on a round robin basis.
As shown, one or more engines 402 includes a peek/poke engine 410, a fast track engine 412, a random read/write engine 414, and a PTP/DMA/RTI engine 416 according to one embodiment of the invention. Although these engines 402 are described, a person skilled in the art will appreciate that other engines may be provided to perform functions related to the memory access services. Engines 402 process a memory service request and provide the appropriate request to memory interface 404 to fulfill the memory service request. For example, engines 402 determine a memory address that data should be read from in memory 304 or the data and a memory address in which data should be written to in memory 304. The action is then performed according to a protocol associated with the memory service request.
Memory interface 404 receives memory service requests from memory interface 404 and provides them to SDRAM memory 406 and/or flash memory 408. Although SDRAM memory 406 and flash memory 408 are shown, it will be understood that a person skilled in the art will appreciate other memories that may be used.
The types of services that are provided by engines 402 will now be described.
When a peek memory service request is received at PIN interface 400, it determines that the request should be sent to peek/poke engine 410. The peek request is received in one or more data words and PIN interface 400 is configured to determine from data in the data words that a peek should be performed. The peek request is then forwarded to peek/poke engine 410, which determines peek address(es) that data should be read from. In one embodiment, peek requests are used to read data from memory or registers found in controller 302. For example, registers storing parameters 422 in ports 418 may be peeked. The data request at the determined address(es) is then sent to appropriate registers. The data is then returned to peek/poke engine 410 and sent to the requesting node through PIN interface 400 and PIN 110.
In order to provide flow control, the requesting node waits for receipt of prior peek data before initiating a new peek request to the same memory.
When a poke request is received at PIN interface 400, PIN interface 400 determines that the request should be sent to peek/poke engine 410. In one embodiment, a poke request is sent in one or more data words and PIN interface 400 determines from the one or more data words that the request should be sent to peek/poke engine 410. Peek/poke engine 410 receives a poke address word from the requester and a poke data word to write to the address previously supplied by the poke address word. For example, registers including parameters 422 may have data written to them. Peek/poke engine 410 also determines from the one or more data words which register to write the data to.
After the data has been written, a poke acknowledgement may be sent by peek/poke engine 410 to the requesting node through PIN 110 and PIN interface 400. Flow control can be realized by requiring a requesting node to wait for full acknowledgement before initiating a new poke to the same memory.
Fast track engine 412 is provided to perform memory access services that have a higher priority. Thus, fast track engine 412 allows requesting nodes to send requests and data in an expedited manner.
When a memory random access read or write is received at PIN interface 400, PIN interface 400 then provides the memory service request to random read/write engine 414. In one embodiment, a double word (32-bits) on a double word boundary may be read at a certain specified address or a burst read, which reads 16 double words on double word boundaries, may be performed.
In one embodiment, MRA read requests are placed in a queue and random read/write engine 414 services requests in a first in/first out methodology in one embodiment. When a request to memory 304 is ready, random read/write engine 414 sends the determined address with an indication of the appropriate memory that data should be read from to memory interface 404. The request is forwarded to memory 304 and data is read and returned to random read/write engine 414. The data can then be returned to the requesting node through PIN interface 400 and PIN 110.
In order to maintain flow control, in one embodiment, the requesting node waits for receipt of prior MRA read data before initiating a new MRA read or write to the same memory. Thus, the requesting node may make a first read request to SDRAM memory 406 and a second request to flash memory 408 simultaneously but cannot make multiple requests to SRAM memory 406 or flash memory 408.
When PIN 400 receives a MRA write request, it determines from one or more data words in the request that a MRA write should be performed. For example, a bit or any other indication may be set in the one or more data words to indicate the request is a MRA request. The request is then forwarded to random read/write engine 414, which determines a memory location from the one or more data words where the data should be written. The address is then stored in a table and when data for the write is received (either with the one or more data words containing the request or in one or more data words received later), the data is then stored in a temporary buffer. The MRA request is then placed in a queue. The queue is serviced in a first in/first out manner by random read/write engine 414.
When the MRA write request is serviced, the data is retrieved from the temporary buffer and written to the address included in the appropriate entry of the random address queue. In this case, the data, address, and which memory to write the data are sent to memory interface 404, which writes the data to either SDRAM memory 406 or flash memory 408 at the address specified. Random read/write engine 414 then sends a MRA write acknowledgement to the requesting node. Flow control is maintained because a requesting node waits for a MRA write acknowledgement before issuing a new random MRA read or write to the same memory.
A plurality of ports 418 are provided for the direct memory access (DMA), point-to-point (PTP), and real-time input (RTI) memory services. In one embodiment, each port includes DAG parameters and other parameters 422 and a temporary buffer 424. In a preferred embodiment the DAG is used to generate sequences of addresses for both reading and writing memory. For example, a node that desires to access a pattern of memory locations obtains the addresses from the DAG. The DAG can be configured in various ways such as, e.g., by a control node poking port configuration parameters. Another way to configure the DAG is dynamically via PTP control words. Details of the DAG are provided in following sections.
One or more DAG parameters 422 associated with a port 148 are used by DAG 420 to determine the appropriate data to retrieve from memory 304, or the appropriate location in memory to update. Other parameters can be included, such as temporary buffer parameters, control and status register bits, producer information, consumer information, counts, and the like.
In one embodiment, each of ports 418 include a temporary buffer 424. Temporary buffer 424 is used to store one or more PTP/DMA/RTI words that are received from a requesting node. When data is stored in temporary buffer 424, an indication of what kind of request associated with the stored data is stored in queue 426.
A PTP_DMA_Queue 426 is maintained by the PTP/DMA/RTI engine 416 for servicing of ports. Various events as described below cause a port to be placed on this first-in-first-out queue.
The services provided by PTP/DMA/RTI engine 416 will now be described.
Direct memory access services include a DMA read and a DMA write service. In a DMA read service, any of the ports 418 can serve as a source of a DMA channel set up by a requesting node 301. When a DMA read request for a port i in ports 418 is serviced, DAG 420 is configured with the DAG parameters for port i. Data is then read from memory 304, such as SDRAM memory 406 or flash memory 408, using the just configured DAG 420 by PTP/DMA/RTI engine 416.
The DMA read may be for a large chunk of data and multiple reads may be needed to read the entire requested chunk of data. Thus, memory controller 302 may send multiple chunks of data to a requesting node 301 in response to a DMA read. In one embodiment, counts are used to determine how much data to read. For example, chunks of data may be read in 32-bit words but the read request may be for seven bytes. The count would be set to seven and when the first word, which includes four bytes, is read, the count is decremented to three. When the next byte is read, the count is decremented to zero and only three bytes are read because the count was three. In some cases, multiple DMA reads may be serviced for a node.
In order to maintain flow control, memory controller 302 waits for a DMA read chunk acknowledgment from the requesting node before transmitting the next chunk of data. Also, PTP/DMA/RTI engine 416 waits for a DMA done message from the requesting node until a new DMA read from the same memory 304, such as SDRAM memory 406 or flash memory 408, is initiated.
PTP/DMA/RTI engine 416 can also perform a DMA write. Any of the ports in ports 418 may serve as the destination of a DMA channel set up by a requesting node. Temporary buffer 424 is provided in each of ports 418 in order to store incoming DMA data that is eventually written into memory 304. Although buffer 424 is described, it will be understood that buffer 424 may not be used and the data may be streamed to PTP/DMA/RTI engine 416. Because a DMA write might be a write for large amounts of data, the data may arrive in multiple data words over a period of time. When a DMA write request is received at a port i in ports 418, if port i's temporary buffers 424 are already full, an error message is sent to the requesting node. If not, the data is written sequentially into port i's temporary buffer 424 and a corresponding DMA write request is placed in queue 426. As more data is received on port i, the data is written sequentially into the port's temporary buffer 424 if it is not already full. When the last data word for the DMA write request is received on port i, a DMA write request is placed in queue 426. Although the above sequence is described, it will be understood that a person skilled in the art will appreciate other ways of handling the received data.
When the DMA write request is ready to be serviced by PTP/DMA/RTI engine 416, DAG 420 of PTP/DMA/RTI engine 416 is configured with DAG parameters 422 for port i. Each successive DMA write request is read from queue 426 and the corresponding data in port i's temporary buffer 424 is then written to memory 304, such as SDRAM memory 406 or flash memory 408, using the just configured DAG 420. DAG 420 may calculate addresses based on one or more parameters 422 associated with port I and an address associated with the applicable memory DMA request. The addresses may be calculated for each successive DMA write request and DAG 420 may be configured with parameters 422 for each write request.
In order to maintain flow control, the transmitting node waits for a chunk acknowledgment from memory controller 302 that indicates the chunk of data has been stored in temporary buffer 424 before transmitting the next chunk of data to be stored in port I's temporary buffer 424. Additionally, the requesting node waits for a DMA done message from memory controller 302 before initiating a new DMA write to the same memory 304.
In one embodiment, counts are used to determine how much data to write. For example, chunks of data may be received in 32-bit words. The write request may be for seven bytes. The count would be set to seven and when the first word, which includes four bytes, is received and written, the count is decremented to three. When the next word is received, the count is decremented to zero and only three bytes are written because the count was three.
Point-to-point memory services may also be performed by PTP/DMA/RTI engine 416. Nodes 301 may read and write memory 304 and update selected port parameters 422 via any of ports 418 using a point-to-point protocol. Memory controller 302 adheres to all point-to-point conventions, performs forward and backward ACKing, and also maintains counts for consumers and producers. Additionally, flow control is maintained because of the point-to-point conventions. For example, in a write request, neither temporary buffer 424 for ports 418 nor a buffer in memory 304 will overflow so long as the requesting node adheres to PTP conventions. Additionally, in a read request, memory controller 302 will not overflow the consuming node's input buffer as long as the requesting node adheres to PTP conventions.
PTP/DMA/RTI engine 416 may perform point-to-point memory services using a number of modes. For example, an auto-source mode provides an infinite source of data. A read occurs automatically when there is available space in a consuming node's input buffer and read requests are not used. An infinite-sink mode may be provided to provide an infinite sink for data. In this case, a write occurs when there is data in temporary buffer 424 and new data overwrites old data when the main buffer is full. In one embodiment, memory 304 includes a main buffer where data is written to. Thus, data is read from temporary buffer 424 and written to the main buffer. Although a main buffer is described, it will be understood that data may be written to other structures in memory 304. A finite-sink mode provides a finite sink for data. In this case, a write occurs when there is data in temporary buffer 424 and available space in the main buffer and writing stops when the main buffer is full. A buffer mode implements a first in/first out (FIFO) queue. In this case, writes fill the main buffer while reads drain the main buffer. A write occurs when there is data in the temporary buffer and available space in the main buffer. A read occurs when there is sufficient data in the main buffer and available space in the consuming-nodes input buffer. A basic mode provides unrestricted writing to a data structure. In this case, a write occurs when there is data in the temporary buffer, and old data in memory is overwritten. Also, the basic mode provides unrestricted reading of a data structure. A read occurs after an explicit read request is received and there is available space in the consuming nodes input buffer.
Data packets are received from a data source such as a distributor (e.g., from PIN Interface 400 of
Port parameters can be updated by information in "poke packets" or by control-word information in incoming PTP/DMA packets. The parameter update information is provided to parameter control system 602. Port parameters are used to define characteristics of a port for specific or desired functionality. For example, port parameters control characteristics of temporary buffers, removing control and data words from the temporary buffer for processing, unpacking data (double) words into records in preparation for writing to main memory, writing and reading records to main memory, packing records read from memory into double-words and composing appropriate MIN words for transmission to the consumer node, sending various control words—forward and backward acknowledgements, DMA chunk acknowledgements and DMA Done messages—to the producer and consumer nodes; and other functions.
Unpacked data produced by unpacker 608 can include one or more records. Each record can be 8, 16 or 32 bits. A 4 bit byte select is sent with each 32-bit unpacked datum to indicate which of the bytes contain valid data and are to be written to memory.
Control words are used to specify parameters and other control information and are discussed in detail in the sections, below. For example, a control word can include information that indicates whether a parameter update is to be followed by a read using the updated port parameters.
Data address generator 606 is used to generate an address, or addresses, for use in reading from or writing to memory. The data address generator is configured by the DAG parameters included in the port parameters 602. Packer 612 is used to pack records received from memory into 32-bit data words for transmission to the consuming node. Packet assembly 610 is used to assemble the 32-bit data words into a standard PTP, DMA or RTI packets for transmission to the consuming node.
In a preferred embodiment, the XMC node adheres to the same network protocol conventions as other nodes in the ACE. Examples of ACE network protocols in the preferred embodiment include Peek/Poke, MRA, PTP, DMA, RTI, message, etc. This allows XMC nodes to benefit from the same scaling features and adaptable architecture of the overall system. Details of a network protocol used in the preferred embodiment can be found in the related patent application entitled "Uniform Interface for a Functional Node in an Adaptive Computing Engine," referenced above.
In a preferred embodiment of the XMC there are 64 ports—each one a combination input/output port. Three matrix interconnect network (MIN) (also referred to as the programmable interconnect network (PIN)) protocols—Direct-Memory-Access (DMA), Point-To-Point (PTP) and Real-Time-Input (RTI)—make use of these ports for both writing data to and reading data from memory.
Memory addresses for both writing and reading are generated by a logical DAG associated with each port. This logical DAG is actually a set of DAG parameters that are used to configure a single physical DAG, as needed, for memory writes and reads.
Each port also has a temporary buffer to temporarily store incoming PTP/RTI/DMA words from the MIN. The total size of all 64 temporary buffers is 16 Kbytes arranged as 4K�33 bit words. The 33rd bit of each word indicates whether a double-word is a data word or a control word, as described below.
Each XMC port is associated with a set of parameters that define the characteristics of that port. These parameters configure the XMC hardware when a port is called upon to perform one of the following tasks:
Writing incoming control and data words into the temporary buffer;
Removing control and data words from the temporary buffer for processing;
Unpacking data (double-) words into records in preparation for writing to main memory;
Writing records to main memory;
Reading records from main memory;
Packing records read from memory into double-words and composing appropriate MIN words for transmission to the consumer node; and
Sending various control words—forward and backward acknowledgements, DMA chunk acknowledgements and DMA Done messages—to the producer and consumer nodes.
The value of each port parameter can be either static or dynamic. If static, then the parameter is updated only by a poke from the K-Node. If dynamic, then the parameter can be updated by a poke from the K-Node and also during normal XMC operation.
The Control and Status Bits described in Table A are the parameters that direct the behavior of ports and define their mode of operation.
Control and Status Bit parameters
0: Port disabled
(Static Value)
1: Port enabled
(Static Value)
01: PTP_Packet_Mode
00: Byte (8-bit)
(Static Value)
01: Word (16-bit)
10: Double-Word (32-bit)
(Static Value)
10: Bit_Reverse
0: Port does not support automatic reads
(Static Value)
1: Producer/Consumer counts can automatically trigger a read
0: Consumer_Count not checked in auto read
0: Consumer_Count not checked in auto read
(Static Value)
1: Consumer_Count >= 0 for auto read
0: New data overwrites old data in memory
(Static Value)
1: No writes to main-memory buffer when full
0: Update DAG_X_Index and DAG_Y_Index only by way of poke
(Static Value)
1: Update DAG_X_Index and DAG_Y_Index after each DAG use
0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words
(Static Value)
1: Start unpacking/packing new MIN word when DAG_Y_Index
0: Normal mode - port handles all incoming words
(Static Value)
1: High-speed mode - port does not support read requests
0: Normal DAG-addressing mode
(Static Value)
1: High-throughput mode for accessing contiguous blocks of 2-D data
0: Normal DAG addressing when performing read request
(Static Value)
1: DAG addressing bypassed when performing read request
The two DMA Bits in Table B are used to control DMA transfers from and to the XMC respectively.
DMA Bits
Poking this bit with a 1 initiates a DMA
(Static Value)
transfer from the XMC to Consumer
0: DMA_Write_Last_Word_Of_Chunk
(Dynamic Value)
initiated DMA service request
1: DMA_Write_Last_Word initiated DMA
service request
The DAG parameters in Table C—together with DAG_Address_Mode—determine the sequence of addresses generated by the port's Data Address Generator. See section 3.2 for more details.
DAG Parameters
Unsigned integer; Units = bytes; Base address of block
(Dynamic Value)
1-D mode read:
DAG Address = DAG_Origin + DAG_X_Index
1-D mode write:
DAG Address = DAG_Origin + DAG_Y_Index
2-D mode:
DAG Address = DAG_Origin + DAG_X_Index + DAG_Y_Index
Bit_Reverse mode read or write:
DAG Address = DAG_Origin + reverse(DAG_X_Index)†
Must be on a Dword boundary, i.e. [1:0] = 00;
†reverse(b, p0, p1) —reverse bits from bitpos p0 thru bitpos p1, e.g.:
for (i = 0; i <=(p1−p0−1)/2; i++) { swap(b[p0+i], b[p1−i]); }
Unsigned integer; Units = bytes
(Dynamic Value)
Initial value must be less than DAG_X_Limit.
1-D mode, after a read, or
2-D mode, after a read or write:
DAG_X_Index += DAG_X_Stride
Bit_Reverse mode, after a read or write:
DAG_X_Index += 1, 2, or 4 (byte, word, dword record, respectively)
Then test:
if DAG_X_Index ≧ DAG_X_Limit (+X Wrap)
DAG_X_Index −= DAG_X_Limit
else if DAG_X_Index < 0 (−X Wrap)
DAG_X_Index += DAG_X_Limit
Signed integer; Units = bytes
(Dynamic Value)
Absolute value must be less than DAG_X_Limit.
1-D, 2-D mode: Increment/decrement to DAG_X_Index
Bit_Reverse mode: reverse(1) = 2{circumflex over ( )}(n − 1), i.e. a single bit marking the
leftmost bit position to be reversed in DAG_X_Index
DAG_X_Limit [27:0]
Unsigned integer; Units = bytes
(Dynamic Value)
1-D mode read - block size
1-D mode write - not used
2-D mode read or write - X block size
Bit_Reverse mode - block size
Unsigned integer; Units = bytes
(Dynamic Value)
Initial value must be less than DAG_Y_Limit.
1-D mode, after a write, or
2-D mode, after an X Wrap:
DAG_Y_Index += DAG_Y_Stride
Bit_Reverse mode - not used
Then test:
if DAG_Y_Index ≧ DAG_Y_Limit (+Y Wrap)
DAG_Y_Index −= DAG_Y_Limit
else if DAG_Y_Index < 0 (−Y Wrap)
DAG_Y_Index += DAG_Y_Limit
Signed integer; Units = bytes
(Dynamic Value)
Absolute value must be less than DAG_Y_Limit
1-D, 2-D mode: Increment/decrement to DAG_Y_Index
Bit_Reverse mode - not used
Unsigned integer; Units = bytes
(Dynamic Value)
1-D mode read - not used
1-D mode write - block size
2-D mode read or write - Y block size
Bit_Reverse mode - not used
The Temporary-Buffer Parameters in Table D define the size of temporary buffer of a port and provide the write-pointer and read-pointer needed to implement a circular first-in-first-out queue.
Temporary-Buffer Parameters
0000: 4 (bytes)
(Static Value)
0001: 8
0010: 16
0011: 32
0100: 64
0101: 128
0110: 256
0111: 512
1000: 1024
1001: 2048
1010: 4096
1011: 8192
1100: 16384
Write pointer
(Dynamic Value)
Read pointer
(Dynamic Value)
The Producer/Consumer Information in Table E is used in various fields in the MIN words that are sent to the Data Producer, Control Producer and Consumer.
Producer/Consumer Information
Address of Data Producer (The
(Static Value)
source of PTP/DMA data words)
Mode bit of Data Producer
(Static Value)
Port number of Data Producer
(Static Value)
Task number of Data Producer
(Static Value)
Address of Control Producer (The
(Static Value)
source of PTP control words)
Mode bit of Control Producer
(Static Value)
Port number of Control Producer
(Static Value)
Task number of Control Producer
(Static Value)
Address of Consumer (The
(Static Value)
destination of read data)
Mode bit of Consumer
(Static Value)
Port number of Consumer
(Static Value)
Task number of Consumer
(Static Value)
The Counts in Table F provide flow control between (a) the Data and Control Producers and the XMC, (b) the temporary buffer and the main-memory buffer (when Buffer_Write=1) and (c) the XMC and the Consumer.
A signed number indicating the number of bytes in a port's
(Dynamic Value)
temporary buffer minus 1; A port is serviced when
ACK_Count ≧ 0
Initialized at system reset to −1 indicating that the temporary
buffer is empty; and then incremented in response to forward
ACKs from the Data and Control Producers indicating the
number of data/control words, expressed in bytes, placed in the
temporary buffer; and then decremented when the XMC sends
backward ACKs to the Data Producer and Control Producer
indicating the number of data words and control words,
respectively - expressed in bytes - removed from the temporary
An unsigned number indicating the number of records read
(Static Value)
from memory and sent to the consumer node per read-request or
A signed number reflecting the available space, in bytes, in the
(Dynamic Value)
Consumer's input-buffer; Producer_Count < 0 indicates
that the consumer node input-buffer has available space for
Read_Count records
Should be initialized to RC − CBS − 1 (a negative value),
where RC is Read_Count, expressed in bytes, and CBS is the
Consumer's input-buffer size, in bytes; Incremented when the
XMC sends forward ACKs to the Consumer indicating the
amount of data, in bytes, read from memory and sent to the
Consumer; and then decremented in response to backward
ACKs from the Consumer indicating the amount of space, in
bytes, freed up in the Consumer's input buffer
A signed number reflecting the number of bytes in the main-
(Dynamic Value)
memory buffer; Consumer_Count ≧ 0 indicates that the
main-memory buffer has at least Read_Count records;
Applicable only when Buffer_Read = 1
Should be initialized to a (negative) value between TBS −
MBS and −RC, where TBS is the temporary-buffer size, in
bytes, MBS is the main-memory-buffer size, in bytes, and RC is
Read_Count, expressed in bytes; Incremented when the
XMC moves data from the temporary buffer to the main-
memory buffer; and then decremented when the XMC sends
forward ACKs to the Consumer indicating the amount of data,
in bytes, read from the main-memory buffer and sent to the
A signed number which, when added to Consumer_Count,
(Static Value)
indicates XMC buffer status; Consumer_Count +
Buffer_Full_Offset ≧ 0 indicates that the main-
memory buffer is full; The main-memory buffer is considered
to be full when it does not have at least a temporary-buffer's
worth of available space; Applicable only when
Buffer_Write = 1
Should be initialized to TBS − MBS − ICC − 1 where TBS
is the temporary-buffer size, in bytes, MBS is the main-memory-
buffer size, in bytes, and ICC is the initial value of
Table C, above, describes XMC DAG parameters. The 3 accessing modes (1-D, 2-D, and Bit_Reverse) are explained below. Special cases are also discussed relating to Y-Wrap and Burst Mode.
The DAG includes the ability to generate patterned addresses to memory. Three parameters—Index, Stride, and Limit—in each of X and Y define these patterns. In the simplest 1-dimensional case, the Index parameter is incremented by Stride, tested against the block size given by Limit, and then added to Origin to determine the final address.
Note that Stride is a signed quantity, and can be negative to enable stepping backwards through a block of memory addresses. If the Index is incremented/decremented outside the block (0 thru Limit-1), the Limit is subtracted/added respectively to bring the address back within the block. In this way, circular buffers with automatic wrap-around addressing are easily implemented. In general, any type of addressing, address incrementing/decrementing, indexing, etc., can be used with DAGs of different designs.
In a 1-D addressing mode, the DAG writes or reads addresses in a linear fashion. On each advance, DAG_X_Stride is added to DAG_X_Index, and the result tested greater than or equal to DAG_X_Limit and less than 0 (since DAG_X_Stride can be negative). In these cases, DAG_X_Index is decremented or incremented, respectively, by DAG_X_Limit, thus restoring it to the proper range.
When in 1-D Write Mode, only, the DAG uses the DAG_Y_Index, DAG_Y_Stride, and DAG_Y_Limit parameters, not X, to compute the write address. This is so that read operations can be performed concurrently, using the X parameters in the usual way, to create a circular buffer such as a FIFO.
In a 2-D addressing mode, the DAG writes or reads addresses in 2-dimensional "scan-line" order, utilizing both the X and Y parameters similarly to the 1-D mode. X advance is performed first, and an X Wrap (either + or −) causes a Y advance (and thus a potential Y Wrap as well). See the DAG advance pseudo-code description in section 3.2.4 below.
Note that Y parameters are always specified in units of bytes, not scan lines or data items.
Bit-reversed addressing is included in the hardware to enable implementation of Fast Fourier Transforms and other interleaved or "bufferfly" computations. In this mode, bits within the DAG_X_Index field are reversed (swapped) just prior to using them in the memory address computation.
In Bit_Reverse mode, DAG_X_Stride is not used as an increment, but instead determines the range of bits to reverse within DAG_X_Index. Specifically, the DAG_X_Stride should be set to reverse(1)=2^(n−1)=� the size of the block in bytes. Bits p through n−1 will be reversed in the DAG_X_Index, where p=0, 1, 2 for Record_Size of byte, word, and dword, respectively.
Example: For a 2^12=4096-point FFT in byte mode, parameters might be
DAG_X_Index=0x0, DAG_X_Stride=0x800, DAG_X_Limit=0x1000.
Thus the hardware will reverse bits 0-11, and the address sequence is
reverse(address, 0, 11)
. . .
. . .
As in other modes, the resulting reversed DAG_X_Index value is added to the Origin address before being used to access memory.
In Bit_Reverse mode, note that the starting DAG_X_Index, the DAG_X_Limit, and the Origin are byte addresses specified normally—NOT bit-reversed. However, in this mode, the Origin must be on a double-word boundary, i.e. bits [1:0]=00;
Although the X Wrap mechanism works in Bit_Reverse mode, typically DAG_X_Index is initialized to 0 and a single array of 2^n values will be addressed once.
Combining the above parameter definitions, the calculation of the DAG memory addresses is as follows:
When the DAG is advanced:
● If Address_Mode = 1-D and the DAG is generating a Read Address
[or Bit_Reverse mode]:
◯ DAG_X_Index = DAG_X_Index + DAG_X_Stride [+ 1, 2,
or 4 instead if Bit_Reverse mode]
◯ If DAG_X_Index >= DAG_X_Limit, (+X wrap)
▪ DAG_X_Index = DAG_X_Index − DAG_X_Limit;
◯ Else if DAG_X_Index < 0, (−X wrap)
▪ DAG_X_Index = DAG_X_Index + DAG_X_Limit;
◯ Memory Address = Origin + DAG_X_Index
[+ reverse(DAG_X_Index) instead if Bit_Reverse mode]
● If Address_Mode = 1-D and the DAG is generating a Write Address:
◯ DAG_Y_Index = DAG_Y_Index + DAG_Y_Stride
◯ If DAG_Y_Index >= DAG_Y_Limit, (+Y wrap)
▪ DAG_Y_Index = DAG_Y_Index − DAG_Y_Limit;
◯ Else if DAG_Y_Index < 0, (−Y wrap)
▪ DAG_Y_Index = DAG_Y_Index + DAG_Y_Limit;
◯ Memory Address = Origin + DAG_Y_Index;
● If Address_Mode = 2-D:
◯ DAG_X_Index = DAG_X_Index + DAG_X_Stride;
◯ If DAG_X_Index >= DAG_X_Limit, (+X wrap)
▪ DAG_X_Index = DAG_X_Index − DAG_X_Limit;
▪ DAG_Y_Index = DAG_Y_Index + DAG_Y_Stride;
▪ If DAG_Y_Index >= DAG_Y_Limit, (+Y wrap)
● DAG_Y_Index = DAG_Y_Index − DAG_Y_Limit;
▪ Else if DAG_Y_Index < 0, (−Y wrap)
● DAG_Y_Index = DAG_Y_Index + DAG_Y_Limit;
◯ Else if DAG_X_Index < 0, (−X wrap)
▪ DAG_X_Index = DAG_X_Index + DAG_X_Limit;
▪ DAG_Y_Index = DAG_Y_Index + DAG_Y_Stride;
▪ If DAG_Y_Index >= DAG_Y_Limit, (+Y wrap)
● DAG_Y_Index = DAG_Y_Index − DAG_Y_Limit;
▪ Else if DAG_Y_Index < 0, (−Y wrap)
● DAG_Y_Index = DAG_Y_Index + DAG_Y_Limit;
◯ Memory Address = Origin + DAG_X_Index + DAG_Y_Index
Tables G-N, below, shows "for loop" representations in C pseudo-code of various DAG addressing modes. Capitalized names such as Origin, Index, Stride, Limit, etc. represent the corresponding DAG parameters. The examples below all assume Record_Size=Dword=4 bytes, and positive strides. Note that DAG parameters are always given in units of bytes, not records.
Linear Addressing Definition
// Linear addressing
void DAG_Linear (
byte *Origin,
uint28 Index,
int28 Stride,
uint28 Limit,
int28 count) { // count < Limit
int28 i;
for (i=Index; i<Index+count; i+=Stride) {
printf("%d: %d %d\n", i, Origin+i, (dword)Origin[i]);
Linear Addressing Example
Given the following memory contents,
the function call
DAG_Linear(0x22bed0, 0, 1*4, 20*4, 6);
Circular Addressing Definition
// Circular (wraparound) addressing
void DAG_Circular_1D(
byte *Origin,
uint28 Index,
int28 Stride,
uint28 Limit,
int28 count) {
int28 i, imod;
for (i=Index; i<Index+count; i+=Stride) {
imod = i % Limit;
printf("%d: %d %d\n", i, Origin+imod, (dword)Origin[imod]);
Circular Addressing Example
Given the following memory contents,
the function call
DAG_Circular_1D(0x22bed0, 0, 1*4, 6*4, 10);
2D Addressing Definition
// 2-D Addressing
void DAG_2D(
byte *Origin,
uint28 xIndex,
int28 xStride,
uint28 xLimit,
uint28 yIndex,
int28 yStride,
uint28 yLimit) {
int28 x, y;
// Access a one-dimensional array through two loops (2-D)
for (y=yIndex; y<yIndex+yLimit; y+=yStride) {
for (x=xIndex; x<xIndex+xLimit; x+=xStride) {
printf("%d %d: $d %d\n", x, y, Origin+x+y, (dword)Origin[x+y]);
2D Addressing Example
Given the following memory contents
(a 2-D image, X � Y = 3 columns � 3 rows embedded in
5 columns � 4 rows),
the function call
DAG_2D(0x22bef8, 0, 1*4, 3*4, 0, 5*4, 15*4);
Bit-Reverse Addressing Definition
// Bit-Reverse addressing (with wraparound)
void DAG_BitReverse(byte *Origin,
uint28 Index,
int28 Stride,
uint28 Limit,
int28 count) {
int28 i, irev;
for (i=Index; i<Index+count*4; i+=4) {// inc by 4 for dwords
irev = Bit_Rev(i % Limit); // swap bits 2 thru Stride bit
printf("%d: %d %d\n", i, Origin+irev, (dword)Origin[irev]);
Bit-Reverse Addressing Example
Given the following memory contents (an 8-element block),
the function call
DAG_BitReverse(0x22bed0, 0, 4*4, 8*4, 12); // Stride =
2{circumflex over ( )}(n−1) = 4 yields
Any of the 64 PTP/DMA ports can serve as the source of a DMA channel set up by the K-Node/Host. In a preferred embodiment, only one DMA channel to/from memory at a time can be supported.
When Status_Register[i].DMA_Go is poked with a 1,
When a Service Request for Port i is serviced with Control_Register[i].Port_Type=DMA and Register[i].DMA_Go=1:
The K-Node waits for a DMA Done message from the destination node before initiating a new DMA read/write from/to the same memory.
Direct-Memory-Access Write
Any of the PTP/DMA 64 ports can serve as the destination of a DMA channel set up by the K-Node/Host.
When a DMA Write from the MIN is received on Port i:
When a DMA Write Last Word Of Chunk from the MN is received on Port i:
When a DMA Write Last Word from the MIN is received on Port i:
When a Service Request for DMA-Port i is serviced
The DMA source waits for a DMA Chunk Acknowledgement from the memory controller before transmitting the next chunk (chunk size must be less than or equal to the size of the port's temporary buffer).
The K-Node waits for DMA Done message from the memory controller before initiating a new DMA read/write from/to the same memory.
Nodes may read and write memory and update selected port parameters via any of the 64 ports of the memory controller using the point-to-point protocol. The memory controller performs forward and backward ACKing and maintains Consumer_Counts and Producer_Counts.
The memory controller recognizes a data word where the payload field contains data to be written to memory and a control word where the payload field contains port-update information and a bit indicating whether the update is to be followed by a read using the DAG. When the update is followed by a read request the control word is called a Read Request. Table 1, below, shows different types of control words. PTP data words and PTP control words may be sent to a memory Port in any order and are processed in the order received.
PTP Control-Word Fields
New Parameter Value
000: Update DAG_Origin
001: Update DAG_X_Index
010: Update DAG_X_Stride
011: Update DAG_X_Limit
100: Update DAG_Y_Index
101: Update DAG_Y_Stride
110: Update DAG_Y_Limit
111: Update Read_Count
0: No Read Request
1: Read Request
Generally, data words and control words sent to the XMC are generated independently by separate tasks running on separate nodes. Therefore, when the XMC sends acknowledgements to the nodes to indicate that a control word or other message or information has been received, the XMC must send separate acknowledgments, with appropriate values, to the task or node that is producing data words. The task or node that is producing the data word is referred to as the "Data Producer". A task or node that is producing control words is referred to as the "Control Producer." The XMC maintains information on the Data Producer and Control Producer in order to properly send backward acknowledgements to both.
In general, tasks or nodes can be referred to as a "process" or as a component that performs processing. Although specific reference may be made to hardware or software components, it should be apparent that functions described herein may be performed by hardware, software or a combination of hardware and software.
In a preferred embodiment, all words—both data and control—arriving at a PTP/RTI port on the XMC are placed sequentially into the same temporary buffer. For a case where two types of words are generated independently, typically by different nodes, it is necessary to allocate a portion of the temporary buffer to data words and a portion to control words to prevent buffer overflow.
When a PTP Write, PTP Packet-Mode Write or RTI Write from the MIN is received on Port i the following actions are performed:
In a preferred embodiment the XMC operates in eight basic modes. These include the following:
Basic Mode—Provides unrestricted reading of and writing to a data structure. A write occurs when there is data in the temporary buffer and old data overwritten. A read occurs after an explicit read request has been received and there is available space in the input buffer consuming node. It does not consume data.
High-Speed-Write Mode—Similar to Basic Mode with the exception that read requests are not supported, thereby achieving higher throughput in writing to memory.
Finite-Sink Mode—Provides finite sink for data. A write occurs when there is data in the temporary buffer and available space in the main buffer. Writing stops when the main buffer is full.
Auto-Source Mode—Provides an infinite source of data. A read occurs automatically when there is available space in the input buffer of the consuming node. Read Requests are not used.
Buffer Mode—Implements a buffer/FIFO. Writes fill the main buffer while reads drain the main buffer. A write occurs when there is data in the temporary buffer and available space in the main buffer. A read occurs when there is sufficient data in the main buffer and available space in the consuming node's input buffer.
Y-Wrap Mode—Permits a write to memory to end in the middle of a double-word for the case when Record_Size is either byte or (16-bit) word.
Burst Mode—A special high-throughput mode for reading and writing 2-D blocks of bytes. Similar to Y-Wrap Mode in that writes to memory can end in the middle of a double-word.
Burst-Write Mode—Identical to Burst Mode except that—like High-Speed-Write Mode—read requests are not permitted. Achieves higher throughput than Burst Mode in writing to memory.
Basic Mode
Basic Mode supports writing to and reading from memory with no restrictions on Port_Type, DAG parameters or the use of PTP control words. Reads are initiated either by a read request when Port_Type is PTP, PTP_Packet_Mode or RTI or by poking a 1 into DMA_Go when Port_Type is DMA.
Table II lists the Control and Status Bit parameters that define Basic Mode.
TABLE II Settings for Basic Mode Parameter Description Auto_Read 0: Port does not support automatic reads Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 0: New data overwrites old data in memory Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 0: Normal mode; The port handles all incoming words Burst 0: Normal DAG-addressing mode Random_Access 0: Normal DAG addressing when performing read request
High-Speed-Write Mode is similar to Basic Mode with the exception that read requests are not supported. This can allows advantages such as not requiring that Producer_Count<0 before words are removed from the temporary buffer is eliminated. Also, words can be removed from the temporary buffer at a higher rate.
Table III lists the Control and Status Bit parameters that define High-Speed-Write Mode.
TABLE III Parameters for High-Speed-Write Mode Parameter Description Auto_Read 0: Port does not support automatic reads Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 0: New data overwrites old data in memory Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 1: High-speed mode; the port does not support read requests Burst 0: Normal DAG-addressing mode Random_Access 0: Normal DAG addressing when performing read request
Finite-Sink mode allows data to be written to memory and preserved from being overwritten by subsequent data. This is useful, for example, for storing statistics data, an error log, etc. Table IV lists the Control and Status Bit parameters that define Finite-Sink Mode.
TABLE IV Parameters for Finite-Sink Mode Parameter Description Auto_Read 0: Port does not support automatic reads Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 1: No writes to main-memory buffer when full Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 1: High-speed mode; Port does not support read requests Burst 0: Normal DAG-addressing mode Random_Access 0: Normal DAG addressing when performing read request
An application may need to make use of tables of constants. For example, wave tables, pseudo-random data, etc., are typically written at system initialization and accessed in a continuous stream during real-time operation. Auto-Source Mode provides a means for accessing such data. Table V lists the Control and Status Bit parameters that define Auto-Source Mode.
TABLE V Parameters for Auto-Source Mode Parameter Description Auto_Read 1: Producer/Consumer counts can automatically trigger a read Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 0: New data overwrites old data in memory Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 1: High-speed mode; The port does not support read requests Burst 0: Normal DAG-addressing mode Random_Access 0: Normal DAG addressing when performing read request
In a preferred embodiment, a port in Buffer Mode implements a first-in-first-out queue. A delay line—a queue in which the amount of data in the queue remains above a threshold—is a form of FIFO and can also be implemented in Buffer Mode. Table VI lists the Control and Status Bit parameters that define Buffer Mode.
TABLE VI Parameters for Buffer Mode Parameter Description Auto_Read 1: Producer/Consumer counts can automatically trigger a read Buffer_Read 1: Consumer_Count >= 0 for auto read Buffer_Write 1: No writes to main-memory buffer when full Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 1: High-speed mode; The port does not support read requests Burst 0: Normal DAG-addressing mode Random_Access 0: Normal DAG addressing when performing read request
Y-Wrap Mode, along with Burst Mode and Burst-Write Mode, permit a write to memory to end in the middle of a double-word. Y-Wrap Mode can be used, for example, when writing a block of pixels (bytes) by rows into a two-dimensional frame buffer. In this case, the Y Wrap occurs when the last pixel of the block is written into memory. Any remaining bytes in the last data word are discarded and the next block of pixels begins with a new data word from the MIN. Table VII lists the Control and Status Bit parameters that define Y-Wrap Mode.
TABLE VII Parameters for Y-Wrap Mode Parameter Description Auto_Read 0: Port does not support automatic reads Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 0: New data overwrites old data in memory Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 1: Start unpacking/packing new MIN word when DAG_Y_Index wraps High_Speed_Write 1: High-speed mode; The port does not support read requests Burst 0: Normal DAG-addressing mode Random_Access 0: Normal DAG addressing when performing read request
Burst Mode can be useful in imaging or video applications (e.g., MPEG4, HDTV, etc.) that have high bandwidth/throughput requirements. In a preferred embodiment, Burst Mode makes use of the Double Data Rate (DDR) feature of DDR DRAM. Other applications can use other types of memory and need not use the DDR feature. Burst Mode allows blocks of pixels to be either written to or read from memory at very high rates. Burst Mode terminates writing (and reading) of a double-word on an X-Wrap. This difference means that each line, not just each block, begins with a new double-word. Table VIII lists the Control and Status Bit parameters that define Burst Mode.
TABLE VIII Parameters for Burst Mode Parameter Description Auto_Read 0: Port does not support automatic reads Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 0: New data overwrites old data in memory Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 0: Normal mode; The port handles all incoming words Burst 1: High-throughput mode for accessing contiguous blocks of 2-D data Random_Access 0: Normal DAG addressing when performing read request
Burst-Write Mode allows higher throughput than Burst Mode by not supporting read requests and by not requiring Producer_Count<0 in order to begin processing words from the temporary buffer. Table IX lists the Control and Status Bit parameters that define Burst-Write Mode.
TABLE IX Parameters for Burst-Write Mode Parameter Description Auto_Read 0: Port does not support automatic reads Buffer_Read 0: Consumer_Count not checked in auto read Buffer_Write 0: New data overwrites old data in memory Update_Index 1: Update DAG_X_Index and DAG_Y_Index after each DAG use New_MIN_Word_On_YWrap 0: Ignore DAG_Y_Index wrap when unpacking/packing MIN words High_Speed_Write 1: High-speed mode; The port does not support read requests Burst 1: High-throughput mode for accessing contiguous blocks of 2-D data Random_Access 0: Normal DAG addressing when performing read request
The features of the XMC can be used to advantage in different ways depending on a specific application. For example, in a "data-sinking" application it is sometimes necessary to store information about system performance (e.g., statistics or an error log) in memory. The data may have to be stored in real time and prevented from being overwritten by subsequent data. An XMC port configured in Finite-Sink Mode can provide that capability. The parameter settings for this mode are shown in Table X, below.
Real-time data are written into a buffer in memory until the buffer becomes full whereupon writing ceases. The data can be read at any time via a read request.
Data-Sinking Application
Read/Write Port i
Finite-Sink Mode
double-word (32 bits)
read-block size (records)
start of buffer
read pointer (initialized to
4 (bytes)
buffer size (bytes)
write pointer (initialized to
4 (bytes)
buffer size (bytes)
Another application is known as "data sourcing". Applications sometimes require a large or unbounded stream of fixed data—pseudo-random data or a wave table, for example—during real-time operation.
To provide the stream an XMC port can be configured in Auto-Source Mode accessing a circular buffer in memory containing the fixed data configured according to Table XI. The fixed data—which is typically written into the buffer at system initialization—can be supplied automatically to the consumer node, the flow being governed by normal PTP flow control using Forwards and Backwards ACKs. Because the buffer is circular and Buffer_Read is turned off, the port provides an infinite source of data.
Data-Sourcing Application
Read/Write Port i
Auto-Source Mode
double-word (32 bits)
read-block size (records)
start of buffer
read pointer (initialized to
4 (bytes)
buffer size (bytes)
write pointer (initialized to
4 (bytes)
buffer size (bytes)
Another type of application may require implementation of "delay lines." For example, digital audio broadcast, personal video recorders, modeling of acoustics, etc., types of applications can require a signal to be delayed by a number of samples. This requirement usually means that there will always be a certain minimum number of samples in the delay line once the line reaches steady-state operation (once the number of samples in the delay line reaches a threshold).
A delay line is implemented using a single port configured in Buffer Mode with Record_Size set to double-word as shown in Table XII. The circular buffer in main memory is accessed by DAG_X_Index for reading and DAG_Y_Index for writing. The initial value of Consumer_Count determines the length/size of the delay line: it is initialized to minus the size of the delay, converted to bytes.
For example, to implement a delay line of 1,000,000 double-words, a buffer of at least 4,000,000 bytes is allocated in memory and Consumer_Count is initialized to −4,000,000 as illustrated in Table. Because of the initial value of Consumer_Count, no output appears until at least 1,000,000 double-words have been written into the buffer and Consumer_Count has been incremented by a cumulative value of at least +4,000,000 (by Forward ACKs from the Data Producer). After that threshold has been reached and Consumer_Count has been driven non-negative, an auto read occurs.
In this example, the consumer node expects to get data from the delay line in blocks of 100 double-words, and so Read_Count is set to 100 (records). Upon an auto read, 100 double-words are removed from the buffer and sent to the Consumer (assuming Producer_Count<0). Consumer_Count is then decremented by 400 (bytes). If the new value of Consumer_Count is still non-negative, then another auto read occurs and the cycle is repeated. If the new value of Consumer_Count is negative, then reading is inhibited until additional double-words are written into the buffer and Consumer_Count is again driven non-negative.
In summary, once the number of samples in the delay line reaches at least 1,000,000 and Consumer_Count becomes non-negative, Consumer_Count never drops below −400 and the number of double-words in the delay line never drops below 999,900.
Delay-Line Application
Read/Write Port i
Buffer Mode
double-word (32 bits)
100 (records)
−4,000,000 (initial value in
start of buffer
read pointer (initialized to 0)
4 (bytes)
≧4,000,000 (buffer size in
write pointer (initialized to 0)
4 (bytes)
≧4,000,000 (buffer size in
Another type of application may require "data reordering" in which the elements in a block of data need to be reordered. Table XIII illustrates an application—sometimes called a corner-turner or corner-bender—that interchanges the rows and columns of a two-dimensional block of data. The application example uses two XMC ports—Write Port i and Read Port j—both accessing the same two-dimensional buffer in memory.
For example, bytes can be written four at a time to memory by rows (lines) using Port i, which has the DAG, configured in 1-D mode. (2-D mode could have been used, but 1-D is simpler and generates the same sequence of addresses.) When the Data Producer receives acknowledgement from the XMC that all data has been written to main memory, it signals the Consumer to begin reading. The Consumer sends a backwards ACK to XMC Port j thereby driving Producer_Count negative and enabling a read.
Bytes are read from memory by columns using Port j with the DAG in 2-D mode. But because reading is by columns and not rows, the usual roles of DAG_X_Index and DAG_Y_Index are reversed. DAG_X_Index now indexes successive bytes in a column, and DAG_Y_Index now indexes successive columns in the 2-D block. More precisely,
DAG_X_Index=R X line-length
where R and C are the row and column, respectively, of a byte in the 2-D block. After each byte is read, DAG_X_Index is incremented by line-length thereby accessing the next byte in the column. After the last byte in the column is read, DAG_X_Index reaches L X line-length, where L is the number of lines (rows) in the 2-D block. But L X line-length=buffer-size=DAG_X_Limit and therefore DAG_X_Index wraps around to 0 and DAG_Y_Index is incremented by 1. The cycle is repeated for each column until DAG_Y_Index=line-length=DAG_Y_Limit, the indication that the entire block has been read. When the Consumer receives the entire block of data, it signals the Data Producer to begin writing once again.
Data-Reordering Application
Write Port i
Read Port j
High-Speed-Write Mode
Basic Mode
read-block size (records)
start of buffer
start of buffer
0 (initial value)
line length (bytes)
buffer size (bytes)
write pointer
0 (initial value)
(initialized to 0)
4 (bytes)
1 (byte)
buffer size (bytes)
line length (bytes)
The XMC allows interlacing, or multiplexing, of multiple data streams into a single data stream. In Table XIV two streams arriving on XMC Ports i and j are combined in memory and then read from memory via XMC Port k.
In a preferred embodiment interlacing of the two streams is accomplished by writing bytes arriving on Port i to even byte addresses in the main-memory buffer, and writing bytes arriving on Port j to odd byte addresses. (Note that when DAG_Y_Index for Port i wraps around it returns to 0, but when DAG_Y_Index for Port j wraps around it returns to 1.)
Synchronizing of writing and reading is accomplished using a double buffering scheme in which the two Data Producers write into one half of the main-memory buffer while the Consumer reads the other half. To make the scheme work, each Data Producer signals the Consumer when it receives acknowledgement from the XMC that buffer-size/4 bytes have been written into the main-memory buffer. When the Consumer receives a signal from each Data Producer, it sends a backwards ACK to XMC Port k thereby driving Producer_Count negative and enabling a read of the interlaced data. When the Consumer receives buffer-size/2 bytes of interlaced data, it signals each Data Producer that they are permitted to write into the buffer half just read.
Data-Interlacing Application
Write Port i
Write Port j
Read Port k
Y-Wrap Mode
Y-Wrap Mode
Basic Mode
word (16 bits)
buffer size/4
start of buffer
start of buffer + 1
start of buffer
0 (initial value)
2 (bytes)
buffer size
0 (initial value)
0 (initial value)
2 (bytes)
2 (bytes)
buffer size
buffer size
Data de-interlacing (demultiplexing) is accomplished whereby instead of merging two data streams into one, one data stream is separated into two.
Table XV illustrates an application that reverses the interlacing operation described in the preceding section. The input data stream arrives on XMC Port i and the two de-interlaced streams exit the XMC via Ports j and k. De-interlacing is accomplished by reading even bytes in the main-memory buffer using Port j and odd bytes using Port k. (Note that when DAG_X_Index for Port j wraps around it returns to 0, but when DAG_X_Index for Port k wraps around it returns to 1.)
Synchronizing of writing and reading is accomplished using a double-buffering scheme in which the Data Producer writes into one half of the main-memory buffer while the two Consumers read the other half. To make the scheme work, the Data Producer notifies the Consumers when it receives acknowledgement from the XMC that buffer-size/2 bytes have been written into the buffer. When the two Consumers receive the signal, they each send a backwards ACK to their XMC read port thereby driving Producer_Count negative and enabling a read of the de-interlaced data. When each Consumer receives buffer-size/4 bytes of data, it notifies the Data Producer that reading of the half buffer has been completed. The Data Producer waits until it receives notification from both Consumers before it begins writing into the just-vacated half buffer.
Data De-Interlacing Application
Write Port i
Read Port j
Read Port k
Y-Wrap Mode
Basic Mode
Basic Mode
word (16 bits)
buffer size/4
buffer size/4
start of buffer
start of buffer
start of buffer + 1
0 (initial value)
0 (initial value)
2 (bytes)
2 (bytes)
buffer size
buffer size (bytes)
0 (initial value)
2 (bytes)
buffer size
Many video compression algorithms (e.g., MPEG) require reading numerous rectangular blocks of pixels (bytes) from a frame buffer. Table XVI illustrates an application in which data are written sequentially into a frame buffer via XMC Port i and in which rectangular blocks within the frame are read via XMC Port j.
A Data Producer for Port i writes data into the frame buffer line-by-line via Port i, and when it receives acknowledgement from the XMC that the entire frame has been written to memory, it notifies the Control Producer for Port j.
A Control Producer for Port j then sends a separate read request (see Section Error! Reference source not found.) to Port j for each block of pixels to be read, the parameter-update value in the request being used to update DAG_Origin. This newly updated value for DAG_Origin determines the location of the block to be read. The remaining DAG parameters determine the size of the block to be read. Table illustrates the parameter settings for a 9�9 block of pixels (bytes).
Frame-Buffer Application
Write Port i
Read Port j
High-Speed-Write Mode
Basic Mode or Burst
double-word (32 bits)
81 (records)
start of buffer
updated via read request
0 (initial value)
1 (byte)
9 (bytes)
0 (initial value)
0 (initial value)
4 (bytes)
line length (bytes)
buffer size (bytes)
9 � line length (bytes)
The XMC provides a scheme employing indirect addressing. In indirect addressing data is accessed in two steps: (1) an address (pointer) is used to access a second address (pointer) and (2) this second address is used in turn to access user data. The XMC implements indirect addressing via two tables, Table A and Table B, both residing in main memory as shown in Table XVII. Table A—which is accessed via XMC Port j—contains pointers into Table B. Table B—which is accessed via XMC Port k—contains user data.
Port j is configured in Auto-Source Mode and the entries in Table 1 are read automatically, in order, and sent via PTP control words from XMC Port j to XMC Port k. (Note the Consumer_ID and Consumer_Port for Port j.) Normal PTP flow control between Port j and Port k guarantees that the input buffer on Port k never overflows.
Each entry in Table A has a format where bit 31 (TableAEntry[31]) is set to 1, bits 30-28 (TableAEntry[30:28]) are set to 001 and bits 27-0 are used for the new DAG_X_Index value. TableAEntry[30:28]=001 indicates that DAG_X_Index[k] is to be updated with the value in TableAEntry[27:0]. TableAEntry[31]=1 indicates that the update is to be immediately followed by a read of Table B.
Port k responds to read requests from Port j as it would from any other source. It updates the appropriate DAG parameter—DAG_X_Index in this case—and then sends Read_Count records to the consumer of user data. Normal PTP flow control between XMC Port k and the data consumer guarantees that the data-consumer's input buffer never overflows.
Indirect-Addressing Application
Read Port j (Table A)
Read Port k (Table B)
Auto-Source Mode
Basic Mode
consumer of user data
(Consumer_ID[0] = 1
indicating a control word)
consumer port
double-word (32 bits)
user defined
Record Format
{1, 001, Pointer[27:0]}
user defined
(Record[31] = 1 indicates
a read request)
(Record[30:28] = 001
indicates X_Index update)
� size of the input buffer
typically 1 (record)
of Port k
start of Table A
start of Table B
0 (initial value)
updated via read
request from Port j
4 (bytes)
size of Table 1 (bytes)
Although the invention has been described with respect to specific embodiments thereof, these embodiments are merely illustrative, and not restrictive, of the invention. For example, although a PIN has been described as a data transfer mechanism other embodiments can use any type of network or interconnection scheme.
Any suitable programming language can be used to implement the routines of the present invention including C, C++, Java, assembly language, etc. Different programming techniques can be employed such as procedural or object oriented. The routines can execute on a single processing device or multiple processors. Although the steps, operations or computations may be presented in a specific order, this order may be changed in different embodiments. In some embodiments, multiple steps shown as sequential in this specification can be performed at the same time. The sequence of operations described herein can be interrupted, suspended, or otherwise controlled by another process, such as an operating system, kernel, etc. The routines can operate in an operating system environment or as stand-alone routines occupying all, or a substantial part, of the system processing.
In the description herein, numerous specific details are provided, such as examples of components and/or methods, to provide a thorough understanding of embodiments of the present invention. One skilled in the relevant art will recognize, however, that an embodiment of the invention can be practiced without one or more of the specific details, or with other apparatus, systems, assemblies, methods, components, materials, parts, and/or the like. In other instances, well-known structures, materials, or operations are not specifically shown or described in detail to avoid obscuring aspects of embodiments of the present invention.
A "computer-readable medium" for purposes of embodiments of the present invention may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, system or device. The computer readable medium can be, by way of example only but not by limitation, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, system, device, propagation medium, or computer memory.
A "processor" or "process" includes any human, hardware and/or software system, mechanism or component that processes data, signals or other information. A processor can include a system with a general-purpose central processing unit, multiple processing units, dedicated circuitry for achieving functionality, or other systems. Processing need not be limited to a geographic location, or have temporal limitations. For example, a processor can perform its functions in "real time," "offline," in a "batch mode," etc. Portions of processing can be performed at different times and at different locations, by different (or the same) processing systems.
Reference throughout this specification to "one embodiment", "an embodiment", or "a specific embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention and not necessarily in all embodiments. Thus, respective appearances of the phrases "in one embodiment", "in an embodiment", or "in a specific embodiment" in various places throughout this specification are not necessarily referring to the same embodiment. Furthermore, the particular features, structures, or characteristics of any specific embodiment of the present invention may be combined in any suitable manner with one or more other embodiments. It is to be understood that other variations and modifications of the embodiments of the present invention described and illustrated herein are possible in light of the teachings herein and are to be considered as part of the spirit and scope of the present invention.
Embodiments of the invention may be implemented by using a programmed general purpose digital computer, by using application specific integrated circuits, programmable logic devices, field programmable gate arrays, optical, chemical, biological, quantum or nanoengineered systems, components and mechanisms may be used. In general, the functions of the present invention can be achieved by any means as is known in the art. Distributed, or networked systems, components and circuits can be used. Communication, or transfer, of data may be wired, wireless, or by any other means.
It will also be appreciated that one or more of the elements depicted in the drawings/figures can also be implemented in a more separated or integrated manner, or even removed or rendered as inoperable in certain cases, as is useful in accordance with a particular application. It is also within the spirit and scope of the present invention to implement a program or code that can be stored in a machine-readable medium to permit a computer to perform any of the methods described above.
Additionally, any signal arrows in the drawings/Figures should be considered only as exemplary, and not limiting, unless otherwise specifically noted. Furthermore, the term "or" as used herein is generally intended to mean "and/or" unless otherwise indicated. Combinations of components or steps will also be considered as being noted, where terminology is foreseen as rendering the ability to separate or combine is unclear.
As used in the description herein and throughout the claims that follow, "a", "an", and "the" includes plural references unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of "in" includes "in" and "on" unless the context clearly dictates otherwise.
The foregoing description of illustrated embodiments of the present invention, including what is described in the Abstract, is not intended to be exhaustive or to limit the invention to the precise forms disclosed herein. While specific embodiments of, and examples for, the invention are described herein for illustrative purposes only, various equivalent modifications are possible within the spirit and scope of the present invention, as those skilled in the relevant art will recognize and appreciate. As indicated, these modifications may be made to the present invention in light of the foregoing description of illustrated embodiments of the present invention and are to be included within the spirit and scope of the present invention.
Thus, while the present invention has been described herein with reference to particular embodiments thereof, a latitude of modification, various changes and substitutions are intended in the foregoing disclosures, and it will be appreciated that in some instances some features of embodiments of the invention will be employed without a corresponding use of other features without departing from the scope and spirit of the invention as set forth. Therefore, many modifications may be made to adapt a particular situation or material to the essential scope and spirit of the present invention. It is intended that the invention not be limited to the particular terms used in following claims and/or to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include any and all embodiments and equivalents falling within the scope of the appended claims.
|Cited Patent
|Filing date
|Publication date
|15 Dec 1978
|24 Nov 1981
|Compression Labs, Inc.
|Digital video compression system and methods utilizing scene adaptive coding with rate buffer feedback
|21 May 1979
|12 Apr 1983
|Massively parallel processor computer
|5 Oct 1983
|25 Mar 1986
|Codenoll Technology Corporation
|Method and apparatus for recovering data and clock information from a self-clocking data stream
|6 Apr 1984
|30 Dec 1986
|Schlumberger Measurement & Control (U.K.) Ltd.
|Digital signal processor
|18 Jul 1983
|10 Mar 1987
|Nec Corporation
|Interface circuit having a shift register inserted between a data transmission unit and a data reception unit
|25 Feb 1985
|15 Sep 1987
|General Electric Company
|VLSI programmable digital signal processor
|28 Jun 1985
|15 Dec 1987
|Hewlett-Packard Company
|Cache memory consistency control with explicit software instructions
|26 Dec 1985
|31 May 1988
|Chiarulli Donald M
|Processor utilizing reconfigurable process segments to accomodate data word length
|28 Mar 1986
|19 Jul 1988
|Xilinx, Inc.
|Microprocessor oriented configurable logic element
|10 Jun 1986
|26 Jul 1988
|The United States Of America As Represented By The Secretary Of The Air Force
|Complex arithmetic vector processor for performing control function, scalar operation, and set-up of vector signal processing instruction
|20 Jun 1986
|26 Jul 1988
|Plessey Overseas Limited
|Arithmetic logic and shift device
|14 Nov 1986
|7 Mar 1989
|Princeton University
|Multinode reconfigurable pipeline computer
|19 Feb 1988
|26 Sep 1989
|Xilinx, Inc.
|Configurable electrical circuit having configurable logic elements and configurable interconnects
|3 May 1988
|27 Feb 1990
|American Telephone And Telegraph Company, At&T Bell Laboratories
|Multi-media virtual circuit
|18 Nov 1988
|30 Oct 1990
|E-Systems, Inc.
|Adaptive processing system having an array of individually configurable processing components
|30 Jan 1990
|4 Jun 1991
|Hughes Aircraft Company
|Data-flow multiprocessor architecture with three dimensional multistage interconnection network for efficient signal and data processing
|6 Feb 1989
|18 Feb 1992
|Motorola, Inc.
|Programmable array logic self-checking system
|14 Jun 1990
|24 Mar 1992
|Hughes Aircraft Company
|Distributed data driven process
|2 Nov 1990
|1 Sep 1992
|Concurrent Logic, Inc.
|Programmable logic cell and array
|17 Dec 1986
|17 Nov 1992
|Massachusetts Institute Of Technology
|Parallel processing system with processor array and network communications system for transmitting messages of variable length
|30 Aug 1989
|9 Mar 1993
|Digital Equipment Corporation
|Delay-based congestion avoidance in computer networks
|27 Feb 1991
|13 Apr 1993
|Sun Microsystems, Inc.
|Method and apparatus for cost-based heuristic instruction scheduling
|25 Aug 1992
|8 Jun 1993
|Concurrent Logic, Inc.
|Programmable logic cell and array with bus repeaters
|30 Aug 1991
|14 Sep 1993
|Atmel Corporation
|Versatile programmable logic cell for use in configurable logic arrays
|29 Jun 1992
|9 Nov 1993
|International Business Machines Corp.
|Synchronous communications scheduler allowing transient computing overloads using a request buffer
|29 Apr 1991
|5 Apr 1994
|Wagner Ferdinand H
|Method of and apparatus for constructing a control system and control system created thereby
|16 Dec 1992
|2 Aug 1994
|Texas Instruments Incorporated
|Communication system and methods for enhanced information transfer
|8 Feb 1993
|9 Aug 1994
|National Semiconductor Corporation
|Configuration features in a configurable logic array
|4 Sep 1991
|16 Aug 1994
|Digital Equipment Corporation
|Compiler allocating a register to a data item used between a use and store of another data item previously allocated to the register
|4 Nov 1992
|1 Nov 1994
|At&T Bell Laboratories
|Adaptive job scheduling for multiprocessing systems with master and slave processors executing tasks with opposite anticipated execution times respectively
|26 Feb 1993
|3 Jan 1995
|Motorola, Inc.
|Detection of unauthorized use of software applications in communication units
|11 Mar 1993
|10 Jan 1995
|Gte Laboratories Incorporated
|Control process for allocating services in communications systems
|10 Jan 1994
|10 Jan 1995
|Thinking Machines Corporation
|System and method for compiling a source code supporting data parallel variables
|6 May 1993
|7 Feb 1995
|Thomson Consumer Electronics, Inc.
|Reconfigurable programmable digital filter architecture useful in communication receiver
|13 Aug 1993
|7 Feb 1995
|Motorola Inc.
|Detecting unauthorized modification of communication unit based on comparison between stored hardware identification code and hardware identification code generated from operational platform identification code
|21 Mar 1989
|27 Jun 1995
|3Dlabs Ltd
|Computer system with clock shared between processors executing separate instruction streams
|29 Jun 1994
|12 Sep 1995
|Loral Aerospace Corp.
|Single-chip self-configurable parallel processor
|24 Jul 1990
|7 Nov 1995
|The United States Of America As Represented By The United States Department Of Energy
|Data flow machine for data driven computing
|17 Oct 1994
|12 Dec 1995
|International Business Machines Corporation
|Dynamic multi-mode parallel processing array
|15 Oct 1993
|26 Dec 1995
|Smiths Industries Public Limited Company
|Electronic circuit assembly an a substrate containing programmable switches
|28 Oct 1993
|6 Feb 1996
|Qualcomm Incorporated
|Demodulation element assignment in a system capable of receiving multiple signals
|25 Jan 1994
|13 Feb 1996
|Silicon Graphics, Inc.
|Loop scheduler
|19 Nov 1994
|9 Apr 1996
|Motorola, Inc.
|Method for reprogramming a communication unit's access to a wireless communication system
|7 Mar 1994
|7 May 1996
|Hitachi, Ltd.
|Data processor and method utilizing coded no-operation instructions
|3 Aug 1994
|14 May 1996
|Kabushiki Kaisha Toshiba
|Neuro-chip and neurocomputer having the chip
|4 Feb 1994
|21 May 1996
|Massachusetts Institute Of Technology
|Construction of hierarchical networks through extension
|23 May 1995
|28 May 1996
|Fujitsu Limited
|Computer resource distributing method and system for distributing a multiplicity of processes to a plurality of computers connected in a network
|19 Sep 1994
|25 Jun 1996
|International Business Machines Corporation
|Optimizing assembled code for execution using execution statistics collection, without inserting instructions in the code and reorganizing the code based on the statistics collected
|21 Apr 1995
|9 Jul 1996
|Intergraph Corporation
|Self-clocking pipeline register
|23 Jan 1995
|10 Sep 1996
|Hewlett-Packard Company
|Method and apparatus for compiling computer programs with interprocedural register allocation
|13 Apr 1995
|24 Sep 1996
|Intergraph Corporation
|Software scheduled superscalar computer architecture
|28 Nov 1995
|24 Sep 1996
|Network Peripherals, Inc.
|Apparatus for translating frames of data transferred between heterogeneous local area networks
|16 Mar 1994
|5 Nov 1996
|Transaction Technology, Inc.
|Computer and telephone apparatus with user friendly interface and enhanced integrity features
|15 Jul 1994
|31 Dec 1996
|Hitachi, Ltd.
|Vector processor adopting a memory skewing scheme for preventing degradation of access performance
|7 Jun 1995
|14 Jan 1997
|Lucent Technologies Inc.
|System for synthesizing field programmable gate array implementations from high level circuit descriptions
|9 Dec 1994
|4 Feb 1997
|Mitsubishi Electric Information Technology Center America, Inc.
|Scaleable very long instruction word processor with parallelism matching
|5 Apr 1993
|4 Feb 1997
|Shaw; Venson M.
|Single chip integrated circuit system architecture for document installation set computing
|19 Dec 1994
|11 Feb 1997
|Qualcomm Incorporated
|Method and apparatus for using Walsh shift keying in a spread spectrum communication system
|3 Apr 1995
|11 Feb 1997
|Giga Operations Corporation
|System for compiling algorithmic language source code for implementation in programmable hardware
|31 Aug 1995
|22 Apr 1997
|National Semiconductor Corporation
|Automatic data generation for self-test of cryptographic hash algorithms in personal security devices
|23 Jun 1994
|29 Apr 1997
|Telemac Cellular Corporation
|Mobile phone with internal call accounting controls
|11 Aug 1994
|13 May 1997
|Stanford Telecommunications, Inc.
|Position enhanced cellular telephone system
|2 Feb 1994
|3 Jun 1997
|Hickman; Paul L.
|Communication configurator and method for implementing same
|5 Jun 1995
|8 Jul 1997
|International Business Machines Corporation
|System and method for dynamically reconfiguring a programmable gate array
|18 Aug 1995
|8 Jul 1997
|Xilinx, Inc.
|Time multiplexed programmable logic device
|6 Jun 1994
|4 Nov 1997
|Nokia Telecommunications Oy
|Base station receiver equipment
|23 Jul 1996
|4 Nov 1997
|Virtual Computer Corporation
|FPGA virtual computer for executing a sequence of program instructions by successively reconfiguring a group of FPGA in response to those instructions
|24 Sep 1996
|2 Dec 1997
|Nec Corporation
|Hardware arrangement of effectively expanding data processing time in pipelining in a microcomputer system and a method thereof
|19 Jul 1996
|23 Dec 1997
|Nestor, Inc.
|Adaptive classifier having multiple subnetworks
|6 Nov 1995
|23 Dec 1997
|Hughes Aircraft Company
|Modular array processor architecture having a plurality of interconnected load-balanced parallel processing nodes
|18 May 1995
|30 Dec 1997
|Hewlett-Packard Company
|Efficient explicit data prefetching analysis and code generation in a low-level optimizer for inserting prefetch instructions into loops of applications
|23 May 1997
|6 Jan 1998
|Gas Research Institute
|Appliance interface apparatus and automated residence management system
|1 Mar 1994
|27 Jan 1998
|Siemens Aktiengesellschaft
|Process for dividing instructions of a computer program into instruction groups for parallel processing
|17 Apr 1995
|17 Feb 1998
|Motorola Inc.
|Neural network and method of using same
|3 Jan 1996
|24 Feb 1998
|Lg Electronics Inc.
|Electric home appliance real use state information collection and analysis apparatus
|27 Aug 1996
|24 Feb 1998
|International Business Machines Corporation
|Method and apparatus for dynamic conversion of computer instructions
|17 May 1995
|17 Mar 1998
|Estes; Mark D.
|Associative network method and apparatus
|28 Sep 1994
|31 Mar 1998
|Namco Ltd.
|Pipeline processing device, clipping processing device, three-dimensional simulator device and pipeline processing method
|5 Apr 1995
|7 Apr 1998
|Xilinx Inc
|Reprogrammable instruction set accelerator
|10 Feb 1995
|21 Apr 1998
|Massachusetts Institute Of Technology
|Dynamically programmable gate array with multiple contexts
|8 Nov 1995
|21 Apr 1998
|Lucent Technologies Inc.
|Multiprocessor scheduling and execution
|27 Apr 1995
|12 May 1998
|Control Systems, Inc.
|Graphics accelerator chip and method
|28 Sep 1995
|19 May 1998
|Ricoh Company, Ltd.
|Digital electronic camera having an external input/output interface through which the camera is monitored and controlled
|3 Mar 1997
|26 May 1998
|Globalstar L.P.
|Low earth orbit communication satellite gateway-to-gateway relay system
|7 Mar 1995
|16 Jun 1998
|Discovision Associates
|Tokens-based adaptive video processing arrangement
|17 May 1996
|23 Jun 1998
|Advanced Micro Devices, Inc.
|Processor having a bus interconnect which is dynamically reconfigurable in response to an instruction field
|18 Aug 1995
|7 Jul 1998
|Xilinx, Inc.
|Programmable logic device with hierarchical confiquration and state storage
|28 May 1996
|21 Jul 1998
|National Semiconductor Corporation
|Reconfigurable computer architecture for use in signal processing applications
|24 May 1996
|21 Jul 1998
|Oracle Corporation
|Dynamic memory allocation in a computer using a bit map index
|6 Jun 1995
|28 Jul 1998
|Apple Computer, Inc.
|Uniform interface for conducting communications in a heterogeneous computing network
|25 Sep 1996
|4 Aug 1998
|Advanced Micro Devices, Inc.
|Configurable digital wireless and wired communications system architecture for implementing baseband functionality
|17 Apr 1995
|11 Aug 1998
|Ricoh Company Ltd.
|System and method for dynamically reconfigurable computing using a processing unit having changeable internal hardware organization
|29 Sep 1995
|11 Aug 1998
|Ricoh Company, Ltd.
|Digital signal processing device
|22 Apr 1996
|1 Sep 1998
|Apple Computer, Inc.
|Method and apparatus for dynamic buffer allocation in a bus bridge for pipelined reads
|23 Jan 1996
|1 Sep 1998
|3Com Corporation
|Bridge/router architecture for high performance scalable networking
|29 Mar 1996
|6 Oct 1998
|Ricoh Company, Ltd.
|Method and system for controlling and communicating with machines using multiple communication formats
|21 Mar 1996
|13 Oct 1998
|National Semiconductor Corporation
|Multi-tasking sequencer for a TDMA burst mode controller
|24 May 1996
|13 Oct 1998
|National Semiconductor Corporation
|Seamless handover in a cordless TDMA system
|6 Sep 1995
|13 Oct 1998
|Solana Technology Development Corporation
|Method and apparatus for transporting auxiliary data in audio signals
|16 Sep 1996
|27 Oct 1998
|Virginia Tech Intellectual Properties, Inc.
|Worm-hole run-time reconfigurable processor field programmable gate array (FPGA)
|12 Apr 1995
|10 Nov 1998
|Advanced Micro Devices, Inc.
|Microprocessor with dynamically extendable pipeline stages and a classifying circuit
|21 Aug 1996
|17 Nov 1998
|Chatter; Mukesh
|High performance self modifying on-the-fly alterable logic FPGA, architecture and method
|7 Jun 1995
|17 Nov 1998
|Tandem Computers Incorporated
|Logical, fail-functional, dual central processor units formed from three processor units
|24 Apr 1997
|12 Jan 1999
|Klingman; Edwin E.
|Single chip microcontroller having down-loadable memory organization supporting "shadow" personality, optimized for bi-directional data transfers over a communication channel
|1 Jun 1995
|9 Feb 1999
|Qualcomm Incorporated
|Method for multi-mode handoff using preliminary time alignment of a mobile station operating in analog mode
|29 Oct 1997
|16 Feb 1999
|International Business Machines Corporation
|Mobile client computer with radio frequency transceiver
|30 Aug 1995
|9 Mar 1999
|Sgs-Thomson Microelectronics S.A.
|Signal processing circuit to implement a Viterbi algorithm
|6 Aug 1997
|16 Mar 1999
|Continental Cablevision, Inc.
|Telecommunication user account management system and method
|5 May 1997
|23 Mar 1999
|Macias; Nicholas J.
|Self-reconfigurable parallel processor made from regularly-connected self-dual code/data processing cells
|18 Jun 1996
|23 Mar 1999
|International Business Machines Corporation
|System, method, and program product for instruction scheduling in the presence of hardware lookahead accomplished by the rescheduling of idle slots
|2 Feb 1996
|30 Mar 1999
|Lucent Technologies, Inc.
|Wireless adapter architecture for mobile computing
|5 Aug 1996
|30 Mar 1999
|Micronet Technology, Inc.
|System for transparently identifying and matching an input/output profile to optimal input/output device parameters
|30 Aug 1996
|6 Apr 1999
|Intertrust Technologies Corp.
|Systems and methods for secure transaction management and electronic rights protection
|29 Aug 1997
|6 Apr 1999
|Xilinx, Inc.
|Field programmable gate array having programming instructions in the configuration bitstream
|12 Nov 1996
|6 Apr 1999
|Lucent Technologies Inc.
|FPGA-based processor
|29 Feb 1996
|13 Apr 1999
|Ericsson Inc.
|Multiple access communications system and method using code and time division
|29 Apr 1997
|11 May 1999
|Smartlynx, Inc.
|Hierarchical adaptive state machine for emulating and augmenting software
|10 Jun 1996
|25 May 1999
|Morphics Technology, Inc
|Method and apparatus for communicating information
|12 Nov 1997
|8 Jun 1999
|International Business Machines Corporation
|Method and system for layout and schematic generation for heterogeneous arrays
|28 Mar 1997
|15 Jun 1999
|Cypress Semiconductor Corp.
|Synchronizing clock pulse generator for logic derived clock signals with synchronous clock suspension capability for a programmable device
|15 Nov 1996
|15 Jun 1999
|Glenayre Electronics, Inc.
|Method and apparatus for reducing phase cancellation in a simulcast paging system
|11 Jun 1997
|29 Jun 1999
|L-3 Communications Corporation
|Data scrambling system and method and communications system incorporating same
|11 Oct 1996
|6 Jul 1999
|Alcatel Business Machines
|Communications system and corresponding equipment for a subscriber installation
|30 Jul 1997
|3 Aug 1999
|Auspex Systems, Inc.
|Parallel I/O network file server architecture
|9 Apr 1997
|3 Aug 1999
|Ricoh Corporation
|Compiling system and method for reconfigurable computing
|18 Feb 1997
|17 Aug 1999
|Mitsubishi Electric Information Technology Center America, Inc (Ita)
|Universal modem for digital video, audio and data communications
|16 Jun 1997
|7 Sep 1999
|Intel Corporation
|Method and apparatus for tracking program usage in a computer system
|3 Mar 1997
|7 Sep 1999
|Bull S.A.
|System using designer editor and knowledge base for configuring preconfigured software in an open system in a distributed environment
|29 Oct 1996
|7 Sep 1999
|Motorola, Inc.
|Method and apparatus for fast pilot channel acquisition using a matched filter in a CDMA radiotelephone
|14 Feb 1996
|14 Sep 1999
|International Business Machines Corporation
|Object-code compatible representation of very long instruction word programs
|31 Jan 1997
|14 Sep 1999
|Qualcomm Incorporated
|Cellular internet telephone
|11 Apr 1996
|21 Sep 1999
|Massachusetts Institute Of Technology
|Intermediate-grain reconfigurable processing device
|30 Dec 1997
|28 Sep 1999
|Xilinx, Inc.
|Programmable logic device including configuration data or user data memory slices
|12 Mar 1997
|5 Oct 1999
|Xilinx, Inc.
|Method for programming complex PLD having more than one function block type
|27 Jun 1997
|12 Oct 1999
|Cooke; Laurence H.
|Method for compiling high level programming languages into an integrated processor with reconfigurable logic
|27 Jun 1997
|19 Oct 1999
|Cooke; Laurence H.
|Integrated processor and programmable data path chip for reconfigurable computing
|6 May 1997
|16 Nov 1999
|Zone Labs, Inc.
|System and methodology for managing internet access on a per application basis for client computers connected to the internet
|10 Apr 1997
|23 Nov 1999
|Cisco Technology, Inc.
|Technique for maintaining prioritization of data transferred among heterogeneous nodes of a computer network
|4 Dec 1996
|23 Nov 1999
|Terayon Communication Systems, Inc.
|Lower overhead method for data transmission using ATM and SCDMA over hybrid fiber coax cable plant
|21 Oct 1997
|7 Dec 1999
|Ftl Systems, Inc.
|Compiler-oriented apparatus for parallel compilation, simulation and execution of computer programs and hardware models
|29 Oct 1996
|21 Dec 1999
|Lucent Technologies Inc.
|Electronic identifiers for network terminal devices
|19 Aug 1997
|21 Dec 1999
|The Chase Manhattan Bank
|Method and apparatus for concurrent data processing
|18 Oct 1996
|18 Jan 2000
|Samsung Electronics Co., Ltd.
|Programming a vector processor and parallel programming of an asymmetric dual multiprocessor comprised of a vector processor and a risc processor
|12 Dec 1997
|25 Jan 2000
|Advanced Micro Devices, Inc.
|Register access controller which prevents simultaneous coupling of more than one register to a bus interface
|14 Nov 1997
|1 Feb 2000
|Ricoh Company Ltd.
|Automatic capture and processing of facsimile transmissions
|9 Oct 1996
|1 Feb 2000
|Hewlett-Packard Company
|Software metering management of remote computing devices
|18 Jul 1997
|8 Feb 2000
|University Of Washington
|Reconfigurable computing architecture for providing pipelined data paths
|22 Jul 1998
|8 Feb 2000
|Virtual Computer Corporation
|Computer with programmable arrays which are reconfigurable in response to instructions to be executed
|9 Mar 1998
|22 Feb 2000
|Sun Microsystems, Inc.
|Geometry instructions for decompression of three-dimensional graphics data
|18 Apr 1997
|21 Mar 2000
|Industrial Technology Research Institute
|Method and apparatus for processing data in a neural network
|12 Dec 1997
|4 Apr 2000
|Xilinx, Inc.
|Method and apparatus for controlling the partial reconfiguration of a field programmable gate array
|29 May 1997
|4 Apr 2000
|Xilinx, Inc.
|Method for configuring FPGA memory planes for virtual hardware computation
|23 Nov 1998
|18 Apr 2000
|Motorola, Inc.
|Software programmable radio and method for configuring
|22 Mar 1996
|25 Apr 2000
|Microsoft Corporation
|System and method for secure purchase and delivery of video content programs
|28 Aug 1995
|2 May 2000
|Usa Technologies, Inc.
|System and method for networking and controlling vending machines
|17 Mar 1997
|9 May 2000
|Motorola, Inc.
|Automatic scheduling of instructions to reduce code size
|27 Oct 1997
|9 May 2000
|Randice-Lisa Altschul
|Disposable wireless telephone and method for call-out only
|27 Mar 1998
|6 Jun 2000
|Lsi Logic Corporation
|Priority arbiter with shifting sequential priority scheme
|19 Feb 1998
|13 Jun 2000
|United States Of America
|Scheduling framework for a heterogeneous computer network
|28 Aug 1997
|20 Jun 2000
|Xilinx, Inc.
|Method of designing FPGAs for dynamically reconfigurable computing
|30 Apr 1998
|11 Jul 2000
|3D Labs, Inc.
|Scalable graphics processor architecture
|12 Dec 1997
|18 Jul 2000
|Xilinx, Inc.
|Rapidly reconfigurable FPGA having a multiple region architecture with reconfiguration caches useable as data RAM
|3 Nov 1998
|18 Jul 2000
|Harris Corporation
|Reconfigurable radio system architecture
|20 Oct 1998
|25 Jul 2000
|Xilinx, Inc.
|Integrated circuit with field programmable and application specific logic areas
|5 Feb 1998
|25 Jul 2000
|George S. Sheng
|Digital signal processor using a reconfigurable array of macrocells
|31 Jul 1997
|29 Aug 2000
|Cisco Technology, Inc.
|Universal protocol conversion
|2 Jun 1997
|29 Aug 2000
|Canon Kabushiki Kaisha
|Adaptive expansion table in a digital telephone receiver
|10 Apr 1997
|5 Sep 2000
|Cisco Technology, Inc.
|Technique for capturing information needed to implement transmission priority routing among heterogeneous nodes of a computer network
|25 Nov 1997
|12 Sep 2000
|8�8 Inc.
|Communication interface between remote transmission of both compressed video and other data and data exchange with local peripherals
|29 Sep 1997
|19 Sep 2000
|Xilinx, Inc.
|Hardwire logic device emulating an FPGA
|30 Oct 1997
|19 Sep 2000
|Tsi Telsys, Inc.
|Apparatus and method for constructing data for transmission within a reliable communication protocol by performing portions of the protocol suite concurrently
|1 Dec 1997
|3 Oct 2000
|Advanced Micro Devices, Inc.
|Programmable data flow processor for performing data transfers
|15 Apr 1998
|17 Oct 2000
|Diamond Multimedia Systems, Inc.
|Redefinable signal processing subsystem
|29 Jan 1998
|17 Oct 2000
|Hewlett-Packard Company
|Determining thresholds and wrap-around conditions in a first-in-first-out memory supporting a variety of read and write transaction sizes
|1 Apr 1999
|31 Oct 2000
|Intel Corporation
|Method and apparatus for dynamically placing portions of a memory in a reduced power consumption state
|25 Feb 1999
|21 Nov 2000
|Xilinx, Inc.
|FPGA configurable logic block with multi-purpose logic/memory circuit
|8 Jan 1998
|28 Nov 2000
|Matsushita Electric Industrial Co., Ltd.
|Motion vector detection apparatus
|21 Apr 1998
|28 Nov 2000
|Victor Company Of Japan, Ltd.
|Variable length coded data processing method and device for performing the same method
|12 Mar 1998
|5 Dec 2000
|Kabushiki Kaisha Toshiba
|Processor and information processing apparatus with a reconfigurable circuit
|4 Dec 1998
|9 Jan 2001
|Billions Of Operations Per Second, Inc.
|Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor
|11 Jun 1996
|16 Jan 2001
|Ameritech Services, Inc.
|Computer system architecture and method for multi-user, real-time applications
|19 Jun 1998
|16 Jan 2001
|Hitachi America. Ltd.
|Registers and methods for accessing registers for use in a single instruction multiple data system
|7 Nov 1997
|6 Feb 2001
|Lucent Technologies Inc.
|Adaptive digital radio communication system
|2 Jan 1998
|20 Feb 2001
|Mitsubishi Electric Research Laboratories, Inc.
|Universal modem for digital video, audio and data communications
|15 Dec 1992
|20 Feb 2001
|Texas Instruments Incorporated
|Communication system and methods for enhanced information transfer
|20 Jun 1996
|20 Feb 2001
|Avid Technology, Inc.
|Detecting available computers to participate in computationally complex distributed processing problem
|9 Oct 1998
|27 Feb 2001
|Altera Corporation
|Mapping heterogeneous logic elements in a programmable logic device
|8 Aug 1997
|6 Mar 2001
|Nec Corporation
|Frequency channel selection method for radio communication system
|9 Sep 1998
|6 Mar 2001
|Perfecto Technologies Ltd.
|Method and system for maintaining restricted operating environments for application programs or operating systems
|17 Apr 1998
|13 Mar 2001
|Motorola, Inc.
|Data processing system for processing vector data and method therefor
|17 Dec 1998
|13 Mar 2001
|Teledesic Llc
|Punctured serial concatenated convolutional coding system and method for low-earth-orbit satellite data communication
|2 May 1997
|17 Apr 2001
|3Com Corporation
|Method and apparatus for operating the internet protocol over a high-speed serial bus
|11 Aug 1998
|17 Apr 2001
|Fujitsu Limited
|Rapidly-readable register file
|27 Oct 1998
|17 Apr 2001
|International Business Machines Corporation
|Circuit arrangement and method of dispatching instructions to multiple execution units
|14 May 1998
|24 Apr 2001
|3Com Corporation
|Method and system for providing quality-of-service in a data-over-cable system using configuration protocol messaging
|27 Aug 1997
|1 May 2001
|Regents Of The University Of Minnesota
|Method and apparatus for scene-based video watermarking
|26 Jan 1998
|8 May 2001
|Xilinx, Inc.
|System and method for programming the hardware of field programmable gate arrays (FPGAs) and related reconfiguration resources as if they were software by creating hardware objects
|26 Feb 1996
|22 May 2001
|Argosystems, Inc.
|Method and apparatus for adaptable digital protocol processing
|24 Dec 1996
|12 Jun 2001
|Lucent Technologies, Inc.
|Mobile base station
|28 Oct 1998
|12 Jun 2001
|Stmicroelectronics S.A.
|Processor with specialized handling of repetitive operations
|5 Nov 1999
|19 Jun 2001
|Electronics And Telecommunications Research Institute
|Hardware-efficient demodulator for CDMA adaptive antenna array systems
|7 May 1999
|17 Jul 2001
|Lucent Technologies Inc.
|Automatic telecommunications provider selection system
|15 Apr 1999
|24 Jul 2001
|Massachusetts Institute Of Technology
|Intermediate-grain reconfigurable processing device
|22 Feb 1999
|7 Aug 2001
|Seiko Epson Corporation
|Microprocessor architecture capable of supporting multiple heterogeneous processors
|17 Jun 1998
|7 Aug 2001
|Agere Systems Guardian Corp.
|Method and apparatus for executing multiple instruction streams in a digital processor with multiple data paths
|28 Jan 2000
|28 Aug 2001
|Nec Corporation
|Programmable device with an array of programmable cells and interconnection network
|29 Jun 1998
|28 Aug 2001
|Chameleon Systems, Inc.
|Integrated processor and programmable data path chip for reconfigurable computing
|30 Oct 1998
|11 Sep 2001
|International Business Machines Corporation
|Method and apparatus for invoking network agent functions using a hash table
|27 Feb 1998
|11 Sep 2001
|Cognigine Corporation
|Apparatus and method of implementing systems on silicon using dynamic-adaptive run-time reconfigurable circuits for processing multiple, independent data and control streams of varying rates
|17 Feb 1998
|11 Sep 2001
|Lucent Technologies Inc.
|Hardware-software co-synthesis of hierarchical heterogeneous distributed embedded systems
|30 Jun 1998
|18 Sep 2001
|Microsoft Corporation
|Dynamic load balancing among processors in a parallel computer
|20 Jun 1997
|18 Sep 2001
|Shore Technologies (1999) Inc.
|Information transfer systems and method with dynamic distribution of data, control and management of information
|14 Oct 1998
|9 Oct 2001
|Conexant Systems, Inc.
|Processor containing data path units with forwarding paths between two data path units and a unique configuration or register blocks
|18 Jun 1998
|16 Oct 2001
|International Business Machines Corporation
|Lifetime-sensitive instruction scheduling mechanism and method
|13 Jan 1999
|30 Oct 2001
|National Instruments Corporation
|Reconfigurable test system
|29 Mar 2000
|4 Dec 2001
|Xilinx, Inc.
|FPGA-based communications access point and system for reconfiguration
|27 Jul 2000
|12 Feb 2002
|Xilinx, Inc.
|Dedicated function fabric for use in field programmable gate arrays
|30 Jun 1999
|12 Feb 2002
|Chameleon Systems, Inc.
|Local memory unit system with global access for use on reconfigurable chips
|31 Mar 1999
|19 Feb 2002
|International Business Machines Corporation
|Performance monitoring in a NUMA computer
|11 Dec 1998
|5 Mar 2002
|Elixent, Ltd.
|Reconfigurable processor devices
|9 Jul 1999
|12 Mar 2002
|Bops, Incorporated
|Methods and apparatus for instruction addressing in indirect VLIW processors
|2 Aug 1999
|19 Mar 2002
|Xilinx, Inc.
|Method for marking packaged integrated circuits
|1 Jul 1996
|19 Mar 2002
|Sun Microsystems, Inc.
|Name service for a redundant array of internet servers
|9 Oct 1998
|19 Mar 2002
|United Technologies Corporation
|Method for optimizing communication speed between processors
|25 Feb 1998
|19 Mar 2002
|International Business Machines Corporation
|Dynamic resource allocation for user management in multi-processor time shared computer systems
|28 Jan 1999
|2 Apr 2002
|Bops, Inc.
|Methods and apparatus to support conditional execution in a VLIW-based array processor with subword execution
|3 Feb 1998
|23 Apr 2002
|Compaq Computer Corporation
|Cryptographic system
|2 Feb 1999
|30 Apr 2002
|United Microelectronics Corp.
|Apparatus and method for serial data communication between plurality of chips in a chip set
|20 Nov 1998
|30 Apr 2002
|Microsoft Corporation
|Dynamic classification of sections of software
|15 Dec 1999
|7 May 2002
|Texas Instruments Incorporated
|Programmable, reconfigurable DSP implementation of a Reed-Solomon encoder/decoder
|17 Dec 1998
|11 Jun 2002
|Hewlett-Packard Company
|Method of gathering usage information and transmitting to a primary server and a third party server by a client program
|10 Mar 1999
|18 Jun 2002
|Oki Electric Industry Co., Ltd.
|Radio communication apparatus employing a rake receiver
|30 Jun 2000
|25 Jun 2002
|Motorola, Inc.
|Reconfigurable systems using hybrid integrated circuits with optical ports
|19 May 1998
|25 Jun 2002
|Harris Communication
|Selective modification of antenna directivity pattern to adaptively cancel co-channel interference in TDMA cellular communication system
|8 Nov 2000
|16 Jul 2002
|Itt Manufacturing Enterprises, Inc.
|Sequential-acquisition, multi-band, multi-channel, matched filter
|23 Jul 1999
|16 Jul 2002
|Interuniversitaire Micro-Elektronica Centrum (Imec Vzw)
|Method for determining a storage bandwidth optimized memory organization of an essentially digital device
|29 Dec 2000
|30 Jul 2002
|Quicklogic Corporation
|Architecture for field programmable gate array
|14 Feb 2000
|6 Aug 2002
|Air2Web, Inc.
|Intelligent harvesting and navigation system and method
|5 May 2000
|13 Aug 2002
|Morphics Technology, Inc.
|Heterogeneous programmable gate array
|1 Apr 1998
|13 Aug 2002
|Avaya Technology Corp.
|Methods and apparatus for scheduling parallel processors
|15 Feb 2000
|20 Aug 2002
|Intel Corporation
|Reconfigurable logic for a computer
|4 Jun 1999
|24 Sep 2002
|I2 Technologies Us, Inc.
|Computer implemented scheduling system and process using abstract local search technique
|31 Jul 2001
|1 Oct 2002
|Morphics Technology, Inc.
|Generic finger architecture for spread spectrum applications
|14 Oct 1998
|15 Oct 2002
|Triscend Corporation
|Configurable processor system unit
|14 Jun 2001
|22 Oct 2002
|Nec Corporation
|Reconfigurable device having programmable interconnect network suitable for implementing data paths
|14 Sep 1998
|29 Oct 2002
|Openwave Systems Inc.
|Method and architecture for interactive two-way communication devices to interact with a network
|29 Dec 2000
|19 Nov 2002
|Quicklogic Corporation
|Configurable computational unit embedded in a programmable device
|20 Aug 1999
|14 Jan 2003
|Hewlett-Packard Company
|Programmatic synthesis of processor element arrays
|25 Feb 1999
|21 Jan 2003
|Fairchild Semiconductor Corporation
|Network switch with head of line input buffer queue clearing
|22 Dec 1998
|21 Jan 2003
|Analog Devices, Inc.
|Digital signal processor having distributed register file
|18 Sep 2001
|25 Mar 2003
|Altera Corporation
|Devices and methods with programmable logic and digital signal processing regions
|18 Sep 2001
|29 Apr 2003
|Altera Corporation
|Programmable logic device including multipliers and configurations thereof to reduce resource utilization
|5 Nov 1999
|13 May 2003
|Telefonaktiebolaget L M Ericsson (Publ)
|Automatic gain control for slotted mode operation
|7 Apr 1999
|27 May 2003
|Cisco Technology, Inc.
|Search engine for forwarding table content addressable memory
|8 May 2001
|10 Jun 2003
|Quicksilver Technology
|Method and system for reconfigurable channel coding
|28 Jul 1998
|1 Jul 2003
|Bell Atlantic Nynex Mobile
|Digital wireless telephone system for downloading software to a digital telephone using wireless data link protocol
|23 Apr 2001
|8 Jul 2003
|Lattice Semiconductor Corporation
|Methods for configuring FPGA's having variable grain components for providing time-shared access to interconnect resources
|6 Jun 2000
|29 Jul 2003
|Emware, Inc.
|Service provider for providing data, applications and services to embedded devices and for facilitating control and monitoring of embedded devices
|30 Dec 1999
|29 Jul 2003
|Pmc-Sierra, Inc.
|Count/address generation circuitry
|16 Apr 1999
|5 Aug 2003
|Usa Technologies, Inc.
|Universal interactive advertising and payment system network for public access electronic commerce and business related products and services
|22 May 2000
|5 Aug 2003
|Lsi Logic Corporation
|Master/slave processor memory inter accessability in an integrated embedded system
|9 Jun 2000
|12 Aug 2003
|Frontier Technologies, Inc.
|Complex scheduling method and device
|21 Jun 2001
|26 Aug 2003
|Seiko Epson Corporation
|Microprocessor architecture capable of supporting multiple heterogeneous processors
|3 May 2000
|2 Sep 2003
|Koninklijke Philips Electronics N.V.
|Data processing device, method of executing a program and method of compiling
|31 May 2001
|9 Sep 2003
|Quicksilver Technology, Inc.
|Adaptive, multimode rake receiver for dynamic search and multipath reception
|21 Jan 1999
|9 Sep 2003
|Analog Devices, Inc.
|Method and apparatus for communicating between multiple functional units in a computer environment
|25 Mar 2002
|28 Oct 2003
|Intertrust Technologies Corporation
|Systems and methods for secure transaction management and electronic rights protection
|30 Aug 1996
|11 Nov 2003
|Koninklijke Philips Electronics N.V.
|Method and apparatus for interconnecting token ring lans operating in ATM
|16 Jan 2002
|25 Nov 2003
|Lsi Logic Corporation
|Heterogeneous integrated circuit with reconfigurable logic cores
|11 Jun 2001
|6 Jan 2004
|Hewlett-Packard Development Company, L.P.
|Multiprocessor cache coherence system and method in which processor nodes and input/output nodes are equal participants
|20 Aug 1999
|6 Jan 2004
|Stmicroelectronics Limited
|Integrated circuit with multiple processing cores
|30 Jun 2000
|27 Jan 2004
|Conexant Systems, Inc.
|System for efficient operation of a very long instruction word digital signal processor
|24 Dec 1998
|10 Feb 2004
|Verizon Corporate Services Group Inc.
|Framework for providing quality of service requirements in a distributed object-oriented computer system
|27 Dec 1999
|17 Feb 2004
|Intel Corporation
|Mapping requests from a processing unit that uses memory-mapped input-output space
|9 Feb 2000
|23 Mar 2004
|International Business Machines Corporation
|Method and apparatus for providing automatic configuration of a computer system based on its physical location using an electronically read schedule
|18 Sep 2000
|6 Apr 2004
|Compal Electronics, Inc.
|Modularized functionality enhancement for a cellular telephone
|14 Apr 1998
|13 Apr 2004
|Hewlett-Packard Development Company, L.P.
|Method and apparatus for device interaction by format
|11 Feb 2000
|13 Apr 2004
|Koninklijke Philips Electronics N.V.
|System for executing computer program using a configurable functional unit, included in a processor, for executing configurable instructions having an effect that are redefined at run-time
|23 Apr 2002
|4 May 2004
|Quicksilver Technology, Inc.
|Method, system and software for programming reconfigurable hardware
|15 Aug 2000
|11 May 2004
|Nortel Networks Limited
|Method and apparatus for messaging between disparate networks
|8 Dec 2000
|18 May 2004
|Microsoft Corporation
|Watermark detection via cardinality-scaled correlation
|2 Sep 2000
|15 Jun 2004
|Actel Corporation
|Field programmable gate array and microcontroller system-on-a-chip
|31 Aug 2001
|22 Jun 2004
|Telephia, Inc.
|System and method for measuring wireless device and network usage and performance metrics
|23 Feb 2001
|6 Jul 2004
|Qualcomm Incorporated
|Forward-link scheduling in a wireless communication system during soft and softer handoff
|31 Aug 2000
|6 Jul 2004
|Micron Technology, Inc.
|Split embedded DRAM processor
|5 Dec 2000
|20 Jul 2004
|Nortel Networks Limited
|Method and system for remote and local mobile network management
|19 Sep 2000
|17 Aug 2004
|Pixim, Inc.
|Digital image sensor with on -chip programmable logic
|11 May 2001
|31 Aug 2004
|Qualcomm Incorporated
|Method and apparatus for processing data in a multiple-input multiple-output (MIMO) communication system utilizing channel state information
|4 Apr 2000
|19 Oct 2004
|Hewlett-Packard Development Company, L.P.
|Disconnecting a device on a cache line boundary in response to a write command
|30 May 2003
|16 Nov 2004
|Sharp Kabushiki Kaisha
|Self-synchronous logic circuit having test function and method of testing self-synchronous logic circuit
|15 Dec 2000
|23 Nov 2004
|Intel Corporation
|Exception handling using an exception pipeline in a pipelined processor
|9 Apr 2001
|7 Dec 2004
|Francotyp-Postalia Ag & Co. Kg
|Arrangement and method for offering a message when loading service data for a terminal device
|13 Apr 2000
|14 Dec 2004
|Lexmark International, Inc.
|Usage-based billing and management system and method for printers and other assets
|22 Mar 2001
|28 Dec 2004
|Quicksilver Technology, Inc.
|Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements
|1 Oct 2002
|22 Feb 2005
|Comsys Communication & Signal Processing Ltd.
|Data transfer scheme in a communications system incorporating multiple processing elements
|13 Dec 2000
|8 Mar 2005
|Conexant Systems, Inc.
|Methods, systems, and computer program products for compressing a computer program based on a compression criterion and executing the compressed program
|26 Jan 2001
|22 Mar 2005
|Microsoft Corporation
|Caching transformed content in a mobile gateway
|13 Dec 2002
|19 Apr 2005
|Sun Microsystems, Inc.
|System and method for efficient write operations for repeated snapshots by copying-on-write to most recent snapshot
|25 Jul 2002
|19 Apr 2005
|University Of New Mexico
|Reconfigurable data path processor
|21 Jun 2001
|17 May 2005
|Samsung Electronics Co., Ltd.
|Apparatus and method for searching a base station in an asynchronous mobile communications system
|2 Jul 1999
|31 May 2005
|Agilent Technologies, Inc.
|System and method for universal service activation
|5 Jun 2002
|14 Jun 2005
|Microsoft Corporation
|Method and system for compressing program code and interpreting compressed program code
|4 Jun 2001
|28 Jun 2005
|Xerox Corporation
|Method and system for algorithm synthesis in problem solving
|18 Jul 2001
|6 Sep 2005
|Cypress Semiconductor Corporation
|Programmable analog system architecture
|23 Feb 2000
|27 Dec 2005
|Multi-service network switch with quality of access
|1 Nov 2001
|10 Jan 2006
|Matsushita Electric Industrial Co., Ltd.
|Matched filter and correlation detection method
|30 Nov 2001
|10 Jan 2006
|Quick Silver Technology, Inc.
|Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements
|14 Sep 2000
|10 Jan 2006
|Texas Instruments Incorporated
|Microphone/speaker system with context switching in processor
|26 Apr 2002
|17 Jan 2006
|Microsoft Corporation
|Distributed computing of a job corresponding to a plurality of predefined tasks
|4 Jun 2001
|18 Apr 2006
|Palmsource, Inc.
|Automatic tracking of user progress in a software application
|19 May 2001
|16 May 2006
|Young-Hie Leem
|On demand contents providing method and system
|4 Mar 2001
|25 Jul 2006
|Filesx Ltd.
|Accelerating responses to requests made by users to an internet
|28 Feb 2002
|21 Nov 2006
|Compass Technology Management, Inc.
|Systems and methods for obtaining digital signatures on a single authoritative copy of an original electronic record
|16 Feb 2000
|28 Nov 2006
|Nec Corporation
|Image processing system
|23 Jul 2003
|24 Jul 2007
|Nvidia Corporation
|Input pipeline registers for a node in an adaptive computing engine
|1 Dec 2000
|7 Jun 2001
|Kovacs Ern?Ouml;
|Communication device and software for operating multimedia applications
|7 Dec 2000
|20 Sep 2001
|Hewlett-Packard Company
|Security protocol
|26 Feb 2001
|11 Oct 2001
|Mirsky Ethan A.
|Method and apparatus for configuring arbitrary sized data paths comprising multiple context processing elements
|5 Feb 2001
|25 Oct 2001
|Moulton Gregory Hagan
|System and method for intelligent, globally distributed network storage
|5 Dec 2000
|8 Nov 2001
|Takashi Miyamoto
|Compiler processing system for generating assembly program codes for a computer comprising a plurality of arithmetic units
|29 Dec 2000
|6 Dec 2001
|Medlock Joel D.
|Fast initial acquisition & search device for a spread spectrum communication system
|29 Jan 2001
|6 Dec 2001
|Uma Jha
|Method and apparatus for processing a secondary synchronization channel in a spread spectrum system
|23 Jun 1997
|13 Dec 2001
|Erik A. Ramberg
|Receiving a spread spectrum signal
|21 May 2001
|24 Jan 2002
|Shoichi Kamano
|Data processing system
|4 May 2001
|31 Jan 2002
|Blaker David M.
|Accelerated montgomery multiplication using plural multipliers
|21 Dec 2000
|31 Jan 2002
|Ostanevich Alexander Y.
|Register economy heuristic for a cycle driven multiple issue instruction scheduler
|31 Jul 2001
|7 Feb 2002
|Keith Rieken
|Apparatus and method for configurable multi-dwell search engine for spread spectrum applications
|22 Mar 2001
|21 Feb 2002
|Mark Tuomenoksa
|Method and system for managing and configuring virtual private networks
|28 Aug 2001
|28 Feb 2002
|Nec Corporation
|Cell search method and circuit in W-CDMA system
|29 Dec 2000
|28 Feb 2002
|Ravi Subramanian
|Method and apparatus to support multi standard, multi service base-stations for wireless voice and data networks
|29 Jan 2001
|14 Mar 2002
|Ravi Subramanian
|Wireless spread spectrum communication platform using dynamically reconfigurable logic
|7 Aug 2001
|14 Mar 2002
|Jabari Zakiya
|Systems and methods for implementing hash algorithms
|16 Apr 2001
|21 Mar 2002
|Lawande Sachin S.
|Method and apparatus for operating the internet protocol over a high-speed serial bus
|14 Dec 2001
|11 Apr 2002
|Matsushita Electric Industrial Co., Ltd.
|CDMA radio receiving apparatus and cell search method
|1 Feb 2001
|11 Apr 2002
|Yutaka Yamanaka
|Compiler for parallel computer
|2 Aug 2001
|23 May 2002
|Leung Kelvin T.
|Apparatus and method for context-sensitive dynamic information service composition via mobile and wireless network communication
|20 Apr 2000
|6 Jun 2002
|Reisman Richard R.
|Method and system for distributing updates
|7 Dec 2001
|13 Jun 2002
|Microsoft Corporation
|Dynamic classification of sections of software
|8 Aug 2001
|20 Jun 2002
|Jean-Jacques Moreau
|Method and device for configuring an electronic document processing peripheral in a communication network
|21 Dec 2000
|27 Jun 2002
|Renard Pascal L.
|Single instruction for multiple loops
|4 Oct 2001
|27 Jun 2002
|Elbrus International
|List scheduling algorithm for a cycle-driven instruction scheduler
|29 Dec 2000
|4 Jul 2002
|Snyder Walter L.
|Re-targetable communication system
|2 Oct 2001
|11 Jul 2002
|Martin Langhammer
|Programmable logic integrated circuit devices including dedicated processor components
|29 Jan 2001
|1 Aug 2002
|Tao Chen
|Method and apparatus for managing finger resources in a communication system
|4 Feb 2002
|8 Aug 2002
|Roe Colleen A.
|Scalable agent service system
|1 Mar 2001
|8 Aug 2002
|Richter Roger K.
|Single chassis network endpoint system with network processor for load balancing
|28 Dec 2001
|29 Aug 2002
|Bitterlich Stefan Johannes
|Channel codec processor configurable for multiple wireless communications standards
|27 Feb 2001
|29 Aug 2002
|Butt Alan B.
|Network management
|29 Jan 2001
|19 Sep 2002
|Ming-Hau Lee
|SIMD/MIMD processing on a reconfigurable array
|22 Mar 2001
|26 Sep 2002
|Quicksilver Technology, Inc.
|Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements
|1 Oct 2001
|3 Oct 2002
|Ichiro Imaizumi
|Correlation circuit for spread spectrum
|4 Mar 2002
|10 Oct 2002
|Juan-Antonio Sanchez-Herrero
|Flexible user distribution between user's serving entities
|16 Mar 2001
|31 Oct 2002
|Conexant Systems, Inc.
|Dynamically varying linearity system for an RF front-end of a communicaton device
|6 Feb 2002
|31 Oct 2002
|Michael Neuman
|Apparatus and method for providing secure network communication
|8 May 2001
|14 Nov 2002
|Scheuermann W. James
|Method and system for reconfigurable channel coding
|31 May 2001
|5 Dec 2002
|Quicksilver Technology, Inc.
|Adaptive, multimode rake receiver for dynamic search and multipath reception
|31 May 2001
|5 Dec 2002
|Philips Semiconductor, Inc.
|Reconfigurable digital filter having multiple filtering modes
|31 May 2001
|5 Dec 2002
|Hogenauer Eugene B.
|Method and system for scheduling in an adaptable computing engine
|8 Jan 2002
|5 Dec 2002
|Broadcom Corporation
|Fast SHA1 implementation
|13 May 2002
|19 Dec 2002
|Anand Satish N.
|Single-pass cryptographic processor and method
|8 Jan 2002
|9 Jan 2003
|Estech Systems, Inc.
|Service observing in a voice over IP telephone system
|5 Oct 2001
|16 Jan 2003
|Changming Zhou
|12 Jul 2002
|23 Jan 2003
|National Instruments Corporation
|Graphical program node for generating a measurement program
|26 Mar 2002
|23 Jan 2003
|Giroti Sudhir K.
|Unified XML voice and data media converging switch and application delivery system
|25 Jul 2001
|30 Jan 2003
|Hogenauer Eugene B.
|Method and system for encoding instructions for a VLIW that reduces instruction memory requirements
|19 Sep 2002
|6 Feb 2003
|Harri Jokinen
|Method for identifying base stations of a time division cellular network in a mobile station and mobile station
|31 Jan 2001
|13 Feb 2003
|General Electric Company
|Shared memory control between detector framing node and processor
|12 Dec 2001
|6 Mar 2003
|Horvitz Eric J.
|Controls and displays for acquiring preferences, inspecting behavior, and guiding the learning and decision policies of an adaptive communications prioritization and routing system
|25 Sep 2001
|27 Mar 2003
|Timesys Corporation
|Resource reservation and priority management
|24 Sep 2001
|27 Mar 2003
|George Lo
|Method for providing engineering tool services
|19 Sep 2001
|3 Apr 2003
|Rao Subramanya P.
|Method & apparatus for step two W-CDMA searching
|12 Oct 2001
|17 Apr 2003
|Duc Pham
|Scalable network gateway processor architecture
|11 Feb 2002
|24 Apr 2003
|Miller Frank William
|Voice over IP architecture
|28 Nov 2001
|29 May 2003
|Chang Li Fung
|Acquisition matched filter for W-CDMA systems providing frequency offset robustness
|30 Nov 2001
|5 Jun 2003
|Master Paul L.
|Apparatus, system and method for configuration of adaptive integrated circuitry having fixed, application specific computational elements
|30 Nov 2001
|5 Jun 2003
|Quicksilver Technology, Inc.
|Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements
|31 Oct 2002
|12 Jun 2003
|Daozheng Lu
|Interactive service device metering systems
|10 Jan 2002
|10 Jul 2003
|Stacey Secatch
|Non-destructive read FIFO
|30 Sep 2002
|31 Jul 2003
|Nec Usa, Inc.
|Techniques for efficient security processing
|7 Mar 2003
|14 Aug 2003
|Quicksilver Technology, Inc.
|Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements
|25 Feb 2002
|28 Aug 2003
|Kozuch Michael A.
|Method and apparatus for loading a trustable operating system
|7 Mar 2003
|11 Sep 2003
|Mccormack Jonathan I.
|System and method for managing two or more electronic devices
|10 Mar 2003
|11 Sep 2003
|Venkatachary Srinivasan
|System and method for delivering data in a network
|23 Apr 2002
|23 Oct 2003
|Quicksilver Technology, Inc.
|Method, system and language structure for programming reconfigurable hardware
|7 Mar 2003
|13 Nov 2003
|Markus Meyer
|System and method for adapting preferences based on device location or network topology
|10 Jun 2002
|11 Dec 2003
|Lsi Logic Corporation
|Pre-silicon verification path coverage
|8 Aug 2001
|8 Jan 2004
|Ivo Vandeweerd
|Array of parallel programmable processing engines and deterministic method of operating the same
|21 May 2003
|15 Jan 2004
|Quicksilver Technology, Inc.
|Uniform interface for a functional node in an adaptive computing engine
|6 Mar 2002
|22 Jan 2004
|Scheuermann W. James
|Method and system for data flow control of execution nodes of an adaptive computing engine (ACE)
|21 May 2003
|5 Feb 2004
|Quicksilver Technology, Inc.
|Hardware task manager
|24 Sep 2003
|25 Mar 2004
|Harri Valio
|Global positioning system code phase detector with multipath compensation and method for reducing multipath components associated with a received signal
|11 Sep 2003
|1 Apr 2004
|Mcdonough John G.
|System and method for detecting direct sequence spread spectrum signals using batch processing of independent parameters
|8 Oct 2003
|29 Apr 2004
|Sergio Parolari
|Method of link adaptation in enhanced cellular systems to discriminate between high and low variability
|24 Jul 2003
|13 May 2004
|Quicksilver Technology, Inc.
|Cache for instruction set architecture using indexes to achieve compression
|23 Jul 2003
|8 Jul 2004
|Quicksilver Technology, Inc.
|Adaptable datapath for a digital processing system
|23 Jul 2003
|26 Aug 2004
|Quicksilver Technology, Inc.
|Input pipeline registers for a node in an adaptive computing engine
|21 Aug 2003
|24 Feb 2005
|Quicksilver Technology, Inc.
|System, method and software for static and dynamic programming and configuration of an adaptive computing architecture
|10 Apr 2002
|28 Jul 2005
|Albert Wang
|High-performance hybrid processor with configurable execution units
|22 Jan 2004
|28 Jul 2005
|International Business Machines Corporation
|Method and apparatus to change the operating frequency of system core logic to maximize system memory bandwidth
|11 Feb 2005
|8 Sep 2005
|Dowling Eric M.
|Federated multiprotocol communication
|30 Sep 2005
|9 Feb 2006
|Master Paul L
|Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements
|13 Apr 2000
|18 Oct 2001
|Siemens Ag
|Mobile terminal such as personal digital assistant or communications terminal
|29 Dec 1994
|5 Jul 1995
|Nec Corporation
|DS/CDMA Receiver using parallel-operating multi-purpose correlators
|16 Feb 1995
|23 Aug 1995
|Pilkington Germany (no. 2) Limited
|Reconfigurable ASIC
|14 Jun 1995
|3 Jan 1996
|Roke Manor Research Limited
|RAKE receiver combining all the useful multipath components of a spread spectrum signal
|6 Jul 1995
|10 Jan 1996
|Nokia Mobile Phones Ltd.
|Dynamic control of acquisition and tracking of the correlators in a RAKE receiver
|11 Oct 1996
|16 Apr 1997
|Matsushita Electric Industrial Co., Ltd.
|Variable word length VLIW-instruction processor
|1 Jul 1997
|7 Jan 1998
|Sun Microsystems, Inc.
|Format conversion of graphical image data words
|21 Jul 1997
|28 Jan 1998
|Ntt Mobile Communications Network Inc.
|Method and apparatus for receiving CDMA radio communication signals
|8 Dec 1998
|16 Jun 1999
|Sony Corporation
|Information broadcasting method, receiver and information processing apparatus
|11 Dec 1998
|30 Jun 1999
|Texas Instruments Inc.
|Processor and method for reducing its power usage
|24 May 2000
|29 Nov 2000
|Samsung Electronics Co., Ltd.
|Apparatus for acquiring pseudo noise code and DS-CDMA receiver including the same
|16 Jun 1999
|20 Dec 2000
|SGS-THOMSON MICROELECTRONICS S.r.l.
|Improved control unit for electronic microcontrollers or microprocessors
|30 May 2000
|20 Dec 2000
|Tektronix, Inc.
|Flow control in adaptive pipelines
|19 Feb 2001
|22 Aug 2001
|Texas Instruments Incorporated
|Microprocessor with non-aligned circular addressing
|25 Apr 2001
|31 Oct 2001
|Nokia Corporation
|A method and system for providing secure subscriber content data
|2 Apr 2001
|20 Mar 2002
|Lucent Technologies Inc.
|Segmented architecture for multiple sequence detection and identification in fading channels
|Title not available
|Title not available
|Title not available
|Title not available
|Title not available
|Title not available
|Title not available
|14 Dec 1992
|8 Jul 1993
|Intel Corporation
|Circuitry for decoding huffman codes
|17 Apr 1996
|24 Oct 1996
|Advanced Micro Devices, Inc.
|Method and apparatus for hybrid vlc bitstream decoding
|20 Jan 1998
|19 Nov 1998
|Infinite Technology Corp
|Processor with reconfigurable arithmetic data path
|19 Oct 1998
|29 Apr 1999
|Quickflex, Inc.
|Reconfigurable secure hardware apparatus and method of operation
|30 Sep 1999
|6 Apr 2000
|Conexant Systems, Inc.
|Method for dynamic allocation and sharing of functional unit datapaths
|16 Feb 2000
|2 Nov 2000
|Roke Manor Research Limited
|Method for downloading software
|5 May 2000
|16 Nov 2000
|Morphics Technology Inc.
|Heterogeneous programmable gate array
|29 Aug 2000
|29 Mar 2001
|Chameleon Systems
|Control fabric for enabling data path flow
|27 Mar 2001
|11 Oct 2001
|General Dynamics Decision Systems, Inc.
|Scalable cryptographic engine
|6 Aug 2001
|14 Feb 2002
|Systems On Silicon, Inc.
|Configurable function processing cell linear array in computation engine coupled to host units
|Abnous et al., "Ultra-Low-Power Domain-Specific Multimedia Processors," VLSI Signal Processing, IX, 1998, IEEE Workshop in San Francisco, CA, USA, Oct. 30-Nov. 1, 1998, pp. 461-470 (Oct. 30, 1998).
|Aggarwal et al.., "Efficient Huffman Decoding," International Conference on Image Processing IEEE 1:936-939 (Sep. 10-13, 2000).
|Allan et al., "Software Pipelining," ACM Computing Surveys, 27(3):1-78 (Sep. 1995).
|Alsolaim et al., "Architecture and Application of a Dynamically Reconfigurable Hardware Array for Future Mobile Communication Systems," Field Programmable Custom Computing Machines, 2000 IEEE Symposium, Napa Valley, Los Alamitos, CA. IEEE Comput. Soc. pp. 205-214 (Apr. 17-19, 2000).
|Altera Apex 20K 1999.
|Andraka Consulting Group, "Distributed Arithmetic," Obtained from: http://www.fpga,guru.com/distribu.htm (1998-2000).
|Ashenden et al., "The VHDL Cookbook," Dept. Computer Science, University of Adelaide, South Australia. Downloaded from http://tams-www.informatik.uni-hamburg.de/vhdl/doc/cookbook/VHDL-Cookbook.pdf on Dec. 7, 2006 (Jul. 1990).
|Bacon et al., "Compiler Transformations for High-Performance Computing," ACM Computing Surveys 26(4):368-373 (Dec. 1994).
|Balasubramonian et al., "Reducing the Complexity of the Register File in Dynamic Superscalar Processors," Proceedings of the 34th Annual ACM/IEEE International Symposium on Microarchitecture, pp. 237-248 (Dec. 1, 2001).
|Banerjee et al., "A MATLAB Compiler for Distributed, Heterogeneous, Reconfigurable Computing Systems," 2000 IEEE Symposium, pp. 39-48, (Apr. 17-19, 2000).
|Bapty et al., "Uniform Execution Environment for Dynamic Reconfiguration," Darpa Adaptive Computing Systems, http://isis.vanderbilt.edu/publications/archive/babty-T-#-0-1999-Uniform-Ex.pdf, pp. 1-7 (1999).
|Bapty et al., "Uniform Execution Environment for Dynamic Reconfiguration," Darpa Adaptive Computing Systems, http://isis.vanderbilt.edu/publications/archive/babty—T—#—0—1999—Uniform—Ex.pdf, pp. 1-7 (1999).
|Baumgarte et al., "Pact XPP-A Self-Reconfigurable Data Processing Architecture," NN www.pactcorp.com/sneu/download/ersa01.pdf; retrieved on Nov. 25, 2005 (Jun. 25, 2001).
|Baumgarte et al., "Pact XPP—A Self-Reconfigurable Data Processing Architecture," NN www.pactcorp.com/sneu/download/ersa01.pdf; retrieved on Nov. 25, 2005 (Jun. 25, 2001).
|Becker et al., "An Application-Tailored Dynamically Reconfigurable Hardware Architecture for Digital Baseband Processing," IEEE Conference Proceedings Article pp. 341-346 (Sep. 18, 2000).
|Becker et al., "Design and Implementation of a Coarse-Grained Dynamically Reconfigurable Hardware Architecture," VLSI 2001, Proceedings IEEE Computer Soc. Workshop, Piscataway, NJ, USA, pp. 41-46 (Apr. 19-20, 2001).
|Bishop & Loucks, "A Heterogeneous Environment for Hardware/Software Cosimulation," Proceedings of the 30th Annual Simulation Symposium, pp. 14-22 (Apr. 7-9, 1997).
|Brakensiek et al., "Re-Configurable Multi-Standard Terminal for Heterogeneous Networks," Radio and Wireless Conference, Rawcon 2002 IEEE. pp. 27-30 (2002).
|Brown et al., "Quick PDA Data Exchange," PC Magazine pp. 1-3 (May 22, 2001).
|Buck et al., "Ptolemy: A Framework for Simulating and Prototyping Heterogeneous Systems," International Journal of Computer Simulation 4:155-182 (Apr. 1994).
|Burns et al., "A Dynamic Reconfiguration Run-Time System," Proceedings of the 5th Annual Symposium on Field-Programmable Custom Computing Machines, pp. 166-175 (Apr. 16, 1997).
|Business Wire, "Whirlpool Internet-Enabled Appliances to Use Beeline Shopper Software Features," http://www.whirlpoocorp.com/news/releases/release.asp?rid=90 (Feb. 16, 2001).
|Buttazzo et al., "Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments," Engineering of Complex Computer Systems, Proceedings of the Third IEEE International Conference on Como, pp. 39-48 (Sep. 8, 1997).
|Callahan et al., "Adapting Software Pipelining for Reconfigurable Computing," in Proceedings of the International Conference on Compilers, Architectrue and Synthesis for Embedded Systems p. 8, ACM (Cases '00, San Jose, CA) (Nov. 17-18, 2000).
|Chapman & Mehrotra, "OpenMP and HPF: Integrating Two Paradigms," Proceedings of the 4th International Euro-Par Conference (Euro-Par'98), Springer-Verlag Heidelberg, Lecture Notes in Computer Science 1470:650-658 (1998).
|Chen et al., "A Reconfigurable Multiprocessor IC for Rapid Prototyping of Algorithmic-Specific High-Speed DSP Data Paths," IEEE Journal of Solid-State Circuits, IEEE 35:74-75 (Feb. 1, 2001).
|Clarke, "Embedded Solutions Enters Development Pact with Marconi," EETimes Online (Jan. 26, 2000).
|Compton & Hauck, "Reconfigurable Computing: A Survey of Systems and Software," ACM Press, ACM Computing Surveys (CSUR) 34(2):171-210 (Jun. 2002).
|Compton et al., "Configuration Relocation and Defragmentation for Run-Time Reconfigurable Computing," Northwestern University, http://citeseer.nj.nec.com/compton00configuration.html, pp. 1-17 (2000).
|Computer Organization and Design 2nd Edition, Hennessy, Morgan Kaufmann Publishers, pp. 569-570 (1998).
|Conte et al., "Dynamic Rescheduling: A Technique for Object Code Compatibility in VLIW Architectures," Proceedings of the 28th Annulal International Symposium on Microarchitecture pp. 208-218 (Nov. 29, 1995).
|Conte et al., "Instruction Fetch Mechanisms for VLIW Architectures with Compressed Encodings," Proceedings of the Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) 29:201-211 (Dec. 2, 1996).
|Cray Research Inc., "Cray T3E Fortran Optimization Guide," Ver. 004-2518-002, Section 4.5 (Jan. 1999).
|Cummings et al., "FPGA in the Software Radio," IEEE Communications Magazine . 37(2):108-112 (Feb. 1999).
|Dandalis et al., "An Adaptive Cryptograhic Engine for IPSec Architectures," IEEE pp. 132-141 (Jan. 2000).
|David et al., "DART: A Dynamically Reconfigurable Architecture Dealing with Future Mobile Telecommunication Constraints," Proceedings of the International Parallel and Distributed Processing Symposium pp. 156-163 (Apr. 15, 2002).
|Deepakumara et al., "FPGA Implementation of MD5 has Algorithm," Canadian Conference on Electrical and Computer Engineering, IEEE (2001).
|Dehon et al., "Reconfigurable Computing: What, Why and Implications for Design Automation," Design Automation Conference Proceedings pp. 610-615 (1999).
|Dipert, "Figuring Out Reconfigurable Logic," EDN 44(16):107-114 (Aug. 5, 1999).
|Dominikus, "A Hardware Implementation of MD4-Family Hash Algorithms," 9th International Conference on Electronics, Circuits and Systems IEEE (2002).
|Dorband, "aCe C Language Reference Guide," Online (Archived Mar. 2001), http://web.archive.org/web/20000616053819/http://newton.gsfc.nasa.gov/aCe/aCe-dir/aCe-cc-Ref.html (Mar. 2001).
|Dorband, "aCe C Language Reference Guide," Online (Archived Mar. 2001), http://web.archive.org/web/20000616053819/http://newton.gsfc.nasa.gov/aCe/aCe—dir/aCe—cc—Ref.html (Mar. 2001).
|Drozdowski, "Scheduling Multiprocessor Tasks-An Overview," Instytut Informatyki Politechnika, pp. 1-31 (Jan. 31, 1996).
|Drozdowski, "Scheduling Multiprocessor Tasks—An Overview," Instytut Informatyki Politechnika, pp. 1-31 (Jan. 31, 1996).
|Ebeling et al., "RaPiD Reconfigurable Pipelined Datapath," Springer-Verlag, 6th International Workshop on Field-Programmable Logic and Applications pp. 126-135 (1996).
|Fawer et al., "A Multiprocessor Approach for Implementing a Time-Diversity Spread Specturm Receiver," Proceeding sof the 1990 International Zurich Seminal on Digital Communications, pp. 173-180 (Mar. 5-8, 1990).
|Fisher, "Gone Flat," Forbes pp. 76-79 (Oct. 2001).
|Fleischmann et al., "Prototyping Networked Embedded Systems," Integrated Engineering, pp. 116-119 (Feb. 1999).
|Forbes "Best of the Web-Computer Networking/Consumer Durables," The Forbes Magnetic 40 p. 80 (May 2001).
|Forbes "Best of the Web—Computer Networking/Consumer Durables," The Forbes Magnetic 40 p. 80 (May 2001).
|Free On-Line Dictionary of Computing. �1995-2000 www.foldoc.org search terms: cache, operating system, Internet, DMA, interrupt.
|Gibson, "Fresh Technologies Will Create Myriad Functions," FT Information Technology Review; World Wide Web at http://technews.acm.org/articles/2000-2/0301w.html?searchterm=%22fresh+technologies%22 (Mar. 1, 2000).
|Gluti I, "Integrierte Signalprozessoren," Elektronik 35(18):112-118 Franzis Verlag GMBH, Munich, Germany (Sep. 5, 1986).
|Gokhale & Schlesinger, "A Data Parallel C and Its Platforms," Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation pp. 194-202 (Frontiers '95) (Feb. 1995).
|Grimm et al., "A System Architecture for Pervasive Computing," Washington University, pp. 1-6 (Sep. 2000).
|Halbwachs et al., "The Synchronous Data Flow Programming Language LUSTRE," Proceedings of the IEEE 79(9):1305-1319 (Sep. 1991).
|Hammes et al., "Cameron: High Level Language Compilation for Reconfigurable Systems," Proc. of the Intl. Conf. on Parallel Architectures and Compilation Techniques, pp. 236-244 (Oct. 1999).
|Hanna et al., "A Normalized Backpropagation Learning Algorithm for Multilayer Feed-Forward Neural Adaptive Filters," Neural Networks for Signal Processing XI, Proceedings of the 2001 IEEE Signal Processing Society Workshop pp. 63-72 (Sep. 2001).
|Hartenstein, "Coarse Grain Reconfigurable Architectures," Design Automation Conference, 2001. Proceedings of the ASP-Dac 2001, Asian and South Pacific Jan. 30, 2001- Februray 2, 2001, Piscataway, Nj, US, IEEE, pp. 564-569 (Jan. 30, 2001).
|Heinz, "An Efficiently Compilable Extension of {M} odula-3 for Problem-Oriented Explicitly Parallel Programming," Proceedings of the Joint Symposium on Parallel Processing (May 1993).
|Hinden et al., "The DARPA Internet: Interconnecting Heterogeneous Computer Networks with Gateways," IEEE Computer Magazine pp. 38-48 (1983).
|Horton, "Beginning Java 2: JDK 1.3 Edition," Wrox Press, Chapter 8, pp. 313-316 (Feb. 2001).
|Huff et al., "Lifetime-Sensitive Modulo Scheduling," 6th Conference on Programming Language, Design and Implementation, pp. 258-267, ACM (1993).
|IBM, "Multisequencing a Single Instruction Stream Scheduling with Space-time Trade-offs," IBM Technical Disclosure Bulletin 36(2):105-108 (Feb. 1, 1993).
|IEEE, "IEEE Standard Verilog Hardware Description Language," downloaded from http://inst.eecs.berkeley.edu/~cs150/fa06/Labs/verilog-ieee.pdf on Dec. 7, 2006 (Sep. 2001), pp . 1-5.
|IEEE, "IEEE Standard Verilog Hardware Description Language," downloaded from http://inst.eecs.berkeley.edu/˜cs150/fa06/Labs/verilog-ieee.pdf on Dec. 7, 2006 (Sep. 2001), pp . 1-5.
|Internet Wire, Sunbeam Joins Microsoft in University Plug and Play Forum to Establish A "Universal" Smart Appliance Technology Standard (Mar. 23, 2000).
|Ishii et al., "Parallel Variable Length Decoding with Inverse Quantization for Software MPEG-2 Decoders," Workshop on Signal Processing Systems, Design and Implementation, IEEE pp. 500-509 (Nov. 3-5, 1997).
|Jain et al., "An Alternative Approach Towards the Design of Control Units," Microelectronics and Reliability 24(6):1009-1012 (1984).
|Jain, "Parallel Processing with the TMS320C40 Parallel Digital Signal Proccssor," Sonitech International Inc., pp. 13-46. Retrieved from: http://www-s.ti.com/sc/psheets/spra031/spra031.pdf retrieved on Apr. 14, 2004 (Feb. 1994).
|Janssen et al., "Partitioned Register File for TTAs," Proceedings of the 28th Annual International Symposium on Microarchitecture, pp. 303-312 (Nov. 1995).
|Janweijer et al., "A Compact Robin Using the SHarc (CRUSH)," Obtained from: http://www.nikhef.nl/˜peterj/Crush/CRUSH-hw.pdf (Sep. 1998).
|Jong-Pyng et al., "Real-Time Virtual Channel flow Control," Proceedings of the Annual International Phoenix Conference on Computers and Communications, Conf. 13, pp. 97-103 (Apr. 12, 1994).
|Jung et al., "Efficient Hardware Controller Synthesis for Synchronous Dataflow Graph in System Level Design," Proceedings of the 13th International Symposium on System Synthesis pp. 79-84 (ISSS'00) (Sep. 2000).
|Kaufmann et al., "Digital Spread-Spectrum Multipath-Diversity Receiver for Indoor Communication," from Pioneers to the 21st Century; Denver, Proceedings of the Vehicular Technology Socity [sic] Conference, NY, IEEE, US 2(Conf. 42):1038-1041 (May 10-13, 1992).
|Kneip et al., "An Algorithm Adapted Autonomous Controlling Concept for a Parallel Single-Chip Digital Signal Processor," Journal of VLSI Signal Processing Systems for Signal, Image, an dVideo Technology 16(1):31-40 (May 1, 1997).
|Lee & Messerschmitt, "Pipeline Interleaved Programmable DSP's: Synchronous Data Flow Programming," IEEE Transactions on Acoustics, Speech, and Signal Processing ASSP-35(9):1334-1345 (Sep. 1987).
|Lee & Messerschmitt, "Synchronous Data Flow," Proceedings of the IEEE 75(9):1235-1245 (Sep. 1987).
|Lee & Parks, "Dataflow Process Networks," Proceedings of the IEEE 83(5):773-799 (May 1995).
|Liu et al., "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," Journal of the Association for Computing 20(1):46-61 (1973).
|Llosa et al., "Lifetime-Sensitive Modulo Scheduling in a Production Environment," IEEE Trans. on Comps. 50(3):234-249 (Mar. 2001).
|Lu et al., "The Morphosys Dynamically Reconfigurable System-On-Chip," Proceedings of the First NASA/DOD Workshop on Evolvable Hardware, pp. 152-160 (Jul. 19, 1999).
|Mangione-Smith et al., "Seeking Solutions in Configurable Computing," Computer 30(12):38-43 (Dec. 1997).
|Mannion, "Networking CPU Adds Spice," Electronic Engineering Times, Issue 1126 (Aug. 14, 2000).
|Mascia & Ishii., "Neural Net Implementation on Single-Chip Digital Signal Processor," IEEE (1989).
|McGraw, "Parallel Functional Programming in Sisal: Fictions, Facts, and Future," Lawrence Livermore National Laboratory pp. 1-40 (Jul. 1993).
|Najjar et al., "High-Level Language Abstraction for Reconfigurable Computing," Computer 36(8):63-69 (Aug. 2003).
|Nichols et al., "Data Management and Control-Flow Constructs in a SIMD/SPMD Parallel Language/Compiler," Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation pp. 397-406 (Oct. 1990).
|Openmp Architecture Review Board, "OpenMP C and C++ Application Program Interface," pp. 7-16 (Oct. 1998).
|Oracle Corporation, "Oracle8i JDBC Developer's Guide and Reference," Release 3, 8.1.7, pp. 10-8-10-10 (Jul. 2000).
|Pauer et al., "Algorithm Analysis and Mapping Environment for Adaptive Computing Systems," Presentation slides, Third Bi-annual Ptolemy Miniconference (1999).
|Pauer et al., "Algorithm Analysis and Mapping Environment for Adaptive Computing Systems: Further Results," Proc. IEEE Symposium on FPGA's for Custom Computing Machines (FCCM), Napa CA (1999).
|Rajagopalan et al., "A Flexible Multiplication Unit for an FPGA Logic Block," Circuits and Systems 4:546-9 (2001).
|Ramamritham et al., "On Scheduling Algorithms for Real-Time Multiprocessor Systems," Algorithms and Applications, Proceedings of the International conference on Parallel Processing 3:143-152 (Aug. 8, 1989).
|Schneider, "A Parallel/Serial Trade-Off Methodology for Look-Up Table Based Decoders," Proceedings of the Design Automation Conference 34:498-503 (Jun. 9-13, 1997).
|Sidhu et al., "A Self-Reconfigurable Gate Array Architecture," 10 International Workshop on Field Programmable Logic and Applications http://coblitz.codeen.org:3125/ citeseer.ist.psu.edu/cache/papers/cs/17524/http:zSzzSzmaarcii.usc.eduzSzPublicationsZSzsidhu-fp100.pdf/sidhu00selfreconfigurable.pdf retrieved on Jun. 21, 2006 (Sep. 1, 2001).
|Sidhu et al., "A Self-Reconfigurable Gate Array Architecture," 10 International Workshop on Field Programmable Logic and Applications http://coblitz.codeen.org:3125/ citeseer.ist.psu.edu/cache/papers/cs/17524/http:zSzzSzmaarcii.usc.eduzSzPublicationsZSzsidhu—fp100.pdf/sidhu00selfreconfigurable.pdf retrieved on Jun. 21, 2006 (Sep. 1, 2001).
|Smith, "Intro to ASICs: ASIC Cell Libraries," at http://iroi.seu.edu.cn/books/asics/Book2/CH01/CH01.5.htm, printed on Feb. 4, 2005 (Jun. 1997).
|Souza, "Computing's New Face-Reconfigurable Devices Could Rattle Supply Chain," Electronic Buyers' News Issue 1205, pg. p. 1 (Apr. 3, 2000).
|Souza, "Computing's New Face—Reconfigurable Devices Could Rattle Supply Chain," Electronic Buyers' News Issue 1205, pg. p. 1 (Apr. 3, 2000).
|Souza, "Quicksilver Buys White Eagle," Electronic Buyers News, Issue 1220 (Jul. 17, 2000).
|Sriram et al., "MPEG-2 Video Decoding on the TMS320C6X DSP Architecture," Conference Record of the 32nd Asilomar Conference on Signals, Systems, and Computers, IEEE pp. 1735-1739 (Nov. 1-4, 1998).
|Sun Microsystems, "Fortran 3.0.1 User's Guide, Revision A," pp. 57 and 68 (Aug. 1994).
|Svensson, "Co's Join on Home Web Wiring Network," Associated Press Online printed on Apr. 30, 2008 (Jun. 2000).
|Tang et al., "Thread Partitioning and Scheduling Based on Cost Model," Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 272-281 Retrieved from: http://doi.acm.org/10.1145/258492.2585 retrieved on Aug. 25, 2004 (1997).
|U.S. Appl. No. 10/719,921 Office Action Date Mailed Jun. 14, 2006.
|U.S. Appl. No. 11/803,998 Office Action Date Mailed Jul. 25, 2007.
|U.S. Appl. No. 12/115,843 Office Action Date Mailed Sep. 9, 2009.
|Vaya, "VITURBO: A Reconfigurable Architecture for Ubiquitous Wireless Networks," A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science; Rice University (Aug. 2002).
|Wang et al., "Cell Search in W-CDMA," IEEE Journal on Selected Areas in Communications 18(8):1470-1482 (Aug. 2000).
|Whiting & Pascoe, "A History of Data-Flow Languages," IEEE Annals of the History of Computing 16(4):38-59 (1994).
|Williamson & Lee, "Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications," Conference Record of the Thirtieth Asilomar Confercnce on Signals, Systems and Computers 1340-1343 (Nov. 1996).
|Wirthlin et al., "A Dynamic Instruction Set Computer," Proceedings of the IEEE Symposium on FPGA's for Custom Computing Machines, pp. 99-107 (Apr. 21, 1995).
|www.appliancemagazine.com, World Wide Web at http://web.archive.org/web/20000511085402/http://www.appliancemagazine.com/ printed on Apr. 30, 2008.
|www.Bestrom.com, BreakMateTM from www.bestrom.com printed on Apr. 29, 2008.
|www.bonator.com, from The World Wide Web at http://web.archive.org/web/20000510102440/http://www.bonator.com/ printed on Apr. 30, 2008.
|www.gateway.com, World Wide Web, http://wcb.archivc.org/wcb/20000229192734/www.gateway.com/productpagcs /9300splash/index.shtml Available on Mar. 3, 2000, 1 page (Mar. 3, 2000).
|www.icl.com, from the World Wide Web at http://www.icl.com printed on Apr. 30, 2008.
|www.margherita2000.com; from Margherita2000.com printed Apr. 30, 2008 (Jan. 26, 2001).
|Xilinx Data Book 1998.
|Xilinx Virtex-E 1.8V Extended Memory FPGAs, 2000.
|Xilinx Virtex-E 1.8V Extended Memory FPGAs, 2002.
|Xilinx, "Virtex-II Pro Platform FPGAs: Functional Description DS083-2 (v2.5)," Product Specification, pp. 13-46 (Jan. 20, 2003).
|Young, "Architecture Powers up IPSec, SSL," EETimes, Los Gatos, CA, pp. 1-4 http://www.eetimes.com/story/OEG20011102S0065 (Nov. 2, 2001).
|Yuan et al., "A Decomposition Approach to Non-Preemptive Real-Time Scheduling," Real Time Systems 6(1):7-35 (1994).
|Zaino et al., "Algorithm Analysis and Mapping Environment for Adaptive Computing Systems," Final Technical Report, DARPA Contract F33615-97-C-1174 (Sep. 2001).
|Zhang et al., "A 1V Heterogeneous Reconfigurable Processor IC for Baseband Wireless Applications," 2000 IEEE Solid.
|Citing Patent
|Filing date
|Publication date
|30 Dec 2008
|23 Jul 2013
|Intel Corporation
|Single instruction processing of network packets
|25 Jun 2013
|9 Jun 2015
|Intel Corporation
|Single instruction processing of network packets
|8 May 2014
|21 Jun 2016
|International Business Machines Corporation
|Interruption of chip component managing tasks
|11 Jun 2014
|28 Jun 2016
|International Business Machines Corporation
|Interruption of chip component managing tasks
|30 Dec 2008
|1 Jul 2010
|Veal Bryan E
|SIMD processing of network packets
|11 Feb 2014
|20 Nov 2014
|International Business Machines Corporation
|Unterbrechung von Aufgaben zur Verwatlung von Chip-Komponenten
|U.S. Classification
|711/149, 711/154
|International Classification
|Cooperative Classification
|European Classification
|14 Jan 2015
|Fee payment
Year of fee payment: 4
|20 Jan 2016
Owner name: QUICKSILVER TECHNOLOGY INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FURTEK, FREDERICK CURTIS;MASTER, PAUL L.;SIGNING DATES FROM 20040420 TO 20040428;REEL/FRAME:037537/0858
|11 Feb 2016
Owner name: TECHFARM VENTURES MANAGEMENT, LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:QUICKSILVER TECHNOLOGY, INC.;REEL/FRAME:037711/0318
Effective date: 20051013
Owner name: QST HOLDINGS, LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TECHFARM VENTURES MANAGEMENT, LLC;REEL/FRAME:037712/0471
Effective date: 20060831