Lecture

Electroacoustic Absorbers: Performance Evaluation and Conclusions

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

EE-548: Audio engineering

This lecture is oriented towards the study of audio engineering, room acoustics, sound propagation, and sound radiation from sources and acoustic antennas. The learning outcomes will be the techniques for microphones and loudspeaker design, as well as room ...

Description

This lecture covers the performance evaluation and conclusions of electroacoustic absorbers, including control design, optimization, target impedance, room modal equalization, and objective evaluation in small and medium rooms. The presentation includes experimental setups, modal equalization graphs, and the decrease of modal decay times. The lecture also discusses the development of demonstration prototypes, new performance metrics, and methodologies for performance improvement, as well as future perspectives in absorber design and performance optimization.

Instructor

Hervé Lissek

Expertise Acoustics and audio engineering, Electroacoustics.Room acoustics.Active noise control.Acoustic metamaterials.Assisted reverberation.Psychoacoustics.Sound spatialization Expertise Acoustics and audio engineering, Electroacoustics.Room acoustics.Active noise control.Acoustic metamaterials.Assisted reverberation.Psychoacoustics.Sound spatialization Mission Head of the Acoustic Group at the Laboratory of Wave Engineering LWE. Research topics :Active Electroacoustic Resonators: turning conventional lou

Official source

Related concepts (17)

Program optimization

In computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.

Combinatorial optimization

Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.

Convex optimization

Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.

Optimizing compiler

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.

Peephole optimization

Peephole optimization is an optimization technique performed on a small set of compiler-generated instructions; the small set is known as the peephole or window. Peephole optimization involves changing the small set of instructions to an equivalent set that has better performance.

Related lectures (64)

Energy optimization strategies

Covers brainstorming options for smart operation changes, heat recovery, and PV panel performance.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Optimization and Simulation

Covers optimization and simulation techniques for drawing from multivariate distributions and dealing with correlations.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Boolean Algebra: Properties and Optimization