Abstract: A fast translation look-aside buffer for translating a linear address RL=A+B to a physical address, where A and B are two N bit operands. Inputs to the translation look-aside buffer are the n highest-order bits of A and B, where n<N, and the carry-out term from the sum of the first N−n bits of A and B. The TLB may provide a hit without the need for the sum of A and B.

Abstract: A 3x adder for adding 2a to a, where a is a binary number, the binary numbers 2a and a partitioned so that 2a=(xk . . . x0) and a=(yk . . . y0)where xi and yi have the same size for each i=0, 1, . . . , k, where the 3x adder provides the group generate terms for the sums xi+yi, i=0, 1, . . . , k, according to Boolean expressions, where for any sum xi+yi where xi and yi each have size n1+1, the number of Boolean variables in the product terms in the Boolean expression for the group generate terms of xi+yi do not exceed j+1, where j is the largest integer not exceeding ni/2.

Abstract: Error correction and detection for time-multiplexed binary 72-tuples over 18 wires to detect a wire fault. A syndrome is computed using a parity check matrix, where circuits for realizing the parity check matrix multiplication can be realized with only two levels of XOR gates and in which the computation is pipelined to process the time-multiplexed binary 72-tuple.

Abstract: A infrared pixel sensor comprising a pixel circuit and a composite infrared pass filter comprising a plurality of filters, wherein each filter belonging to the plurality of filters are substantially transparent to infrared radiation and have a visible pass spectrum so that the composite infrared pass filter is substantially opaque to visible light. Signals from infrared pixel sensors are subtracted from color pixel sensors to correct for infrared radiation in the image signal without the need for an infrared blocking filter.

Abstract: A method for communicating between a sender and a receiver a set of dependencies among a set of media streams in a data network. The method comprises the step of creating a payload data packet having a header and a set of stream descriptors, where the header has a required stream field. Each stream descriptor is uniquely associated with a media stream belonging to the set of media streams and has a connection field to provide a network address for its associated media stream. Each stream descriptor that is associated with a media stream having a dependency also has a dependency field. The method also comprises the steps of creating a control data packet having the payload data packet as a payload; setting the required stream field to a value indicative of a required set of media streams, the required set of media streams being a subset of the set of media streams; and setting the dependency fields to indicate the set of relationships.

Abstract: Requests to memory issued by an agent on a bus are satisfied while maintaining cache consistency. The requesting agent may issue a request to another agent, or the memory unit, by placing the request on the bus. Each agent on the bus snoops the bus to determine whether the issued request can be satisfied by accessing its cache. An agent which can satisfy the request using its cache, i.e., the snooping agent, issues a signal to the requesting agent indicating so. The snooping agent places the cache line which corresponds to the request onto the bus, which is retrieved by the requesting agent. In the event of a read request, the memory unit also retrieves the cache line data from the bus and stores the cache line in main memory. In the event of a write request, the requesting agent transfers write data over the bus along with the request. This write data is retrieved by both the memory unit, which temporarily stores the data, and the snooping agent.