Hearing device comprising a delayless adaptive filter
11812224 · 2023-11-07
Assignee
Inventors
Cpc classification
H04R3/02
ELECTRICITY
H04R25/407
ELECTRICITY
International classification
Abstract
A hearing device includes a feedback control system that applies an adaptive filtering algorithm. The adaptive algorithm provides a filter control signal to adaptively control filter coefficients based on first and second algorithm input signals of a forward path. The feedback control system further includes first and second transform units for transforming the first and second algorithm input signals to the transform domain, and an inverse transform unit to convert an estimate of the current feedback path in the transformed domain to a time domain estimate, and a combination unit in the forward path to subtract the estimate of the current feedback signal from a signal of the forward path to provide a feedback corrected signal.
Claims
1. A hearing device adapted to be worn by a user, or for being partially implanted in the head of the user, comprising a forward path for processing an audio signal, the forward path comprising at least one input transducer for converting a sound to a corresponding at least one electric input signal representing said sound, a hearing aid processor for providing a processed signal in dependence of said at least one electric input signal, or a signal originating there from, and an output transducer for providing stimuli perceivable as sound to the user in dependence of said processed signal, a feedback control system comprising an adaptive filter, and a combination unit, the adaptive filter comprising an adaptive algorithm unit, and a time domain time varying filter, wherein the adaptive algorithm unit is configured to provide a filter control signal for adaptively controlling filter coefficients of the time varying filter in dependence of different first and second algorithm input signals of the forward path, the adaptive algorithm unit comprising first and second transform units for transforming said different first and second algorithm input signals to respective first and second transform domain algorithm input signals, the adaptive algorithm being configured to provide an estimate (H′) in the transform domain of a current feedback path from the output transducer to the input transducer in dependence of said first and second transform domain algorithm input signals, wherein the adaptive algorithm is updated based on an unconstrained gradient determined from said first and second transform domain algorithm input signals E, U as U*⊙E, where * denotes the complex conjugate, and denotes vector elementwise multiplication, and an inverse transform unit configured to convert the estimate of the current feedback path in the transform domain to an estimate of the current feedback path in the time domain, and wherein said filter control signal is provided in dependence of said estimate of the current feedback path in the time domain, and wherein the time domain time varying filter is configured to use adaptive filter coefficients controlled in dependence of said filter control signal to provide an estimate of an impulse response of the current feedback path to thereby provide an estimate of a current feedback signal in dependence of the processed signal, and the combination unit being located in the forward path and configured to subtract said estimate of the current feedback signal from a signal of the forward path to provide a feedback corrected signal, and wherein said first and second transform units and said inverse transform unit comprise respective linear convolution constraints.
2. A hearing device according to claim 1 wherein the linear convolution constraint is applied to respective first and second algorithm input signal vectors, each comprising a present value and a number of previous values of the respective first and second algorithm input signals.
3. A hearing device according to claim 2 wherein the number of previous values of the respective first and second algorithm input signals is larger than or equal to L−1, where L is the number of coefficients or weights controlling the adaptive filter.
4. A hearing device according to claim 1 wherein the respective first and/or second algorithm input signal vectors contain a number of added time sample values.
5. A hearing device according to claim 1 wherein the linear convolution constraint is further applied to respective transformed first and second algorithm input signal vectors, each comprising a present value and a number of previous values of the respective first and second algorithm input signals, and/or a number of added time sample values.
6. A hearing device according to claim 1 wherein the linear convolution constraint is applied to the output from the inverse transform.
7. A hearing device according to claim 1 wherein the linear convolution constraint is implemented by using the overlap-save, and/or overlap-add techniques.
8. A hearing device according to claim 1 wherein the linear convolution constraint of the first and second transform units are different.
9. A hearing device according to claim 1 wherein the first algorithm input signal comprises the feedback corrected signal, and wherein the second algorithm input signal comprises the processed signal.
10. A hearing device according to claim 1 wherein the transform is executed at a decimated rate D.
11. A hearing device according to claim 1 wherein an interpolation function, is used to get the time variant filter to work at a higher sampling rate.
12. A hearing device according to claim 1 wherein said first and second transform units are configured to determine (2L×1) dimensional time-domain signal vectors e(m) and u(m), respectively, where m=1, 2, . . . is a frame index:
e(m)=[0.sub.L.sup.T,e(m.Math.D−L+1),e(m.Math.D−L+2), . . . ,e(m.Math.D)].sup.T,
u(m)=[u(m.Math.D−2L+1),u(m.Math.D−2L+2), . . . ,u(m.Math.D)].sup.T, where 0.sub.L is a (L×1) dimensional null-vector containing L zeros, D is a decimation factor, m.Math.D meaning m multiplied by D, L is the number of coefficients or weights controlling the adaptive filter h′(n), and the superscript .sup.T denotes the vector transpose, and where the elements of the (2L×1) dimensional signal vectors (e(m), u(m)) represent time domain samples of the input signals (e(n)) and (u(n)) to the adaptive algorithm, and wherein the extra L time samples in the input signals e(m) and u(m) represent linear convolution constraint.
13. A hearing device according to claim 12 wherein the signal vectors e(m) and u(m) are applied as the linear convolution constraint to avoid circular convolution.
14. A hearing device according to claim 12 wherein respective transform domain signal vectors E(m) and U(m) are computed as,
E(m)=TDA(e(m)),
U(m)=TDA(u(m)), where TDA is a Transform Domain Algorithm.
15. A hearing device according to claim 12, wherein said transform domain is the frequency domain, the adaptive algorithm comprises a complex Least Mean Square (LMS) or a complex Normalized Least Mean Square (NLMS) algorithm, and the complex LMS or NLMS algorithm is updated based on an unconstrained gradient determined in terms of U*(m)⊙E(m), where U(m) and E(m) are defined as the following frequency domain signal vectors:
E(m)=DFT(e(m)), and
U(m)=DFT(u(m)), wherein DFT is a Discrete Fourier Transform algorithm.
16. A hearing device according to claim 1 wherein said transform domain is the frequency domain.
17. A hearing device according to claim 1 wherein the adaptive algorithm comprises a complex Least Mean Square or a complex Normalized Least Mean Square algorithm.
18. A hearing device according to claim 1 being constituted by or comprising an air-conduction type hearing aid, a bone-conduction type hearing aid, a cochlear implant type hearing aid, or a combination thereof.
19. A method of operating a hearing device adapted to be worn by a user, or for being partially implanted in the head of the user, the hearing device comprising a forward path for processing an audio signal comprising at least one input transducer for converting a sound to corresponding at least one electric input signal representing said sound, a hearing aid processor for providing a processed signal in dependence of said at least one electric input signal, and an output transducer for providing stimuli perceivable as sound to the user in dependence of said processed signal, and a feedback control system comprising an adaptive filter comprising an adaptive algorithm and a time domain time varying filter, the method comprising transforming different first and second algorithm input signals of the forward path to respective first and second transform domain algorithm input signals, configuring the adaptive algorithm to provide an estimate in the transform domain of a current feedback path from the output transducer to the input transducer in dependence of said first and second transform domain algorithm input signals, wherein the adaptive algorithm is updated based on an unconstrained gradient determined from said first and second transform domain algorithm input signals E, U as U*⊙E, where * denotes the complex conjugate, and ⊙ denotes vector elementwise multiplication, inversely transforming said estimate of the current feedback path in the transform domain to an estimate of the current feedback path in the time domain, providing a filter control signal in dependence of said estimate of the current feedback path in the time domain, adaptively controlling filter coefficients of the time varying filter in dependence of said filter control signal to thereby provide an estimate of a current feedback signal from said output transducer to said input transducer in dependence of the processed signal, and subtracting said estimate of the current feedback signal from a signal of the forward path to provide a feedback corrected signal, and, wherein said transforming and said inversely transforming procedures comprise respective linear convolution constraints.
20. A non-transitory computer readable medium storing a computer program comprising instructions which, when the program is executed by a computer, cause the computer to carry out the method of claim 19.
Description
BRIEF DESCRIPTION OF DRAWINGS
(1) The aspects of the disclosure may be best understood from the following detailed description taken in conjunction with the accompanying figures. The figures are schematic and simplified for clarity, and they just show details to improve the understanding of the claims, while other details are left out. Throughout, the same reference numerals are used for identical or corresponding parts. The individual features of each aspect may each be combined with any or all features of the other aspects. These and other aspects, features and/or technical effect will be apparent from and elucidated with reference to the illustrations described hereinafter in which:
(2)
(3)
(4)
(5)
(6)
(7)
(8) The figures are schematic and simplified for clarity, and they just show details which are essential to the understanding of the disclosure, while other details are left out. Throughout, the same reference signs are used for identical or corresponding parts.
(9) Further scope of applicability of the present disclosure will become apparent from the detailed description given hereinafter. However, it should be understood that the detailed description and specific examples, while indicating preferred embodiments of the disclosure, are given by way of illustration only. Other embodiments may become apparent to those skilled in the art from the following detailed description.
DETAILED DESCRIPTION OF EMBODIMENTS
(10) The detailed description set forth below in connection with the appended drawings is intended as a description of various configurations. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. Several aspects of the apparatus and methods are described by various blocks, functional units, modules, components, circuits, steps, processes, algorithms, etc. (collectively referred to as “elements”). Depending upon particular application, design constraints or other reasons, these elements may be implemented using electronic hardware, computer program, or any combination thereof.
(11) The electronic hardware may include micro-electronic-mechanical systems (MEMS), integrated circuits (e.g. application specific), microprocessors, microcontrollers, digital signal processors (DSPs), field programmable gate arrays (FPGAs), programmable logic devices (PLDs), gated logic, discrete hardware circuits, printed circuit boards (PCB) (e.g. flexible PCBs), and other suitable hardware configured to perform the various functionality described throughout this disclosure, e.g. sensors, e.g. for sensing and/or registering physical properties of the environment, the device, the user, etc. Computer program shall be construed broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
(12) The present application relates to the field of hearing devices, e.g. hearing aids, particularly to feedback estimation. In the present disclosure, a new structure of the so-called ‘delayless adaptive filter’ is proposed.
(13)
(14)
(15) The adaptive filter (AF) comprises a ‘Filter’ part (Filter) and a prediction error algorithm part (Algorithm) is aimed at providing a good estimate (v′) of the ‘external feedback path’ from the input of the output unit (here the DA) to the output from input unit (here the AD). The prediction error algorithm uses a reference signal (u) together with the (feedback corrected) microphone signal (e) to find the setting (coefficients) of the adaptive filter that minimizes the prediction error when the reference signal (u) is applied to (filtered by) the adaptive filter. The forward path of the hearing aid comprises signal processor (PRO) to adjust the signal to the (possibly impaired) hearing of the user. In the embodiment of
(16) Some or all of the signals of the embodiment of
(17)
(18) The state-of-the-art delayless structure is originally described in [1, 2] and patented in [3] is illustrated in
(19) However, differently to the traditional frequency domain adaptive filter approach of
(20) It is very important to note, that although a frame delay is involved in the estimation of the cancellation filter h′(n), which can also affect the adaptive filter performance if this frame delay becomes too big, the creation of v′(n) does not require a frame delay as required by the traditional frequency domain adaptive filter approach.
(21) Hence, there is no need to have any additional delay between x(n) and u(n) for the cancellation purpose, hereby the name of delayless structure.
(22) The method proposed in [1] was later refined in [2] to obtain better performance, however, we discovered that even the refined method in [2] can be improved further, using the method described in the present invention disclosure.
(23) The existing delayless structure from [1] and [2] transform the signals e(n) and u(n), using uniform DFT filter banks (cf. blocks denoted ‘Transform’ in
(24) The frequency stacking in [1], also referred to as the FFT stacking, has been shown to have an undesired property. Hence, a new frequency stacking method, referred to as the FFT-2, was proposed in [2]. However, even with the FFT-2 stacking, the performance can be further improved by using our proposed delayless structure.
(25) A difference between the structure of a delayless adaptive filter according to the present disclosure and the one depicted in
(26) The linear convolution constraints and DFT blocks may e.g. use known techniques from signal processing, e.g. the overlap-save technique (cf. e.g. the ‘Overlap-save_method’-entry of Wikipedia), or the overlap-add technique (cf. e.g. the ‘Overlap-add_method’-entry of Wikipedia). The overlap-save and overlap-add method are also described in the textbook [4]. Thereby it is ensured that the subsequent frequency domain FFT algorithm provides a resulting time domain filter h′(n) to perform the desired linear convolution. Another advantage is that the structure is simpler, and easier to implement.
(27) The processing of the forward path in
(28)
(29) In this way, the cumbersome frequency stacking technique, as proposed in [1] and [2], is dispensed with. Further, the performance of the delayless adaptive filter according to the present disclosure is improved.
(30) The delayless adaptive filter structure of
(31) If the decimation factor is D, then the corresponding index “n=D*m”, i.e., and h′(m) is (only) updated for every D'th value of the “n” index. The purpose of the interpolation unit is to fill the gaps in the estimate h′(m), e.g. between h′(m) and h′(m+1) to thereby provide values at h(n=m), h(n=m+1), . . . h(n=m+D−1, h(n=m+D).
(32) By sample & hold, we update h′(n) values, either with the updated h′(m) values for every D'th “n” indices (thereby sample), or using the previous h′(m) value (thereby “hold”) for the “n” indices without a corresponding h′(m). By more advanced interpolation techniques, more realistic intermediate values may be provided. Alternatively, a low-pass filter may be applied to the values of h′(n) if provided by a sample and hold function to thereby smooth the signal.
(33) In the following, calculations of an embodiment of the delayless adaptive filter according to the present disclosure are outlined.
(34) First, we define the (2L×1) signal vectors e(m) and u(m), where m=1, 2, . . . is the frame index, to be:
e(m)=[0.sub.L.sup.T,e(m.Math.D−L+1),e(m.Math.D−L+2), . . . ,e(m.Math.D)].sup.T,
u(m)=[u(m.Math.D−2L+1),u(m.Math.D−2L+2), . . . ,u(m.Math.D)].sup.T,
where 0.sub.L is a (L×1) null-vector containing L zeros, D is the decimation factor (so m.Math.D means m multiplied by D), L is the length of (number of coefficients or weights controlling) the adaptive filter h′(n), and the superscript T denotes the vector transpose. The elements of the (2L×1) signal vectors represent time domain samples of the input signals e and u to the adaptive algorithm. The extra time samples in the input signals e and u represent an example of the linear convolution constraint. In general, the number of extra samples should be equal to or above a threshold number large enough to avoid circular convolution. The signal vectors may comprise more than 2L values, e.g. N.Math.L, where N is an integer larger than 1.
(35) The frequency domain signal vectors E(m) and U(m) are computed as,
E(m)=DFT(e(m)),
U(m)=DFT(u(m)),
where DFT denotes the Discrete Fourier Transform. E(m) and U(m) are now the frequency transform of the time domain signal vectors e(m) and u(m). The e(m) and u(m) vectors are applied as the linear convolution constraint to avoid circular convolution.
(36) The linear convolution constraint using the overlap-save technique is provided by the vector definition of e(m) and u(m). In particular, the L zeros added to the first part of e(m), and the first L old samples to create u(m). The linear convolution constraint may e.g. be implemented using the overlap-save technique or the overlap-add technique.
(37) In this way, the length of ‘concatenated vectors’ and hence the DFT size is 2L, double of the adaptive filter length of h′(n). Each of the frequency domain signal vectors E(m) and U(m) represents a specific frequency band (in other words, the band index k has been omitted for simplicity).
(38) The complex NLMS algorithm may then be carried out as,
(39)
(40) where the superscript * denotes the complex conjugate, ⊙ denotes vector elementwise multiplication, ∥U(m)∥ denotes the Euclidean norm of the vector U(m), and c is a small positive number as a regularization parameter. H′(m) is hence a 2L×1 vector.
(41) In other words, the complex LMS (or NLMS) update may make use of the unconstrained gradient in terms of U*(m)⊙E(m) in the above update equation, where U(m) and E(m) are defined as the frequency domain signal vectors, cf. above.
(42) The inverse transform and the linear convolution constraint on H′(m) is performed as,
h′(m)=K(IDFT(H′(m)),L),
where IDFT denotes the Inverse Discrete Fourier Transform, and the function K(x, L) keeps the first L samples of the vector x and discards the remaining (L) samples. h′(m) is thus a L×1 vector. Removing the last L samples, to reach h′(m), is also part of the linear convolution constraint.
(43) The adaptive filter coefficient update of h′(m) occurs at the rate of the frequency domain processing, and finally an interpolation function, e.g. a sample and hold function, is used to bring h′(m) to h′(n), where m and n are tied together by a decimation factor.
(44) The adaptive algorithm unit of
(45)
(46) The first and second transform units (Transform-LCC) and the inverse transform unit (Inverse Transform-LCC) comprise respective linear convolution constraints to ensure that the frequency domain algorithm provides a resulting time domain filter h′(n) to perform the desired linear convolution. The linear convolution constraints may be mutually different. Each of the first and second transform units are configured to apply the linear convolution constraint to the first and second algorithm input signals (e(n), u(n)). The transform units may be configured to apply a Fourier transform algorithm to the respective linearly constrained signals to thereby provide the first and second algorithm input signals (E(m), U(m)) in the frequency domain. The Fourier transform algorithm may comprise a Discrete Fourier Transform (DFT) algorithm, e.g. a Short Time Fourier Transform (STFT) algorithm.
(47) The filter control signal may be equal to the estimate of the current feedback path in the time domain (h′((m)). The adaptive algorithm unit may (as here) comprise an interpolation function (Interpol) for providing values of the filter control signal corresponding to a sample index (n), e.g. to fill the gaps in values between a time frame index (m) and a time sample index (n). The filter control signal may be equal to the estimate of the current feedback path in the time domain (h′(n)). The filter control signal may comprise update filter coefficients (or updates to filter coefficients) for use in the time varying filter providing the estimate of the current feedback path in the time domain (h′).
(48) A comparison of the traditional methods (cf. [2]) and the proposed method using Matlab simulations has been made. In a closed loop acoustic feedback cancellation setup for the hearing aid application, initially we have a feedback path in free field, then after 1 s we change the feedback path with a phone next to the ear. The results in terms of misalignment ∥h.sub.true(n)−h′(n)∥ is shown in
(49)
(50) Embodiments of the disclosure may e.g. be useful in applications such as hearing aids or headsets or audio processing devices, where acoustic feedback may be a problem.
(51) It is intended that the structural features of the devices described above, either in the detailed description and/or in the claims, may be combined with steps of the method, when appropriately substituted by a corresponding process.
(52) As used, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well (i.e. to have the meaning “at least one”), unless expressly stated otherwise. It will be further understood that the terms “includes,” “comprises,” “including,” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will also be understood that when an element is referred to as being “connected” or “coupled” to another element, it can be directly connected or coupled to the other element but an intervening element may also be present, unless expressly stated otherwise. Furthermore, “connected” or “coupled” as used herein may include wirelessly connected or coupled. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items. The steps of any disclosed method is not limited to the exact order stated herein, unless expressly stated otherwise.
(53) It should be appreciated that reference throughout this specification to “one embodiment” or “an embodiment” or “an aspect” or features included as “may” means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. Furthermore, the particular features, structures or characteristics may be combined as suitable in one or more embodiments of the disclosure. The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects.
(54) The claims are not intended to be limited to the aspects shown herein but are to be accorded the full scope consistent with the language of the claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” Unless specifically stated otherwise, the term “some” refers to one or more.
REFERENCES
(55) [1] D. R. Morgan and J. C. Thi, “A delayless subband adaptive filter architecture,” IEEE Trans. Signal Process., vol. 43, no. 8, pp. 1819-1830, August 1995 [2] J. Huo, S. Nordholm, and Z. Zang, “New weight transform schemes for delayless subband adaptive filtering,” in Proc. IEEE Global Telecommunications Conf, vol. 1, November 2001, pp. 197-201. [3] U.S. Pat. No. 5,329,587A (AT&T) 12.07.1994. [4] A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, Englewood Cliffs, N.J., US: Prentice-Hall, March 1989.