JP3533482B2 - Melody conversion device and method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a melody conversion device and a method thereof.

[0002]

2. Description of the Related Art In a conventional melody conversion apparatus, pitch data of a plurality of notes constituting an arbitrary music piece is changed and converted to another music piece. In the melody conversion in this case, there is a method in which the pitch of a note in a predetermined section, for example, one measure, is uniformly shifted upward or downward by a semitone.

[0003]

However, the conversion method of the above-mentioned conventional melody conversion apparatus uniformly shifts the pitch upward or downward by one semitone, so that the pitch difference between each note does not change. However, there is a problem that it is impossible to meet various needs for melody conversion. On the other hand, when the pitches of the notes are arbitrarily exchanged, as the number of notes in one measure increases, the number of combinations increases. For example, when there are eight notes in one bar, there are 40319 combinations of pitch replacement, so it is extremely necessary for the user to realize all combinations without duplication and without omission. There was a problem that it involved difficult work.
SUMMARY OF THE INVENTION It is an object of the present invention to meet various needs for melody conversion and to prevent the melody conversion from involving a difficult operation of a user.

[0004]

According to the first aspect of the present invention, a number corresponding to each of n note data constituting a melody to be changed is assigned, and the n note data are assigned. And a numerical value p (0 ≦ p <n) indicating one of all combinations (n! Types) of the n pieces of note data after the change.
! ) For inputting the change command information including the following: and a numerical value p included in the change command information from the input means is set to 0.
~ (N-1)! It decomposes at each _{number, p = Σi k × (n} -1-k)! However, k = 0,1,2 ... (n- 3), in order to determine each coefficient _{i k} when expressed as (n-2), first, k
Is set to 0, _{pk = 0} = p, and this _pk is (n−1−k)! The coefficient i _k is generated by repeating the operation of setting the integer value obtained by the division by _ik and setting the remainder of the division to a value p _{k + 1} used for the next operation while sequentially incrementing the value of _k . a generation unit, a storage area corresponding to the number of all i _k generated by the generating means, a first for sequentially storing the i _k generated by said generating means and the value of k in the address in the corresponding storage area And n storage areas, and each storage area has n stored in the storage means.
A second buffer number can be respectively stored indicating the number of note data sequentially by scanning the respective storage areas of the second buffer from the beginning with sequentially reading i _k stored in the first buffer The position of the free storage area is detected, and the number indicating the note data is determined based on the read _ik and the position of the free storage area of the second buffer. A rearrangement order determining unit for storing a number indicating the determined note data; and a rearranging unit for rearranging the note data of the storage unit in a numerical order indicating the respective note data stored in the second buffer. It is characterized by having. In the invention according to claim 2, a number corresponding to each of n pieces of note data constituting a melody to be changed is assigned, and the n pieces of note data are stored in a storage means. The user inputs change command information including a numerical value p (0 ≦ p <n!) Indicating one of all combinations (n! Types) of the n pieces of note data after the change. Numerical value p included in change command information
From 0 to (n-1)! It decomposes at each _{number, p = Σi k × (n} -1-k)! However, k = 0,1,2 ... (n- 3), in order to determine each coefficient _{i k} when expressed as (n-2), first, k
Is set to 0, _{pk = 0} = p, and this _pk is (n−1−k)! The coefficient i _k is generated by repeating an arithmetic process in which the integer value divided by is set to i _k and the remainder value of the division is a value p _{k + 1} used for the next operation while sequentially incrementing the value of _k , the first buffer having a storage area corresponding to the number of all the generated i _k, sequentially stores the i _k generated by the value of k in the address to a corresponding said storage area, said first buffer sequentially reads the stored i _k, each of n husband number indicating the n pieces of note data stored in said storage means in each storage area has a storage area of s storable second buffer By scanning the storage area from the beginning, the position of the empty storage area is sequentially detected,
A number indicating the note data is determined based on the read _ik and the position of the free storage area of the second buffer, and a number indicating the determined note data at the detected free storage area position. Is stored, and the note data in the storage means is rearranged in numerical order indicating the respective note data stored in the second buffer.

