Patent US5063573A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5063573A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for the equalization of dispersive, linear or approximately linear channels for the transmission of digital signals and arrangement for carrying out the method

Assignee: Telefunken Radio Communication Systems GmbH and Co KG
•
Filing: 1989-08-21
•
Granted: 1991-11-05
•
Expires: 2009-08-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for the equalization of dispersive, linear or approximately linear channels for the digital signal transmission by using an adaptive matched filter matched to the entire transmission channel, which converts the received signal into a time-discrete signal sequence and during this process determines the optimum sampling times by itself, and by the use of a subsequent equalizer which equalizes the signal sequence in sections by an iteration method with relaxation is disclosed.

Inventors

  • 👤 Ulrich Langewellpott

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 12:13
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/02; H04L25/03; H04L25/03006; H04L25/03012; H04L25/03019; H04L25/03038; H04H; H04H20/00; H04H20/65; H04H20/71; H04H20/72

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 458 words
A method for the equalization of dispersive, linear or approximately linear channels, particularly radio channels, for transmitting digital signals by means of an matched filter and a following equalizer, comprising the steps of: providing a matched filter (1) which is matched to the entire transmission channel; filtering, in the matched filter (1), a received signal r(t) characterized by a data sequence a k to produce a time-discrete signal sequence mfo k at the output of the matched filter (1), which automatically determines the optimum sampling times for the time-discrete signal sequence mfo k ; and equalizing the time-discrete signal sequence mfo k in sections in the equalizer (2) by means of an iteration procedure with relaxation, with said procedure comprising the steps of: subdividing the signal sequence mfo k into shorter mutually overlapping sections and storing the sections individually in a first and second store (22, 23) of the equalizer (2); equalizing the shorter mutually overlapping sections of signal sequence mfo k stored in each case in an equalization filter (25) of the equalizer (2); feeding the data stored in the second store (23) to the input of a first shift register (251) which is connected in series with a second shift register (252); feeding, in each clock interval of one iteration cycle, the data stored in the individual register locations (2511-2514; 2521-2523) of the first and second shift registers (251; 252) via weighting sections (2541-1547) of a weighting stage (254) to a summation section (253), where they are summed together; feeding back the data δβ k summed together at the output of the summation section (253) with a time delay and additional weighting (relaxation) to the input of the second shift register (252); generating in the equalization filter (25), during each iteration cycle, new estimated values β k of the data sequence a k which are in each case output at the output of the second shift register (252) and are subsequently stored in the second store (23) and during this process overwrite the data hitherto stored; summing together in each iteration cycle the square of the magnitude formed from the processed data δβ k at the output of the summation section (253) and the individual magnitude squares and using the sum signal s to determine the relaxation factor α for the processed data δβ k fed back and as criterion for the termination of the iteration process; and after termination of the iteration process, outputting the estimated values β k , last stored in the second store (23), of the data sequence a k at the output (8) of the equalizer (2) and subsequently storing the next section of the output signal sequence mfo k of the matched filter (1) in the two stores (22, 23).
Claim 2
Independent Claim 458 words
A method for the equalization of dispersive, linear or approximately linear channels, particularly radio channels, for transmitting digital signals by means of an matched filter and a following equalizer, comprising the steps of: providing a matched filter (1) which is matched to the entire transmission channel; filtering, in the matched filter (1), a received signal r(t) characterized by a data sequence a k to produce a time-discrete signal sequence mfo k at the output of the matched filter (1), which automatically determines the optimum sampling times for the time-discrete signal sequence mfo k ; and equalizing the time-discrete signal sequence mfo k in sections in the equalizer (2) by means of an iteration procedure with relaxation, with said procedure comprising the steps of: subdividing the signal sequence mfo k into shorter mutually overlapping sections and storing the sections individually in a first and second store (22, 23) of the equalizer (2); equalizing the shorter mutually overlapping sections of signal sequence mfo k stored in each case in an equalization filter (25) of the equalizer (2); feeding the data stored in the second store (23) to the input of a first shift register (251) which is connected in series with a second shift register (252); feeding, in each clock interval of one iteration cycle, the data stored in the individual register locations (2511-2514; 2521-2523) of the first and second shift registers (251; 252) via weighting sections (2541-1547) of a weighting stage (254) to a summation section (253), where they are summed together; feeding back the data δβ k summed together at the output of the summation section (253) with a time delay and additional weighting (relaxation) to the input of the second shift register (252); generating in the equalization filter (25), during each iteration cycle, new estimated values β k of the data sequence a k which are in each case output at the output of the second shift register (252) and are subsequently stored in the second store (23) and during this process overwrite the data hitherto stored; summing together in each iteration cycle the square of the magnitude formed from the processed data δβ k at the output of the summation section (253) and the individual magnitude squares and using the sum signal s to determine the relaxation factor α for the processed data δβ k fed back and as criterion for the termination of the iteration process; and after termination of the iteration process, outputting the estimated values β k , last stored in the second store (23), of the data sequence a k at the output (8) of the equalizer (2) and subsequently storing the next section of the output signal sequence mfo k of the matched filter (1) in the two stores (22, 23).
Claim 3
Dependent Claim 47 words
The method according to claim 1, wherein the weighting factors of the individual weighting sections (2541-2547) of the weighting stage (254) correspond to the real part of the auto-correlation function of the pulse response of the transmission function of the entire transmission channel for the respective section.
Claim 4
Dependent Claim 32 words
The method according to claim 2, further comprising: selecting the length of a section in such a manner that the channel impulse response can be considered approximately as stationary during the section.
Claim 5
Dependent Claim 23 words
The method according to claim 1, further comprising: terminating the iteration process when the sum signal s drops below a particular first value.
Claim 6
Dependent Claim 52 words
The method according to claim 1, further comprising: increasing or reducing respectively, the relaxation factor α for the processed data δβ k fed back in the subsequent iteration cycle if the difference between the sum signals s of the two preceding iteration cycles drops below or exceeds a particular second value respectively.
Claim 7
Dependent Claim 24 words
The method according o claim 5, wherein the magnitude of the particular second value depends on the magnitude of the respective last sum signals.
Claim 8
Dependent Claim 39 words
The method according to claim 1, further comprising: feeding the estimated values β k , read out of the second store (23) after termination of the iteration process, of the data sequence a k to a decision section (31).
Claim 9
Dependent Claim 42 words
The method according to claim 1, further comprising: feeding the estimated values β k , read out of the secon dstore (23) after termination of the iteration process, of the data sequence a k to an error-correcting decoding circuit (32 or 33).
Claim 10
Dependent Claim 77 words
The method according to claim 8, further comprising: directly feeding the data stored in the last register location (2514) at the output of the first shift register (251) to the associated weighting section (2544) and feeding the data stored in the remaining registers (2511-2513; 2521-2523) of the first and second shift registers (251, 252) via the decision sections (2561-2566) of the additional decision stage (256) to the associated weighting sections (2541-2543; 2545-2547) of the weighting stage (254).
Claim 11
Dependent Claim 47 words
The method according to claim 1, further comprising: feeding the data stored in the individual register locations (2511-2514; 2521-2523) of the first and second shift registers (251, 252) via decision sections of an additional decision stage (256) to the weighting sections (2541-2547) of the weighting stage (254).
Claim 12
Dependent Claim 24 words
The method according to claim 10 further comprising: in the decision sections of the decision stage (256) making a hard decision in each case.
Claim 13
Dependent Claim 53 words
The method according to claim 10 further comprising: in the decision sections of the decision stage (256), for the data of the register locations of the first and second shift registers (251, 252) which are located within a predetemrined range, in each case making a soft decision and otherwise making a hard decision.
Claim 14
Dependent Claim 59 words
The method according to claim 10 further comprising: in the decision sections of the decision stage (256), for data of the register locations of the first and second shift registers (251, 252) which are within a predetermined range, allocating the mean value of the hard decision values which are in each case adjacent and otherwise making a hard decision.
Claim 15
Dependent Claim 17 words
The method according to claim 1, used for a cellular mobile radio system with dispersive multi-path propagation.
Claim 16
Dependent Claim 14 words
The method according ot claim 1, used in a digital audio broadcasting system (DAB).
Claim 17
Dependent Claim 265 words
An arrangement for carrying out a method for the equaliation of dispersive, linear or approximately linear channels, particularly radio cahnnels, for transmitting digital signals by means of a matched filter and a following equalizer, wherein the matched filter (1) is an adaptive matched filter, and wherein the equalizer (2) comprises: a first store (22) connected at its input via a controllable on-/off-switch (20) to an input (7) of the equalizer (2) and connected at its output to an input of a first summation section (253) of an equalizer filter (25); and a second store (23) connected at its input to a first controllable change-over switch (21) which selectively connects it either to th einput (7) of the equalizer (2) or to an output of a second shift register (252) of the equalization filter (25) and is connected at its output to a second controllable change-over switch (24) which connects it either to an input of a first shift register (251) of the equalization filter (25) or to an output (8) of the equalizer (2); wherein, an output of the first summation seciton (253) of the equalization filter (25) is connected via a timing section (26) and a controllable weighting section (27) to a first addition section (255) which is connected between the first and second shift registers (251, 252) of the equalization filter (25) and the output of the first summation section (253) of the equalization filter (25) is further connected via a first circuit (28) for forming a magnitude square and a subsequent second summation section (29) to a sequence control circuit (4, 5).
Claim 18
Dependent Claim 265 words
An arrangement for carrying out a method for the equaliation of dispersive, linear or approximately linear channels, particularly radio cahnnels, for transmitting digital signals by means of a matched filter and a following equalizer, wherein the matched filter (1) is an adaptive matched filter, and wherein the equalizer (2) comprises: a first store (22) connected at its input via a controllable on-/off-switch (20) to an input (7) of the equalizer (2) and connected at its output to an input of a first summation section (253) of an equalizer filter (25); and a second store (23) connected at its input to a first controllable change-over switch (21) which selectively connects it either to th einput (7) of the equalizer (2) or to an output of a second shift register (252) of the equalization filter (25) and is connected at its output to a second controllable change-over switch (24) which connects it either to an input of a first shift register (251) of the equalization filter (25) or to an output (8) of the equalizer (2); wherein, an output of the first summation seciton (253) of the equalization filter (25) is connected via a timing section (26) and a controllable weighting section (27) to a first addition section (255) which is connected between the first and second shift registers (251, 252) of the equalization filter (25) and the output of the first summation section (253) of the equalization filter (25) is further connected via a first circuit (28) for forming a magnitude square and a subsequent second summation section (29) to a sequence control circuit (4, 5).
Claim 19
Dependent Claim 68 words
The arrangement according to claim 16, wherein: each individual register location (2511-2514; 2521-2523) of the first and second shift registers (251, 252) of the equalization filter (25) is connected at its output respectively to an input of an associated weighting section (2541-2544; 2545-2547) of the weighting stage (254) of the equalization filter (25) and outputs of the weighting sections (2541-2547) are connected to the first summation section (253).
Claim 20
Dependent Claim 25 words
The arrangement according to claim 17, characterized in that the weighting sections (2541-2547) of the weighting stage (254) of the equalization filter (25) are controllable.
Claim 21
Dependent Claim 88 words
The arrangement according to claim 16 characterized in that eac of the register locations (2511-2514; 2521-2523) of the first and second shift registers (251, 252) of the equaliation filter (25) or each of the register locations apart from the last register location (2514) located at the output of the first shift register (251) is connected at the output in each case via a decision section (2561-2563; 254-2566) of an additional decision stage (256) to the input of the associated weighting section (2541-2543; 2545-2547) of the weighting stage (254).
Claim 22
Dependent Claim 62 words
The arrangement according to claim 16, characterized in that in the case of complex-value data sequences a k , the adaptive matched-filter (1) and the stores (22, 23), the shift registers (251, 252), the addition section (256) of the equalization filter (25) and the weighting sections (2541-2547) of the weighting stage (254) of the equalization filter (25) are designed to be complex.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-11-04 1995-05-06 1995-11-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-11-04 1999-05-06 1999-11-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-11-04 2003-05-06 2003-11-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag