Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Applied Mathematics | en_US |
| dc.contributor.advisor | Yiu, Ka-fai Cedric (AMA) | en_US |
| dc.creator | He, Qi | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/12275 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | On the beamforming design | en_US |
| dcterms.abstract | Beamforming is an essential technique in speech enhancement, which has been applied to many applications, including wireless communication, hands-free communication, and speech recognition. This thesis mainly focuses on the beamformer design and sensor array localization problem via optimization techniques in the distributed network. | en_US |
| dcterms.abstract | Firstly, we consider the microphone array localization problem with time-difference-of-arrival (TDOA) measurements. We formulated the problem which applied the known source locations to identify the wireless array configuration and estimate the location for each array. The proposed method formulates a mixed semidefinite programming (SDP) and second-order cone programming (SOCP) relaxation model. Then the acoustic geometry calibration is obtained by solving a convex optimal programming. The characteristics of the optimal solution are studied, and exact relaxation conditions are given. In addition, two methods are proposed to give an offset of the random internal error caused by the recording procedure. Experimental results demonstrate the proposed mixed model in 2-dimensional and 3-dimensional space, which outperforms other relaxation methods. | en_US |
| dcterms.abstract | Then, with the given locations, a near-field broadband beamformer based on IIR filters performing spatial and frequency filtering is designed. The coefficients of the beamformer can be found from an optimal minimax problem which minimizes the error between the desired response and the actual response. We proposed a decom-position method to solve the stability problem, and two optimization algorithms are considered to obtain a global solution. Since the design problem is very complex and highly nonlinear due to the need for stability constraints, a specific structure is proposed to simplify the problem, Furthermore, the performance limit of the general and specific structure is analyzed. Results show that significantly fewer coefficients are needed than for FIR filter designs, and the corresponding computational load in the implementation decreases. | en_US |
| dcterms.abstract | Finally, two adaptive beamformers are designed in the modulation domain, bypassing the need of spatial information. The beamformers are designed based on the least square (LS) error between the desired and estimated signals and the maximum signal-to-noise ratio (SNR). The proposed methods have been evaluated by three indicators, including STOI, noise suppression, and signal distortion. The results show that the beamformers designed in the modulation domain outperform the counterparts developed in the frequency domain. | en_US |
| dcterms.extent | xv, 154 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2023 | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.LCSH | Beamforming | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/12275