[0005]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a melody conversion device according to the present invention will be described below with reference to FIGS. FIG.
FIG. 2 is a block diagram illustrating a hardware configuration of an embodiment of a melody conversion device. The keyboard unit 1 inputs a pitch, a start timing of a sound from the beginning of a bar, a sound generation time, and the like by a user's depression or performance. The key press detection circuit 2 detects the depression of the keyboard unit 1 and converts it into melody data such as pitch data, clock time data, gate time data, and the like. The switch group (input means) 3 controls the volume, timbre,
In addition to inputting octave switching and performance mode, a change number (change command information) for changing pitch data at the time of melody conversion is input. The switch detection circuit 4 detects an input from the switch group 3 and converts it into melody data. The CPU (control means) 5 is provided with a key press detection circuit 2, a switch detection circuit 4, a program ROM 7, a work RAM (storage means) 8, a data ROM 9, and a display unit 1 via a bus 6.
0 and the melody generating circuit 11
This device is controlled based on a program stored in OM7. Then, the melody data provided from the key press detection circuit 2 and the switch detection circuit 4 are stored in the work RAM 8.
And supplies it to the melody generating circuit 11 after performing predetermined processing. The melody generating circuit 11 generates a digital sound signal based on the melody data supplied from the CPU 5 and supplies the digital sound signal to the D / A converter 12. The D / A converter 12 converts the digital audio signal into an analog audio signal and supplies the analog audio signal to the speaker 14 via the power amplification circuit 13. Therefore, a song corresponding to the user's keyboard operation and switch operation, that is, the user's manual performance is emitted from the speaker 14.

On the other hand, the melody data of the music is stored in the data ROM 9 in advance. Then, the user can change the pitch data of the musical notes of the music stored in the data ROM 9 within one bar and convert it to another melody. For this reason, the work RAM 8 is provided with an original data area 80 for storing the melody data of a one-note note serving as a conversion source. FIG. 2 shows the format of the melody data stored in the original data area 80. The melody data corresponds to n notes in one measure, and pitch data (note data) # 1 to # indicating the pitch.
n, clock time data 1 to n indicating the clock time from the beginning of the bar, and gate time data 1 indicating the sound generation time
To n. In this case, the pitch data is 0 to 127
The pitch can be indicated in 128 levels. At the end of the data, a bar end is stored. Work RAM
8 is provided with a ma (address data area) 82 for setting an address of the original data area 80. Further, the work RAM 8 is provided with a new data area 81 for storing melody data of a new note of one measure after the change. And this new data area 8
An sa (address data area) 83 for setting an address of 1 is provided. In addition, the work RAM 8 stores a data area 84 for storing the change number p input from the switch group 3, a data area 85 for storing the number of notes in one measure of the original data area, and data calculated according to the change number p. TBUF86 and JBUF87, J to be stored
A USEBUF 88 that indicates the state of the BUF 87 by a flag is provided.

As shown in FIG. 2, the melody data stored in the original data area 81 of the work RAM 8 corresponds to n notes in one bar, and pitch data (note data) # 1 to 1 indicating the pitch. #N, clock time data 1 to n indicating the clock time from the beginning of the bar, and gate time data 1 to n indicating the sound generation time. In this case, the pitch data can indicate the pitch in 128 stages from 0 to 127. At the end of the data, bar end data is stored. FIG. 3 shows TBUF86 and JBUF8.
7 shows the data structure of USEBUF88. TBUF8
Numerical data i ₀ , i ₁ , i ₂ ,.
i _n−2 and i _n−1 are calculated by predetermined arithmetic expressions, which will be described later.

