Full metadata record
DC FieldValueLanguage
dc.contributor.authorBai, MRen_US
dc.contributor.authorTung, CWen_US
dc.contributor.authorLee, CCen_US
dc.date.accessioned2014-12-08T15:19:15Z-
dc.date.available2014-12-08T15:19:15Z-
dc.date.issued2005-05-01en_US
dc.identifier.issn0001-4966en_US
dc.identifier.urihttp://dx.doi.org/10.1121/1.1880852en_US
dc.identifier.urihttp://hdl.handle.net/11536/13777-
dc.description.abstractAn optimal design technique of loudspeaker arrays for cross-talk cancellation with application in three-dimensional audio is presented. An array focusing scheme is presented on the basis of the inverse propagation that relates the transducers to a set of chosen control points. Tikhonov regularization is employed in designing the inverse cancellation filters. An extensive analysis is conducted to explore the cancellation performance and robustness issues. To best compromise the performance and robustness of the cross-talk cancellation system, optimal configurations are obtained with the aid of the Taguchi method and the genetic algorithm (GA). The proposed systems are further justified by physical as well as subjective experiments. The results reveal that large number of loudspeakers, closely spaced configuration, and optimal control point design all contribute to the robustness of cross-talk cancellation systems (CCS) against head misalignment. (c) 2005 Acoustical Society of America.en_US
dc.language.isoen_USen_US
dc.titleOptimal design of loudspeaker arrays for robust cross-talk cancellation using the Taguchi method and the genetic algorithmen_US
dc.typeArticleen_US
dc.identifier.doi10.1121/1.1880852en_US
dc.identifier.journalJOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICAen_US
dc.citation.volume117en_US
dc.citation.issue5en_US
dc.citation.spage2802en_US
dc.citation.epage2813en_US
dc.contributor.department機械工程學系zh_TW
dc.contributor.departmentDepartment of Mechanical Engineeringen_US
dc.identifier.wosnumberWOS:000229068700016-
dc.citation.woscount16-
Appears in Collections:Articles


Files in This Item:

  1. 000229068700016.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.