IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9993396.html
   My bibliography  Save this article

Using a Solution Construction Algorithm for Cyclic Shift Network Coding under Multicast Network to the Transformation of Musical Performance Styles

Author

Listed:
  • Xiuqin Wang
  • Jun Geng
  • Zhiyuan Li
  • Zhihan Lv

Abstract

This paper presents a theoretical framework of the circular shift network coding system through the study of nonmultiple clustered interval music performance style conversion and the analysis of music conversion by using circular shift topology, and a series of basic research results of circular shift network coding is obtained under this framework. It reveals the essential connection between scalar network coding based on finite domain and cyclic shift network coding, designs a solution construction algorithm for cyclic shift network coding under multicast network, and portrays the multicast capacity of cyclic shift network coding. It overcomes the problem that the piano roll-curtain representation cannot distinguish between a single long note and multiple consecutive notes of the same pitch, describes musical information more comprehensively, extracts musical implicit style from the note matrix based on autoencoder, and better eliminates the potential influence of musical content on musical performance style. A two-way recurrent neural network based on the gated recurrent unit is used to extract a sequence of note feature vectors of different styles, and a one-dimensional convolutional neural network is used to predict the intensity of the extracted note feature vector sequence for a specific style, which better learns the intensity variation of different styles of MIDI music.

Suggested Citation

  • Xiuqin Wang & Jun Geng & Zhiyuan Li & Zhihan Lv, 2021. "Using a Solution Construction Algorithm for Cyclic Shift Network Coding under Multicast Network to the Transformation of Musical Performance Styles," Complexity, Hindawi, vol. 2021, pages 1-11, April.
  • Handle: RePEc:hin:complx:9993396
    DOI: 10.1155/2021/9993396
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9993396.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9993396.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/9993396?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:9993396. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.