Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
266 words
A graphic processor for single instruction multiple data operations on k pixels simultaneously, each pixel having at most n bits, where k and n are integers each greater than one, which processor is also easily expandable in terms of pixel length and can efficiently handle conditional operations requiring efficient interpixel communications comprising: a plurality of n frame buffers, each buffer storing data of k bit width, said plurality of frame buffers arranged in groups of i frame buffers per group, where n and i are each integers greater than one and i is an integer less than n to provide n/i groups of frame buffers, a plurality of pixel slice processors, each operating on data of i bit width, said plurality of pixel slice processors arranged in n/i groups of k processors per group where each frame buffer group has a corresponding pixel slice processor group, data path means to provide for: (i) bidirectional, bit-parallel data flow within a group between said frame buffers and said pixel slice processors, (ii) data flow between pixel slice processors of a group, and (iii) data flow between corresponding pixel slice processors of different groups, said data path means providing bidirectional, bit parallel data flow within a group including connections between each pixel slice processor and each frame buffer where each frame buffer of a group is connected only to pixel slice processors of that group, whereby computations requiring intra pixel carries and conditional computations requiring inter pixel communications are provided for on said data path means and extensions of pixel length are handled by increases in the integer n.
Claim 2
Dependent Claim
266 words
A graphic processor for single instruction multiple data operations on k pixels simultaneously, each pixel having at most n bits, where k and n are integers each greater than one, which processor is also easily expandable in terms of pixel length and can efficiently handle conditional operations requiring efficient interpixel communications comprising: a plurality of n frame buffers, each buffer storing data of k bit width, said plurality of frame buffers arranged in groups of i frame buffers per group, where n and i are each integers greater than one and i is an integer less than n to provide n/i groups of frame buffers, a plurality of pixel slice processors, each operating on data of i bit width, said plurality of pixel slice processors arranged in n/i groups of k processors per group where each frame buffer group has a corresponding pixel slice processor group, data path means to provide for: (i) bidirectional, bit-parallel data flow within a group between said frame buffers and said pixel slice processors, (ii) data flow between pixel slice processors of a group, and (iii) data flow between corresponding pixel slice processors of different groups, said data path means providing bidirectional, bit parallel data flow within a group including connections between each pixel slice processor and each frame buffer where each frame buffer of a group is connected only to pixel slice processors of that group, whereby computations requiring intra pixel carries and conditional computations requiring inter pixel communications are provided for on said data path means and extensions of pixel length are handled by increases in the integer n.
Claim 3
Dependent Claim
98 words
The processor of claim 20 in which said data path means comprises: a first set of data paths in each group coupling first i/o ports of said pixel slice processors to i/o ports of said frame buffers, a second set of data paths for intra group communication coupling second i/o ports of pixel slice processors in a group to each other to provide for inter pixel data communication, and a third set of data paths for inter group communication coupling third i/o ports of corresponding pixel slice processors in different groups to provide for intra pixel data communication.
Claim 4
Dependent Claim
48 words
The processor of claim 2 in which said first set of data paths in each group includes k*i bidirectional data paths, arranged in groups of i conductors, each group of i conductors coupling one of said k pixel slice processors to said i frame buffers of a group.
Claim 5
Dependent Claim
62 words
The processor of claim 1 which further includes: a plurality of circuit boards, one for each group, in which each of said groups of pixel slice processors are located on a different one of said circuit boards, and an inter board bus to provide that portion of said data path means for data flow between corresponding pixel slice processors of different groups.
Claim 6
Dependent Claim
68 words
The processor of claim 1 which further includes a tri-port transceiver for each pixel slice processor, a first port coupled to bus internal to the associated pixel slice processor, a second port coupled over a portion of said data path means to transceivers associated with different pixel slice processors within a group and a third port coupled to transceivers associated with corresponding pixel slice processors in different groups.
Claim 7
Dependent Claim
57 words
The processor of claim 1 which further includes a five port transceiver for each pixel slice processor, a first port coupled over a bus in said data path means to transceivers associated with corresponding pixel slice processors in different groups, and second through fifth ports coupled to transceivers associated with different pixel slice processors within a group.
Claim 8
Dependent Claim
100 words
The graphic processor of claim 1 in which each of said pixel slice processors includes: source and destination operand registers each of n-bit length and each coupled to said data path means and therethrough to an associated frame buffer, a digital memory with an input from each of said operand registers responsive to addressing inputs from said operand registers to produce n-bit output data, a data latch responsive to said n-bit output data of said digital memory, and connecting means coupling said data latch to said data path means and therethrough to other pixel slice processors in said pixel processor.
Claim 9
Dependent Claim
58 words
The graphic processor of claim 7 wherein each of said pixel slice processors further includes: a second source and second destination register each of n-bit length and each coupled to said data path means, source and destination multiplexers each connected between said digital memory said source and second source regsters and said destination and second destination registers, respectively.
Claim 10
Dependent Claim
87 words
The graphic processor of claim 7 wherein each of said pixel slice processors further includes: a second source and second destination register each of n-bit length and each coupled to said data path means, source and destination multiplexers and source and destination AND gates, said source AND gate coupled between said source and second source registers and said source multiplexer, said destination AND gate coupled between said destination and second destination registers and said destination multiplexer, said source and destination multiplexers each connected to said digital memory.
Claim 11
Dependent Claim
47 words
The graphic processor of claim 7 which further includes: a transceiver coupled between said data latch and said digital memory, said transceiver having a first port coupled to said digital memory and a second port coupled in common to said data latch and a host data bus.
Claim 12
Dependent Claim
42 words
The graphic processor of claim 10 in which said digital memory comprises a R/W random access memory means for providing an output to said data latch through said transceiver and responsive to data provided through said transceiver from said host data bus.