We present some combinatorial problems which arise in the fields of music representation and music processing, in particular in the context of analysis of the harmonic structure of chord sequences. We are mainly concerned with problems related to chord sequences which exhibit a certain kind of regular harmonic structure, and provide also algorithms to solve some of them. In particular, we present an O(n+m)-time algorithm, based on bit-parallelism, to check whether a given chord progression of length n is regular, where m is the size of the chords in the progression.

On some combinatorial problems concerning the harmonic structure of musical chord sequences

CANTONE, Domenico;FARO, SIMONE
2008-01-01

Abstract

We present some combinatorial problems which arise in the fields of music representation and music processing, in particular in the context of analysis of the harmonic structure of chord sequences. We are mainly concerned with problems related to chord sequences which exhibit a certain kind of regular harmonic structure, and provide also algorithms to solve some of them. In particular, we present an O(n+m)-time algorithm, based on bit-parallelism, to check whether a given chord progression of length n is regular, where m is the size of the chords in the progression.
2008
music processing; harmonic structure analysis; chord sequences
File in questo prodotto:
File Dimensione Formato  
2008 CantoneCristofaroFaro IJFCS.pdf

solo gestori archivio

Tipologia: Versione Editoriale (PDF)
Licenza: Non specificato
Dimensione 303.96 kB
Formato Adobe PDF
303.96 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/7959
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact