throbber
United States Patent {191
`[45]
`Date of Patent:
`Aug. 15, 1995
`Chang et a].
`
`[1 1]
`
`Patent Number:
`
`5,442,748
`
`|I|||||||||||||l|||||||||||ll|||l|l|l||||l||I|||||||||||||||l|l||||||||||||
`U5005442?43A
`
`[75]
`
`[54] ARCHITECTURE OF OUTPUT SWITCHING
`CIRCUITRY FOR FRANIE BUFFER
`Inventors: Shnen C. Chang, San Jose; Haj D. Ho,
`hdflrntam Szu (L Sun,n&oununn
`View; Jawii Chen, Cupertino, all of
`Calif.
`[73] Assignees: Sun Mierosystems, Inc, Mountain
`View; Samsung SEMiWfldllCtOT [31ch
`5311 Jose, both 0f C8111-
`[21] Appl. No; 145,754
`_
`0‘1 29' 1993
`[22] Elm:
`[51]
`Int. (31.5 ______________________________________________ G06F 12/00
`
`[52] US. Cl. ........................... 395/164
`{58] Field of Search ................................ 395/ 162—166,
`395/250, 275, 425; 345/185—187, 189, 190, 197,
`193, 200
`
`156]
`
`References Cited
`
`U‘S‘ PATENT DOCUMENTS
`365/219
`4,747,081
`5/1938 Heilveil et a].
`355/139-04
`4.947.373
`3/1990 Yamaguchi Ct 31-
`365/139.03
`5,023,838
`6/1991 Herbert ...............
`365/230'05
`5’042’013
`8/1992 8an
`5,170,157 12/1992 Ishll ............. 340N951
`5,249,159
`9/1993 Sate
`3652331165
`5.305.273 4/1994 Inoue
`3651230113
`
`
`
`Primary Examiner—Raymond J. Bayerl
`Assistant Examiner—U. Chauhan
`{£2.3ng Agent, or Firm Blakely SOROIOH Taylor &
`
`ABSTRACT
`[57}
`A frame buffer including a plurality of array planes of
`memory cells, row decoding circuitry for selecting
`rows of memory cells in each of the array planes to be
`accessed, column decoding circuitry for selecting col-
`umns of memory cells in each of the array planes to be
`accessed, a plurality of bitlines associated with the col-
`umns of memory cells of each array plane, each of the
`bitlines connecting to a column of memory cells and
`including a bitline sensing amplifier and a column select
`switch for providing access to the memory cells of that
`column of the array plane, a plurality of output sense
`amplifiers adapted to be connected to a selected number
`of bidines in an array plane by closing of particular ones
`of the column select switches in the bitlines, first appa-
`rams for providing output signals from the plurality of
`output sense amplifiers associated with each array plane
`to a data bus, and second apparatus for providing output
`signals {1.9m the plurality Of output sense amplifiers
`associated with each array plane to a shift register.
`
`20 Claims, 5 Drawing Sheets
`
`10
`
`ADDRESS BUS
`
`MODE
`
`CAG2
`
`:
`(mo-2
`ELIE!“
`
`.
`ill“
`MODE —:85 '
`
`ADD
`89
`T0
`DATA
`
`COKJJNHQIUD IUflSS
`
`ROW ADDRESS
`
` COLUMN
`mg_
`
`6774
`71-.-
`
`67
`
`
`
`
`
`
`v—mtur'mmzmcm
`
`
`
`BUS
`
`A III-III-
`B ::::::::
`:
`s IIIIIIII
`g III-Ill-
`
`90
`
`31
`
`
`
`
`
`g IIIIIIII
`IlllllllMOD ,
`8
`3:1 MUX
`
`83
`
`DATA BUS
`
`TO DISPLAY
`
`32
`
`92
`
`Page 1 of 14
`Page 1 of 14
`
`81
`
`5-1
`
`PLANE
`SELECT
`
`A MODE
`
`83
`
`HTC-LG-SAMSUNG EXHIBIT 1027
`HTC-LG-SAMSUNG EXHIBIT 1027
`
`

`

`US. Patent
`
`Aug. 15,1995
`
`Sheet 1 of 5
`
`5,442,748
`
`moEQMuU
`
`Heumamfimoufl
`
`5
`
`ma
`
`
`
`3&demadam
`
`
`
`hflmma953:0
`
`N953%
`
`bofimg
`
`Egomuseum
`
`fimhwfiwo
`
`homeUOhnH
`
`8.8m.was
`
`ma
`
`EoEwE
`
`$3.5”EaEmmv
`
`ma
`
`Emma
`
`3.8532
`
`NHmam
`
`Page 2 of 14
`Page 2 of 14
`
`
`

`

`US. Patent
`
`Aug. 15, 1995
`
`Sheet 2 of 5
`
`5,442,748
`
`%fi"
`9..
`.2
`"U
`c
`E-l
`
`Figure2(PriorArt)
`
`AflressBus e3of14
`
`Page 3 of 14
`
`DataBus
`
`

`

`U.S. Patent
`
`Aug. 15, 1995
`
`Sheet 3 of 5
`
`5,442,748
`
`03
`‘d‘
`
`00
`VI‘
`
`Q0—1
`{1‘m"-1
`'1':
`
`0 E
`
`Figure3(PriorArt)
`
`l
`
`AddressBus
`
`Page 4 of 14
`'0age4of14
`
` DataBus
`
`

`

`US. Patent
`
`Aug. 15, 1995
`
`Sheet 4 of 5
`
`5,442,748
`
`w23me
`
`
`
`mfimmmougfi
`
`
`
`m.Emmapaganon.
`
`3m33
`
`Page 5 of 14
`Page 5 of 14
`
`

`

`US. Patent
`
`Aug. 15, 1995
`
`Sheet 5 of 5
`
`5,442,748
`
`Figure5
`
`““E’
`g;
`
`mg”;
`
`a 8 2
`
`'38
`
`51
`
`31
`
`m3
`Qua
`83
`m0
`Q93
`3%
`on
`C:
`
`a
`
` 3%
`
`Q
`
`:25?“
`
`ROWADDRESS
`
`
`
`ADDRESSBUS
`
`
`a
`
`2 E8
`58%
`g
`U
`
`fl
`
`o
`
`g
`o
`2
`an;
`g;
`O
`O
`
` -' 4
`
`
`
`.I-IIIIIII_—II
`
`
`u:
`on
`f
`g.
`'4-
`=2-
`‘-55
`o :
`a Ell-
`3
`
`c:
`a:
`
`3
`
`Q
`o
`E
`IIIIIIII
`IIIIIIII
`g
`IIIIIIII
`I..----- so 2
`
`III-III.
`IIIIIIII
`
`on
`
`«nnmmmmmao
`
`“333
`0%
`2::
`a
`4
`3 a:
`c3
`4: j m 08%
`o
`e- a D:
`
`N
`a”
`
`w
`g
`g
`9
`
`g
`a:
`a:
`S
`q
`
`555%
`mama.
`QQQQ
`
`Page 6 of 14
`Page 6 of 14
`
`

`

`1
`
`5,442,748
`
`ARCHITECTURE 0F OUTPUT SWITCHING
`CIRCUITRY FOR FRAME BUFFER
`
`BACKGROUND OF THE INVENTION
`
`1. Field of the Invention
`This invention relates to computer systems and, more
`particularly, to apparatus for transferring data from a
`memory array of a frame buffer to a shift register used
`to provide data to an output display device.
`2. History of the Prior Art
`One of the significant problems involved in increas-
`ing the operational Speed of deskmp computers has
`been in finding ways to increase the rate at which infor-
`mation is transferred to an output display device. Many
`of the various forms of data presentation which are
`presently available require that copious amounts of data
`be transferred. For example, if a computer output dis-
`play monitor is operating in a color mode in which
`1024x780 pixels are displayed on the screen at once
`and the mode is one in which thirty-two bits are used to
`define each pixel, then a total of over twenty-five mil«
`lions bits of information must be transferred to the
`screen with each individual picture (called a “ft-arm”)
`that is displayed. Typically, sixty frames are displayed
`each second so that over one and one-half billion bits
`must be transferred each second in such a system. This
`requires a very substantial mount of processing power.
`In order to provide such a large amount of informa-
`tion to an output display device, computer systems
`typically utilize a frame buffer which holds the pixel
`data which is to be displayed on the output display.
`Typically a frame buffer offers a sufficient amount of
`dynamic random access memory (DRAM) to store one
`frame of data to be displayed. The information in the
`frame buffer is transferred to the display from the frame
`buffer sixty or more times each second. After (or dur-
`ing) each transfer, the pixel data in the frame buffer is
`updated with the new information to be diSplayed in the
`next frame. Prior art frame buffers capable of holding
`the necessary amount of information are quite large and
`complicated.
`In fact, a number of operations which might help to
`increase the speed of operation of a frame buffer and the
`transfer of the data in the frame buffer to the output
`display device are not implemented because the mount
`of circuitry required is too extensive and too compli-
`cated to be economic.
`For example, transferring the data to and from the
`frame buffer is very slow because of the manner in
`which the frame buffers are constructed. Various im-
`provements have been made to speed access in frame
`buffers. For example, two-ported video random access
`memory (VRAM) has been substituted for dynamic
`random access memory so that information may be
`transferred from the frame buffer to the display at the
`same time other information is being loaded into the
`frame buffer.
`One of the problems which all frame buffers have
`faced is caused by the method by which data is trans-
`ferred from the frame buffer to an output display de-
`vice. Typically, the display device is a cathode ray tube
`which renders the pixel data stored in the frame buffer
`on a screen in a series of rows. A typical diaplay is
`comprised of 780 horizontal rows, each of which in-
`cludes as many as 1024 individual pixels. A frame is
`described on the display by writing individual rows of
`pixels starting at the upper left corner of the display.
`Page 7 of 14
`Page 7 of 14
`
`5
`
`IO
`
`15
`
`20
`
`25
`
`35
`
`45
`
`SO
`
`55
`
`2
`Each row of pixels is rendered from left to right across
`the display before a next row in sequence is begun,
`When a row is completed, the next row below is begun
`at the left side of the screen. Each row is rendered in
`order until the last row at the bottom of the screen is
`completed. This completes one frame. Then the process
`starts over from the beginning with the next frame at
`the upper left corner of the display. As explained above,
`in the typical display sixty individual frames are pres-
`ented each second.
`
`In order to cause each of the pixels stored in the
`frame buffer to be presented at the appropriate position
`on the display, it is necessary to read the data for each
`pixel and transfer that data to the circuitry which con-
`trols its rendering on the output‘display device. In a
`typical VRAM, the pixel data to be displayed is read a
`row at a time and placed in a shift register at the output
`of the frame buffer. This is accomplished by providing
`one stage of shift register memory for each column of
`the array and writing into the shift register in response
`to a row selection accomplished by the row decode
`signal. The data stored at each cell of the row is ampli-
`fied by a bitline sense amplifier for that column and
`transferred to the associated shift. register stage. The
`data is then available in the shift register so that it may
`be shifted to the display a pixel at a time in order to fit
`the above-described sequence in which the pixels of a
`frame are displayed on a display device.
`Such a prior art shift register stores an entire row of
`pixel data stored in the array of the frame buffer. Such
`a shift register size has always been necessary because of
`the architectural arrangement by which a stage of the
`output shift register is associated with each column of
`the array. However, to hold this mount of data such a
`shift register must be capable of holding the number of
`pixels in a row multiplied by the largest number of bits
`in a pixel. For thirty-two bit color displays having a size
`of 512)< 512 pixels, this requires a shift register capable
`of holding 512x32 or a total of over sixteen thousand
`bits. A shift register capable of storing this amount of
`data and the attendant circuitry for transferring the data
`from the frame buffer array to the shift register require
`a very substantial amount of die space. Moreover, the
`pixel data stored by such a shift register must further
`amplified before it is furnished to the display control
`circuitry because the bitline sense amplifiers do not
`provide a sufficient amount of amplification. This addi-
`tion amplification slows the operation of writing to the
`diSplay.
`It has now been determined that such a large shift
`register is unnecessary for providing sufficient data to
`keep up with the display of pixel data on an output
`display device. It is therefore desirable to provide an
`architecture which allows the size of the shift register to
`be reduced in order to reduce the complexity and ex-
`pense of frame buffer circuitry. It is also desirable to
`provide a more rational arrangement of circuit architec-
`ture for transferring data from a frame buffer array to a
`shift register used for furnishing pixel data to an output
`diSplay device.
`SUMMARY OF THE INVENTION
`
`65
`
`It is, therefore, an object of the present invention to
`provide a new design of circuitry for providing output
`from a frame buffer.
`It is another more specific object of the present inven-
`tion to provide a new design of output circuitry for
`
`

`

`3
`switching pixel data from a frame buffer to an output
`display device which output circuitry is reduced in size
`and more capable in operation than prior art arrange-
`ments.
`-
`
`These and other objects of the present invention are
`realized in a frame buffer comprising a plurality of array
`planes of memory cells, row decoding circuitry for
`selecting rows of memory cells in each of the array
`planes to be accessed. column decoding circuitry for
`selecting columns of memory cells in each of the array
`planes to be accessed, a plurality of bitlines associated
`with the columns of memory cells of each array plane.
`each of the hitlines connecting to a column of memory
`cells and including a bitline sensing amplifier and a
`column select switch for providing access to the mem-
`ory cells of that column of the array plane, a plurality of
`output sense amplifiers adapted to be connected to a
`selected number of bitlines in an array plane by closing
`of particular ones of the column select switches in the
`bitlines, a first means for providing output signals from
`the plurality of output sense amplifiers associated with
`each array plane to a data bus, and a second means for
`providing output signals from the plurality of output
`sense amplifiers associated with each array plane to a
`shift register.
`These and other objects and features of the invention
`will be better understood by reference to the detailed
`description which follows taken together with the
`drawings in which like elements are referred to by like
`designations throughout the several views.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIG. 1 is a block diagram illustrating a computer
`system which may include the present invention.
`FIG. 2 is a block diagram illustrating a frame buffer
`designed in accordance with the prior art.
`FIG. 3 is a block diagram illustrating another frame
`buffer designed in accordance with the prior art.
`FIG. 4 is a block diagram illustrating an arrangement
`in accordance with the present invention.
`FIG. 5 is a circuit diagram sh0wing a preferred em-
`bodiment of the present invention.
`NOTATION AND NOMENCLATURE
`
`Some portions of the detailed descriptions which
`follow are presented in terms of symbolic representa-
`tions of operations on data bits within a computer mem-
`ory. These descriptions and representations are the
`means used by those skilled in the data processing arts
`to most effectively coavey the substance of their work
`to others skilled in the art. The operations are those
`requiring physical manipulations of physical quantities.
`Usually, though not necessarily, these quantities take
`the form of electrical or magnetic signals capable of
`being stored,
`transferred, combined, compared, and
`otherwise manipulated. It has proven convenient at
`times, principally for reasons of common usage, to refer
`to these signals as bits, values, elements, symbols, char-
`acters, terms, numbers. or the like. It should be borne in
`mind, however, that all of these and similar terms are to
`be associated with the appropriate physical quantities
`and are merely convenient labels applied to these quan-
`tities.
`Further, the manipulations performed are often re-
`ferred to in terms, such as adding or comparing. which
`are c0mmonly associated with mental operations per-
`formed by a human operator. No such capability of a
`human operator is necessary or desirable in most cases
`Page 8 of 14
`Page 8 of 14
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`5,442,748
`
`4
`in any of the operations described herein which form
`part of the present invention;
`the operations are ma~
`chine operations. Useful machines for performing the
`operations of the present invention include general pur-
`pose digital computers or other similar devices. In all
`cases the distinction between the method operations in
`operating a computer and the method of computation
`itself should be borne in mind. The present invention
`relates to a method and apparatus for operating a com~
`puter in processing electrical or other [e.g. mechanical,
`chemical) physical signals to generate other desired
`physical signals.
`DETAILED DESCRIPTION OF THE
`INVENTION
`
`Referring now to FIG. I, there is illustrated 3 mm-
`puter system 10. The system 10 includes a central pro—
`cessor 11 which carries out the various instructions
`provided to the computer 10 for its operations. The
`central processor 11 is joined to a bus 12 adapted to
`carry information to various components of the system
`10. Also connected to the bus 12 is main memory 13
`which is typically constructed of dynamic random ac—
`cess memory arranged in a manner well known to those
`skilled in the prior art to store information being used
`by the central processor during the period in which
`power is provided to the system 10. A read only mem-
`ory 14 which may include various memory devices
`(such as electrically programmable read only memory
`devices (EPROND) well known to those skilled in the
`art which are adapted to retain a memory conditiou in
`the absence of power to the system 10. The read only
`memory 14 typically stores various basic functions used
`by the processor 11 such as basic input/output and
`startup processes.
`Also connected to the bus 12 are various peripheral
`components such as long term memory 16. The con
`struction and operation of long term memory 16 (typi—
`cally an electro-mechanical hard disk drive) are well
`known to those skilled in the art. Also coupled to the
`bus 12 is circuitry such as a frame buffer 17 to which
`data may be written which is to be transferred to an
`output device such as a monitor 18 for display. For the
`purposes of the present explanation, the frame buffer 17
`may be considered to include in addition to various
`memory planes necessary to store information, various
`circuitry well known to those skilled in the art such as
`addressing circuitry, sensing amplifiers, color lookup
`tables (where color indexing is utilized), digital-to-
`analog converter circuitry, and circuitry for controlling
`the scan of information to the output display. In addi-
`tion, the frame buffer 17 may be connected to the bus 12
`through circuitry such as graphic accelerating circait 15
`used for providing fast rendering of graphical data to be
`furnished to the frame buffer 17.
`FIG. 2 illustrates a frame buffer 17 constructed in
`accordance with the-prior art. Typically, such a frame
`buffer 17 includes a dynamic random access memory
`array 20 designed to store information defining pixels
`on the output display. Such an array 20 may be designed
`to provide two ports so that information may be read
`from the array during a period in which information is
`being written to the array. An array 20 so coustructed is
`referred to as video random access memory or VRAM.
`Typically, pixel data is transferred to the array 20 in
`a binary pattern. In a typical computer system having a
`thirty-two bit data bus portion of the bus 12, thirty~two
`bits of information may be written to the frame buffer
`
`

`

`5
`memory and appear at thirty-two input pins. This data
`may define one or more pixels depending upon the
`number of bits required to define a pixel in the particular
`mode of operation. This pixel data is transferred to
`memory addresses within the array 20 from which it
`may later be retrieved for display. The positions to
`which the pixel data is transferred within the array are
`designated by addresses transferred to the array on an
`address bus.
`Typically, the pixel data is transferred to the frame
`buffer on the data bus portion of the bus 12, and the
`address for that data is transferred on the address bus
`portion of the bus 12. The address includes a row ad-
`dress portion and a column address portion. These por-
`tions of the address are decoded by row and column
`address decoding circuits 22 and 23, respectively. The
`selected row and column identify a specific memory
`cell so that a bit of data may be written to that selected
`position. If data defining an individual pixel is more than
`one bit (four, eight, sixteen, or thirty-two bits of color
`data), then the address typically identifies a plurality of
`positions within the array 20 (often in individual planes
`of the array) in which the bits defining one or more
`pixels are to be stored. Data stored in the frame buffer
`17 may be read from the array 20 On the data bus by
`addressing the appropriate pixel position using the row
`and column addresses of the memory cells in the array
`and providing a read command. Such data may then be
`utilized within the computer system of which the frame
`buffer 17 is a part in accordance with instructions sent
`by, for example, a central processing unit. As may be
`seen, both writing to and reading from the frame buffer
`1'." require that the memory positions of the array he
`addressed.
`Although data may be read from the array on the
`data bus, it is typical that the largest amount of informa-
`tion transferred from the array is pixel data transferred
`to an output display device such as the device 18 illus-
`trated in FIG. 1. And although information being writ-
`ten to the array 20 of the frame buffer 17 tends to
`change in a somewhat varied manner because of the
`way data is fiJrnished to a computer, data is typically
`being constantly transferred from the array 20 of the
`frame buffer 17 to the display in an orderly, row by row
`fashion. In order to allow pixel data to be written to the
`array while information is constantly being written to
`the output display device, a second output port apart
`from the system bus is used. This second output port
`includes a large shift register 25 having an individual
`shift register stage associated with each column of the
`array. Thus, a typical shift register 25 for transferring
`data to the dismay holds one entire row of bits of pixel
`data for each plane of the array 20. To load the shift
`register 25, an address designating a row is transferred
`to the frame buffer on the address bus and decoded. All
`of the memory cells in the row of the array addressed
`are read and written in parallel into the shift register 25
`through the bitline sense amplifiers. This data is then
`shifted sequentially, pixel by pixel, out of the shift regis-
`ter 25 to the display. Then a next row address in se-
`quence is received on the address bus from the unit
`controlling the transfer of the pixel data to the display.
`The pixel data in this next addressed row is read and
`written to the shift register 25 for transfer to the output
`di5play. This operation continues as long as information
`is being displayed. As will be understood, since the pixel
`data being transferred to the output display has been
`transferred from the frame buffer to the shift register in
`Page 9 of 14
`Page 9 of 14
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`45
`
`SD
`
`55
`
`65
`
`5,442,748
`
`6
`a single access, the operations of the frame buffer may
`be accelerated since new information may be written to
`the frame buffer while pixel data is being sequentially
`transferred from the shift register to the display. This
`also frees the data buses for purposes other than trans-
`ferring the pixel data to the output diSplay device 18.
`FIG. 2 illustrates one well known prior art arrange-
`ment for providing individual ports for the data bus and
`for the output shift register. In the arrangement illus-
`trated, each plane of the array 20 is divided into two
`individual halves. Similarly, the column address decod-
`ing circuitry is divided into two halves which are physi-
`cally arranged outside of the memory cell portion of the
`array itself in each plane of the array. Each of the halves
`of the column decoding circuitry 23 includes bitline
`sensing amplifiers and switching circuitry for selecting
`the particular addressed columns in each Operation
`practiced with respect to the array.
`A series of column decoding switches 27 is positioned
`between the two halves of each plane of the array 20.
`The switches 27 provide the circuitry necessary to de-
`code the addresses of the columns of the array which
`are to be transferred to the output shift register 25 for
`transfer to the output display device. In known embodi~
`merits, the circuitry 2'! is adapted to switch pixel data -
`from upper and lower halves of each of the two halves
`of the array 20. This arrangement is utilized in order to
`reduce the power required to read out the memory cells
`and to reduce the size of the circuitry 27. In order to
`accomplish this, a signal is provided to designate each
`of the four areas of the plane of the array from which
`data is being read. Thus one signal reads the upper left
`half of the plane, another reads the lower left half, a
`third reads the upper right half, while a fourth reads the
`lower right half.
`.
`Because each of the two halves of the column decode
`circuits 23 and the circuit 27 are directly adjacent to the
`array halves, it is necessary to provide redundant output
`circuitry for each of these sets of circuits in order to be
`able to build such circuits economically. Such redun-
`dant circuits 28 and 29 are illustrated in FIG. 2 to the
`right of the other circuitry of the frame buffer 17. In the
`case of the column decode circuitry, this redundant
`circuin includes the column address decoding cir-
`cuitry, the switches for selecting the columns, and the
`bitline sense amplifiers. The circuitry 27 for transferring
`pixel data to the shift register 25 includes decoding
`circuitry for selecting the proper portion of the row of
`the array to transfer to the shift register 25 and the
`actual switches for accomplishing this operation.
`It will be understood by those skilled in the art that
`the redundant circuitry 28 and 29 for both the column
`decode circuitry 23 and the circuitry 27 and the large
`shift register 25 require very substantial areas of the
`frame buffer. These areas are expensive to manufacture
`and large in size. The areas are often so large that the
`completed circuitry will not easily fit within the re-
`stricted areas available in desktop and portable comput-
`ers. Typical circuitry used to provide the necessary
`redundancy occupies approximately four percent of the
`total die space used for the frame buffer.
`FIG. 3 is a block diagram of another frame buffer 37
`designed in accordance with the teachings of the prior
`art. In the frame buffer 37 illustrated, the array 40 is
`divided into two halves in each plane as with the ar-
`rangement illustrated in FIG. 2. However. the column
`decode circuitry 43 and its assOciated bitline sense am-
`plifiers, decoding circuits, and switches activated by the
`
`

`

