US4648045A — High speed memory and processor system for raster…

Claim 1

Independent Claim 164 words

A high speed memory system for creating a raster of pixel elements comprising an image which is displayed in response to pixel data as the image is scanned along a plurality of scan lines, said memory system comprising a bus for providing transformed data of graphical primitives in display coordinates, a plurality of scan line processors connected to receive said transformed data from said bus, each scan line processor controlling data for a plurality of scan lines, and a plurality of data memory means for storing data for all of said scan lines, each of said data memory means connected to receive data from one of said scan line processors, each of said data memory means comprising a plurality of memory segments with each memory segment storing data for a limited portion of each of said plurality of scan lines controlled by the scan line processor to which said data memory means is connected, thereby providing parallel storage, access, and operation on stored data.

Claim 2

Dependent Claim 164 words

A high speed memory system for creating a raster of pixel elements comprising an image which is displayed in response to pixel data as the image is scanned along a plurality of scan lines, said memory system comprising a bus for providing transformed data of graphical primitives in display coordinates, a plurality of scan line processors connected to receive said transformed data from said bus, each scan line processor controlling data for a plurality of scan lines, and a plurality of data memory means for storing data for all of said scan lines, each of said data memory means connected to receive data from one of said scan line processors, each of said data memory means comprising a plurality of memory segments with each memory segment storing data for a limited portion of each of said plurality of scan lines controlled by the scan line processor to which said data memory means is connected, thereby providing parallel storage, access, and operation on stored data.

Claim 3

Dependent Claim 55 words

The memory system as defined by claim 1 wherein each memory segment includes a random access storage array representing a portion of a raster image and a processor which responds to scan line number, start point, and end point data from said scan line processor for modifying selected data in said random access storage array.

Claim 4

Dependent Claim 34 words

The memory system as defined by claim 2 wherein said processor is further responsive to halftone pattern data from said scan line processor for storing and accessing data in said random access storage array.

Claim 5

Dependent Claim 34 words

The memory system as defind by claim 2 wherein said processor is further responsive to commands from said scan line processor for performing Boolean logical operations on selected portions of stored image raster data.

Claim 6

Dependent Claim 60 words

The memory system as defined by claim 2 wherein said processor responds to commands including the row of said memory array, the first and last element of a contiguous subset which an arithmetic logic unit is to modify, the pattern of binary digits for the halftone pattern, and the Boolean logical operation which the arithmetic logic unit is to perform.

Claim 7

Dependent Claim 35 words

The memory system as defined by claim 5 wherein each memory segment includes display latch means for receiving data from said random access storage means for use in extracting the image from said memory segment.

Claim 8

Dependent Claim 35 words

The memory system as defined by claim 2 wherein each memory segment includes display latch means for receiving data from said random access storage means for use in extracting the image from said memory segment.

Claim 9

Dependent Claim 19 words

The memory system as defined by claim 1 wherein said data memory means stores pixel data as intensity values.

Claim 10

Dependent Claim 47 words

The memory system as defined by clalim 8 wherein said data memory means includes a plurality (K) of storage locations for each (K bit) pixel intensity value, said plurality of storage locations being arranged whereby one bit of all pixels on a scan line are accessible simultaneously.

Claim 11

Dependent Claim 47 words

The memory system as defined by clalim 8 wherein said data memory means includes a plurality (K) of storage locations for each (K bit) pixel intensity value, said plurality of storage locations being arranged whereby one bit of all pixels on a scan line are accessible simultaneously.

Claim 12

Dependent Claim 27 words

The memory system as defined by claim 9 wherein each row of said memory array contains one of the K intensity bits of a row of pixels.

Claim 13

Dependent Claim 20 words

The memory system as defined by claim 10 and further including a binary tree for providing interpolated pixel intensity values.

Claim 14

Dependent Claim 36 words

The memory system as defined by claim 11 wherein said interpolated values are calculated simultaneously for all selected pixels on a scan line, said values being provided for all selected pixels one bit at a time.

Claim 15

Dependent Claim 20 words

The memory system as defined by claim 9 and further including a binary tree for providing interpolated pixel intensity values.

Claim 16

Independent Claim 86 words

