z-logo
open-access-imgOpen Access
Initial Development of a Temporal-Envelope-Preserving Nonlinear Hearing Aid Prescription Using a Genetic Algorithm
Author(s) -
Andrew T. Sabin,
Pamela E. Souza
Publication year - 2013
Publication title -
trends in amplification
Language(s) - English
Resource type - Journals
eISSN - 1940-5588
pISSN - 1084-7138
DOI - 10.1177/1084713813495981
Subject(s) - hearing aid , envelope (radar) , audiology , speech perception , speech recognition , computer science , medical prescription , metric (unit) , perception , hearing loss , algorithm , medicine , psychology , engineering , telecommunications , radar , operations management , neuroscience , pharmacology
Most hearing aid prescriptions focus on the optimization of a metric derived from the long-term average spectrum of speech, and do not consider how the prescribed values might distort the temporal envelope shape. A growing body of evidence suggests that such distortions can lead to systematic errors in speech perception, and therefore hearing aid prescriptions might benefit by including preservation of the temporal envelope shape in their rationale. To begin to explore this possibility, we designed a genetic algorithm (GA) to find the multiband compression settings that preserve the shape of the original temporal envelope while placing that envelope in the listener's audiometric dynamic range. The resulting prescription had a low compression threshold, short attack and release times, and a combination of compression ratio and gain that placed the output signal within the listener's audiometric dynamic range. Initial behavioral tests of individuals with impaired hearing revealed no difference in speech-in-noise perception between the GA and the NAL-NL2 prescription. However, gap detection performance was superior with the GA in comparison to NAL-NL2. Overall, this work is a proof of concept that consideration of temporal envelope distortions can be incorporated into hearing aid prescriptions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here