US5282275A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Address processor for a signal processor
Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1991-01-10
•
Granted: 1994-01-25
•
Expires: 2011-01-10
Abstract
Abstract The invention relates to an address processor for a signal processor. This address processor comprises means for address calculation in a read/write memory containing at least one circular buffer for storing state variables of digital filters. This means comprises a set of registers for storing the current folding address for each circular buffer relative to the absolute start address of the buffer. Furthermore, a calculation unit (+) is included for (1) adding the current folding address to the displacement (data-addr, write-addr) of a selected state variable relative to the corresponding buffer start address, (2) reducing the sum obtained in step (1) with the corresponding buffer length (mod-numb) if the sum exceeds or is equal to this buffer length, and (3) adding the buffer start address to the result obtained in (2) for obtaining the absolute address of the selected state variable.
Inventors
- 👤 Tore M. Andre
- 👤 Karl-Gunnar A. Rojås
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 10:15
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/34; G06F9/355; G06F9/3552; G06F5/00; G06F5/06; G06F5/065; H; H03; H03H; H03H17/00; H03H17/02; G06F2205/00; G06F2205/06; G06F2205/066
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
215 words
An address processor for a signal processor, comprising means for address calculation in a read/write memory containing one or more circular buffers for storing state variables of digital filters, at least one of said buffers containing state variables of at least two digital filters, each of the filters in the same buffer corresponding to the same sampling frequency and the length of each buffer depending on the sum of a number of delay elements in the filters of the buffer, said means comprising: (a) register means for storing a current folding address of each circular buffer relative to a corresponding buffer start address in said read/write memory and (b) calculation means for adding, for a selected state variable of a selected filter in a selected buffer, the current folding address of said selected buffer to a displacement of said selected state variable relative to a start address within said selected buffer of said selected filter, to obtain a first value, reducing the first value by the length of said selected buffer if said sum exceeds or is equal to said buffer length to obtain a second value, and adding the buffer start address of said selected buffer to said second value to obtain the absolute address of said selected state variable in said read/write memory.
Claim 2
Dependent Claim
215 words
An address processor for a signal processor, comprising means for address calculation in a read/write memory containing one or more circular buffers for storing state variables of digital filters, at least one of said buffers containing state variables of at least two digital filters, each of the filters in the same buffer corresponding to the same sampling frequency and the length of each buffer depending on the sum of a number of delay elements in the filters of the buffer, said means comprising: (a) register means for storing a current folding address of each circular buffer relative to a corresponding buffer start address in said read/write memory and (b) calculation means for adding, for a selected state variable of a selected filter in a selected buffer, the current folding address of said selected buffer to a displacement of said selected state variable relative to a start address within said selected buffer of said selected filter, to obtain a first value, reducing the first value by the length of said selected buffer if said sum exceeds or is equal to said buffer length to obtain a second value, and adding the buffer start address of said selected buffer to said second value to obtain the absolute address of said selected state variable in said read/write memory.
Claim 3
Dependent Claim
32 words
The address processor according to claim 1, wherein the length of each buffer is formed by the sum of the number of delay elements in the filters in the buffer plus one.
Claim 4
Dependent Claim
37 words
The address processor according to claim 1, wherein said calculation means is formed by an adder, and the possible reduction being performed by adding the two-complement of the length of said selected buffer to the first value.
Claim 5
Dependent Claim
42 words
The address processor according to claim 3, including a first register in said register means for storing the current folding address, the two-complement of the length of said selected buffer and the start address of said selected buffer in sequential storage locations.
Claim 6
Dependent Claim
48 words
The address processor according to claim 4, including a second register in said register means for storing the displacement of said selected state variable relative to the start address within said selected buffer of said selected filter, the first value and the second value in sequential storage locations.
Claim 7
Dependent Claim
66 words
The address processor according to claim 5, wherein the most significant bit in said adder after the calculation of the second value is used as a sign bit and the first value is kept in said second register if the second value is negative, and wherein the first value in said second register is replaced by the second value if the second value is not negative.
Claim 8
Dependent Claim
85 words
The address processor according to claim 1, wherein each filter is calculated by fetching the state variables of the filter and the corresponding coefficients in sequence after each other by using an index, that is equal to the number of delay elements in the respective filter, said index being added to the filter start position to generate the displacement used for obtaining the oldest state variable and the corresponding coefficient and then being successively decremented down to 0 for obtaining younger and younger state variables.
Claim 9
Dependent Claim
36 words
The address processor according to claim 7, wherein the value of a calculated filter is written into the memory position of the oldest state variable in a previous filter, so that this memory position is reused.
Claim 10
Dependent Claim
14 words
The address processor according to claim 1, wherein said register means contains four registers.
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) | 1997-01-24 | 1997-07-26 | 1998-01-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-01-24 | 2001-07-26 | 2002-01-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-01-24 | 2005-07-26 | 2006-01-25 | $7700.00 | Window Closed / Lapsed |