Next, a melody conversion method in the embodiment will be described with reference to a flowchart of a melody conversion process by the CPU 5 shown in FIG. First, the number of notes in one bar shown in FIG. 2 is counted (step S1). FIG. 5 shows a flowchart of the note number counting process. In this process, the melody data start address of FIG. 2 is set in ma82 (step S11), and "0" is set in the data area 85 (step S12). Next, ma8
It is determined whether or not the data (ma) of No. 2 is a bar end (step S13). If it is not the bar end, it is determined whether or not the data (ma) is pitch data (step S14). If the data (ma) is pitch data, in step S15, 1 is added to n and incremented, and the process proceeds to step S15. If the data (ma) is not pitch data but rest data or the like, Directly proceeds to step S15. In step S15, ma82
Is added to the value of, i.e., the address of the next pitch data (strictly speaking, there may be rest data instead of pitch data). Then, the process proceeds to step S13, and steps S13 to S13 are performed until the data (ma) reaches the bar end.
The process of step S16 is repeatedly executed to count pitch data, that is, the number of musical notes. And the data (ma)
Has reached the end of the bar, the process proceeds to step S2 in the flowchart of FIG.

In step S2 of FIG. 4, it is determined whether or not the value of n in the data area 85 is "0". If n is "0", there is no pitch data in one bar. Since there is no note, the melody conversion process ends, and if n is not "0", TBUF generation is executed (step S3). FIG. 6 shows a flowchart of the TBUF generation processing. In performing this processing, the change number p (however, 0
≦ p <n! ), P _k = Σi _k · (n−1−k)! (K = 0 to n−2). However, in this case, 0 ≦ i ₀ ≦ n−1,
0 ≦ i ₁ ≦ n−2, 0 ≦ i ₂ ≦ _n−3 ,.
2, 0 ≦ i _n−2 ≦ 1, i _n−1 = 0. In FIG. 6, the pointer k is set to "0" (step S2).
1), _pk, that is, p ₀ in this case, is set as the input change number p (step S22). Next, the following equation: i _k = p _k / (n−1−k)! Numerical data i ₀ , i ₁ , i ₂ ,..., in _-2 are calculated from p _{k + 1} = mod i _k k = 0, 1, 2,... (n-3), (n−2). (Step S23), it is stored in the TBUF 86 (Step S24). In this equation, mod i
_k is p _k / (n−1−k)! Is the remainder of Then, k
Is incremented by "1" (step S25), and it is determined whether or not k has reached n-1 (step S26). Then, the respective processes of steps S23 to S26 are repeatedly executed until k reaches n-1. When _k reaches n-1, i _k = 0, i.e., i
Assuming that _n-1 = 0 (step S27), it is stored in the TBUF 86 (step S28). Thereafter, step S in FIG.
The processing shifts to JBUF generation processing 4.

Next, permutation data is generated in accordance with the array of numerical data stored in the TBUF 86, and this is referred to as JBUF.
The operation of the JBUF generation process stored in the storage unit 87 will be described. In this case, the data previously used in the JBUF 87 is stored so as not to be used redundantly. For this reason, the process shown in the flowchart of the JBUF generation process shown in FIG. 7 is executed. First, the pointer j is set to "0" (step S31), and all areas of the USEBUF 88 of the work RAM 8 are set to "0" (step S3).
2). Each area of USEBUF88 corresponds to each area of JBUF87, and when data is stored in an arbitrary area of JBUF87, the USB corresponding to the area is stored.
The area of the UF 88 is set from “0” to “1”.
Here, since data is not yet stored in all the areas of the JBUF 87, all the areas of the USEBUF 88 are set to “0”. Next, TB of address j
The numerical data of the UF 86 is set as data x in the register of the CPU 5 (step S33), and the USEBUF 88
"0" is set to the pointer m (step S3).
4). Next, it is determined whether or not the flag of the USEBUF 88 at the address m is “0” (step S35). If the flag is not "0", "1" is added to the address m (step S36), and it is determined whether or not the flag of the USEBUF 88 of the address m is "0". And USEBUF8
The address m is added until the flag of 8 reaches the area of "0", and when it reaches the area of "0", it is determined whether or not x is "0" (step S37). If x is not "0", "1" is subtracted from x (step S38), and a pointer m is added in step S36, USE of address m
The processing of step S35 for determining whether or not the flag of the BUF88 is "0" and the processing of step S37 for determining whether or not the pointer x is "0" are executed. When x becomes “0”, the value of the pointer m is stored in the area of the address j of the JBUF 87 (step S39), and the USEBU of the address m is stored.
The flag of F88 is set to "1" (step S4)
0). Next, “1” is added to the pointer j (step S
41) It is determined whether or not j is the same as the number n of notes stored in the data area 85 (step S42). j is n
If not, the processing from step S33 to step S42 is repeatedly executed. If j = n, the processing shifts to the music piece replacement processing in step S5 in FIG.

