PICTURE MEMORY MAPPING FOR MINIMIZING MEMORY BANDWIDTH IN COMPRESSION AND EXPANSION OF DATA SEQUENCE

PROBLEM TO BE SOLVED: To store and retrieve mass data which are required at the time of being sequentially accessed by storing each succeeding data of a stripe in a word in a memory having an adjacent word address after a word storing data of the preceding row. SOLUTION: A memory buffer 210 belongs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: OWEN JEFFERSON E, BALAKRISHNAN JEYENDRAN
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:PROBLEM TO BE SOLVED: To store and retrieve mass data which are required at the time of being sequentially accessed by storing each succeeding data of a stripe in a word in a memory having an adjacent word address after a word storing data of the preceding row. SOLUTION: A memory buffer 210 belongs to a memory of a device having a main decoder. A position in the memory is selected as a 1st word 208 and data in a 1st row of a 1st stripe 202 of a picture are stored in the word 208. Succeeding data in the 1st row one stored in the succeeding work 214. This is continuously executed about the entire stripe 202. One row of the stripe 202 is stored in a word just after a word storing a preceding row of the stripe 202. A 1st row of the succeeding stripe 204 is stored in a word 217 which is next to a word 215 storing data of the last row of the preceding stripe 202 and has a word address that is adjacent to it.