Search arXivSearch

arXiv · 2201.05452

Multiphonic modeling using Impulse Pattern Formulation (IPF)

Abstract

Multiphonics, the presence of multiple pitches within the sound, can be produced in several ways. In wind instruments, they can appear at low blowing pressure when complex fingerings are used. Such multiphonics can be modeled by the Impulse Pattern Formulation (IPF). This top-down method regards musical instruments as systems working with impulses originating from a generating entity, travel through the instrument, are reflected at various positions, and are exponentially damped. Eventually, impulses return to the generating entity and retrigger or interact with subsequent impulses. Due to this straightforward approach, the IPF can explain fundamental principles of complex dynamic systems. While modeling wind instruments played with blowing pressures at the threshold of tone onset, the IPF captures transitions between regular periodicity at nominal pitch, bifurcations, and noise. This corresponds to behavior found in wind instruments where multiphonics appear at the transition between noise and regular musical note regimes. Using the IPF, complex fingerings correspond to multiple reflection points at open finger holes with different reflection strengths. Multiphonics can be modeled if reflection points farther away show higher reflection strength and thus, disrupt periodic motion. The IPF can also synthesize multiphonic sounds by concatenating typical wind instrument waveforms at adjacent impulse time points.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Linke, Rolf Bader, Robert Mores. 2022-01-14. Multiphonic modeling using Impulse Pattern Formulation (IPF). https://arxiv.org/abs/2201.05452

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Xiaomi-CocktailASR-1 Technical Report

Recently, large language model (LLM) based ASR models have achieved significant progress, yet they generally lack support for multi-speaker scenarios, where the cocktail party problem remains a critical bottleneck for further advancing ASR. Existing TS-ASR methods, including end-to-end architectures with speaker embeddings and latest LLM-based explorations suffer from degraded single-speaker performance and the inability to reject when the target speaker is absent. In this paper, we propose Xiaomi-CocktailASR-1, an LLM-based end-to-end TS-ASR architecture. By utilizing reference speech as voiceprint prompts, it directly transcribes the target speaker's speech without requiring speech separation. Xiaomi-CocktailASR-1 maintains competitive performance in single-speaker scenarios, comparable to mainstream ASR models. It also features a negative sample rejection capability, outputting empty text when the target speaker is absent from the mixed speech. Additionally, Xiaomi-CocktailASR-1 supports a Chain-of-Thought (CoT) reasoning mode to provide explicit reasoning steps. Extensive experiments on various synthetic and real-world multispeaker benchmarks demonstrate that Xiaomi-CocktailASR-1 achieves state-of-the-art performance, effectively addressing the cocktail party problem through a unified architecture that balances multispeaker and single-speaker recognition accuracy, along with rejection capability.

cs.SD

EConv-TasNet: Efficient Conv-TasNet for Effective Speech Separation

Conv-TasNet has served as a strong baseline for time-domain speech separation, and many studies have extended it with advanced architectures such as dual-path networks, U-Nets, and attention mechanisms. However, these methods often introduce high computational cost and complexity, limiting their deployment in resource-constrained scenarios. To address this issue, we propose eConv-TasNet, an efficient variant of Conv-TasNet that improves both effectiveness and efficiency without relying on resource-intensive modules. The proposed model consists of a group-wise early-splitting (GES) module and a multi-group feature aggregation (MGFA) module. GES generates discriminative speaker embeddings at intermediate stages, while MGFA progressively aggregates these group-level representations for refined mask estimation. Experimental results show that eConv-TasNet reduces model size by 22.4%, accelerates inference by 18.9%, and improves SI-SNRi by 14.0%-28.0% across three public benchmarks. Moreover, it achieves competitive performance compared with state-of-the-art methods while requiring significantly fewer parameters and lower inference cost. These results demonstrate a favorable efficiency-effectiveness trade-off for edge deployment.

cs.SD