The music data exchange process in step S5 is as follows.
As shown in FIG. 8, the start address of the new data area 81 is set in sa83 (step S51), and the start address of the original data area 80 is set in ma82 (step S52). Next, the pointer j is set to "0" (step S53), and steps S54 to S56 are performed.
, While the pointer j is incremented by “1”, the pitch data in the original data area 80 is added to the JBUF 87
Are sequentially transferred to the new data area 81 based on the permutation data. When j becomes n-1, that is, when n pieces of pitch data have been transferred from the original data area 80 to the new data area 81, the pointer j is set to "0" again (step S57). Next, in steps S58 to S60, the pitch data of the new data area 81 is sequentially transferred to the original data area while incrementing the pointer j by "1". When j becomes n-1, that is, when all pitch data have been transferred from the new data area 81 to the original data area 80, the process returns to the main routine (not shown).

Next, n = 3, that is, the number of notes in one measure is three
The melody conversion in the case of the number will be described. In this case, the possible value of the change number p is 0 ≦ p <3! That is, 6
Therefore, p = 0 to 5. Therefore, FIG.
As shown in FIG. 6, TBUF generation processing in FIG.
Numerical data is stored in BUF86, and JB in FIG.
The permutation data is stored in the JBUF 87 by the UF generation processing. Then, based on the permutation data, the pitch data of the original data area 80 is transferred to the new data area 81 along the arrow in FIG.

FIG. 10 shows an example of melody conversion when n = 8. FIG. 10A shows a tune having notes n1 to n8 in one bar. In this case, when an arbitrary change number p is input from the switch group 3, the permutation data is automatically generated according to the change number p, and as shown in FIG. The high data is transferred to the new data area 81 along the arrow. As a result, as shown in FIG. 10B, the melody is converted into a note of one measure.

As described above, in the above-described embodiment, the permutation data to be stored in the JBUF 87 is generated in accordance with the input change number p, and one permutation is performed based on the generated permutation data.
The pitch data of an original note in a bar is automatically rearranged and changed to the pitch data of a new note. Therefore,
In addition to meeting various melody conversion needs, the melody conversion does not involve the user's difficult work.

[0015]

According to the first or second aspect of the present invention, a number corresponding to each of the n pieces of note data to be changed is assigned, and all of the n pieces of note data after the change are assigned. When a change number p indicating one of the combinations is input from the switch group, the change number p is set to all the combinations 0 to (n-1)! Decomposes at each number, the following calculation formula _{p = Σi k × (n-} 1-k)! , The value of k is 0, 1, 2,... (N−3), (n−
While sequentially incrementing 2), pk corresponding to each value of _k is (n−1−k)! Division by integer value with the i _k in the value p using the remainder value of the division to the next operation
_The calculation processing of _{k + 1} is repeated to generate each coefficient _ik , _ik is sequentially stored using the value of k as an address, and sequentially detected from each storage area capable of storing a number indicating n note data. order of the numbers indicating the note data determined based on the values of the position and k of free storage area for which the i _k you address, by rearranging the n-number of note data to be changed, various melodies conversion of the user And the melody conversion does not involve any difficult work of the user.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a melody conversion device according to an embodiment of the present invention.

