US4602283A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for spatially and temporally transposing data words arrayed in periodically recurring patterns
Assignee: Telecom Italia SpA
•
Filing: 1983-10-25
•
Granted: 1986-07-22
•
Expires: 2003-10-25
Abstract
Abstract A train of incoming data words, specifically digitized video samples arrayed in frames of Y lines of X pixels each which have already undergone a 2-dimensional spatial transformation, is scrambled by being divided into Z sequences (frames) whose data words are temporarily written in respective cells of Z 2 storage units of a memory of dynamic-RAM Type. The Z 2 storage units, each divided into Z sections, are read out in cyclic-succession--at a rate of one cell per unit--and each cell is reloaded immediately after being vacated. Reading and writing occurs for one set of Z sequences in a first addressing mode, conforming to the order of arrival of the data words in the incoming train, and for the next set in a second addressing mode involving the grouping of homologous data words of respective sequences into successive series of Z data words each. The two addressing modes alternate for consecutive sets and the outgoing train so formed can be subjected to a further transformation before being transmitted to a remote station for unscrambling.
Inventors
- 👤 Luigi Corgnier
- 👤 Benedetto Riolfo
- 👤 Mario Guglielmo
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 10:49
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0207; H; H04; H04N; H04N19/00; H04N19/60; H04N19/62; H04N19/649
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
315 words
A system for transforming an incoming train of data words into a modified outgoing train retransformable into a replica of said incoming train after intermediate storage, comprising: memory means with a multiplicity of storage units together having P·Z cells for accommodating a recurrent set of Z sequences of P data words of said incoming train; input means connected in parallel to respective writing terminals of said storage units for supplying said incoming train thereto; output means connected in parallel to respective reading terminals of said storage units for receiving said outgoing training therefrom; addressing means connected to said storage units for identifying same in cyclic succession and selecting a cell of a storage unit so identified for reading and writing; counting means for determining the end of a succession of P·Z data words in said incoming train; distributing means responsive to said counting means for controlling said addressing means to establish either of two modes of selecting the cells in which data words are to be read and written, said modes including a first mode conforming to the order of occurrence of said data words in said incoming train and a second mode according to which homologous data words of said Z sequences are grouped into P consecutive series of Z data words each; switchover means responsive to said counting means for modifying the operation of said distributing means after every succession of P·Z data words to change from one of said modes to the other; and timing means synchronizing the operation of said counting means with the delivery of incoming data words by said input means, said timing means controlling said memory means in synchronism with the operation of said distributing means for commanding a readout of data words from selected cells and an immediately following writing of new data words therein during intervals which are relatively staggered for said multiplicity of storage units.
Claim 2
Independent Claim
315 words
A system for transforming an incoming train of data words into a modified outgoing train retransformable into a replica of said incoming train after intermediate storage, comprising: memory means with a multiplicity of storage units together having P·Z cells for accommodating a recurrent set of Z sequences of P data words of said incoming train; input means connected in parallel to respective writing terminals of said storage units for supplying said incoming train thereto; output means connected in parallel to respective reading terminals of said storage units for receiving said outgoing training therefrom; addressing means connected to said storage units for identifying same in cyclic succession and selecting a cell of a storage unit so identified for reading and writing; counting means for determining the end of a succession of P·Z data words in said incoming train; distributing means responsive to said counting means for controlling said addressing means to establish either of two modes of selecting the cells in which data words are to be read and written, said modes including a first mode conforming to the order of occurrence of said data words in said incoming train and a second mode according to which homologous data words of said Z sequences are grouped into P consecutive series of Z data words each; switchover means responsive to said counting means for modifying the operation of said distributing means after every succession of P·Z data words to change from one of said modes to the other; and timing means synchronizing the operation of said counting means with the delivery of incoming data words by said input means, said timing means controlling said memory means in synchronism with the operation of said distributing means for commanding a readout of data words from selected cells and an immediately following writing of new data words therein during intervals which are relatively staggered for said multiplicity of storage units.
Claim 3
Dependent Claim
44 words
A system as defined in claim 1 wherein said input means comprises a video camera scanning a scene to be televised in consecutive frames of Y rows of X picture elements each, with P=X·Y, said data words being digitized samples of said picture elements.
Claim 4
Dependent Claim
63 words
A system as defined in claim 1 wherein said adressing means comprises a multiplicity of address registers with outputs respectively connected to said storage units and with inputs connected in parallel to respective stage outputs of said counting means, said distributing means comprising a plurality of logic gates connected to other stage outputs of said counting means for sequentially activating said address registers.
Claim 5
Dependent Claim
65 words
A system as defined in claim 3 wherein said stage outputs include a first plurality of stage outputs extending from several lowest-ranking stages and a second plurality of stage outputs extending from several highest-ranking stages of said counting means, said logic gates having first input terminals and second input terminals interchangeably connectable to said first and second pluralities of stage outputs by said switchover means.
Claim 6
Dependent Claim
16 words
A system as defined in claim 4 wherein said logic gates are of the Exclusive-OR type.
Claim 7
Dependent Claim
80 words
A system as defined in claim 4 wherein said switchover means comprises a first multiplexer connecting said first plurality of stage outputs to the input terminals of a first group of said logic gates and a second multiplexer connecting said second plurality of stage outputs to the input terminals of a second group of said logic gates in a first position, said multiplexers reversing the connections between said pluralities of stage outputs and said input terminals in a second position.
Claim 8
Dependent Claim
42 words
A system as defined in claim 6 wherein said second multiplexer has output connections extending to input terminals of all said logic gates, said second group of logic gates having further input terminals connected to additional stage outputs of said counting means.
Claim 9
Dependent Claim
21 words
A system as defined in claim 7 wherein the output connections of said second multiplexer also extend to said address registers.
Claim 10
Dependent Claim
37 words
A system as defined in claim 6 wherein said switchover means further comprises a flip-flop controlling said multiplexers, said flip-flop being alternately settable and resettable by said counting means after the arrival of every P·Z data words.
Claim 11
Dependent Claim
31 words
A system as defined in claim 1 wherein the number of said storage units is Z 2 , each storage unit being divided into Z sections each accommodating P data words.
Claim 12
Dependent Claim
32 words
A system as defined in claim 6 wherein said input means further comprises pretransformation means inserted between said video camera and said memory means for transposing certain digitized samples within each frame.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-07-21 | 1990-01-20 | 1990-07-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-07-21 | 1994-01-20 | 1994-07-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-07-21 | 1998-01-20 | 1998-07-22 | $7700.00 | Window Closed / Lapsed |