EP1919251B1 - Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande - Google Patents

Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande Download PDF

Info

Publication number
EP1919251B1
EP1919251B1 EP20060022602 EP06022602A EP1919251B1 EP 1919251 B1 EP1919251 B1 EP 1919251B1 EP 20060022602 EP20060022602 EP 20060022602 EP 06022602 A EP06022602 A EP 06022602A EP 1919251 B1 EP1919251 B1 EP 1919251B1
Authority
EP
European Patent Office
Prior art keywords
beamforming
filter
domain
weights
beamformer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP20060022602
Other languages
German (de)
English (en)
Other versions
EP1919251A1 (fr
Inventor
Franck Beaucoup
Michael Tetelbaum
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Mitel Networks Corp
Original Assignee
Mitel Networks Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mitel Networks Corp filed Critical Mitel Networks Corp
Priority to DE200660016617 priority Critical patent/DE602006016617D1/de
Priority to EP20060022602 priority patent/EP1919251B1/fr
Publication of EP1919251A1 publication Critical patent/EP1919251A1/fr
Application granted granted Critical
Publication of EP1919251B1 publication Critical patent/EP1919251B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04RLOUDSPEAKERS, MICROPHONES, GRAMOPHONE PICK-UPS OR LIKE ACOUSTIC ELECTROMECHANICAL TRANSDUCERS; DEAF-AID SETS; PUBLIC ADDRESS SYSTEMS
    • H04R3/00Circuits for transducers, loudspeakers or microphones
    • H04R3/005Circuits for transducers, loudspeakers or microphones for combining the signals of two or more microphones
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04RLOUDSPEAKERS, MICROPHONES, GRAMOPHONE PICK-UPS OR LIKE ACOUSTIC ELECTROMECHANICAL TRANSDUCERS; DEAF-AID SETS; PUBLIC ADDRESS SYSTEMS
    • H04R2430/00Signal processing covered by H04R, not provided for in its groups
    • H04R2430/03Synergistic effects of band splitting and sub-band processing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04RLOUDSPEAKERS, MICROPHONES, GRAMOPHONE PICK-UPS OR LIKE ACOUSTIC ELECTROMECHANICAL TRANSDUCERS; DEAF-AID SETS; PUBLIC ADDRESS SYSTEMS
    • H04R2430/00Signal processing covered by H04R, not provided for in its groups
    • H04R2430/20Processing of the output signals of the acoustic transducers of an array for obtaining a desired directivity characteristic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04RLOUDSPEAKERS, MICROPHONES, GRAMOPHONE PICK-UPS OR LIKE ACOUSTIC ELECTROMECHANICAL TRANSDUCERS; DEAF-AID SETS; PUBLIC ADDRESS SYSTEMS
    • H04R25/00Deaf-aid sets, i.e. electro-acoustic or electro-mechanical hearing aids; Electric tinnitus maskers providing an auditory perception
    • H04R25/40Arrangements for obtaining a desired directivity characteristic
    • H04R25/407Circuits for combining signals of a plurality of transducers

Definitions

  • the present invention relates to a beam forming design method and a real-time implementation structure that reduces the computational complexity of broadband beamformers.
  • EP 1 517 581 A2 discloses a method for designing a beam former, and a beam former made in accordance with this method, characterized by a uniform speaker phone response condition, resulting in optimal beam forming directivity under a uniform coupling constraint.
  • a finite number of individual beam formers are constrained to have the same response to a loudspeaker signal (as well as the same gain in their respective look directions) without specifying the exact value of their response to this signal. This results in beam former weights that are optimal in the minimum variance sense and satisfy the uniform coupling constraint.
  • the minimum variance condition combines all beam former weights at once, and the uniform coupling constraint is expressed as a finite number of linear constraints on the weights of the individual beam formers, without specifying an arbitrary, a priori value for the actual value of the uniform response.
  • Sensor array processing also known as beamforming
  • Beamforming consists of combining the signals received by several omni-directional sensors to provide spatial directivity (see H.L.Van Trees, "Optimum array processing (detection, estimation and modulation theory, part IV),” John Wiley and Sons, 2002 for a general presentation). Beamforming has been used for several decades for applications such as radar, sonar, hearing aids and smart antennas for telecommunications.
  • microphone arrays have also been used for low-cost desktop products such as end-point speech processing devices for-Personal Computers (PC) applications (see M.Brandstein and D.Ward, "Microphone arrays, signal processing techniques and applications," Springer, 2001 ) and audio conference phones (see M.Tetelbaum and F.B imp, "Design and implementation of a conference phone based on microphone array technology" Proceedings of Global Signal Processing Conference and Expo (GSPx) 2004, San Jose, CA, Sep 2004 ).
  • PC Personal Computers
  • GSPx Global Signal Processing Conference and Expo
  • the computational complexity of array processing depends on such factors as the number of sensors (respectively sources), the amount of spatial directivity desired from the array, and the bandwidth of operation compared to its average frequency (narrow-band or broad-band beamforming, as defined in H.L.Van Trees, "Optimum array processing (detection, estimation and modulation theory, part IV),” John Wiley and Sons, 2002 and M.Brandstein and D.Ward, “Microphone arrays, signal processing techniques and applications,” Springer, 2001 ). For cost-sensitive applications and in scenarios where the number of sensors is large, this computational complexity can be a critical issue.
  • a beamformer can be described as a weighted summation of signals received by an array of sensors.
  • the signals are only submitted to pure delays, resulting in a beamformer known as the delay-and-sum beamformer (or conventional beamformer).
  • the weights applied to the various channels can use both magnitude and phase information to create more effective spatial filtering. In the traditional complex-domain representation of signals, these weights are therefore complex numbers.
  • these beamforming weights are chosen to optimise a criterion related to the directivity of the beamformer, such as in the popular Minimum Variance Distortionless Response (MVDR) and Linearly Constrained Minimum Variance (LCMV) beamformers (see H.L. Van Trees, “Optimum array processing (detection, estimation and modulation theory, part IV),” John Wiley and Sons, 2002 and M.Brandstein and D.Ward, “Microphone arrays, signal processing techniques and applications,” Springer, 2001 ).
  • MVDR Minimum Variance Distortionless Response
  • LCMV Linearly Constrained Minimum Variance
  • DFT Discrete Fourier Transform
  • H.L.Van Trees "Optimum array processing (detection, estimation and modulation theory, part IV),” John Wiley and Sons, 2002 ).
  • the principle is to make use of fast convolution in the frequency domain in order to reduce the computational complexity of the beamforming process.
  • Each sensor signal is transformed into the frequency domain with a DFT operation, and narrow-band beamforming is then performed independently on each individual bin in the frequency domain.
  • the resulting frequency-domain beamformer output is then brought back into the time domain with an Inverse DFT (IDFT).
  • IDFT Inverse DFT
  • This frequency domain technique may be implemented with block processing or with sample processing with the sliding DFT algorithm as explained in M.L.Van Trees, "Optimum array processing (detection, estimation and modulation theory, part IV),” John Wiley and Sons, 2002 .
  • the filtering operation in the frequency-domain can be performed with the traditional techniques of overlap-add or overlap-save (see S.Haykin, "Adaptive filter theory,” Prentice Hall, 1996 ).
  • the frequency domain weights correspond to time-domain filters that are as short as possible.
  • short time-domain filters are fitted to the original frequency-domain weights as described for time-domain implementations, followed by use of the frequency response of these time-domain filters to perform narrow-band beamforming on each bin in the frequency domain.
  • the step of designing short time-domain beamforming filters is an important step towards computational efficiency.
  • the present invention describes a novel design procedure that produces a more efficient time-domain representation of the frequency-domain weights and therefore results in more efficient real-time implementations, both in the time domain and in the frequency domain.
  • the conditioning stage is implemented so as to remove from all beamforming channels (by division in the frequency domain, and therefore without affecting the spatial directivity) some common characteristics in their weights' frequency responses.
  • the conditioning stage facilitates the filter fit on each channel, thereby reducing the filter order and consequently the computational complexity of the beamforming structure, whether time-domain or frequency-domain.
  • the resulting change in the beamformer's response to its look direction can be compensated for by a single-channel "conditioning equalisation" filter placed on the output of the beamformer.
  • an improvement of the beamforming design method comprising modifying each beamforming weight in the frequency domain by dividing each beamforming weight by a common characteristic established in the frequency response across an array of sensors prior to fitting each beamforming weight to a filter.
  • a weight-conditioning beamformer for providing spatial directivity, said beamformer comprising an array of sensors, corresponding beamforming filters fitted with conditioned beamforming weights, wherein each conditioned beamforming weight is obtained by dividing each beamforming weight by a common characteristic established in the frequency response across an array of sensors prior to fitting each beamforming weight to the filter, and a summer for summing the outputs of said filters.
  • Figure 1 is a block diagram of a time-domain implementation of a broadband beamformer.
  • Figure 2 is a block diagram of a frequency-domain implementation of a broadband beamformer.
  • Figure 3 is a process diagram of a broadband beamformer according to an embodiment of the invention.
  • Figure 4 is a block diagram of the embodiment shown in Figure 3 , illustrating a time-domain implementation of a broadband beamformer with weight conditioning.
  • Figure 5 is a graph showing multi-channel normalized filter-fit quality according to a multi-channel normalised filter-fit error criterion with and without the weights condition step.
  • one approach for designing the time-domain filters is to first calculate complex-domain weights at discrete frequencies across the desired frequency range, and then fit a time-domain filter to the frequency response consistent of the complex beamforming weights over the whole frequency range for each particular channel.
  • each output from the array of sensors 12 is then filtered by the corresponding time-domain filter F k 14; the resulting outputs are then summed 16 and outputted for subsequent processing.
  • DFT beamforming makes use of fast convolution in the frequency domain in order to reduce the computational complexity of the beamforming process from an array of sensors 22.
  • Each sensor signal is transformed into the frequency domain with a DFT operation 24, and narrow-band beamforming 26 is then performed independently on each individual bin in the frequency domain.
  • the resulting frequency-domain beamformer output is then summed 28 brought back into the time domain with an Inverse DFT 30.
  • this approach is shown using the Fast Fourier Transform (FFT) algorithm.
  • FFT Fast Fourier Transform
  • the directivity of a beamformer regardless of the exact indicator that is used to measure it (e.g. directivity index, front-back ratio, signal-to-interference-plus-noise ratio, etc... see H.L.Van Trees, "Optimum array processing (detection, estimation and modulation theory, part IV),” John Wiley and Sons, 2002 or M.Brandstein and D.Ward, "Microphone arrays, signal processing techniques and applications," Springer, 2001 ) is homogeneous as a function of the beamforming weights or filters. Multiplying all channels by the same complex number at any given frequency does not alter the directivity of the resulting beamformer. For broad-band beamformers, multiplying weights for all channels by the same "frequency response" does not alter the directivity of the resulting beamformer (although it clearly affects its response in the look direction over the frequency range).
  • the exact indicator that is used to measure it e.g. directivity index, front-back ratio, signal-to-interference-plus
  • the weights are then filter fit 44.
  • the beamformer is then implemented 46 as a time-domain or frequency-domain beamformer. Note that since the conditioning stage affects the beamformer's frequency response in its look direction, compensation, if required, can be achieved by placing a "conditioning equalisation” filter at the output of the beamformer. This equalisation filter only affects the frequency response of the beamformer and not its directivity.
  • the present invention is not intended to be restricted to a specific conditioning function.
  • one of the beamforming channel weights, or a delayed version of it, is used as the conditioning function.
  • One advantage of this conditioning is that one channel becomes a trivial channel (pure delay) that does not need FIR filtering in the final implementation.
  • the resulting beamforming structure with the conditioning equalisation filter is shown In Figure 4 for a time-domain implementation. As shown, each output from the array of sensors 52 is filtered by the corresponding conditioned time-domain filter F k 54; the resulting outputs are then summed 60 and outputted for subsequent processing.
  • the summed signal is then subjected to a conditioning equalization filter 62; it will be appreciated that the conditioning equalization filter is optional, depending on the particular implementation. Although shown for time-domain implementation; one skilled in the art can easily derive the corresponding structure for a frequency-domain (DFT) implementation.
  • DFT frequency-domain
  • a "multi-channel normalised filter-fit error” is introduced as a cost function.
  • W j ( v k ), 1 ⁇ j ⁇ M , 1 ⁇ k ⁇ N denotes the complex-domain beamforming weights of the M channels over the discrete set of frequencies v k , 1 ⁇ k ⁇ N , and [ ⁇ 1 ⁇ 2 ... ⁇ N ] the (complex) values of the conditioning function on these same frequencies.
  • These weights are assumed to yield a distortionless beamformer in its look direction (e.g. MVDR or LCMV).
  • the cost function is defined as a .
  • ⁇ M ⁇ M ] v 1 ) denotes the frequency response at frequency v 1 of the filter adjusted (according to a given filter-fit procedure, for instance a simple least-squares fit (see S.Haykln, "Adaptive filter theory,” Prentice Hall, 1996 ) to the j th channel weight W , dot-multiplied (that is, multiplied element-wise) by the conditioning function [ ⁇ 1 ⁇ 2 , ... ⁇ M ]. Note that the reason for the normalisation factor
  • Figure 5 shows the values of this filter-fit quality criterion as a function of the filter order, with and without the weights conditioning step, for a regularised MVDR beamformer over the frequency range [300Hz, 3300Hz] on a 6-microphone uniform linear array of 15cm in length.
  • the weights conditioning step reduces the length of the beamforming filters by roughly 30% for the same quality of filter fit (and therefore the same directivity).
  • the present invention describes a beamforming design method and a real-time implementation structure that can significantly reduce the computational complexity of broadband beamformers without affecting their performance in terms of spatial directivity or robustness to uncorrelated noise.
  • the invention applies equally to arrays of sources for spatially directive transmitters.
  • the time-domain filters fitted with the conditioned weights would be applied to the input signals to the transmitter, as opposed to the output signals of the sensors.
  • the present invention pertains to the design procedure making use of conditioning function, and is not restricted to a specific conditioning function. Many choices are possible for the conditioning function; the present invention in intended to cover all choices as long as they fit in the framework of the design procedure shown in Figure 3 .
  • one skilled in the art could search for a function that would be optimal according to some criterion related to the quality of the filter fit, or the directivity cost function used to calculate the frequency-domain beamforming weights.
  • the multi-channel normalised filter-fit error function described above could represent such a criterion.
  • a traditional gradient-based optimisation procedure could be used to determine the vector [ ⁇ 1 ⁇ 2 ... ⁇ M ] that minimises this function.
  • the unknown vector must be normalised one way or another in order to have access to local minima.
  • fix ⁇ 1 1 and therefore look for a conditioning vector of the form [1 ⁇ 2 ... ⁇ M ].
  • the above discussion relates to the present invention in the context of an audio conferencing environment.
  • other applications making use of fixed beamforming in the presence of some kind of isotropic noise (e.g. any audio processing) could potentially benefit from it.
  • adaptive beamforming and specifically adaptive interference cancellation the outcome is less certain because there is no a-priori guarantee that all frequency-domain beamforming weights will indeed present a strong common pattern in their frequency response and therefore benefit from the conditioning stage.
  • the use of the aforementioned beamforming weights conditioning stage in a real-time scenario would also fall within the scope of the present invention.

Landscapes

  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Otolaryngology (AREA)
  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Acoustics & Sound (AREA)
  • Signal Processing (AREA)
  • Circuit For Audible Band Transducer (AREA)
  • Obtaining Desirable Characteristics In Audible-Bandwidth Transducers (AREA)

Claims (7)

  1. Procédé de conception de formation de faisceau pour concevoir un système de formation de faisceau à base de canaux où les coefficients de pondération de formation de faisceau sont prédéfinis, ledit procédé comprenant l'étape consistant à :
    modifier chaque coefficient de pondération de formation de faisceau dans le domaine fréquentiel en divisant chaque coefficient de pondération de formation de faisceau par une caractéristique commune établie dans la réponse en fréquence sur l'ensemble d'un réseau de détecteurs avant d'affecter chaque coefficient de pondération de formation de faisceau à un filtre.
  2. Procédé selon la revendication 1, ladite caractéristique commune étant l'un des coefficients de pondération de formation de faisceau sur un canal dudit système de formation de faisceau à base de canaux.
  3. Procédé selon la revendication 1, ladite caractéristique commune étant une version différée d'un des coefficients de pondération de formation de faisceau sur un canal dudit système de formation de faisceau à base de canaux.
  4. Procédé selon la revendication 1, ledit filtre étant un filtre à réponse impulsionnelle finie.
  5. Formateur de faisceau à conditionnement des coefficients de pondération destiné à produire une diversité spatiale, ledit formateur de faisceau comprenant :
    un réseau de détecteurs ;
    des filtres de formation de faisceau correspondants conçus pour se voir affecter des coefficients de pondération de formation de faisceau conditionnés, chaque coefficient de pondération de formation de faisceau conditionné étant obtenu en le divisant par une caractéristique commune établie dans la réponse en fréquence sur l'ensemble du réseau de capteurs avant d'affecter chaque coefficient de pondération de formation de faisceau au filtre ; et
    un sommateur destiné à sommer les sorties desdits filtres.
  6. Formateur de faisceau selon la revendication 5, comprenant en outre un filtre d'égalisation destiné à corriger la réponse en fréquence suite à la sommation des sorties.
  7. Formateur de faisceau selon la revendication 5, ledit filtre de formation de faisceau étant un filtre à réponse impulsionnelle finie.
EP20060022602 2006-10-30 2006-10-30 Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande Active EP1919251B1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
DE200660016617 DE602006016617D1 (de) 2006-10-30 2006-10-30 Anpassung der Gewichtsfaktoren für Strahlformung zur effizienten Implementierung von Breitband-Strahlformern
EP20060022602 EP1919251B1 (fr) 2006-10-30 2006-10-30 Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP20060022602 EP1919251B1 (fr) 2006-10-30 2006-10-30 Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande

Publications (2)

Publication Number Publication Date
EP1919251A1 EP1919251A1 (fr) 2008-05-07
EP1919251B1 true EP1919251B1 (fr) 2010-09-01

Family

ID=37834157

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20060022602 Active EP1919251B1 (fr) 2006-10-30 2006-10-30 Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande

Country Status (2)

Country Link
EP (1) EP1919251B1 (fr)
DE (1) DE602006016617D1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103000185A (zh) * 2011-09-30 2013-03-27 斯凯普公司 处理信号
US9210504B2 (en) 2011-11-18 2015-12-08 Skype Processing audio signals

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2493327B (en) 2011-07-05 2018-06-06 Skype Processing audio signals
GB2495278A (en) 2011-09-30 2013-04-10 Skype Processing received signals from a range of receiving angles to reduce interference
GB2495472B (en) 2011-09-30 2019-07-03 Skype Processing audio signals
GB2495131A (en) 2011-09-30 2013-04-03 Skype A mobile device includes a received-signal beamformer that adapts to motion of the mobile device
GB2495130B (en) 2011-09-30 2018-10-24 Skype Processing audio signals
GB2495129B (en) 2011-09-30 2017-07-19 Skype Processing signals
GB201120392D0 (en) 2011-11-25 2012-01-11 Skype Ltd Processing signals
GB2497343B (en) 2011-12-08 2014-11-26 Skype Processing audio signals
CN103969630B (zh) * 2014-05-14 2016-09-14 哈尔滨工程大学 一种基于频率响应不变的稳健宽带波束形成方法
CN104133205B (zh) * 2014-06-30 2016-10-12 电子科技大学 一种树形宽带波束形成器
DE102015203600B4 (de) * 2014-08-22 2021-10-21 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. FIR-Filterkoeffizientenberechnung für Beamforming-Filter
EP3311590B1 (fr) * 2015-10-15 2019-08-14 Huawei Technologies Co., Ltd. Noeud de traitement de son d'un agencement de noeuds de traitement de son
EP3185589B1 (fr) * 2015-12-22 2024-02-07 Oticon A/s Dispositif auditif comprenant un système de commande de microphone
CN112327305B (zh) * 2020-11-06 2022-10-04 中国人民解放军海军潜艇学院 一种快速频域宽带mvdr声纳波束形成方法
CN116301195B (zh) * 2023-05-16 2023-09-05 湖南工商大学 函数波束优化方法与装置

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0321722D0 (en) * 2003-09-16 2003-10-15 Mitel Networks Corp A method for optimal microphone array design under uniform acoustic coupling constraints

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103000185A (zh) * 2011-09-30 2013-03-27 斯凯普公司 处理信号
CN103000185B (zh) * 2011-09-30 2016-01-13 斯凯普公司 处理信号
US9210504B2 (en) 2011-11-18 2015-12-08 Skype Processing audio signals

Also Published As

Publication number Publication date
DE602006016617D1 (de) 2010-10-14
EP1919251A1 (fr) 2008-05-07

Similar Documents

Publication Publication Date Title
EP1919251B1 (fr) Conditionner l'échantillonnage de la formation du faisceaux pour le realisation efficace de faisceaux à large bande
EP2936830B1 (fr) Filtre et procédé pour exécuter un filtrage spatial informé au moyen d'estimations instantanées multiples de sens d'arrivée
JP7175441B2 (ja) 雑音のある時変環境のための重み付け予測誤差に基づくオンライン残響除去アルゴリズム
US10123113B2 (en) Selective audio source enhancement
RU2713858C1 (ru) Устройство и способ для обеспечения индивидуальных звуковых зон
US9984702B2 (en) Extraction of reverberant sound using microphone arrays
Khaykin et al. Acoustic analysis by spherical microphone array processing of room impulse responses
KR102357287B1 (ko) 음장 기술을 생성하기 위한 장치, 방법, 또는 컴퓨터 프로그램
Kjems et al. Maximum likelihood based noise covariance matrix estimation for multi-microphone speech enhancement
CN111128210B (zh) 具有声学回声消除的音频信号处理的方法和系统
EP1517581B1 (fr) Une méthode à la conception d'un réseau optimal de microphone sous des contraintes de couplage acoustique uniforme
JP4973657B2 (ja) 適応アレイ制御装置、方法、プログラム、及び適応アレイ処理装置、方法、プログラム
CN108141691B (zh) 自适应混响消除系统
Berkun et al. Combined beamformers for robust broadband regularized superdirective beamforming
AU2001261344A1 (en) Interference suppression techniques
WO2007123047A1 (fr) Dispositif, procédé et programme de commande de réseau adaptatif et dispositif, procédé et programme associés de traitement de réseau adaptatif
JP4973656B2 (ja) 適応アレイ制御装置、方法、プログラム、及び適応アレイ処理装置、方法、プログラム
Dietzen et al. Partitioned block frequency domain Kalman filter for multi-channel linear prediction based blind speech dereverberation
Pan et al. Design of directivity patterns with a unique null of maximum multiplicity
US9036752B2 (en) Low-delay filtering
Leese Microphone arrays
Thomas et al. Optimal beamforming as a time domain equalization problem with application to room acoustics
Mukai et al. Evaluation of separation and dereverberation performance in frequency domain blind source separation
Kuno et al. A neural network approach to broadband beamforming
US7010556B1 (en) Antenna treatment method and system

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

17P Request for examination filed

Effective date: 20080510

AKX Designation fees paid

Designated state(s): DE FR GB

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

GRAL Information related to payment of fee for publishing/printing deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR3

17Q First examination report despatched

Effective date: 20090714

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 602006016617

Country of ref document: DE

Date of ref document: 20101014

Kind code of ref document: P

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20110606

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006016617

Country of ref document: DE

Effective date: 20110606

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230907

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230911

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230906

Year of fee payment: 18