FIG. 2 is an exemplary view showing melody data in a work RAM according to the embodiment.

FIG. 3 is an exemplary view showing a configuration of a data area of a work RAM in the embodiment.

FIG. 4 is a flowchart of a melody conversion process according to the embodiment.

FIG. 5 is a flowchart of a subroutine for counting the number of notes in FIG. 3;

FIG. 6 is a flowchart of a subroutine of a TBUF generation process of FIG. 3;

FIG. 7 is a flowchart of a subroutine of a JBUF generation process of FIG. 3;

FIG. 8 is a flowchart of a subroutine of a music data exchange process of FIG. 3;

FIG. 9 is a diagram showing a melody conversion state in the case where the number of notes is three in the embodiment.

FIG. 10 is an exemplary view showing an example of a melody conversion note in the embodiment;

[Explanation of symbols]

5 CPU 8 Work RAM 9 Data ROM 80 Original data area 81 New Data Area

Claims (2)

(57) [Claims] 1. n pieces of a melody to be changed
It is assumed that numbers corresponding to the note data of
The storage means in which the n pieces of note data are stored , and all combinations of the n pieces of note data after the change.
Numerical value p (0 ≦
p <n! ) For inputting the change command information including the change command information, and a numerical value p included in the change command information from the input means.
From 0 to (n-1)! It decomposes at each _{number, p = Σi k × (n} -1-k)! However, k = 0,1,2 ... (n- 3), in order to determine each coefficient _{i k} when expressed as (n-2), first, k
As 0, and _{p k =} 0 _{= p,} the _{p k (n-1-k} )! The integer value divided by
using the remainder value of the division to the next operation with the i _k
The calculation process of setting the value p _{k + 1} to the value k is sequentially incremented.
By repeating while instrument, generate each coefficient i _k
Generating means, and storage areas for the number of i _k generated by the generating means.
With the value of k as an address and
The sequentially stores i _k generated in the corresponding storage area
One buffer, and n storage areas, wherein each storage area has the storage means.
The numbers indicating the n pieces of note data stored in
A second buffer capable憶, when sequentially reading the i _k stored in the first buffer
Both run from the beginning in each storage area of the second buffer.
The position of the empty storage area is sequentially detected by
The read _ik and empty storage of the second buffer
Determines the note data number based on the location of the area
The determined free storage area position is
To determine the sort order to store the number indicating the note data
A row and each of the note data stored in the second buffer;
In which the note data in the storage means are rearranged in numerical order.
A melody conversion device, comprising: a replacement unit . 2. The n melody which constitutes the melody to be changed
It is assumed that numbers corresponding to the note data of
The n note data is stored in the storage means, and all combinations of the n note data after the change are stored.
Numerical value p (0 ≦
p <n! ) Is input, and the numerical value p included in the input change instruction information is
0- (n-1)! It decomposes at each _{number, p = Σi k × (n} -1-k)! However, k = 0,1,2 ... (n- 3), in order to determine each coefficient _{i k} when expressed as (n-2), first, k
As 0, and _{p k =} 0 _{= p,} the _{p k (n-1-k} )! The integer value divided by
using the remainder value of the division to the next operation with the i _k
The calculation process of setting the value p _{k + 1} to the value k is sequentially incremented.
Generates each coefficient i _k By repeating while instruments
And, first having a storage area corresponding to the number of all i _k This generated
Is generated using the value of k as an address for
Sequentially storing that i _k in the corresponding the storage area, the out sequentially reading the i _k stored in the first buffer
Both have n storage areas, and each storage area
The number indicating the n note data stored in the storage means
Whether each storage area of the second buffer that can be stored respectively is the first
Detecting empty storage area position sequentially by scanning from
And the read _ik and the empty space of the second buffer.
Number indicating the note data based on the location of the storage area
Is determined, and the determined
A number indicating the specified note data is stored, and each note data stored in the second buffer is indicated.
A melody conversion method , wherein the musical note data in the storage means is rearranged in numerical order .