A method of processing data for generating a multiline raster image comprising the steps of storing pixel data for a plurality of scan lines in locations in a plurality of memory segments which can be accessed in parallel, and simultaneously accessing, processing, and modifying a plurality of pixel data locations for any one scan line, said data being processed in run length commands including scan line containing the pixels to be modified (Y), first point to be modified (Xs), and last point to be modified (Xe).

Claim 17

Independent Claim 86 words

A method of processing data for generating a multiline raster image comprising the steps of storing pixel data for a plurality of scan lines in locations in a plurality of memory segments which can be accessed in parallel, and simultaneously accessing, processing, and modifying a plurality of pixel data locations for any one scan line, said data being processed in run length commands including scan line containing the pixels to be modified (Y), first point to be modified (Xs), and last point to be modified (Xe).

Claim 18

Dependent Claim 47 words

The method as defined by claim 14 and including the step of latching pixel data from said plurality of memory segments for display scan line control which allows manipulation of data stored in said memory segments while said latched data is independently extracted from said memory segment.

Claim 19

Dependent Claim 21 words

The method as defined by claim 15 and including the step of processing in parallel data for pluralities of scan lines.

Claim 20

Independent Claim 72 words

A method of processing data for generating a multiline raster image comprising the steps of storing pixel data for a plurality of scan lines in locations in a plurality of memory segments which can be accessed in parallel, and simultaneously accessing, processing, and modifying a plurality of pixel data locations for any one scan line, said graphical primitives being translated to horizontal line fill commands communicated to said plurality of memory segments.

Claim 21

Independent Claim 72 words

A method of processing data for generating a multiline raster image comprising the steps of storing pixel data for a plurality of scan lines in locations in a plurality of memory segments which can be accessed in parallel, and simultaneously accessing, processing, and modifying a plurality of pixel data locations for any one scan line, said graphical primitives being translated to horizontal line fill commands communicated to said plurality of memory segments.

Claim 22

Dependent Claim 47 words

The method as defined by claim 17 and including the step of matching pixel data from said plurality of memory segments for display scan line control which allows manipulation of data stored in said memory segments while said latched data is independently extracted from said memory segment.

Claim 23

Dependent Claim 21 words

The method as defined by claim 18 and including the step of processing in parallel data for pluralities of scan lines.

Claim 24

Dependent Claim 87 words

A memory segment for use in a high speed memory having a parallel architecture comprising random access storage array of storage elements arranged in rows and columns, a dedicated arithmetic logic unit responsive to control signals for storing, accessing, and operating on data in said storage array, and control means for directing said arithmetic logic unit (ALU) for accessing, operating on and storing any portion of data in a row wherein any storage elements in one row can be accessed and operated on simultaneously in one operation.

Claim 25

Dependent Claim 87 words

A memory segment for use in a high speed memory having a parallel architecture comprising random access storage array of storage elements arranged in rows and columns, a dedicated arithmetic logic unit responsive to control signals for storing, accessing, and operating on data in said storage array, and control means for directing said arithmetic logic unit (ALU) for accessing, operating on and storing any portion of data in a row wherein any storage elements in one row can be accessed and operated on simultaneously in one operation.

Claim 26

Dependent Claim 16 words

The memory segment as defined by claim 20 wherein said segment comprises a semiconductor integrated circuit.

Claim 27

Dependent Claim 39 words

The memory segment as defined by claim 20 wherein said control and ALU means respond to commands to operate on subsets of a memory row without changing unselected portions, said subset being variable from one operation to the next.

Claim 28

Dependent Claim 50 words

The memory segment as defined by claim 22 and executing commands consisting of the elements (i) the row of said memory array on which the said ALU is to operate, and (ii) the first and last element of said portion of accessed data which the said ALU is to modify.

Claim 29

Dependent Claim 33 words

The memory segment as defined by claim 20 wherein said arithmetic logic unit is further responsive to halftone pattern data for accessing, operating on, and storing data in said random access storage array.

Claim 30

Dependent Claim 39 words

The memory segment as defined by claim 24 wherein said arithmetic logic unit (ALU) is further responsive to commands for modifying stored data by performing Boolean logical operations on specified portions of the accessed data and the halftone pattern.

Claim 31

Dependent Claim 44 words

The memory segment as defined by claim 25 and further including latch means for receiving data from said random access storage means thereby allowing continued manipulation of data stored in said memory array while said latched data is independently extracted from said memory segment.

