← Back to Patent Explorer
US5170251A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for storing high definition video data for interlace or progressive access

Assignee: Sony Electronics Inc
•
Filing: 1991-05-16
•
Granted: 1992-12-08
•
Expires: 2011-05-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus in which data defining a high definition video frame are written into a memory in a manner so that the data can be linearly accessed from the memory in a selected (interlaced or progressive) format. In a preferred embodiment in which the data are written into a two megabyte memory in blocks of 128 pixels, with a 14-bit address for each block, the invention enables SMPTE-240M format high definition video data to be written into memory in a manner so that the data can be linearly accessed from memory in either an interlaced format or a progressive format. In an embodiment for storing (1920×1080)=2,073,600 pixels defining a high definition video frame, the apparatus of the invention includes a two megabyte memory and a thirty-two kilobyte PROM (or PAL) circuit. The thirty-two kilobyte circuit implements two look-up tables, each having a size of 16,384 bytes. In an interlace storage mode, the apparatus employs a first one of the look-up tables to assign interlaced format memory addresses to the pixel blocks being written into memory (so that the data can be linearly accessed from memory in interlaced format). In a progressive storage mode, the apparatus employs the other look-up table to assign "progressive format" memory addresses to the pixel blocks being written into memory (so that the data can be linearly accessed from memory in progressive format).

Inventors

  • 👤 Yoram Levy

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 14:26
CPC Classifications
H; H04; H04N; H04N7/00; H04N7/015; G; G11; G11C; G11C7/00; G11C7/10; G11C7/1015; G11C7/1018; G11C8/00; G11C8/04; H04N5/00; H04N5/76; H04N5/907; H04N7/01; H04N7/0117; H04N7/012

Claims Analysis

Total Claims: 25
Claim 1
Independent Claim 243 words
An apparatus for storing digital video data, wherein the data includes MX pixels, where M and X are integers, the apparatus including: a memory means having linearly accessible memory locations which map into a grid of MZ x Y locations, where Z and Y are integers; and a memory access means for writing the data into the memory means in blocks of M pixels, wherein the memory access means includes an address generation means for generating an address signal for each block of M pixels of the data, wherein the address generation means includes: a counter which generates a counter signal having most significant bits and least significant bits, including a means for supplying the least significant bits to the memory means; and a mode-specific address generation means for receiving the most significant bits of the counter signal, said mode-specific address generation means including: first look-up table means for generating a first address signal for said each block of M pixels from the most significant bits of the counter signal, and supplying the first address signal to the memory means; second look-up table means for generating a second address signal for said each block of M pixels from the most significant bits of the counter signal, and supplying the second address signal to the memory means; and mode-selection means for enabling a selected one of the first look-up table means and the second look-up table means in response to a mode selection signal.
Claim 2
Independent Claim 243 words
An apparatus for storing digital video data, wherein the data includes MX pixels, where M and X are integers, the apparatus including: a memory means having linearly accessible memory locations which map into a grid of MZ x Y locations, where Z and Y are integers; and a memory access means for writing the data into the memory means in blocks of M pixels, wherein the memory access means includes an address generation means for generating an address signal for each block of M pixels of the data, wherein the address generation means includes: a counter which generates a counter signal having most significant bits and least significant bits, including a means for supplying the least significant bits to the memory means; and a mode-specific address generation means for receiving the most significant bits of the counter signal, said mode-specific address generation means including: first look-up table means for generating a first address signal for said each block of M pixels from the most significant bits of the counter signal, and supplying the first address signal to the memory means; second look-up table means for generating a second address signal for said each block of M pixels from the most significant bits of the counter signal, and supplying the second address signal to the memory means; and mode-selection means for enabling a selected one of the first look-up table means and the second look-up table means in response to a mode selection signal.
Claim 3
Dependent Claim 14 words
The apparatus of claim 1, wherein the mode selection signal is a one-bit signal.
Claim 4
Dependent Claim 59 words
The apparatus of claim 1, wherein the memory means stores the data in an interlace format in response to the first address signal and the least significant bits of the counter signal, and the memory means stores the data in a progressive format in response to the second address signal and the least significant bits of the counter signal.
Claim 5
Dependent Claim 93 words
The apparatus of claim 1, wherein the memory access means also includes a read means for reading digital data from the memory means in blocks of M pixels, wherein the read means reads the digital data from the memory means in an interlace format in response to the first address signal and the least significant bits of the counter signal, and wherein the read means reads the digital data from the memory means in a progressive format in response to the second address signal and the least significant bits of the counter signal.
Claim 6
Dependent Claim 39 words
The apparatus of claim 1, wherein the least significant bits are a seven-parallel-bit stream, the most significant bits are a fourteen-parallel-bit stream, the first address signal is a fourteen-parallel-bit stream, and the second address signal is a fourteen-parallel-bit stream.
Claim 7
Dependent Claim 16 words
The apparatus of claim 1, wherein the digital video data represent a high definition video frame.
Claim 8
Dependent Claim 48 words
The apparatus of claim 1, also including: a second memory means having linearly accessible memory locations which map into said grid of MZ x Y locations, and wherein the memory access means includes means for writing the data into the second memory means in blocks of M pixels.
Claim 9
Dependent Claim 152 words
The apparatus of claim 7, wherein the counter includes means for supplying the least significant bits to the second memory means, and wherein the address generation means includes: a second mode-specific address generation means for receiving the most significant bits of the counter signal, said second mode-specific address generation means including: first look-up table means for generating a first address signal for said each block of M pixels from the most significant bits of the counter signal, and supplying the first address signal to the second memory means; second look-up table means for generating a second address signal for said each block of M pixels from the most significant bits of the counter signal, and supplying the second address signal to the second memory means; and mode-selection means for enabling a selected one of the first look-up table means and the second look-up table means in response to a mode selection signal.
Claim 10
Dependent Claim 20 words
The apparatus of claim 1, wherein MX is equal to 2,073,600, and wherein the memory means has 2,097,152 storage locations.
Claim 11
Dependent Claim 18 words
The apparatus of claim 1, wherein the digital video data are SMPTE-240M format high definition digital video data.
Claim 12
Dependent Claim 33 words
The apparatus of claim 5, wherein a single thirty-two kilobyte circuit includes the first look-up table means and the second look-up table means, and wherein the counter is a twenty-one bit counter circuit.
Claim 13
Independent Claim 181 words
A method for storing digital video data comprising MX pixels in a memory means having linearly accessible memory locations which map into a grid of MZ x Y locations, where M, X, Y, and Z are integers, including the steps of: (a) writing the data into the memory means in blocks of M pixels; (b) generating a counter signal having most significant bits and least significant bits; (c) supplying the least significant bits directly to the memory means; and (d) contemporaneously with step (a), generating an address signal for each block of M pixels of the data by converting the most significant bits to a first address signal for said each block of M pixels in a first look-up table means and supplying the first address signal to the memory means in response to a first mode selection signal, and converting the most significant bits to a second address signal for said each block of M pixels in a second look-up table means and supplying the second address signal to the memory means in response to a second mode selection signal.
Claim 14
Independent Claim 181 words
A method for storing digital video data comprising MX pixels in a memory means having linearly accessible memory locations which map into a grid of MZ x Y locations, where M, X, Y, and Z are integers, including the steps of: (a) writing the data into the memory means in blocks of M pixels; (b) generating a counter signal having most significant bits and least significant bits; (c) supplying the least significant bits directly to the memory means; and (d) contemporaneously with step (a), generating an address signal for each block of M pixels of the data by converting the most significant bits to a first address signal for said each block of M pixels in a first look-up table means and supplying the first address signal to the memory means in response to a first mode selection signal, and converting the most significant bits to a second address signal for said each block of M pixels in a second look-up table means and supplying the second address signal to the memory means in response to a second mode selection signal.
Claim 15
Dependent Claim 71 words
The method of claim 12, wherein during step (a), the data re written into the memory means in an interlace format in response to the first address signal and the least significant bits of the counter signal, and wherein during step (a), the data are written into the memory means in a progressive write mode in response to the second address signal and the least significant bits of the counter signal.
Claim 16
Dependent Claim 39 words
The method of claim 12, wherein the least significant bits are a seven-parallel-bit stream, the most significant bits are a fourteen-parallel-bit stream, the first address signal is a fourteen-parallel-bit stream, and the second address signal is a fourteen-parallel-bit stream.
Claim 17
Dependent Claim 19 words
The method of claim 12, wherein the digital video data represent a frame of a high definition video signal.
Claim 18
Dependent Claim 20 words
The method of claim 12, wherein MX is equal to 2,073,600, and wherein the memory means has 2,097,152 storage locations.
Claim 19
Independent Claim 181 words
A method for reading digital video data comprising MX pixels from a memory means having linearly accessible memory locations which map into a grid of MZ x Y locations, where M, X, Y, and Z are integers, including the steps of: (a) generating address signals, each representing a block of M pixels of the data, by generating a counter signal having most significant bits and least significant bits; supplying the least significant bits directly to the memory means; in response to a first mode selection signal, converting the most significant bits to a first address signal for said each block of M pixels in a first look-up table means, and supplying the first address signal to the memory means; and in response to a second mode selection signal, converting the most significant bits to a second address signal for said each block of M pixels in a second look-up table means, and supplying the second address signal to the memory means; and (b) in response to the address signals, reading the data from the memory means in blocks of M pixels.
Claim 20
Independent Claim 181 words
A method for reading digital video data comprising MX pixels from a memory means having linearly accessible memory locations which map into a grid of MZ x Y locations, where M, X, Y, and Z are integers, including the steps of: (a) generating address signals, each representing a block of M pixels of the data, by generating a counter signal having most significant bits and least significant bits; supplying the least significant bits directly to the memory means; in response to a first mode selection signal, converting the most significant bits to a first address signal for said each block of M pixels in a first look-up table means, and supplying the first address signal to the memory means; and in response to a second mode selection signal, converting the most significant bits to a second address signal for said each block of M pixels in a second look-up table means, and supplying the second address signal to the memory means; and (b) in response to the address signals, reading the data from the memory means in blocks of M pixels.
Claim 21
Dependent Claim 63 words
The method of claim 17, wherein the data is read from the memory means in an interlace format in response to the first address signals and the least significant bits of the counter signal, and the data is read from the memory means in a progressive format in response to the second address signals and the least significant bits of the counter signal.
Claim 22
Dependent Claim 39 words
The method of claim 17, wherein the least significant bits are a seven-parallel-bit stream, the most significant bits are a fourteen-parallel-bit stream, the first address signal is a fourteen-parallel-bit stream, and the second address signal is a fourteen-parallel-bit stream.
Claim 23
Dependent Claim 19 words
The method of claim 17, wherein the digital video data represent a frame of a high definition video signal.
Claim 24
Dependent Claim 20 words
The method of claim 17, wherein MX is equal to 2,073,600, and wherein the memory means has 2,097,152 storage locations.
Claim 25
Dependent Claim 18 words
The method of claim 12, wherein the digital video data are SMPTE-240M format high definition digital video data.

References Cited (Backward Citations)

US4368466A Cited
US4396938A Cited
US4617564A Cited
US4951042A Cited
US4956708A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-12-08 1996-06-08 1996-12-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-12-08 2000-06-08 2000-12-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-12-08 2004-06-08 2004-12-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag