Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Optimal Array Pattern Synthesis With Desired Magnitude Response|
|Abstract:||Letting Euclidean norm be the performance parameter, the task of finding the best approximation of a complex function in a finite dimension subspace leads to a convex optimization problem that can be easily solved by the least-squares method. However, this procedure leads to a sub-optimal solution in applications that have no phase requirements on the approximated function. In this case, semidefinite programming has been used to obtain optimal magnitude responses. In this work, this non-convex optimization problem is dealt with by using an iterative method based on the least-squares, which is illustrated on directivity synthesis by spherical loudspeaker arrays. Usually, instead of synthesize directly the desired pattern, the strategy adopted is to reproduce its truncated spherical harmonic representation. The truncation order is determined by the number of drivers of the spherical array. It is shown that truncation error and signal powers can be significantly reduced if phase error is neglected, providing potential means to improve directivity synthesis for applications requiring only magnitude response.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.