DEVELOPMENT OF A LOW COST IMPEDANCE TUBE TO MEASURE THE ACOUSTIC ABSORPTION AND TRANSMISSION LOSS OF MATERIALS

Traditional methods of measuring sound absorption coefficient and sound transmission loss of a material are time consuming. To overcome this limitation, normal incidence sound absorption and transmission loss measurement technique was developed. Unfortunately the equipment required for this task is equally expensive. Hence efforts are taken to develop a cost-effective equipment for measuring normal incidence sound absorption coefficient and transmission loss. An impedance tube capable of measure absorption coefficient and transmission loss is designed and built under a budget of $1500 for educational institutes. A background study is performed to gain knowledge and understanding of the normal incidence measurements technique. Based on the literature review, parameters involved such as tube material, source and microphone properties, sample holders, etc. are discussed in depth. Based on these parameters, design options are generated to meet the cost and functionality targets pre-assigned. After selection of materials and components, an impedance tube is built and tested using three fibrous absorption materials for absorption and a barrier for transmission loss performance. These measured results then compared with those obtained with the help of industry recognized Brüel & Kjær impedance tube. The results show performances are comparable, hence validation the new built tube.

HIGH PERFORMANCE, LOW COST SUBSPACE DECOMPOSITION AND POLYNOMIAL ROOTING FOR REAL TIME DIRECTION OF ARRIVAL ESTIMATION: ANALYSIS AND IMPLEMENTATION

This thesis develops high performance real-time signal processing modules for direction of arrival (DOA) estimation for localization systems. It proposes highly parallel algorithms for performing subspace decomposition and polynomial rooting, which are otherwise traditionally implemented using sequential algorithms. The proposed algorithms address the emerging need for real-time localization for a wide range of applications. As the antenna array size increases, the complexity of signal processing algorithms increases, making it increasingly difficult to satisfy the real-time constraints. This thesis addresses real-time implementation by proposing parallel algorithms, that maintain considerable improvement over traditional algorithms, especially for systems with larger number of antenna array elements. Singular value decomposition (SVD) and polynomial rooting are two computationally complex steps and act as the bottleneck to achieving real-time performance. The proposed algorithms are suitable for implementation on field programmable gated arrays (FPGAs), single instruction multiple data (SIMD) hardware or application specific integrated chips (ASICs), which offer large number of processing elements that can be exploited for parallel processing. The designs proposed in this thesis are modular, easily expandable and easy to implement. Firstly, this thesis proposes a fast converging SVD algorithm. The proposed method reduces the number of iterations it takes to converge to correct singular values, thus achieving closer to real-time performance. A general algorithm and a modular system design are provided making it easy for designers to replicate and extend the design to larger matrix sizes. Moreover, the method is highly parallel, which can be exploited in various hardware platforms mentioned earlier. A fixed point implementation of proposed SVD algorithm is presented. The FPGA design is pipelined to the maximum extent to increase the maximum achievable frequency of operation. The system was developed with the objective of achieving high throughput. Various modern cores available in FPGAs were used to maximize the performance and details of these modules are presented in detail. Finally, a parallel polynomial rooting technique based on Newton’s method applicable exclusively to root-MUSIC polynomials is proposed. Unique characteristics of root-MUSIC polynomial’s complex dynamics were exploited to derive this polynomial rooting method. The technique exhibits parallelism and converges to the desired root within fixed number of iterations, making this suitable for polynomial rooting of large degree polynomials. We believe this is the first time that complex dynamics of root-MUSIC polynomial were analyzed to propose an algorithm. In all, the thesis addresses two major bottlenecks in a direction of arrival estimation system, by providing simple, high throughput, parallel algorithms.