`7
`decoding circuitry are placed between the two halves
`4!] of the array. Since the center of the array is filled, the
`circuitry 47 for transferring pixel data to a shift register
`45 is divided into two halves and placed outside the
`memory cells of the array 40. Again, the arrangement of
`FIG. 3 requires that redundant circuitry be pr0vided for
`each of the column decode circuitry 43 and the shift
`register decoding circuitry 47. Typically, the amount of
`redundant circuitry is the same as the redundant cir-
`cuitry needed for the arrangement of FIG. 2.
`The present invention provides a new arrangement
`for transferring pixel data from a frame buffer to an
`output shift register.
`Referring now to FIG. 4, there is illustrated a block
`diagram showing an architectural arrangement of a
`frame buffer 50 designed in accordance with the present
`invention. The frame buffer 50 includes first and second
`halves 51 of two planes of a memory array. Each of the
`halves 51 of each of the planes of the memory array 50
`is accessed by means of addresses furnished on an ad-
`dress bus to a row decode circuit 52 and to a column
`decode circuit 53. The column decode circuit 53 fur-
`nishes signals to select particular columns to be ac—
`cessed through the operation of column select gates and
`bitline sense amplifiers located in an area 55 centrally
`arranged between the two halves 51 of the array. The
`bitlines run from the area 55 separating the two halves
`51 of the array to a plurality of column sense amplifiers
`57. The figure includes a pair of groups of such column
`Sense amplifiers arranged to sense the output of two
`individual planes of the array which are illustrated.
`From the output of the sense amplifiers, the data may be
`transferred to an output shift register 58 or to the data
`bus.
`The output arrangement utilized by the frame buffer
`5|] to transfer pixel data from the memory array to the
`shift register 58 is thus the same circuitry used to trans-
`fer pixel data from the array to the data bus. Because the
`circuitry included in the area 55 provides output signals
`to both the shift register 58 and to the data bus, it is
`necessary to provide only a single set of redundancy
`circuits to correct imperfections in the manufacture of
`the array circuitry. This set of circuits 60 is illustrated to
`the right of the frame buffer in the figure. Because of
`this reduction in redundancy circuitry, this architecture
`substantially reduces the area required by each plane of
`the frame buffer memory array and reduces the cost
`thereof. In a preferred embodiment, the redundancy
`circuitry requires only one-half the die area required by
`the similar circuitry of the prior art.
`In addition, this arrangement allows the stages of the
`shift register to be separated from the close association
`with the cells of the array at the output of the bitline
`sense amplifiers of each column because the shift regis-
`ter is placed at the output of the column sense amplifiers
`57. It will be recognized by those skilled in the art that
`placing the shift register 58 at the output of the column
`sense amplifiers 57 where data appears only after being
`selected by the column decode circuitry means that less
`than an entire row of pixel data is transferred to the shift
`register 58 in any access. This means that there need not
`be One shift register stage for each column of the array.
`Because of this, the shift register 58 illustrated in the
`FIG. 4 is Selected to provide only 64 bits of storage for
`each plane of the array, instead of the usual 512 bits of
`storage per plane. Thus, the die size required for the
`shift register is only one-eighth the size required by
`prior art shift registers. This also drasticwa reduces the
`Page 10 of 14
`Page 10 of14
`
`5
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`£30
`
`45
`
`50
`
`55
`
`65
`
`5,442,748
`
`8
`size of the array and decreases its cost while previding
`a shift register of sufficient size to process the pixel data
`at an appropriate rate for the output display. Because of
`its positidn at the output of the column sense amplifiers,
`the shift register 58 receives pixel data with the full
`amplification provided by the column sense amplifiers
`and need not be further amplified when furnished to the
`display output circuitry. For this reason, the delay due
`to the additional output amplification in prior art cir-
`cuits is eliminated.
`FIG. 5 is a circuit diagram showing a preferred em—
`bodiment of the invention. In FIG. 5, the various ele-
`ments of the circuitry necessary to accomplish the type
`of physical layout illustrated in FIG. 4 are shown. How-
`ever,
`the elements of FIG. 5 are not themselves ar-
`ranged as they might be arranged in a specific physical
`arrangement. For example, although each plane of the
`array is typically divided into two halves which are
`separately addressed, only a single array of memory
`element is shown in FIG. 5 for each plane since to in—
`clude both halves would make the circuitry very diff-
`cult to understand.
`
`FIG. 5 shows a frame buffer 61 with a plurality of
`array planes 62 each having memory cells 63 arranged
`in row and column fashion. Row decode circuitry 64-
`receives row addresses while column decode circuitry
`65 receives column addresses by which individual mem-
`ory cells in each plane of the array are accessed. As may
`be seen, the row and column decode circuitry are posi—
`tioned alongside the array planes 62. The column den
`code circuitry decodes column addresses and uses col-
`umn select switches 67 to select among the particular
`columns for each access-of the array. As may be seen, a
`series of plane select transmission gates 74 are used to
`select particular planes of the array to be accessed.
`Each Switch 67 is joined in a column to a bitline sense
`amplifier 73. The bitline sense amplifier 73 is used to
`refresh the memory cells 63 of a selected row of the
`array and to write new data to the memory cells of the
`array.
`Data is furnished to the cells of a selected row frorn a
`data bus Shown as a 32 bit bus in the figure. As the frame
`buffer is Optimized for eight bit color pixels, eight input
`conductors are shown connecting from a single one of
`the ecuductors of the data bus through eight write driv-
`ers 83 and eight write enable switches 81 to every
`eighth one of the bitlines of one plane of the array.
`Similar conductors, write drivers, and write enable
`Switches connect each of the other conductors of the
`data bus to the bitlines in the other planes of the array.
`Each of the bitline; in each plane may also be can-
`nected using the column select switches 6'? to eight
`column select output amplifiers 85. The output amplifi-
`ers 85 furnish signals which may be transferred through
`a gating arrangement 87 to an output shift register 90. In
`a preferred embodiment of the invention, the arrange-
`ment 87 includes a plurality of transmission gates de—
`signed to transfer data from particular columns to par—
`ticular positions in the shift register 90. Since only eight
`columns are transferred to the shift register at any ac-
`cess, the 64 bit positions of the shift register 90 are filled
`in a series of eight sequential accesses. Of course, this
`number would change with a different number of out-
`put amplifiers. A multiplexor 92 at the output of the
`shift register 90 allows the data in the shift register 90 to
`be transferred to the output diSplay on a bit by bit per
`plane (pixel by pixel per array) basis. The output ampli-
`fiers 85 furnish signals which may also be transferred
`
`

`

`9
`through a multiplexer

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket