Patent US4323980A successfully refreshed from Google Patents.
US4323980A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital filter for shared-time processing on several channels
Assignee: Thales SA
•
Filing: 1980-01-17
•
Granted: 1982-04-06
•
Expires: 2000-01-17
Abstract
Abstract A digital filter for shared-time processing on several channels. The filter has several elementary cells (C1 to CK), each comprising a read-write memory (M1 to MK), a read-only memory (H1 to HK), and an arithmetic unit (U1 to UK). A page address counter CT1, a word address counter CT2 and a weighting coefficient address counter CT3 are common to the cells. Delayed discrete values are transferred by the relative addressing of the memory words. The filter will find particular application as a half-band extrapolator filter for telephone switching.
Inventors
- 👤 Jean-Pierre Houdard
- 👤 Jean-Jacques Julie
- 👤 Bernard G. Leoni
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 10:33
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/0283; H03H17/0292; H03H2218/00; H03H2218/06
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
173 words
A method for processing successive signal samples, for example, the signals which appear on a plurality of time-multiplexed transmission channels, comprising the steps of: during each sampling time slot and for each channel, writing the current sample into one of a plurality of random access memories in place of the oldest priorly written sample, all of the samples for a given channel being read into said memory in succession starting with that which has just been written and progressing to other memories in the order of increasing age to the oldest sample; simultaneously reading all of said memories in the order of increasing age starting with the sample which has just been written; sending the samples thus read from each memory to a corresponding arithmetic unit; summing the results produced by the different arithmetic units; and then, said progressing of memories comprising transferring the oldest sample from each memory to the next memory, starting with the next to last memory, said memories being arranged in the order of increasing age of their contents.
Claim 2
Independent Claim
173 words
A method for processing successive signal samples, for example, the signals which appear on a plurality of time-multiplexed transmission channels, comprising the steps of: during each sampling time slot and for each channel, writing the current sample into one of a plurality of random access memories in place of the oldest priorly written sample, all of the samples for a given channel being read into said memory in succession starting with that which has just been written and progressing to other memories in the order of increasing age to the oldest sample; simultaneously reading all of said memories in the order of increasing age starting with the sample which has just been written; sending the samples thus read from each memory to a corresponding arithmetic unit; summing the results produced by the different arithmetic units; and then, said progressing of memories comprising transferring the oldest sample from each memory to the next memory, starting with the next to last memory, said memories being arranged in the order of increasing age of their contents.
Claim 3
Dependent Claim
88 words
The method in accordance with claim 1 applied to an extrapolator network, comprising the further steps of: after reading the latest sample, incrementing each memory by 2, except for the last reading for which the incrementation is by 1 only; and reading the address of the first delayed discrete value in each memory during a reading and weighting cycle such that said address is always less than the address of the first delayed discrete value read in said memories during the previous reading and weighting cycle by 2.
Claim 4
Dependent Claim
32 words
The method in accordance with claim 2, wherein two or more memories are used, comprising the further step of: during the transfer phase between memories, transferring two delayed discrete values each time.
Claim 5
Dependent Claim
181 words
An M-order digital filter for the shared-time processing of digital signals appearing on I channels, which comprises: (a) K processing cells, K being a whole number equal to or greater than 1, each of said K cells comprising: a random access memory organized in I pages, each page corresponding to a channel and capable of storing at least P words of q bits each, where M=KP-1, said memory being intended for storing delayed discrete values; a read-only memory having a capacity of at least P words of r bits each for storing the weighting coefficients of the different delayed discrete values; and an arithmetic unit connected to said random access memory and said read-only memory; (b) a modulo-I counter, common to the K cells, for addressing the I pages of said K random access memories; (c) a first modulo-P counter, common to the K cells, for ordering the writing, reading and transfer of the said delayed discrete values; and (d) a second modulo-P counter, common to the K cells, for addressing the weighting coefficients corresponding to the operation to be performed.
Claim 6
Dependent Claim
181 words
An M-order digital filter for the shared-time processing of digital signals appearing on I channels, which comprises: (a) K processing cells, K being a whole number equal to or greater than 1, each of said K cells comprising: a random access memory organized in I pages, each page corresponding to a channel and capable of storing at least P words of q bits each, where M=KP-1, said memory being intended for storing delayed discrete values; a read-only memory having a capacity of at least P words of r bits each for storing the weighting coefficients of the different delayed discrete values; and an arithmetic unit connected to said random access memory and said read-only memory; (b) a modulo-I counter, common to the K cells, for addressing the I pages of said K random access memories; (c) a first modulo-P counter, common to the K cells, for ordering the writing, reading and transfer of the said delayed discrete values; and (d) a second modulo-P counter, common to the K cells, for addressing the weighting coefficients corresponding to the operation to be performed.
Claim 7
Dependent Claim
30 words
A digital filter in accordance with claim 4, further comprising an adder common to the K processing cells for summing the various partial results produced by said K arithmetic units.
Claim 8
Dependent Claim
53 words
A digital filter according to claim 4 or 5 wherein to act as a M'-order filter where M'=(2P'-1), P' being an even, whole number, said filter further comprises an input buffer connected to said random access memories, said first modulo-P counter is modulo-P' counter, and said second modulo-P counter is a modulo-(P'/2+2) counter.
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) | 1985-04-05 | 1985-10-05 | 1986-04-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1989-04-05 | 1989-10-05 | 1990-04-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1993-04-05 | 1993-10-05 | 1994-04-06 | $7700.00 | Window Closed / Lapsed |