CA2145365C - Method for accessing banks of dram - Google Patents
Method for accessing banks of dramInfo
- Publication number
- CA2145365C CA2145365C CA002145365A CA2145365A CA2145365C CA 2145365 C CA2145365 C CA 2145365C CA 002145365 A CA002145365 A CA 002145365A CA 2145365 A CA2145365 A CA 2145365A CA 2145365 C CA2145365 C CA 2145365C
- Authority
- CA
- Canada
- Prior art keywords
- cell
- data words
- cells
- words associated
- bank
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Classifications
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C7/00—Arrangements for writing information into, or reading information out from, a digital store
- G11C7/10—Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
- G11C7/1015—Read-write modes for single port memories, i.e. having either a random port or a serial port
- G11C7/1042—Read-write modes for single port memories, i.e. having either a random port or a serial port using interleaving techniques, i.e. read-write of one part of the memory while preparing another part
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0207—Addressing or allocation; Relocation with multidimensional access, e.g. row/column, matrix
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/04—Addressing variable-length words or parts of words
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0607—Interleaved addressing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/16—Handling requests for interconnection or transfer for access to memory bus
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/20—Handling requests for interconnection or transfer for access to input/output bus
- G06F13/28—Handling requests for interconnection or transfer for access to input/output bus using burst mode transfer, e.g. direct memory access DMA, cycle steal
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
- G11C11/21—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements
- G11C11/34—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices
- G11C11/40—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices using transistors
- G11C11/401—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices using transistors forming cells needing refreshing or charge regeneration, i.e. dynamic cells
- G11C11/4063—Auxiliary circuits, e.g. for addressing, decoding, driving, writing, sensing or timing
- G11C11/407—Auxiliary circuits, e.g. for addressing, decoding, driving, writing, sensing or timing for memory cells of the field-effect type
- G11C11/408—Address circuits
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
- G11C11/21—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements
- G11C11/34—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices
- G11C11/40—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices using transistors
- G11C11/401—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices using transistors forming cells needing refreshing or charge regeneration, i.e. dynamic cells
- G11C11/4063—Auxiliary circuits, e.g. for addressing, decoding, driving, writing, sensing or timing
- G11C11/407—Auxiliary circuits, e.g. for addressing, decoding, driving, writing, sensing or timing for memory cells of the field-effect type
- G11C11/409—Read-write [R-W] circuits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
- H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Computer Hardware Design (AREA)
- Mathematical Physics (AREA)
- Dram (AREA)
- Image Processing (AREA)
Abstract
This invention discloses a method for accessing Dynamic Random Access Memory (DRAM) to store and retrieve data words associated with a two dimensional image. The DRAM
includes two separate banks, a first bank and a second bank.
Each bank is capable of operating in page mode to read and write the data words. The two dimensional image is organized in a two dimensional grid pattern of cells, each cell containing an M by N matrix of pixels. The words associated with each cell occupy one page or less of a bank. Each cell is assigned a particular one of the two banks so that all data words associated with that particular cell are read from and written to one particular page of that particular bank. The assignment of banks to cells is done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column. There is then read the data words associated with a cell that is composed of a matrix of pixels and is not aligned with the two dimensional grid pattern, but is aligned with pixels in cells in the two dimensional grid pattern.
includes two separate banks, a first bank and a second bank.
Each bank is capable of operating in page mode to read and write the data words. The two dimensional image is organized in a two dimensional grid pattern of cells, each cell containing an M by N matrix of pixels. The words associated with each cell occupy one page or less of a bank. Each cell is assigned a particular one of the two banks so that all data words associated with that particular cell are read from and written to one particular page of that particular bank. The assignment of banks to cells is done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column. There is then read the data words associated with a cell that is composed of a matrix of pixels and is not aligned with the two dimensional grid pattern, but is aligned with pixels in cells in the two dimensional grid pattern.
Description
~ :~ 4 ~ 3 6 5 METHOD FOR ACCESSING BANKS OF DRAM
REFERENCE TO RELATED APPLICATIONS
Thls applicatlon ls related to Britlsh Patent Appllcatlon entltled "Method for Accesslng Banks of DRAM" as U.K. Serlal No. 9415391.3 flled on July 29, 1994 and Brltlsh Patent Appllcatlon entltled "Vldeo Decompresslon" as U.K.
Serlal No. 9405914.4 flled on March 24, 1994 and Brltlsh Patent Appllcatlon entltled "Method and Apparatus for Interfaclng wlth RAM" as U.K. Serlal No. 9503964.0 flled on February 28, 1995.
BACKGROUND
Thls lnventlon relates to Random Access Memory (RAM), and more partlcularly, to a method for accesslng dlfferent banks of dynamic RAM. One of the most popular types of RAM is Dynamic Random Access Memory (DRAM). Much attention has been paid to methods for accesslng (readlng from or wrltlng to) DRAMs. The maln concern ls speed of access. The dominant limitation on access speed is the need to precharge the RAM before starting an access.
Access speed is greatly increased by accessing more of the RAM using a single precharge, a technique called page mode addresslng. In page mode addresslng, a block of data words (two or more) has the same row address for each word.
Accesslng the block lnvolves charging only the column addresses of the data words in the block, not the fixed row address, thus saving on the need to precharge before continuing the access.
Refreshing and precharging in a timely and efficient ~a36~
manner is accomplished by interleaving blocks of data lnto two separate banks of DRAMs. In this manner, while one DRAM bank is being accessed, the other bank could be safely refreshed or precharged, thereby eliminating (or at least reduclng~ dead time. Ideally, data would be accessed from the one bank in blocks long enough that refreshing or precharging of the other bank could be finlshed. In practlce, however, thls does not always occur because RAM memory systems typlcally lack a provision for selecting which particular bank to refresh.
These two methods can be combined, as disclosed in U.S. Patent No. 5,274,788. This patent discloses a RAM memory system in which contiguous memory address locations are interleaved, on a single page basis, between two DRAM banks.
While the combined technique of '788 patent is generally adequate, it ls most effectlve when handllng access to a linear sequence of data blocks that are read out of DRAM
ln essentially the same order as they were written lnto the DRAM (e.g., cache memory systems). In some appllcations, however, data blocks are actually related to each other in two (or more) dimenslons (e.g., digital video). There is therefore a need for a memory system that interleaves between banks in a manner that takes into account the multi-dimensional relationship between the data blocks.
SUMMARY OF THE INVENTION
This invention discloses a method for accessing Dynamic Random Access Memory (DRAM) to store and retrieve data words associated with a two dimensional image. The DRAM
includes two separate banks, a first bank and a second bank.
3 6 ~
.._ Each bank is capable of operatlng ln page mode to read and wrlte the data words. The two dlmensional image is organlzed ln a two dimenslonal grld pattern of cells, each cell contalnlng an M by N matrlx of plxels. The words assoclated wlth each cell occupy one page or less of a bank. Each cell ls asslgned a partlcular one of the two banks so that all data words assoclated wlth that particular cell are read from and wrltten to one partlcular page of that partlcular bank. The asslgnment of banks to cells ls done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column. There is then read the data words associated with a cell that is composed of a matrix of pixels, and that is not aligned with the two dimenslonal grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.
In accordance with another aspect of the invention, the data words assoclated wlth the unaligned cell are read by flrst reading, from the flrst bank of DRAM, the data words associated with one of the cells in the grld pattern identified as contalning data words associated wlth the unaligned cell. Then there are read, from the second bank of DRAM, the data words associated wlth another of the cells ln the grld pattern contalnlng data words assoclated wlth the unaligned cell. Alternate readings between the first and second banks are continued until all the data words assoclated with the unaligned cell have been read.
In accordance with another aspect of the invention, the data words assoclated with the unaligned cell are read by ~ S 3 ~ 5 first reading, in a predetermlned order of cells, the data words assoclated with each cell ln the grld pattern contalnlng data words assoclated wlth the unallgned cell. The predetermlned order of cells ls chosen such that data words read from succeedlng cells are read from alternatlng banks.
In accordance wlth another aspect of the lnventlon, the predetermlned order ls a clockwlse rotatlon of cells ln the grid pattern ldentlfied as contalnlng data words associated with the unallgned cell. Alternately, the predetermlned order is a counter-clockwlse rotatlon of cells ln the grld pattern ldentlfled as contalnlng data words assoclated wlth the unallgned cell.
BRIEF DESCRIPTION OF THE DRAWINGS
Flgure 1 deplcts an lmage, dlsplayed on a televlslon or monltor screen, composed of cells that are allgned ln a rectangular grld, and one unallgned cell superimposed over the allgned cells.
Flgure 2 deplcts the arrangement of plxels wlthin each cell of Figure 1, each cell being an exemplary elght pixel by eight pixel block.
Flgure 3 depicts data words representing each plxel of Flgure 2.
Figure 4 deplcts the relatlonshlp between an unallgned cell and the plxels ln underlylng allgned cells.
Flgure 5 ls a plctorlal dlagram mapplng the cells of Flgures 1 or 4 onto the RAM banks of Flgure 6.
Flgure 6 ls a block dlagram of a RAM system havlng two banks of RAM and used to store data words of Flgure 3.
~14J~6~
Flgure 7 ls a pictorlal representatlon of a vldeo decoder that lncludes the RAM system of Flgure 6, and provldes dlgltal vldeo to the screen of Flgure 1.
Flgure 8 deplcts a cell of Flgures 1 or 4 belng further partltioned lnto subcells, and the relatlonshlp between subcells and the RAM banks of Flgure 6.
DETAILED DESCRIPTION OF THE ~K~ED EMBODIMENT
Referrlng now to Flgures 1, 2, and 7, Flgure 7 shows a vldeo monltor 2 havlng a dlsplay screen 6 sultable for dlsplaylng lmages 8 rendered from dlgltal vldeo 4. The source of dlgltal vldeo 4 ls vldeo decoder 5. Video decoder 5 lncludes sultable decodlng clrcuitry (not shown). Video decoder 5 decodes encoded vldeo g. Typlcal sources of encoded vldeo 9 lnclude CD or laser dlsc player 7, or cable televlslon hook-up 8.
In Flgure 1 there is shown a portion of a dlsplay screen 6, lncludlng lmage 8. Images such as lmage 8 are composed of plxels 14. Typlcally plxels 14 are grouped lnto cells 12. By grouplng plxels 14 lnto cells 12, the dlgltal vldeo 4 representlng lmage 8 (as well as the rest of dlsplay screen 6) can be manlpulated (e.g., compressed) more efflclently.
Whlle cells 12 could be arranged ln any repeatlng pattern, typlcally cells 12 are arranged ln the pattern of a rectlllnear grld 9. The pattern of grld 9 extends across dlsplay screen 6. Wlthln each cell 12, plxels 14 typlcally are arranged ln a square matrlx of N rows by N columns. For example, ln Flgure 2 cell 12 conslsts of elght row by elght ~ ~14~3Sj columns of pixels 14. Associated with each pixel 14 is an identifying posltion number 13 (from 0 to 63). Alternately, plxels 14 could be grouped in a non-square matrix (i.e., M
rows by N columns, where M does not equal N).
Referring now to Figures 1, 2, and 3, digital video 4 includes a number of data words 15. In the MPEG digital video standard, six data words 15 are required to represent each region of four pixels 14 One word 15 represents Cb, one word 15 represents Cr, and four words 15 represent Y
(luminance).
Referring now to Figures 1,3,6 and 7, video decoder 5 includes RAM system 30. RAM system 30 is the memory vldeo decoder 5 uses to store data words 15. Video decoder 5 reads words 15 from RAM system 30 in the course of creatlng, displaylng, and manipulating image 8 on screen 6. RAM system 30 includes interleaver 34 and two banks 32 of RAM, bankO 32-0 and bankl 32-1. Interleaver 34 connects banks 32 to the portion (not shown) of vldeo decoder 5 that ls used to create, display, and manipulate images 8. In banks 32, data words 15 are stored in pages 33, whlch are represented in flgure 6 as overlapplng rectangles. A typical size for a page 33 is 1024 elght blt words.
Referring now to Figures 1, 2 and 4, one requirement of vldeo decoder 5 ls the ablllty to read a cell 22 that ls not allgned to the exlstlng cell grid 9. Instead, cell 22 ls aligned to plxels 14 wlthln cells 12. This ablllty to read unaligned cells 22 is required for searching lmage 8 for features, or for detectlng motlon between successive lmages 8.
21~1~3v~
Referring now to Figures 1 and 4, in Figure 1 there is shown a cell 22-1 to be read from RAM system 30. Cell 22-l ls not aligned with grid 9, but ls aligned to the pixels 14 of cells 12. Cell 22-1 is shown in dotted lines, and can be seen to overlap four cells 12, 12-5, 12-6, 12-7, and 12-8.
In Figure 4 there is shown a more detailed representation of how unaligned read cell 22-1 overlaps underlying cells 12-5, 12-6, 12-7 and 12-8. The numbers 26 within cell 22-1 represent the numbers 13 of the pixels 14 at the boundary between cell 22-1 and each underlying cell 12.
Note that unaligned read cell 22-1 largely consists of pixels 14 drawn from a single underlying cell 12-5. The number of plxels 14 drawn from cells 12-6, 12-8, and 12-7 are seven, seven and one, respectively. Forty-nine pixels are drawn from cell 12-5.
In Figures 1 and 4, rectilinear grid 9 ls shown without showing how pages 33 containing the data words 15 representing each cell 12 are interleaved. Conceivably the respective pages 33 associated with all of the cells 12 underneath a partlcular unaligned read cell 22 could be in the same bank 32 of RAM system 30. If so, creating the unallgned read cell 22 would, in the worst case, lnvolve accessing four pages 33 from the same bank 32, a process that requires dead time to precharge that bank 32 three times. For all unallgned cells 22 on image 8, the worst case must appear Searching or matching do not specify where unaligned cell 22 ls, and hence can always be the worst case.
Much better than accesslng four pages 33 from the 21 4~3~
, same bank 32 is to access two pages 33 from each bank 3Z, a process that maximizes interleaving possibllities. The question now becomes how to deal with cases like the example of Figure 4, ln whlch most of the plxels 14 of the unallgned read cell 22-1 are drawn from a single underlylng cell 12-5, leavlng little time to precharge while performlng the relatively short reads needed to read data from the pages 33 associated with the other three underlying cells 12-6, 12-7 and 12-8. Another dlfflcult case has the unaligned read cell 22 overlying substantial portions of two cells 12, and insubstantial portions of another two cells 12.
In accordance with the inventlon, the problem of relatlvely short read times is reduced by lnterleaving in a partlcular two-dlmenslonal pattern 40 the pages 33 assoclated wlth cells 12.
Referring now to Flgures 5 and 6, ln Figure 5 half of the cells 12 are shown with hatchlng 39, and half of the cells 12 lack hatching 39. The presence of hatchlng 39 on a cell 12 signlfies that the page 33 associated wlth that particular cell 12 resldes ln bankO 32-0. The absence of hatchlng 39 on a cell 12 signlfies that the page 33 assoclated with that particular cell 12 resides in bankl 32-1. For example, cell 12-6 is shown hatched, so the page 33 assoclated with the data words 15 that describe cell 12-6 are stored in bankO 32-0, and so must be read from bankO 32-0.
In accordance with the inventlon, the problem of relatively short read tlmes ls reduced by havlng lnterleaver 34 lnterleave pages 33 lnto banks 32 based on a particular two dlmensional pattern 40 of cells 12 assoclated with pages 33.
As shown in Figure 5, pattern 40 resembles a checkerboard No two sequential cells 12 in the same row of grid 9 have their associated page 33 in the same bank 32, and no two sequential cells 12 in the same column of grid 9 have their associated page 33 in the same bank 32.
Checkerboard pattern 40 maximizes interleave posslbllltles by ensuring that when unaligned read cell 22 overlies four cells 12, the pages 33 of two of the overlaid cells 12 are stored in one bank 32, while the pages 33 assoclated wlth the other two overlald cells 12 are stored in the other bank 32. For example, in figure 5, cells 12-5 and 12-7 have thelr associated pages 33 stored in bankl 32-1, whlle cells 12-6 and 12-8 have their associated pages 33 stored ln bankO 32-0.
For maxlmum interleave efficlency, pages 33 should be read from alternate banks 32. Thls is ensured by reading from the four cells 12 underlying an unaligned read cell 22 ln elther a clockwlse order, or ln a counter-clockwlse order. As an example of the method of readlng in the clockwise direction, consider the four cells 12 underlylng cell 22-1 in Figure 5. First, the page 33 associated with cell 12-5 would be read from bankl 32-1 by interleaver 34. Then the page 33 associated with cell 12-6 would be read, since cell 12-6 is posltloned ln the same row as cell 12-5, and to the rlght of cell 12-5. Next the page 33 assoclated wlth cell 12-7 would be read, slnce cell 12-7 is ln the same column as cell 12-6, and below cell 12-6. Flnally the page 33 assoclated with cell g 21453~5 12-8 would be read, since cell 12-8 ls in the same row as cell 12-7, and to the left of cell 12-7.
Simulations have shown that the checkerboard pattern 40 of lnterleaving banks 32 reduces dead tlme. The aspect ratio and slze of checkerboard pattern 40 can be selected to be optlmum for the partlcular appllcatlon. The only requlrement ls that at least one cell 12 underlylng an unallgned read cell 22 is represented by less than one page 33 of words 15. In this manner, each of the four posslble reads of underlying cells 12 is self-contained, limiting the lnterleavlng to the mechanlsm descrlbed. Any further fragmentatlon would lnvolve a more complex lnterleavlng algorithm and would cause longer dead times.
Note that sometlmes each palr of posslble reads of underlylng cells 12 contalns words 15 ln the same page 33 (e.g., words 15 from cells 12-6 and 12-8 underlylng unallgned read cell 22-1 may be contalned on the same page 33).
Therefore the readlng of words 15 from pages 33 could be further optlmlzed. However, the worst case scenarlo remalns.
The method of the present lnventlon can also be applied, with out any loss in performance, to cells 12 having dimensions (M by N) that require more data words 15 than can be stored in a slngle page 33. Referrlng now to Flgures 6 and 8, such a cell 12 is divided by subgrld 52 into subcells 50, with the dlmenslons of subcells 50 chosen so that the number of words 15 assoclated with each subcell 50 can be stored in a single page 33. As shown in Figure 8, the same checkerboard pattern 40 can be applied to subcells 50 (e.g., subcells 50-1 21~5~
i._ and 50-3 stored in the same bank 32, and subcells 50-2 and 50-4 stored ln the same bank 32), allowing the accessing of words 15 associated with each "overslzed" cell 12 to be managed ln the same efflclent manner as cells 12 themselves are managed.
Whlle the lnvention has been described with reference to the structures and methods dlsclosed, lt ls not conflned to the speclflc detalls set forth, but ls lntended to cover such modlficatlons or changes as may come wlthln the scope of the followlng clalms.
REFERENCE TO RELATED APPLICATIONS
Thls applicatlon ls related to Britlsh Patent Appllcatlon entltled "Method for Accesslng Banks of DRAM" as U.K. Serlal No. 9415391.3 flled on July 29, 1994 and Brltlsh Patent Appllcatlon entltled "Vldeo Decompresslon" as U.K.
Serlal No. 9405914.4 flled on March 24, 1994 and Brltlsh Patent Appllcatlon entltled "Method and Apparatus for Interfaclng wlth RAM" as U.K. Serlal No. 9503964.0 flled on February 28, 1995.
BACKGROUND
Thls lnventlon relates to Random Access Memory (RAM), and more partlcularly, to a method for accesslng dlfferent banks of dynamic RAM. One of the most popular types of RAM is Dynamic Random Access Memory (DRAM). Much attention has been paid to methods for accesslng (readlng from or wrltlng to) DRAMs. The maln concern ls speed of access. The dominant limitation on access speed is the need to precharge the RAM before starting an access.
Access speed is greatly increased by accessing more of the RAM using a single precharge, a technique called page mode addresslng. In page mode addresslng, a block of data words (two or more) has the same row address for each word.
Accesslng the block lnvolves charging only the column addresses of the data words in the block, not the fixed row address, thus saving on the need to precharge before continuing the access.
Refreshing and precharging in a timely and efficient ~a36~
manner is accomplished by interleaving blocks of data lnto two separate banks of DRAMs. In this manner, while one DRAM bank is being accessed, the other bank could be safely refreshed or precharged, thereby eliminating (or at least reduclng~ dead time. Ideally, data would be accessed from the one bank in blocks long enough that refreshing or precharging of the other bank could be finlshed. In practlce, however, thls does not always occur because RAM memory systems typlcally lack a provision for selecting which particular bank to refresh.
These two methods can be combined, as disclosed in U.S. Patent No. 5,274,788. This patent discloses a RAM memory system in which contiguous memory address locations are interleaved, on a single page basis, between two DRAM banks.
While the combined technique of '788 patent is generally adequate, it ls most effectlve when handllng access to a linear sequence of data blocks that are read out of DRAM
ln essentially the same order as they were written lnto the DRAM (e.g., cache memory systems). In some appllcations, however, data blocks are actually related to each other in two (or more) dimenslons (e.g., digital video). There is therefore a need for a memory system that interleaves between banks in a manner that takes into account the multi-dimensional relationship between the data blocks.
SUMMARY OF THE INVENTION
This invention discloses a method for accessing Dynamic Random Access Memory (DRAM) to store and retrieve data words associated with a two dimensional image. The DRAM
includes two separate banks, a first bank and a second bank.
3 6 ~
.._ Each bank is capable of operatlng ln page mode to read and wrlte the data words. The two dlmensional image is organlzed ln a two dimenslonal grld pattern of cells, each cell contalnlng an M by N matrlx of plxels. The words assoclated wlth each cell occupy one page or less of a bank. Each cell ls asslgned a partlcular one of the two banks so that all data words assoclated wlth that particular cell are read from and wrltten to one partlcular page of that partlcular bank. The asslgnment of banks to cells ls done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column. There is then read the data words associated with a cell that is composed of a matrix of pixels, and that is not aligned with the two dimenslonal grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.
In accordance with another aspect of the invention, the data words assoclated wlth the unaligned cell are read by flrst reading, from the flrst bank of DRAM, the data words associated with one of the cells in the grld pattern identified as contalning data words associated wlth the unaligned cell. Then there are read, from the second bank of DRAM, the data words associated wlth another of the cells ln the grld pattern contalnlng data words assoclated wlth the unaligned cell. Alternate readings between the first and second banks are continued until all the data words assoclated with the unaligned cell have been read.
In accordance with another aspect of the invention, the data words assoclated with the unaligned cell are read by ~ S 3 ~ 5 first reading, in a predetermlned order of cells, the data words assoclated with each cell ln the grld pattern contalnlng data words assoclated wlth the unallgned cell. The predetermlned order of cells ls chosen such that data words read from succeedlng cells are read from alternatlng banks.
In accordance wlth another aspect of the lnventlon, the predetermlned order ls a clockwlse rotatlon of cells ln the grid pattern ldentlfied as contalnlng data words associated with the unallgned cell. Alternately, the predetermlned order is a counter-clockwlse rotatlon of cells ln the grld pattern ldentlfled as contalnlng data words assoclated wlth the unallgned cell.
BRIEF DESCRIPTION OF THE DRAWINGS
Flgure 1 deplcts an lmage, dlsplayed on a televlslon or monltor screen, composed of cells that are allgned ln a rectangular grld, and one unallgned cell superimposed over the allgned cells.
Flgure 2 deplcts the arrangement of plxels wlthin each cell of Figure 1, each cell being an exemplary elght pixel by eight pixel block.
Flgure 3 depicts data words representing each plxel of Flgure 2.
Figure 4 deplcts the relatlonshlp between an unallgned cell and the plxels ln underlylng allgned cells.
Flgure 5 ls a plctorlal dlagram mapplng the cells of Flgures 1 or 4 onto the RAM banks of Flgure 6.
Flgure 6 ls a block dlagram of a RAM system havlng two banks of RAM and used to store data words of Flgure 3.
~14J~6~
Flgure 7 ls a pictorlal representatlon of a vldeo decoder that lncludes the RAM system of Flgure 6, and provldes dlgltal vldeo to the screen of Flgure 1.
Flgure 8 deplcts a cell of Flgures 1 or 4 belng further partltioned lnto subcells, and the relatlonshlp between subcells and the RAM banks of Flgure 6.
DETAILED DESCRIPTION OF THE ~K~ED EMBODIMENT
Referrlng now to Flgures 1, 2, and 7, Flgure 7 shows a vldeo monltor 2 havlng a dlsplay screen 6 sultable for dlsplaylng lmages 8 rendered from dlgltal vldeo 4. The source of dlgltal vldeo 4 ls vldeo decoder 5. Video decoder 5 lncludes sultable decodlng clrcuitry (not shown). Video decoder 5 decodes encoded vldeo g. Typlcal sources of encoded vldeo 9 lnclude CD or laser dlsc player 7, or cable televlslon hook-up 8.
In Flgure 1 there is shown a portion of a dlsplay screen 6, lncludlng lmage 8. Images such as lmage 8 are composed of plxels 14. Typlcally plxels 14 are grouped lnto cells 12. By grouplng plxels 14 lnto cells 12, the dlgltal vldeo 4 representlng lmage 8 (as well as the rest of dlsplay screen 6) can be manlpulated (e.g., compressed) more efflclently.
Whlle cells 12 could be arranged ln any repeatlng pattern, typlcally cells 12 are arranged ln the pattern of a rectlllnear grld 9. The pattern of grld 9 extends across dlsplay screen 6. Wlthln each cell 12, plxels 14 typlcally are arranged ln a square matrlx of N rows by N columns. For example, ln Flgure 2 cell 12 conslsts of elght row by elght ~ ~14~3Sj columns of pixels 14. Associated with each pixel 14 is an identifying posltion number 13 (from 0 to 63). Alternately, plxels 14 could be grouped in a non-square matrix (i.e., M
rows by N columns, where M does not equal N).
Referring now to Figures 1, 2, and 3, digital video 4 includes a number of data words 15. In the MPEG digital video standard, six data words 15 are required to represent each region of four pixels 14 One word 15 represents Cb, one word 15 represents Cr, and four words 15 represent Y
(luminance).
Referring now to Figures 1,3,6 and 7, video decoder 5 includes RAM system 30. RAM system 30 is the memory vldeo decoder 5 uses to store data words 15. Video decoder 5 reads words 15 from RAM system 30 in the course of creatlng, displaylng, and manipulating image 8 on screen 6. RAM system 30 includes interleaver 34 and two banks 32 of RAM, bankO 32-0 and bankl 32-1. Interleaver 34 connects banks 32 to the portion (not shown) of vldeo decoder 5 that ls used to create, display, and manipulate images 8. In banks 32, data words 15 are stored in pages 33, whlch are represented in flgure 6 as overlapplng rectangles. A typical size for a page 33 is 1024 elght blt words.
Referring now to Figures 1, 2 and 4, one requirement of vldeo decoder 5 ls the ablllty to read a cell 22 that ls not allgned to the exlstlng cell grid 9. Instead, cell 22 ls aligned to plxels 14 wlthln cells 12. This ablllty to read unaligned cells 22 is required for searching lmage 8 for features, or for detectlng motlon between successive lmages 8.
21~1~3v~
Referring now to Figures 1 and 4, in Figure 1 there is shown a cell 22-1 to be read from RAM system 30. Cell 22-l ls not aligned with grid 9, but ls aligned to the pixels 14 of cells 12. Cell 22-1 is shown in dotted lines, and can be seen to overlap four cells 12, 12-5, 12-6, 12-7, and 12-8.
In Figure 4 there is shown a more detailed representation of how unaligned read cell 22-1 overlaps underlying cells 12-5, 12-6, 12-7 and 12-8. The numbers 26 within cell 22-1 represent the numbers 13 of the pixels 14 at the boundary between cell 22-1 and each underlying cell 12.
Note that unaligned read cell 22-1 largely consists of pixels 14 drawn from a single underlying cell 12-5. The number of plxels 14 drawn from cells 12-6, 12-8, and 12-7 are seven, seven and one, respectively. Forty-nine pixels are drawn from cell 12-5.
In Figures 1 and 4, rectilinear grid 9 ls shown without showing how pages 33 containing the data words 15 representing each cell 12 are interleaved. Conceivably the respective pages 33 associated with all of the cells 12 underneath a partlcular unaligned read cell 22 could be in the same bank 32 of RAM system 30. If so, creating the unallgned read cell 22 would, in the worst case, lnvolve accessing four pages 33 from the same bank 32, a process that requires dead time to precharge that bank 32 three times. For all unallgned cells 22 on image 8, the worst case must appear Searching or matching do not specify where unaligned cell 22 ls, and hence can always be the worst case.
Much better than accesslng four pages 33 from the 21 4~3~
, same bank 32 is to access two pages 33 from each bank 3Z, a process that maximizes interleaving possibllities. The question now becomes how to deal with cases like the example of Figure 4, ln whlch most of the plxels 14 of the unallgned read cell 22-1 are drawn from a single underlylng cell 12-5, leavlng little time to precharge while performlng the relatively short reads needed to read data from the pages 33 associated with the other three underlying cells 12-6, 12-7 and 12-8. Another dlfflcult case has the unaligned read cell 22 overlying substantial portions of two cells 12, and insubstantial portions of another two cells 12.
In accordance with the inventlon, the problem of relatlvely short read times is reduced by lnterleaving in a partlcular two-dlmenslonal pattern 40 the pages 33 assoclated wlth cells 12.
Referring now to Flgures 5 and 6, ln Figure 5 half of the cells 12 are shown with hatchlng 39, and half of the cells 12 lack hatching 39. The presence of hatchlng 39 on a cell 12 signlfies that the page 33 associated wlth that particular cell 12 resldes ln bankO 32-0. The absence of hatchlng 39 on a cell 12 signlfies that the page 33 assoclated with that particular cell 12 resides in bankl 32-1. For example, cell 12-6 is shown hatched, so the page 33 assoclated with the data words 15 that describe cell 12-6 are stored in bankO 32-0, and so must be read from bankO 32-0.
In accordance with the inventlon, the problem of relatively short read tlmes ls reduced by havlng lnterleaver 34 lnterleave pages 33 lnto banks 32 based on a particular two dlmensional pattern 40 of cells 12 assoclated with pages 33.
As shown in Figure 5, pattern 40 resembles a checkerboard No two sequential cells 12 in the same row of grid 9 have their associated page 33 in the same bank 32, and no two sequential cells 12 in the same column of grid 9 have their associated page 33 in the same bank 32.
Checkerboard pattern 40 maximizes interleave posslbllltles by ensuring that when unaligned read cell 22 overlies four cells 12, the pages 33 of two of the overlaid cells 12 are stored in one bank 32, while the pages 33 assoclated wlth the other two overlald cells 12 are stored in the other bank 32. For example, in figure 5, cells 12-5 and 12-7 have thelr associated pages 33 stored in bankl 32-1, whlle cells 12-6 and 12-8 have their associated pages 33 stored ln bankO 32-0.
For maxlmum interleave efficlency, pages 33 should be read from alternate banks 32. Thls is ensured by reading from the four cells 12 underlying an unaligned read cell 22 ln elther a clockwlse order, or ln a counter-clockwlse order. As an example of the method of readlng in the clockwise direction, consider the four cells 12 underlylng cell 22-1 in Figure 5. First, the page 33 associated with cell 12-5 would be read from bankl 32-1 by interleaver 34. Then the page 33 associated with cell 12-6 would be read, since cell 12-6 is posltloned ln the same row as cell 12-5, and to the rlght of cell 12-5. Next the page 33 assoclated wlth cell 12-7 would be read, slnce cell 12-7 is ln the same column as cell 12-6, and below cell 12-6. Flnally the page 33 assoclated with cell g 21453~5 12-8 would be read, since cell 12-8 ls in the same row as cell 12-7, and to the left of cell 12-7.
Simulations have shown that the checkerboard pattern 40 of lnterleaving banks 32 reduces dead tlme. The aspect ratio and slze of checkerboard pattern 40 can be selected to be optlmum for the partlcular appllcatlon. The only requlrement ls that at least one cell 12 underlylng an unallgned read cell 22 is represented by less than one page 33 of words 15. In this manner, each of the four posslble reads of underlying cells 12 is self-contained, limiting the lnterleavlng to the mechanlsm descrlbed. Any further fragmentatlon would lnvolve a more complex lnterleavlng algorithm and would cause longer dead times.
Note that sometlmes each palr of posslble reads of underlylng cells 12 contalns words 15 ln the same page 33 (e.g., words 15 from cells 12-6 and 12-8 underlylng unallgned read cell 22-1 may be contalned on the same page 33).
Therefore the readlng of words 15 from pages 33 could be further optlmlzed. However, the worst case scenarlo remalns.
The method of the present lnventlon can also be applied, with out any loss in performance, to cells 12 having dimensions (M by N) that require more data words 15 than can be stored in a slngle page 33. Referrlng now to Flgures 6 and 8, such a cell 12 is divided by subgrld 52 into subcells 50, with the dlmenslons of subcells 50 chosen so that the number of words 15 assoclated with each subcell 50 can be stored in a single page 33. As shown in Figure 8, the same checkerboard pattern 40 can be applied to subcells 50 (e.g., subcells 50-1 21~5~
i._ and 50-3 stored in the same bank 32, and subcells 50-2 and 50-4 stored ln the same bank 32), allowing the accessing of words 15 associated with each "overslzed" cell 12 to be managed ln the same efflclent manner as cells 12 themselves are managed.
Whlle the lnvention has been described with reference to the structures and methods dlsclosed, lt ls not conflned to the speclflc detalls set forth, but ls lntended to cover such modlficatlons or changes as may come wlthln the scope of the followlng clalms.
Claims (11)
1. A method for accessing Dynamic Random Access Memory (DRAM) to store and retrieve data words associated with a two dimensional image, the DRAM including two separate banks, each bank being capable of operating in page mode to read and write the data words, the two dimensional image being organized in a two dimensional grid pattern of cells, each cell containing an M by N matrix of pixels, and the words associated with each cell occupying one page or less of a bank, the method comprising the steps of:
(a) assigning each cell a particular one of the two banks so that all data words associated with that particular cell are read from and written to one particular page of that particular bank, the assignment of banks to cells being done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column;
(b) reading the data words associated with a cell that is composed of a matrix of pixels, and that is not aligned with the two dimensional grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.
(a) assigning each cell a particular one of the two banks so that all data words associated with that particular cell are read from and written to one particular page of that particular bank, the assignment of banks to cells being done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column;
(b) reading the data words associated with a cell that is composed of a matrix of pixels, and that is not aligned with the two dimensional grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.
2. The method of claim 1, wherein the DRAM includes a first and a second bank, and the step (b) of reading the data words associated with the unaligned cell includes the steps of:
(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;
(d) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(e) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(f) repeating steps (d) and (e) until all the data words associated with the unaligned cell have been read.
(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;
(d) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(e) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(f) repeating steps (d) and (e) until all the data words associated with the unaligned cell have been read.
3. A method for accessing Dynamic Random Access Memory (DRAM) to store and retrieve data words associated with a two dimensional image, the DRAM including two separate banks, each bank being capable of operating in page mode to read and write the data words, the two dimensional image being organized in a two dimensional grid pattern of cells, each cell containing an M by N matrix of pixels, and the words associated with each cell occupying one page or less of a bank, the method comprising the steps of (a) assigning each cell a particular one of the two banks so that all data words associated with that particular cell are read from and written to one particular page of that particular bank, the assignment of banks to cells being done such that each cell is associated with a different bank than any bordering cell which is also either in the same row or in the same column;
(b) reading the data words associated with a cell that is composed of an M by N matrix of pixels, and that is not aligned with the two dimensional grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.
(b) reading the data words associated with a cell that is composed of an M by N matrix of pixels, and that is not aligned with the two dimensional grid pattern, but that is aligned with pixels in cells in the two dimensional grid pattern.
4. The method of claim 3, wherein the DRAM includes a first and a second bank, and the step (b) of reading the data words associated with the unaligned cell includes the steps of:
(c) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern containing data words associated with the unaligned cell;
(d) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern containing data words associated with the unaligned cell;
(e) repeating steps (c) and (d) until all the data words associated with the unaligned cell have been read.
(c) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern containing data words associated with the unaligned cell;
(d) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern containing data words associated with the unaligned cell;
(e) repeating steps (c) and (d) until all the data words associated with the unaligned cell have been read.
5. The method of claim 3, wherein the DRAM includes a first and a second bank, and the step (b) of reading the data words associated with the unaligned cell includes the steps of:
(d) reading, in a predetermined order of cells, the data words associated with each cell in the grid pattern containing data words associated with the unaligned cell, the predetermined order of cells resulting in data words read from succeeding cells being read from alternating banks.
(d) reading, in a predetermined order of cells, the data words associated with each cell in the grid pattern containing data words associated with the unaligned cell, the predetermined order of cells resulting in data words read from succeeding cells being read from alternating banks.
6. The method of claim 5, wherein the predetermined order is a clockwise rotation of cells in the grid pattern containing data words associated with the unaligned cell.
7. The method of claim 5, wherein the predetermined order is a counter-clockwise rotation of cells in the grid pattern containing data words associated with the unaligned cell.
8. The method of claim 3, wherein the DRAM includes a first and a second bank, and the step (b) of reading the data words associated with the unaligned cell includes the steps of:
(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;
(d) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(e) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(f) repeating steps (d) and (e) until all the data words associated with the unaligned cell have been read.
(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;
(d) reading, from the first bank of DRAM, the data words associated with one of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(e) reading, from the second bank of DRAM, the data words associated with another of the cells in the grid pattern identified as containing data words associated with the unaligned cell;
(f) repeating steps (d) and (e) until all the data words associated with the unaligned cell have been read.
9. The method of claim 3, wherein the DRAM includes a first and a second bank, and the step (b) of reading the data words associated with the unaligned cell includes the steps of:
(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;
(d) reading, in a predetermined order of cells, the data words associated with each cell in the grid pattern identified as containing data words associated with the unaligned cell, the predetermined order of cells resulting in data words read from succeeding cells being read from alternating banks.
(c) identifying which cells in the two dimensional grid pattern contain data words associated with the unaligned cell;
(d) reading, in a predetermined order of cells, the data words associated with each cell in the grid pattern identified as containing data words associated with the unaligned cell, the predetermined order of cells resulting in data words read from succeeding cells being read from alternating banks.
10. The method of claim 9, wherein the predetermined order is a clockwise rotation of cells in the grid pattern identified as containing data words associated with the unaligned cell.
11. The method of claim 9, wherein the predetermined order is a counter-clockwise rotation of cells in the grid pattern identified as containing data words associated with the unaligned cell.
Applications Claiming Priority (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB9405914.4 | 1994-03-24 | ||
| GB9405914A GB9405914D0 (en) | 1994-03-24 | 1994-03-24 | Video decompression |
| GB9415391.3 | 1994-07-29 | ||
| GB9415391A GB9415391D0 (en) | 1994-07-29 | 1994-07-29 | Method for accessing banks of dram |
| GB9503964.0 | 1995-02-28 | ||
| GB9503964A GB2287808B (en) | 1994-03-24 | 1995-02-28 | Method and apparatus for interfacing with ram |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2145365A1 CA2145365A1 (en) | 1995-09-25 |
| CA2145365C true CA2145365C (en) | 1999-04-27 |
Family
ID=27267121
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002145365A Expired - Lifetime CA2145365C (en) | 1994-03-24 | 1995-03-23 | Method for accessing banks of dram |
Country Status (2)
| Country | Link |
|---|---|
| US (2) | US6018354A (en) |
| CA (1) | CA2145365C (en) |
Families Citing this family (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5355450A (en) | 1992-04-10 | 1994-10-11 | Avid Technology, Inc. | Media composer with adjustable source material compression |
| CA2145365C (en) * | 1994-03-24 | 1999-04-27 | Anthony M. Jones | Method for accessing banks of dram |
| US7379069B2 (en) * | 2001-02-15 | 2008-05-27 | Sony Corporation | Checkerboard buffer using two-dimensional buffer pages |
| US7088369B2 (en) * | 2001-02-15 | 2006-08-08 | Sony Corporation | Checkerboard buffer using two-dimensional buffer pages and using bit-field addressing |
| US7205993B2 (en) * | 2001-02-15 | 2007-04-17 | Sony Corporation | Checkerboard buffer using two-dimensional buffer pages and using memory bank alternation |
| US6765580B2 (en) * | 2001-02-15 | 2004-07-20 | Sony Corporation | Pixel pages optimized for GLV |
| US6803917B2 (en) * | 2001-02-15 | 2004-10-12 | Sony Corporation | Checkerboard buffer using memory bank alternation |
| US6828977B2 (en) * | 2001-02-15 | 2004-12-07 | Sony Corporation | Dynamic buffer pages |
| US6850241B2 (en) * | 2001-02-15 | 2005-02-01 | Sony Corporation | Swapped pixel pages |
| US6795079B2 (en) * | 2001-02-15 | 2004-09-21 | Sony Corporation | Two-dimensional buffer pages |
| US6992674B2 (en) * | 2001-02-15 | 2006-01-31 | Sony Corporation | Checkerboard buffer using two-dimensional buffer pages and using state addressing |
| US7038691B2 (en) * | 2001-02-15 | 2006-05-02 | Sony Corporation | Two-dimensional buffer pages using memory bank alternation |
| US20030058368A1 (en) * | 2001-09-24 | 2003-03-27 | Mark Champion | Image warping using pixel pages |
| EP2259583B1 (en) * | 2003-07-03 | 2012-05-30 | Panasonic Corporation | Reproduction apparatus, reproduction method, recording medium, recording apparatus and recording method. |
| KR100668302B1 (en) * | 2004-07-28 | 2007-01-12 | 삼성전자주식회사 | Memory mapping apparatus and method for video decoer/encoder |
| JP5147102B2 (en) * | 2005-05-30 | 2013-02-20 | 株式会社メガチップス | Memory access method |
| US20080301400A1 (en) * | 2005-12-01 | 2008-12-04 | Nxp B.V. | Method and Arrangement for Efficiently Accessing Matrix Elements in a Memory |
| TWI305479B (en) * | 2006-02-13 | 2009-01-11 | Advanced Semiconductor Eng | Method of fabricating substrate with embedded component therein |
| GB0807803D0 (en) * | 2008-04-29 | 2008-06-04 | Imagination Tech Ltd | An efficient apparatus for fast video edge filitering |
| US8566515B2 (en) * | 2009-01-12 | 2013-10-22 | Maxim Integrated Products, Inc. | Memory subsystem |
| US9478000B2 (en) * | 2013-09-27 | 2016-10-25 | Intel Corporation | Sharing non-page aligned memory |
| KR102336666B1 (en) | 2017-09-15 | 2021-12-07 | 삼성전자 주식회사 | Memory device and memory system comprising the same |
Family Cites Families (200)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0576749B1 (en) | 1992-06-30 | 1999-06-02 | Discovision Associates | Data pipeline system |
| US3893042A (en) * | 1973-12-12 | 1975-07-01 | Us Navy | Lock indicator for phase-locked loops |
| US3962685A (en) * | 1974-06-03 | 1976-06-08 | General Electric Company | Data processing system having pyramidal hierarchy control flow |
| GB1532275A (en) * | 1976-01-28 | 1978-11-15 | Nat Res Dev | Apparatus for controlling raster-scan displays |
| US4142205A (en) * | 1976-07-21 | 1979-02-27 | Nippon Electric Co., Ltd. | Interframe CODEC for composite color TV signals comprising means for inverting the polarity of carrier chrominance signals in every other frame or line |
| JPS53114617A (en) * | 1977-03-17 | 1978-10-06 | Toshiba Corp | Memory unit for picture processing |
| US4149242A (en) * | 1977-05-06 | 1979-04-10 | Bell Telephone Laboratories, Incorporated | Data interface apparatus for multiple sequential processors |
| US4135242A (en) * | 1977-11-07 | 1979-01-16 | Ncr Corporation | Method and processor having bit-addressable scratch pad memory |
| US4215369A (en) * | 1977-12-20 | 1980-07-29 | Nippon Electric Company, Ltd. | Digital transmission system for television video signals |
| US4196448A (en) * | 1978-05-15 | 1980-04-01 | The United States Of America As Represented By The Secretary Of The Navy | TV bandwidth reduction system using a hybrid discrete cosine DPCM |
| US4302775A (en) * | 1978-12-15 | 1981-11-24 | Compression Labs, Inc. | Digital video compression system and methods utilizing scene adaptive coding with rate buffer feedback |
| GB2039106B (en) | 1979-01-02 | 1983-03-23 | Honeywell Inf Systems | Number format conversion in computer |
| JPS6046585B2 (en) | 1979-03-06 | 1985-10-16 | 株式会社リコー | Serial data transmission method |
| JPS6010458B2 (en) * | 1979-08-23 | 1985-03-18 | 富士通株式会社 | Phase locked loop circuit |
| GB2059724B (en) | 1979-09-28 | 1984-04-04 | Racal Datacom Ltd | Data transmission systems |
| DE3015125A1 (en) * | 1980-04-19 | 1981-10-22 | Ibm Deutschland Gmbh, 7000 Stuttgart | DEVICE FOR STORING AND DISPLAYING GRAPHIC INFORMATION |
| US4334246A (en) * | 1980-05-16 | 1982-06-08 | Xerox Corporation | Data decompressor circuit |
| JPS6228086Y2 (en) * | 1980-12-08 | 1987-07-18 | ||
| DE3138897A1 (en) | 1981-09-30 | 1983-04-14 | Siemens AG, 1000 Berlin und 8000 München | CIRCUIT FOR THE PROCESSING OF STORAGE OPERANDS FOR DECIMAL AND LOGICAL COMMANDS |
| US4495629A (en) * | 1983-01-25 | 1985-01-22 | Storage Technology Partners | CMOS scannable latch |
| US4799677A (en) * | 1983-09-02 | 1989-01-24 | Bally Manufacturing Corporation | Video game having video disk read only memory |
| US4540903A (en) * | 1983-10-17 | 1985-09-10 | Storage Technology Partners | Scannable asynchronous/synchronous CMOS latch |
| US4598372A (en) * | 1983-12-28 | 1986-07-01 | Motorola, Inc. | Apparatus and method of smoothing MAPS compressed image data |
| US4689823A (en) * | 1984-01-04 | 1987-08-25 | Itek Corporation | Digital image frame processor |
| US4747070A (en) * | 1984-01-09 | 1988-05-24 | Wang Laboratories, Inc. | Reconfigurable memory system |
| US4630198A (en) * | 1984-02-21 | 1986-12-16 | Yuan Houng I | Intelligent stand-alone printfile buffer with paging control |
| FR2561011B1 (en) * | 1984-03-09 | 1986-09-12 | Cit Alcatel | PROCESSOR FOR CALCULATING A DISCRETE INVERSE COSINUS TRANSFORM |
| US4580066A (en) * | 1984-03-22 | 1986-04-01 | Sperry Corporation | Fast scan/set testable latch using two levels of series gating with two current sources |
| US4885786A (en) * | 1984-10-24 | 1989-12-05 | International Business Machines Corporation | Method for enlarging an image stored in run representation form |
| US4646151A (en) * | 1985-02-01 | 1987-02-24 | General Electric Company | Television frame synchronizer with independently controllable input/output rates |
| JPS61194989A (en) | 1985-02-22 | 1986-08-29 | Mitsubishi Electric Corp | Still picture transmitter |
| US4680581A (en) | 1985-03-28 | 1987-07-14 | Honeywell Inc. | Local area network special function frames |
| US5233420A (en) | 1985-04-10 | 1993-08-03 | The United States Of America As Represented By The Secretary Of The Navy | Solid state time base corrector (TBC) |
| DE3525898A1 (en) * | 1985-07-19 | 1987-01-29 | Reinhard Lidzba | METHOD FOR COMPRESSING AND DECOMPRESSING SEVERAL STRUCTURE-RELATED DATA SEQUENCES AND DEVICES FOR IMPLEMENTING THE METHOD |
| JPS62139081A (en) | 1985-12-13 | 1987-06-22 | Canon Inc | Formation of synthetic image |
| US4789927A (en) * | 1986-04-07 | 1988-12-06 | Silicon Graphics, Inc. | Interleaved pipeline parallel processing architecture |
| JP2500858B2 (en) * | 1986-04-11 | 1996-05-29 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Display system having extended raster operation circuit |
| FR2599872B1 (en) * | 1986-06-06 | 1988-07-29 | Thomson Csf | DEVICES FOR CALCULATING MONO-DIMENSIONAL COSINE TRANSFORMS, AND CODING DEVICE AND IMAGE DECODING DEVICE COMPRISING SUCH COMPUTING DEVICES |
| US4829465A (en) * | 1986-06-19 | 1989-05-09 | American Telephone And Telegraph Company, At&T Bell Laboratories | High speed cosine transform |
| GB8618060D0 (en) | 1986-07-24 | 1986-12-17 | Gec Avionics | Data processing apparatus |
| EP0255767A3 (en) | 1986-07-31 | 1990-04-04 | AT&T Corp. | Selective broadcasting arrangement for local area networks |
| US4887224A (en) * | 1986-08-28 | 1989-12-12 | Canon Kabushiki Kaisha | Image data processing apparatus capable of high-speed data encoding and/or decoding |
| JP2520404B2 (en) * | 1986-11-10 | 1996-07-31 | 日本電気株式会社 | Compression decoding device |
| NL8700843A (en) * | 1987-04-10 | 1988-11-01 | Philips Nv | TELEVISION TRANSFER SYSTEM WITH TRANSFORM CODING. |
| US4975595A (en) * | 1987-06-12 | 1990-12-04 | National Semiconductor Corporation | Scannable register/latch circuit |
| JPS6477391A (en) * | 1987-09-18 | 1989-03-23 | Victor Company Of Japan | System and device for predictive coding |
| EP0309669B1 (en) * | 1987-09-30 | 1992-12-30 | Siemens Aktiengesellschaft | Method for scenery model aided image data reduction for digital television signals |
| US5122873A (en) * | 1987-10-05 | 1992-06-16 | Intel Corporation | Method and apparatus for selectively encoding and decoding a digital motion video signal at multiple resolution levels |
| US4785349A (en) * | 1987-10-05 | 1988-11-15 | Technology Inc. 64 | Digital video decompression system |
| US4866637A (en) * | 1987-10-30 | 1989-09-12 | International Business Machines Corporation | Pipelined lighting model processing system for a graphics workstation's shading function |
| US5134697A (en) * | 1987-11-16 | 1992-07-28 | Prime Computer | Remote memory-mapped display with interactivity determination |
| US4823201A (en) * | 1987-11-16 | 1989-04-18 | Technology, Inc. 64 | Processor for expanding a compressed video signal |
| DE3782500T2 (en) | 1987-12-23 | 1993-05-06 | Ibm | SHARED STORAGE INTERFACE FOR DATA PROCESSING SYSTEM. |
| FR2625340B1 (en) * | 1987-12-23 | 1990-05-04 | Labo Electronique Physique | GRAPHIC SYSTEM WITH GRAPHIC CONTROLLER AND DRAM CONTROLLER |
| US4891784A (en) * | 1988-01-08 | 1990-01-02 | Hewlett-Packard Company | High capacity tape drive transparently writes and reads large packets of blocked data between interblock gaps |
| GB8805742D0 (en) * | 1988-03-10 | 1988-04-07 | Emi Plc Thorn | Bandwidth reduction system for television signals |
| US5724540A (en) * | 1988-03-28 | 1998-03-03 | Hitachi, Ltd. | Memory system having a column address counter and a page address counter |
| US5010401A (en) * | 1988-08-11 | 1991-04-23 | Mitsubishi Denki Kabushiki Kaisha | Picture coding and decoding apparatus using vector quantization |
| US4991110A (en) * | 1988-09-13 | 1991-02-05 | Silicon Graphics, Inc. | Graphics processor with staggered memory timing |
| US4866510A (en) * | 1988-09-30 | 1989-09-12 | American Telephone And Telegraph Company | Digital video encoder |
| US5148524A (en) * | 1988-11-29 | 1992-09-15 | Solbourne Computer, Inc. | Dynamic video RAM incorporating on chip vector/image mode line modification |
| US5091721A (en) * | 1988-12-22 | 1992-02-25 | Hughes Aircraft Company | Acoustic display generator |
| SG126671A1 (en) * | 1989-02-10 | 2006-11-29 | Canon Kk | Apparatus for image reading or processing |
| US5060242A (en) * | 1989-02-24 | 1991-10-22 | General Electric Company | Non-destructive lossless image coder |
| JP2925157B2 (en) * | 1989-02-28 | 1999-07-28 | キヤノン株式会社 | Data storage device |
| JPH02280462A (en) * | 1989-04-20 | 1990-11-16 | Fuji Photo Film Co Ltd | Picture data compression method |
| AU612543B2 (en) * | 1989-05-11 | 1991-07-11 | Panasonic Corporation | Moving image signal encoding apparatus and decoding apparatus |
| US5172011A (en) * | 1989-06-30 | 1992-12-15 | Digital Equipment Corporation | Latch circuit and method with complementary clocking and level sensitive scan capability |
| US5233690A (en) | 1989-07-28 | 1993-08-03 | Texas Instruments Incorporated | Video graphics display memory swizzle logic and expansion circuit and method |
| US5151997A (en) * | 1989-08-10 | 1992-09-29 | Apple Computer, Inc. | Computer with adaptable video circuitry |
| US5257350A (en) | 1989-08-10 | 1993-10-26 | Apple Computer, Inc. | Computer with self configuring video circuitry |
| FR2651402B1 (en) | 1989-08-22 | 1991-10-25 | Europ Rech Electr Lab | FRAME FREQUENCY AND NUMBER OF LINES CONVERSION DEVICE FOR A HIGH DEFINITION TELEVISION RECEIVER. |
| US5299025A (en) | 1989-10-18 | 1994-03-29 | Ricoh Company, Ltd. | Method of coding two-dimensional data by fast cosine transform and method of decoding compressed data by inverse fast cosine transform |
| US5053985A (en) * | 1989-10-19 | 1991-10-01 | Zoran Corporation | Recycling dct/idct integrated circuit apparatus using a single multiplier/accumulator and a single random access memory |
| US5142380A (en) * | 1989-10-23 | 1992-08-25 | Ricoh Company, Ltd. | Image data processing apparatus |
| EP0428310A3 (en) * | 1989-11-06 | 1992-08-05 | Canon Kabushiki Kaisha | Image processing apparatus and image transmitting apparatus |
| US5057793A (en) * | 1989-11-13 | 1991-10-15 | Cowley Nicholas P | Frequency synthesizer PLL having digital and analog phase detectors |
| US5136695A (en) * | 1989-11-13 | 1992-08-04 | Reflection Technology, Inc. | Apparatus and method for updating a remote video display from a host computer |
| US5146326A (en) * | 1989-11-14 | 1992-09-08 | Fujitsu Limited | Coded picture information decoding apparatus having means for improving picture distortion |
| US5027212A (en) * | 1989-12-06 | 1991-06-25 | Videologic Limited | Computer based video/graphics display system |
| US5003204A (en) * | 1989-12-19 | 1991-03-26 | Bull Hn Information Systems Inc. | Edge triggered D-type flip-flop scan latch cell with recirculation capability |
| US5287470A (en) | 1989-12-28 | 1994-02-15 | Texas Instruments Incorporated | Apparatus and method for coupling a multi-lead output bus to interleaved memories, which are addressable in normal and block-write modes |
| JP2881886B2 (en) * | 1989-12-30 | 1999-04-12 | ソニー株式会社 | Video signal encoding method and apparatus therefor |
| US5221966A (en) * | 1990-01-17 | 1993-06-22 | Avesco Plc | Video signal production from cinefilm originated material |
| US5107345A (en) * | 1990-02-27 | 1992-04-21 | Qualcomm Incorporated | Adaptive block size image compression method and system |
| US5081450A (en) * | 1990-03-09 | 1992-01-14 | International Business Machines Corporation | Apparatus and method for compressing and expanding multibit digital pixel data |
| US5253078A (en) | 1990-03-14 | 1993-10-12 | C-Cube Microsystems, Inc. | System for compression and decompression of video data using discrete cosine transform and coding techniques |
| US5191548A (en) * | 1990-03-14 | 1993-03-02 | C-Cube Microsystems | System for compression and decompression of video data using discrete cosine transform and coding techniques |
| US5136371A (en) * | 1990-03-15 | 1992-08-04 | Thomson Consumer Electronics, Inc. | Digital image coding using random scanning |
| US5151875A (en) * | 1990-03-16 | 1992-09-29 | C-Cube Microsystems, Inc. | MOS array multiplier cell |
| FR2660138B1 (en) * | 1990-03-26 | 1992-06-12 | France Telecom Cnet | DEVICE FOR CODING / DECODING IMAGE SIGNALS. |
| DE69126565T2 (en) * | 1990-04-17 | 1998-01-02 | Matsushita Electric Ind Co Ltd | Procedure for the transmission of codes of variable length |
| US5201056A (en) * | 1990-05-02 | 1993-04-06 | Motorola, Inc. | RISC microprocessor architecture with multi-bit tag extended instructions for selectively attaching tag from either instruction or input data to arithmetic operation output |
| US5311309A (en) | 1990-06-01 | 1994-05-10 | Thomson Consumer Electronics, Inc. | Luminance processing system for compressing and expanding video data |
| US5179372A (en) * | 1990-06-19 | 1993-01-12 | International Business Machines Corporation | Video Random Access Memory serial port access |
| US5247612A (en) | 1990-06-29 | 1993-09-21 | Radius Inc. | Pixel display apparatus and method using a first-in, first-out buffer |
| FR2664779B1 (en) | 1990-07-13 | 1993-06-11 | Europ Rech Electr Lab | PROCESS FOR PROCESSING A VIDEO SIGNAL. |
| IL98700A (en) | 1990-07-13 | 1994-04-12 | Minnesota Mining & Mfg | Apparatus and method for assembling a composite image from a plurality of data types |
| KR100214435B1 (en) | 1990-07-25 | 1999-08-02 | 사와무라 시코 | Synchronous burst-access memory |
| US5174641A (en) * | 1990-07-25 | 1992-12-29 | Massachusetts Institute Of Technology | Video encoding method for television applications |
| US5202847A (en) * | 1990-07-31 | 1993-04-13 | Inmos Limited | Digital signal processing |
| US5241658A (en) | 1990-08-21 | 1993-08-31 | Apple Computer, Inc. | Apparatus for storing information in and deriving information from a frame buffer |
| US5189526A (en) * | 1990-09-21 | 1993-02-23 | Eastman Kodak Company | Method and apparatus for performing image compression using discrete cosine transform |
| US5297271A (en) | 1990-09-21 | 1994-03-22 | Chips And Technologies, Inc. | Method and apparatus for performing a read-write-modify operation in a VGA compatible controller |
| US5038209A (en) * | 1990-09-27 | 1991-08-06 | At&T Bell Laboratories | Adaptive buffer/quantizer control for transform video coders |
| JPH04142812A (en) | 1990-10-04 | 1992-05-15 | Toshiba Corp | Phase locked loop circuit |
| US5130568A (en) * | 1990-11-05 | 1992-07-14 | Vertex Semiconductor Corporation | Scannable latch system and method |
| US5229863A (en) * | 1990-12-24 | 1993-07-20 | Xerox Corporation | High speed CCITT decompressor |
| JPH04242860A (en) | 1990-12-28 | 1992-08-31 | Sony Corp | Arithmetic device |
| US5184124A (en) * | 1991-01-02 | 1993-02-02 | Next Computer, Inc. | Method and apparatus for compressing and storing pixels |
| GB2252002B (en) * | 1991-01-11 | 1995-01-04 | Sony Broadcast & Communication | Compression of video signals |
| JPH04236664A (en) | 1991-01-18 | 1992-08-25 | Sony Corp | Arithmetic circuit |
| US5231605A (en) | 1991-01-31 | 1993-07-27 | Micron Technology, Inc. | DRAM compressed data test mode with expected data |
| US5257213A (en) | 1991-02-20 | 1993-10-26 | Samsung Electronics Co., Ltd. | Method and circuit for two-dimensional discrete cosine transform |
| US5111292A (en) * | 1991-02-27 | 1992-05-05 | General Electric Company | Priority selection apparatus as for a video signal processor |
| US5122875A (en) * | 1991-02-27 | 1992-06-16 | General Electric Company | An HDTV compression system |
| US5168356A (en) * | 1991-02-27 | 1992-12-01 | General Electric Company | Apparatus for segmenting encoded video signal for transmission |
| US5870497A (en) | 1991-03-15 | 1999-02-09 | C-Cube Microsystems | Decoder for compressed video signals |
| JP2866754B2 (en) | 1991-03-27 | 1999-03-08 | 三菱電機株式会社 | Arithmetic processing unit |
| US5164819A (en) * | 1991-04-03 | 1992-11-17 | Music John D | Method and system for coding and compressing color video signals |
| US5287193A (en) | 1991-04-10 | 1994-02-15 | Industrial Technology Research Institute | Parallel processing architecture of run-length codes |
| US5457780A (en) | 1991-04-17 | 1995-10-10 | Shaw; Venson M. | System for producing a video-instruction set utilizing a real-time frame differential bit map and microblock subimages |
| US5182642A (en) * | 1991-04-19 | 1993-01-26 | General Dynamics Lands Systems Inc. | Apparatus and method for the compression and transmission of multiformat data |
| JP3109854B2 (en) | 1991-04-23 | 2000-11-20 | キヤノン株式会社 | Image coding method and apparatus |
| US5146325A (en) * | 1991-04-29 | 1992-09-08 | Rca Thomson Licensing Corporation | Video signal decompression apparatus for independently compressed even and odd field data |
| US5212549A (en) * | 1991-04-29 | 1993-05-18 | Rca Thomson Licensing Corporation | Error concealment apparatus for a compressed video signal processing system |
| US5185819A (en) * | 1991-04-29 | 1993-02-09 | General Electric Company | Video signal compression apparatus for independently compressing odd and even fields |
| US5263136A (en) | 1991-04-30 | 1993-11-16 | Optigraphics Corporation | System for managing tiled images using multiple resolutions |
| AU657510B2 (en) | 1991-05-24 | 1995-03-16 | Apple Inc. | Improved image encoding/decoding method and apparatus |
| EP0514663A3 (en) | 1991-05-24 | 1993-07-14 | International Business Machines Corporation | An apparatus and method for motion video encoding employing an adaptive quantizer |
| US5212742A (en) * | 1991-05-24 | 1993-05-18 | Apple Computer, Inc. | Method and apparatus for encoding/decoding image data |
| US5228098A (en) * | 1991-06-14 | 1993-07-13 | Tektronix, Inc. | Adaptive spatio-temporal compression/decompression of video image signals |
| GB2258781B (en) | 1991-08-13 | 1995-05-03 | Sony Broadcast & Communication | Data compression |
| US5321806A (en) | 1991-08-21 | 1994-06-14 | Digital Equipment Corporation | Method and apparatus for transmitting graphics command in a computer graphics system |
| US5319460A (en) | 1991-08-29 | 1994-06-07 | Canon Kabushiki Kaisha | Image signal processing device including frame memory |
| JP2507204B2 (en) | 1991-08-30 | 1996-06-12 | 松下電器産業株式会社 | Video signal encoder |
| US5168375A (en) * | 1991-09-18 | 1992-12-01 | Polaroid Corporation | Image reconstruction by use of discrete cosine and related transforms |
| GB2260053B (en) | 1991-09-27 | 1995-03-08 | Sony Broadcast & Communication | Image signal processing |
| US5261047A (en) | 1991-10-29 | 1993-11-09 | Xerox Corporation | Bus arbitration scheme for facilitating operation of a printing apparatus |
| US5231484A (en) * | 1991-11-08 | 1993-07-27 | International Business Machines Corporation | Motion video compression system with adaptive bit allocation and quantization |
| US5214507A (en) * | 1991-11-08 | 1993-05-25 | At&T Bell Laboratories | Video signal quantization for an mpeg like coding environment |
| US5257223A (en) | 1991-11-13 | 1993-10-26 | Hewlett-Packard Company | Flip-flop circuit with controllable copying between slave and scan latches |
| US5227878A (en) * | 1991-11-15 | 1993-07-13 | At&T Bell Laboratories | Adaptive coding and decoding of frames and fields of video |
| US5237413A (en) | 1991-11-19 | 1993-08-17 | Scientific-Atlanta, Inc. | Motion filter for digital television system |
| US5175617A (en) * | 1991-12-04 | 1992-12-29 | Vision Applications, Inc. | Telephone line picture transmission |
| US5307180A (en) | 1991-12-18 | 1994-04-26 | Xerox Corporation | Method and apparatus for controlling the processing of digital image signals |
| US5307449A (en) | 1991-12-20 | 1994-04-26 | Apple Computer, Inc. | Method and apparatus for simultaneously rendering multiple scanlines |
| US5517603A (en) | 1991-12-20 | 1996-05-14 | Apple Computer, Inc. | Scanline rendering device for generating pixel values for displaying three-dimensional graphical images |
| US5241222A (en) | 1991-12-20 | 1993-08-31 | Eastman Kodak Company | Dram interface adapter circuit |
| US5237432A (en) | 1991-12-23 | 1993-08-17 | Xerox Corporation | Image scaling apparatus |
| US5159449A (en) * | 1991-12-26 | 1992-10-27 | Workstation Technologies, Inc. | Method and apparatus for data reduction in a video image data reduction system |
| US5446866A (en) | 1992-01-30 | 1995-08-29 | Apple Computer, Inc. | Architecture for transferring pixel streams, without control information, in a plurality of formats utilizing addressable source and destination channels associated with the source and destination components |
| JP3323950B2 (en) | 1992-03-17 | 2002-09-09 | サン・マイクロシステムズ・インコーポレーテッド | Method of performing IDCT in a digital image processing system and IDCT processor therefor |
| US5293229A (en) | 1992-03-27 | 1994-03-08 | Matsushita Electric Corporation Of America | Apparatus and method for processing groups of fields in a video data compression system |
| US5253058A (en) | 1992-04-01 | 1993-10-12 | Bell Communications Research, Inc. | Efficient coding scheme for multilevel video transmission |
| US5265212A (en) | 1992-04-01 | 1993-11-23 | Digital Equipment Corporation | Sharing of bus access among multiple state machines with minimal wait time and prioritization of like cycle types |
| KR0160610B1 (en) | 1992-04-07 | 1999-01-15 | 강진구 | Method and device for variable length image compression and decompression |
| US5287420A (en) | 1992-04-08 | 1994-02-15 | Supermac Technology | Method for image compression on a personal computer |
| US5283646A (en) | 1992-04-09 | 1994-02-01 | Picturetel Corporation | Quantizer control method and apparatus |
| US5384745A (en) | 1992-04-27 | 1995-01-24 | Mitsubishi Denki Kabushiki Kaisha | Synchronous semiconductor memory device |
| GB2267194B (en) | 1992-05-13 | 1995-10-04 | Sony Broadcast & Communication | Apparatus and method for processing image data |
| US5241383A (en) | 1992-05-13 | 1993-08-31 | Bell Communications Research, Inc. | Pseudo-constant bit rate video coding with quantization parameter adjustment |
| US5305438A (en) | 1992-05-19 | 1994-04-19 | Sony Electronics Inc. | Video storage, processing, and distribution system using recording format independent hierarchical storages and processors |
| CA2096584A1 (en) | 1992-05-28 | 1993-11-29 | Frank H. Liao | Variable length code decoder for video decompression operations |
| US5289577A (en) | 1992-06-04 | 1994-02-22 | International Business Machines Incorporated | Process-pipeline architecture for image/video processing |
| US5276513A (en) | 1992-06-10 | 1994-01-04 | Rca Thomson Licensing Corporation | Implementation architecture for performing hierarchical motion analysis of video images in real time |
| JPH0695986A (en) | 1992-06-19 | 1994-04-08 | Westinghouse Electric Corp <We> | Real-time data imaging network system and operating method thereof |
| US5289276A (en) | 1992-06-19 | 1994-02-22 | General Electric Company | Method and apparatus for conveying compressed video data over a noisy communication channel |
| US5276681A (en) | 1992-06-25 | 1994-01-04 | Starlight Networks | Process for fair and prioritized access to limited output buffers in a multi-port switch |
| US5253055A (en) | 1992-07-02 | 1993-10-12 | At&T Bell Laboratories | Efficient frequency scalable video encoding with coefficient selection |
| US5287178A (en) | 1992-07-06 | 1994-02-15 | General Electric Company | Reset control network for a video signal encoder |
| US5325092A (en) | 1992-07-07 | 1994-06-28 | Ricoh Company, Ltd. | Huffman decoder architecture for high speed operation and reduced memory |
| US5231486A (en) * | 1992-07-27 | 1993-07-27 | General Electric Company | Data separation processing in a dual channel digital high definition television system |
| US5278647A (en) | 1992-08-05 | 1994-01-11 | At&T Bell Laboratories | Video decoder using adaptive macroblock leak signals |
| FR2695278B1 (en) | 1992-08-26 | 1994-10-14 | Euro Cp Sarl | Method for exchanging information, in particular between equipment in a room, and functional unit and installation relating thereto. |
| US5301019A (en) | 1992-09-17 | 1994-04-05 | Zenith Electronics Corp. | Data compression system having perceptually weighted motion vectors |
| US5351047A (en) | 1992-09-21 | 1994-09-27 | Laboratory Automation, Inc. | Data decoding method and apparatus |
| US5294894A (en) | 1992-10-02 | 1994-03-15 | Compaq Computer Corporation | Method of and apparatus for startup of a digital computer system clock |
| US5298992A (en) | 1992-10-08 | 1994-03-29 | International Business Machines Corporation | System and method for frame-differencing based video compression/decompression with forward and reverse playback capability |
| US5300949A (en) | 1992-10-22 | 1994-04-05 | International Business Machines Corporation | Scalable digital video decompressor |
| US5278520A (en) | 1992-10-26 | 1994-01-11 | Codex, Corp. | Phase lock detection in a phase lock loop |
| US5301272A (en) | 1992-11-25 | 1994-04-05 | Intel Corporation | Method and apparatus for address space aliasing to identify pixel types |
| JP3255308B2 (en) | 1992-12-18 | 2002-02-12 | ソニー株式会社 | Data playback device |
| JP3476231B2 (en) | 1993-01-29 | 2003-12-10 | 三菱電機エンジニアリング株式会社 | Synchronous semiconductor memory device and semiconductor memory device |
| US5298896A (en) | 1993-03-15 | 1994-03-29 | Bell Communications Research, Inc. | Method and system for high order conditional entropy coding |
| US5572691A (en) | 1993-04-21 | 1996-11-05 | Gi Corporation | Apparatus and method for providing multiple data streams from stored data using dual memory buffers |
| US5448310A (en) | 1993-04-27 | 1995-09-05 | Array Microsystems, Inc. | Motion estimation coprocessor |
| US5486876A (en) | 1993-04-27 | 1996-01-23 | Array Microsystems, Inc. | Video interface unit for mapping physical image data to logical tiles |
| EP0625858B1 (en) | 1993-05-19 | 1998-06-24 | Alcatel | Video server memory management method |
| US5304953A (en) | 1993-06-01 | 1994-04-19 | Motorola, Inc. | Lock recovery circuit for a phase locked loop |
| US5829007A (en) | 1993-06-24 | 1998-10-27 | Discovision Associates | Technique for implementing a swing buffer in a memory array |
| US5577203A (en) | 1993-07-29 | 1996-11-19 | Cirrus Logic, Inc. | Video processing methods |
| US5598514A (en) | 1993-08-09 | 1997-01-28 | C-Cube Microsystems | Structure and method for a multistandard video encoder/decoder |
| US5561777A (en) | 1993-08-30 | 1996-10-01 | Xerox Corporation | Process for sequentially reading a page from an image memory in either of two directions |
| US5568165A (en) | 1993-10-22 | 1996-10-22 | Auravision Corporation | Video processing technique using multi-buffer video memory |
| US5398072A (en) | 1993-10-25 | 1995-03-14 | Lsi Logic Corporation | Management of channel buffer in video decoders |
| US5446691A (en) * | 1994-03-15 | 1995-08-29 | Shablamm! Computer Inc. | Interleave technique for accessing digital memory |
| CA2145361C (en) | 1994-03-24 | 1999-09-07 | Martin William Sotheran | Buffer manager |
| CA2145365C (en) * | 1994-03-24 | 1999-04-27 | Anthony M. Jones | Method for accessing banks of dram |
| US5495291A (en) | 1994-07-22 | 1996-02-27 | Hewlett-Packard Company | Decompression system for compressed video data for providing uninterrupted decompressed video data output |
-
1995
- 1995-03-23 CA CA002145365A patent/CA2145365C/en not_active Expired - Lifetime
- 1995-06-07 US US08/474,231 patent/US6018354A/en not_active Expired - Lifetime
-
1999
- 1999-06-01 US US09/325,691 patent/US6297857B1/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| CA2145365A1 (en) | 1995-09-25 |
| US6018354A (en) | 2000-01-25 |
| US6297857B1 (en) | 2001-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2145365C (en) | Method for accessing banks of dram | |
| US6819326B2 (en) | Memory address translation for image processing | |
| KR100514704B1 (en) | Storage device and access method | |
| US6920536B2 (en) | Method of accessing matrix data with address translation circuit that enables quick serial access in row or column directions | |
| US6604166B1 (en) | Memory architecture for parallel data access along any given dimension of an n-dimensional rectangular data array | |
| US5585863A (en) | Memory organizing and addressing method for digital video images | |
| JP3278756B2 (en) | Image processing method and apparatus | |
| KR100249409B1 (en) | Signal processing system | |
| US5613018A (en) | Page buffer rotator | |
| US6560686B1 (en) | Memory device with variable bank partition architecture | |
| JPH01283676A (en) | Read-out processing system for window image data | |
| US5991186A (en) | Four-bit block write for a wide input/output random access memory in a data processing system | |
| JP3151788B2 (en) | How to rotate the original rectangle image | |
| JPS6158058A (en) | Semiconductor memory device | |
| JP3124852B2 (en) | Data transfer circuit and address array | |
| KR100297716B1 (en) | Semiconductor memory device having high flexibility in column | |
| GB2123998A (en) | Data memory arrangement | |
| JP3291070B2 (en) | Data transposition equipment | |
| JP2633251B2 (en) | Image memory device | |
| KR100266165B1 (en) | Method of accessig dram for processing error correction code | |
| JPH06324935A (en) | Address generator and address generation system | |
| JPH0233158B2 (en) | ||
| SU1336109A1 (en) | Storage unit with multiple-format data access | |
| JPH0415555B2 (en) | ||
| JPH0773100A (en) | Picture memory |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20150323 |