Claim 32

Dependent Claim 70 words

The memory segment as defined by claim 25 and executing commands consisting of four elements: (i) the row of said memory array on which the said ALU is to operate, (ii) the first and last element of said portion of accessed data which the said ALU is to modify, (iii) the pattern of binary digits of said halftone pattern, (iv) the Boolean logical operation which the ALU is to perform.

Claim 33

Dependent Claim 45 words

The memory segment as defined in claim 27 wherein said control means includes means to store a number of said patterns and to present one of them to said ALU each time one of the run lengths commands is presented to the said memory segment.

Claim 34

Dependent Claim 39 words

The memory segment as defined by claim 27 wherein said control and ALU means respond to commands to operate on subsets of a memory row without changing unselected portions, said subset being variable from one operation to the next.

Claim 35

Dependent Claim 36 words

The memory segment as defined by claim 25 wherein said pattern can be modified through the use of known logical Boolean operations before being used by said ALU to operate on said portion of accessed data.

Claim 36

Dependent Claim 19 words

The memory segment as defined by claim 20 wherein said data memory means stores pixel data as intensity values.

Claim 37

Dependent Claim 47 words

The memory segment as defined by claim 20 wherein said data memory means includes a plurality (K) of storage locations for each (K bit) pixel intensity value, said plurality of storage locations being arranged whereby one bit of all pixels on a scan line are accessible simultaneously.

Claim 38

Dependent Claim 27 words

The memory segment as defined by claim 32 wherein each row of said memory array contains one of the K intensity bits of a row of pixels.

Claim 39

Dependent Claim 20 words

The memory segment as defined by claim 33 and further including a binary tree for providing interpolated pixel intensity values.

Claim 40

Dependent Claim 36 words

The memory segment as defined by claim 34 wherein said interpolated values are calculated simultaneously for all selected pixels on a scan line, said values being provided for all selected pixels one bit at a time.

Claim 41

Dependent Claim 20 words

The memory segment as defined by claim 32 and further including a binary tree for providing interpolated pixel intensity values.

Claim 42

Dependent Claim 39 words

The memory segment as defined by claim 32 wherein said control and ALU means respond to commands to operate on subsets of a memory row without changing unselected portions, said subset being variable from one operation to the next.

Claim 43

Dependent Claim 208 words

A high speed memory system for creating a raster of pixel elements comprising an image which is displayed in response to pixel data as the image is scanned along a plurality of scan lined, said memory system comprising a bus for providing transformed data of graphical primitives in display coordinates, at least one scan line processor connected to receive said transformed data from said bus, said scan line processor controlling data for a plurality of scan lines, and a plurality of data memory means for storing data for all of said scan lines, each of said data memory means connected to receive data from said scan line processor, each of said data memory means comprising a plurality of memory segments with each memory segment storing data for a limited portion of each of said plurality of scan lines controlled by said scan line processor to which said data memory means if connected, thereby providing parallel storage, access, and operation on stored data, each memory segment including a random access storage array representing a portion of a raster image and a processor which responds to scan line number, start point, and end point data from said scan line processor for modifying selected data in said random access storage array.

Claim 44

Dependent Claim 208 words

A high speed memory system for creating a raster of pixel elements comprising an image which is displayed in response to pixel data as the image is scanned along a plurality of scan lined, said memory system comprising a bus for providing transformed data of graphical primitives in display coordinates, at least one scan line processor connected to receive said transformed data from said bus, said scan line processor controlling data for a plurality of scan lines, and a plurality of data memory means for storing data for all of said scan lines, each of said data memory means connected to receive data from said scan line processor, each of said data memory means comprising a plurality of memory segments with each memory segment storing data for a limited portion of each of said plurality of scan lines controlled by said scan line processor to which said data memory means if connected, thereby providing parallel storage, access, and operation on stored data, each memory segment including a random access storage array representing a portion of a raster image and a processor which responds to scan line number, start point, and end point data from said scan line processor for modifying selected data in said random access storage array.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1990-03-02	1990-09-01	1991-03-03	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1994-03-02	1994-09-01	1995-03-03	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	1998-03-02	1998-09-01	1999-03-03	$7700.00	Window Closed / Lapsed

High speed memory and processor system for raster display

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag