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

Device for converting a line scanning into a vertical saw tooth scanning through stripes

Assignee: STMicroelectronics SA
•
Filing: 1990-07-26
•
Granted: 1992-09-29
•
Expires: 2010-07-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A device for converting a horizontal scanning of successive lines of N data into a saw tooth scanning of stripes having a height of M lines. This device comprises a MN word memory wherein are sequentially written the first MN data, then wherein the following data are sequentially written while the existing data are read out at same successive addresses Ai,j. The value of i determines the sequence number of the data of the memory (0<i<MN-1), and the value of j determines a stripe number (1<j<n). An address generator supplies addresses Ai,j so that Ai+1,j=(Ai,j+xj) Modulo(MN-1), xj being a number such that xj+1=N.xj Modulo(MN-1) and xj=1.

Inventors

  • 👤 Alain Artieri

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 10:09
CPC Classifications
H; H04; H04N; H04N3/00; H04N3/10; H04N3/16; H04N3/30

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 139 words
A device for converting a horizontal scanning of successive lines of N data into a saw tooth scanning of stripes, each stripe having a height of M lines, said device comprising: M×N words of memory, wherein are sequentially written into the first MN horizontally scanned data then wherein following horizontally scanned data are sequentially written while stored data are read out at same successive addresses A i ,j to provide saw tooth scanning output data, where i is a sequence number of the data in the memory (0<i<MN-1) and j is a stripe number (1<j<n); and an address generator circuit for supplying said addresses A i ,j to said memory, wherein A i+1 ,j =(A i ,j +x j ) Modulo (MN-1), x j being a number such that x j+1 =N.x j Modulo (MN-1) and x 1 =1.
Claim 2
Independent Claim 139 words
A device for converting a horizontal scanning of successive lines of N data into a saw tooth scanning of stripes, each stripe having a height of M lines, said device comprising: M×N words of memory, wherein are sequentially written into the first MN horizontally scanned data then wherein following horizontally scanned data are sequentially written while stored data are read out at same successive addresses A i ,j to provide saw tooth scanning output data, where i is a sequence number of the data in the memory (0<i<MN-1) and j is a stripe number (1<j<n); and an address generator circuit for supplying said addresses A i ,j to said memory, wherein A i+1 ,j =(A i ,j +x j ) Modulo (MN-1), x j being a number such that x j+1 =N.x j Modulo (MN-1) and x 1 =1.
Claim 3
Dependent Claim 108 words
A device according to claim 1, wherein the address generator circuit comprises: a first register for the value x j ; a second register for an address value (A i ,j); an adder for adding the output of the first register and the output of the second register (x j +(A i ,j); means for transferring the lowest of the positive values (x j +(A i ,j) and (x j +(A i ,j) -(MN-1)) towards the second register; and means for transferring value (x j+1 ) into the first registor (x j ), at each stripe change, and clearing the content of the second register (A 0 ,j).
Claim 4
Dependent Claim 19 words
A device according to claim 2, wherein the address generator circuit includes means for prestoring values x j .
Claim 5
Dependent Claim 58 words
A device according to claim 2, wherein the address generator circuit includes means for supplying the values x j , said means for supplying comprising: a multiplier by a N receiving the value x j and supplying Nx j ; and a third register receiving the lowest of the positive values Nx j and Nx j Modulo (MN-1).

References Cited (Backward Citations)

US4451852A Cited
US4472732A Cited
DE3136029A1 Cited
US4991127A Cited
US4992960A Cited
US4985849A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag