Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1109.6270

Fractal String Generation and Its Application in Music Composition

Avishek Ghosh·Joydeep Banerjee·Sk. S. Hassan·P. Pal Choudhury
View original source ↗Read source document ↗Export metadata ↓

Abstract

Music is a string of some of the notes out of 12 notes (Sa, Komal_re, Re, Komal_ga, Ga, Ma, Kari_ma, Pa, Komal_dha, Dha, Komal_ni, Ni) and their harmonics. Each note corresponds to a particular frequency. When such strings are encoded to form discrete sequences, different frequencies present in the music corresponds to different amplitude levels (value) of the discrete sequence. Initially, a class of discrete sequences has been generated using logistic map. All these discrete sequences have at most n-different amplitude levels (value) (depending on the particular raga). Without loss of generality, we have chosen two discrete sequences of two types of Indian raga viz. Bhairabi and Bhupali having same number of amplitude levels to obtain/search close relatives from the class. The relative / closeness can be assured through correlation coefficient.The search is unbiased, random and non-adaptive. The obtained string is that which maximally resembles the given two sequences. The same can be thought of as a music composition of the given two strings. It is to be noted that all these string are fractal string which can be persuaded by fractal dimension.

Explore related subjects

cs.SDcs.DM

Keep this discovery

BibTeXRIS

Avishek Ghosh, Joydeep Banerjee, Sk. S. Hassan, P. Pal Choudhury. 2011-09-27. Fractal String Generation and Its Application in Music Composition. https://arxiv.org/abs/1109.6270

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