JP2000099011A - Automatic arranging device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To generate the performance data suited to original music and to easily generate rich sound performance information. SOLUTION: A melody of a certain part of the original music is inputted to a melody memory 4, and the chord data of the original music are inputted to a code advance memory 5. A rhythm pattern of a rhythm pattern memory 12 is selected according to the style and the composition constitution of the original music. A top note, an added sound, a bass part and a drum part are generated at the timing of the note code of the selected rhythm pattern. The top note according to a chord is generated from a top note table of a top note table memory 15, and the added sound according to the top note and the chord is generated from a voicing table of a voicing table memory 16. The top note and the added sound are selected from a continuous two sound pair.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an automatic arranging apparatus for automatically generating performance data for a plurality of performance parts of an original tune by inputting a melody or chord progression of the original tune. About.

[0002]

2. Description of the Related Art Conventionally, in the field of automatic arranging, an attempt has been made to input or store in advance performance data of a melody part of an original music piece and to automatically generate performance data of another part based on the performance data. However, it was difficult to generate a part suitable for the original song. For example, in some of these attempts, performance data is generated based on the tonality, style, and chord of the original music, but the generated performance data still gives a simple and unnatural impression.

[0003]

SUMMARY OF THE INVENTION The present invention relates to an automatic arranging apparatus for automatically generating another part based on performance data of a certain part of an original music. It is an object of the present invention to easily generate performance information having a resounding sound.

[0004]

According to a first aspect of the present invention, there is provided an automatic arrangement apparatus for generating performance information of a part other than a melody to be added to a melody. In the automatic arranging device, a rhythm pattern storage means for storing a plurality of rhythm patterns at least indicating a sounding timing and having no pitch information, and a rhythm pattern of a song to be created is selected from the plurality of rhythm patterns. Selecting means, chord progression supplying means for supplying a chord progression corresponding to the melody, and a plurality of note names which can be used for each chord as performance information of parts other than the melody and include note names other than the chord constituent sounds. Note name candidate storage means for storing candidates, for each chord, and for each note name candidate, additional sound storage means for storing an additional sound to be added to the note name, The selected rhythm pattern is read from the rhythm pattern storage unit, and for each sounding timing of the rhythm pattern, any one of a plurality of note name candidates usable in the chord indicated by the supplied chord progression is selected, The supplied chord and the additional sound corresponding to the selected note name candidate are read out from the additional sound storage means, and these are added together with the note name information of the additional sound and the note name information of the selected note name candidate. And performance information generating means for generating performance information corresponding to the note name information of the part as performance information of parts other than the melody.

According to a second aspect of the present invention, there is provided an automatic arrangement apparatus for generating performance information of a part other than a melody to be added to a melody. Rhythm pattern storage means for storing a rhythm pattern having no pitch information, pitch information supply means for supplying pitch information of the melody, chord progression supply means for supplying a chord progression corresponding to the melody, A pitch name candidate storage unit that stores a plurality of pitch name candidates that can be used as performance information of parts other than the melody for each chord, and that is added to the pitch name for each chord and for each pitch name candidate. A rhythm pattern is read from the additional sound storage means storing the power addition sound to be stored, and the rhythm pattern is read from the rhythm pattern storage means. Among a plurality of pitch names candidate corresponding to chord indicated chord progression was, while select one with reference to the pitch information of the melody corresponding to the tone generation timing,
The supplied chord and the additional sound corresponding to the selected note name candidate are read out from the additional sound storage means, and these are added together with the note name information of the additional sound and the note name information of the selected note name candidate. And performance information generating means for generating performance information corresponding to the note name information of the part as performance information of parts other than the melody.

According to a third aspect of the present invention, there is provided an automatic arrangement apparatus for generating performance information of a part other than a melody to be added to a melody. Rhythm pattern storage means for storing a rhythm pattern having no pitch information, a chord progression supply means for supplying a chord progression corresponding to the melody, and, for each chord, usable as performance information of parts other than the melody. A note name candidate storing means for storing a plurality of note name candidates; an additional sound storing means for storing, for each chord and for each note name candidate, an additional sound to be added to the note name; The rhythm pattern is read from the means, and for each sounding timing of the rhythm pattern, a plurality of note name candidates corresponding to the chord indicated by the supplied chord progression are read out. While referring to the previously generated performance information and selecting any one of them, the supplied chord and the additional sound corresponding to the selected note name candidate are read from the additional sound storage means, and the note name information of the additional sound and Performance information generating means for generating performance information corresponding to the selected note name information as performance information of a part other than the melody, together with the note name information of the selected note name candidates. .

According to a fourth aspect of the present invention, there is provided an automatic arrangement device according to the first or second or third aspect, wherein the additional sound storage means is provided for each chord and each note name candidate. A plurality of additional sound candidates are stored, and the performance information generating means uses any one of the plurality of additional sound candidates selected as the performance information.

[0008]

According to the automatic arrangement device of the first, second or third aspect of the present invention, since there is no information for designating the pitch of each rhythm pattern, the storage capacity of the rhythm pattern is reduced. In addition, it is possible to easily generate rich sounding performance information including a note name selected from any of the note name candidates and an additional sound suitable for the selected note name.

In particular, according to the automatic arranging device of the first aspect,
Since any one of a plurality of tone name candidates including non-chord constituent tones usable for the supplied chord is selected, performance information suitable for the chord can be generated, and further, other than the chord constituent tones. Can also be generated, so that various performance information can be created.

According to the automatic arranging device of the second aspect,
Since any one of a plurality of pitch name candidates is selected with reference to the pitch information of the melody, performance information suitable for the melody can be generated.

[0011] According to the automatic arrangement device of the third aspect,
Since any one of the plurality of tone name candidates is selected with reference to the previously generated performance information, it is possible to generate performance information with a natural flow.

Further, according to the automatic arranging device of the fourth aspect,
In addition to the effects of the first to third aspects, since a plurality of additional sound candidates are provided for one note name candidate, a large amount of performance information can be generated with a small storage capacity.

[0013]

FIG. 1 is a block diagram of an automatic arrangement apparatus according to an embodiment of the present invention. A CPU 1 controls the entire apparatus by using a working area of a working memory 3 based on a control program stored in a program memory 2. I do. Then, the performance data stored in the melody memory 4,
Based on the chord progression data (time-series chord data) stored in the chord progression memory 5, the style of the music to be input and the composition of the passages, the backing part mainly in the mid-range such as guitar and strings, and the bass guitar The performance data of the bass part and the drum part of the percussion instrument timbre, mainly of the low tone range, such as the timbre and the tuba, are stored in the backing part memory 6, the base part memory 7, and the drum part memory 8, respectively. Note that a predetermined clock is set as the note timing and interval in the performance data, for example, a quarter note is made to correspond to 24 clocks, and this clock value is used as time information.

The performance data stored in the melody memory 4 and the chord data stored in the chord progression memory 5 are:
For example, the data is input from an external device via the input / output interface 9 and stored in a predetermined format.
For example, as shown in FIG. 4, chord data is stored in order from the beginning of a song together with duration data indicating the duration of the chord by setting the root of the chord and a chord type, and ending at the end of the song. The code is stored. The performance data is stored, for example, as a set of melody key codes and timing data. They are,
The operator may directly play and input, or an already completed one may be transferred as a data file.

The style and passage composition of the music are input and set by the display on the display unit 10 and the operation of the operation unit 11 as intended by the operator. FIG. 5 shows a display example when a phrase configuration is input. First, when the process of the phrase configuration input is performed, as shown in FIG.
A ′, etc.) are displayed on the display unit 10. When an arbitrary phrase configuration is selected by operating the operation section 11 from among the displayed phrase configurations, the number of measures of each phrase in the selected phrase configuration is input as shown in FIG. The display is switched, and the number of measures is input from the operation unit 11.

The phrase configuration input in this way is stored in the pattern sequence memory PTN (k) of the working memory 3 in a format consisting of the type of each phrase and the number of measures as shown in FIG. At the end of the end code is stored. The phrase type is stored as a type number corresponding to the type. To input a style, the style name is displayed on the display unit 10 and the operation unit 1 is displayed.
It is selected by the operation 1 and stored as a style number.

As shown in FIG. 7, the rhythm pattern memory 12 stores a plurality of types of rhythm pattern data corresponding to styles and passage types.
In each pattern data, a timing data and a note code or a rest code are paired and stored for one measure, and an end code is stored at the end of the measure. The pattern data is referred to in accordance with the style number S and the phrase type number T, and a key code constituting the backing part is generated as performance data at a timing corresponding to the note code.

As shown in FIG. 8, the base pattern memory 13 stores a plurality of types of base pattern data corresponding to styles and passage types.
In each pattern data, the timing data, the key code of the bass sound and the key-on time data are stored as a set and stored for one bar, and the end code is stored at the end of the bar. The key code of this bass tone is stored in, for example, a C major tone. The pattern data is referred to by the style number S and the phrase type number T, and the bass tone at the current timing is determined according to the current chord data. The pitch is converted, and a key code constituting the bass part is generated as performance data.

It should be noted that the rhythm pattern referred to in the present embodiment is constituted by data representing a timing without including a pitch. Of course, it goes without saying that velocity data and the like may be added to the timing data. Although there is a literature which refers to a percussion instrument performance pattern as a rhythm pattern, in the present embodiment, this is distinguished by using terms such as a drum pattern and a drum part.

A plurality of types of drum pattern data corresponding to one style are stored in the drum pattern memory 14 corresponding to the style and the phrase type, and the drum pattern data is stored in accordance with the set style number and the phrase type number. The selected data is stored as performance data of the drum part.

The key code of the backing part and the key code of the base part generated as described above are stored in the backing part memory 6 and the base part memory 7, respectively, in the format shown in FIG. That is, timing data, key code, and key-on time data are set, bar line data is stored between each bar, and an end code is stored at the end of the song. The drum pattern data of the drum part is stored in the drum part memory 8 together with the bar line data for each measure.

Here, in this embodiment, the key code of the bass part is generated by pitch-converting the bass sound of the base pattern memory 13 according to the chord as described above. A top note corresponding to the chord is generated with reference to the top note table of the top note table memory 15, and an additional sound corresponding to the chord and the top note is generated with reference to the voicing table of the voicing table memory 16.

In the generation of the top note, if the current melody sound (key code) is included in the performance data in the melody memory 4, a note closest to the current melody sound is selected from candidate sounds corresponding to the chords. If there is no current melody sound, a sound randomly selected from the candidate sounds corresponding to the chords is set as the top note. Further, in the generation of these top notes, a top note of one note corresponding to a note at one timing of the rhythm pattern is generated, and a top note of a two-sound pair corresponding to two notes at continuous timing is generated. There are times when you do.

FIG. 2 is a diagram showing a top note table. The top note table includes a two-sound pair table for generating a two-note top note and a one-sound table for generating a one-note top note. Each table has a top note candidate sound (D♯ → E, F♯ →
G,...: In the case of a two-tone pair, D, E,..., In the case of one tone) are stored in association with the chord type TP (M, m, 7th,. In this embodiment, the candidate tones for the chord whose root is “C” (“C”, “Cm”, “C7th”...) Are stored as note name codes, and are selected from these candidate tones. The pitch name code is pitch-converted based on the root of the chord,
It is the key code of the top note corresponding to each chord.

FIG. 3 is a diagram showing a voicing table for generating an additional sound. The voicing table includes two sets of additional sounds 1 and 2 corresponding to a top note of a two-sound pair. It is composed of a pair table and a one-sound table for generating one set of additional sounds corresponding to one top note of one sound. In each table, candidates of additional sounds corresponding to combinations of the types of chords in the top note table of FIG. 2 and candidate sounds of the top note are represented by pitch differences (“−4”, “−8”, ) Is stored in each of two sets of additional sound data indicating each set, and each set is selected by a set No. This set No. No. 1 corresponds to a dense chord (closed voicing), and set No. 2 corresponds to an open chord (open voicing). In the voicing table, a pitch difference D between the top note and the root of the chord (C) is added for reference by the top note. In addition, one difference between the pitch difference D and the additional sound data corresponds to a semitone.

FIG. 10 is a flowchart of a main routine of the control program, and FIGS. 11 to 18 are flowcharts of subroutines. The operation of the embodiment will be described based on each flowchart. In the following description and each flowchart, each register and the like are represented by the following labels, and their contents are represented by the same label unless otherwise specified.

AD ₁ (j): additional sound data / key code of additional sound 1 AD ₂ (j): additional sound data / key code of additional sound 2 BK (k): register BKP of backing part memory: backing part memory Write pointer BP: read pointer of base pattern memory BS (k): register of base part memory BSP: write pointer of base part memory BSPTN _{S, T} (k): S (style number) and T (section) of base pattern memory BTMm corresponding to the type number): Set No. m minimum value of the additional sound data / key code (lowest sound) (m = 1, 2) BYM
KC: Key code of the lowest tone of the generated additional sound

D: Pitch difference between top note and root of chord GTM: Gate time (key-on time) of rhythm pattern i: Selected set No. K: Counter of number of additional sounds KC: Key code of base part MJN: Pattern sequence Number counter in bars in memory NC: Note name code of top note of one note NC1: Note name code of previous note in top note of two note pair NC2: Note name of last note in top note of two note pair Chord n: Number of top notes in one sound / two sound pairs (one sound: n = 1,
2 sounds: n = 2)

ORT: root of previous chord OTP: type of previous chord PTN (k): register of pattern sequence memory PTNP: read pointer of pattern sequence memory RT: root of chord RYT _{S, T} (k): Registers corresponding to S and T of rhythm pattern memory RYTP: Read pointer of rhythm pattern memory S: Input style number STYL: Input style number T: Phrase type number of pattern sequence memory TKC: Performance data of melody memory Keycode of melody TP: Type of chord TPKC: Keycode of top note generated for one note TPKCm: Keycode of top note generated for two note pair (m = 1: previous sound, m = 2: back) sound of)

When the processing of the main routine shown in FIG. 10 is started by turning on the power or the like, the processing for inputting the passage composition is performed in step S1 as described with reference to FIG. 5, and the melody is input via the input / output interface 9 in step S2. Is performed, and chord progression data is input via the input / output interface 9 in step S3. Next, in step S4, the style input processing is performed, and the input style number is stored in STYL. In step S5, the backing part generation processing in FIG. 11 is performed. In step S6, the drum part generation processing in FIG. 17 and step S7 are performed. Then, the base part generation process of FIG. 18 is performed, and the process ends.

In the backing part generation process of FIG. 11, the pattern data of the rhythm pattern memory (FIG. 7) is referred to in accordance with the phrase type and style of the pattern sequence memory (FIG. 6). A top note and an additional sound are generated according to the content, and the generated top note and the additional sound are stored in the backing part memory in the format shown in FIG. The processing of one measure is terminated by detecting the last end code of the measure in the rhythm pattern memory, and the measure line code is stored in the backing part memory. Then, the process is repeated for each bar type by the number of bars, and the process is terminated by detecting the end code in the pattern sequence memory.

That is, in step S11, the style number STYL is set in the register S, the pointer PTNP of the pattern sequence memory and the pointer BKP of the backing part memory are reset, and the default value "FF _H " is set in the chord root register RT. Is set and the process proceeds to step S12.

Next, in step S12, the phrase type number PTN (PTNP) of the pattern sequence memory is set in the register T, and the number of measures P of the phrase type is set.
TN (PTNP + 1) is set in MJN, and step S
Step 13 and subsequent steps are performed. Then, the pointer PTNP is incremented by 2 in step S105, and the process is repeated while updating the registers T and MJN in step S12 until an end code in the pattern sequence memory is detected in step S106. Thus, the same process is repeated for each phrase type. When an end code is detected in step S106, the end code is written in the backing part memory in step S107, the backing part generation process ends, and the process returns to the main routine.

In the processing for each phrase type, the pointer RYTP of the rhythm pattern memory is reset in step S13, which is the beginning of one measure, and the processing for one measure is performed in steps S14 to S19. Here, since the pointer RYTP is incremented by two by the voicing process described later, as shown in FIG. 7, RYT _{S, T} (RYT _{S, T}
P) is timing data or end code. Therefore, in step S14, it is determined whether or not RYT _{S, T} (RYTP) is an end code.
The processing of steps 5 to S19 is repeated for one measure. If the end code is obtained in step S14, the processing for one measure is completed, and the process goes to step S101.

In the processing for each bar, at step S15, R
It is determined whether or not YTS _{, T} (RYTP + 1) is a note code. If it is not a note code (for example, a rest code), the process returns to step S14. If YTS _{, T} (RYTP + 1) is a note code, the process returns to step S16. Type TP to register OR
T, OTP, and at step S17, read chord data corresponding to the note timing RYTS _{, T} (RYTP) from the chord progression memory and register the root note and type in the register R.
Stored in T and TP. Then, in step S18, FIG.
14 to generate a top note, and perform the voicing processing of FIGS. 15 and 16 to generate an additional sound in step S19, and return to step S14.

Each time the processing of one bar is completed, the process goes to step S101. In step S101, the bar number counter MJN is decremented by one.
Steps S13 to S13 until N = 0, that is, until the number of remaining bars MJN of one passage type becomes zero.
The processing of step 19, steps S103 and S104 are repeated for each bar. Step S10
At 3, the bar line code is written into the backing part memory BK (BKP) at the end of one bar, and step S10
At 4, the pointer BKP is incremented by one and updated.

In the processing of the top note in FIG. 12, first,
In step S21, _{"ORT = FF H or (ORT =} R
T & OTP = TP) ", that is, whether or not the chord corresponding to the timing of the current note chord has changed from the previous chord. Proceed to S204, and if it has changed, proceed to Step S22. In step S22, the melody memory is searched to determine whether or not there is a melody during the duration time of the current chord. If there is a melody, a process based on the melody TKC and the top note table is performed in step S23 and thereafter. If not, the process based on the top note table is performed in step S204 and thereafter.

In step S23, it is determined whether or not BKP> 0. If BKP> 0 is not satisfied, that is, if the first top note is generated, the flow advances to step S27 to execute BKP.
If> 0, that is, if the top note is generated for the second time or later, the process proceeds to step S24. In step S24, RYT _{S, T}
It is determined whether or not (RYTP-1) is a note code, that is, whether or not the pattern data at the timing before the current note code in the rhythm pattern in the rhythm pattern memory is a note code. If it is not a note code, the process proceeds to step S27, and if it is a note code, the process proceeds to step S25.

Here, if the previous pattern data is a note code, some top note has been generated in the previous processing. Therefore, in step S25, whether or not the sound is to be maintained as the top note, that is, the same sound is continuously Whether to perform or not is selected at random, and according to the determination in step S26,
If the same sound continues, return to the original routine as it is,
If the same sound does not continue, a top note is generated in step S27 and subsequent steps.

In step S27, RYT _{S, T} (R
It is determined whether or not (YTP + 3) is a note code, that is, whether or not the pattern data at the timing following the current note code is a note code. If it is not a note code, the top note is selected based on the one note table in step S28, and if it is a note code, the top note is selected based on the two note table and one note table in step S29.

That is, in step S28, the current chord type TP is read from the one-note table of the top note table.
Is selected from the candidate tone names corresponding to the melody TKC within the predetermined chord when the pitch is shifted by the root of the chord. Then, the note name code of the selected sound is stored in the NC in step S201, and the process proceeds to step S220 in FIG. In step S29, a note name group corresponding to the chord type TP is selected from the two note pair table of the top note table, and a candidate note name group corresponding to the chord type TP is selected from the single note table. Then, a sound which is closest to the melody TKC within a predetermined range when the pitch is shifted by the root of a chord is selected from both of these note names.

In step S202, it is determined whether or not the selected sound is from the two-sound pair table. If there is, step S20
In step 3, the note name code of the selected previous sound is stored in NC1, and the note name code of the subsequent sound paired with this sound is stored in NC2, and the process proceeds to step S213 in FIG.

On the other hand, step S204, step S20
5. In the processing of steps S206 and S207, steps S23, S24, and S25
Similarly to the processing in step S26, a random selection process is performed to determine whether or not the sound is continuous. If the sound is continuous, the process returns to the original routine. If the sound is not continuous, the process proceeds to step S208. In step S208,
It is determined whether or not RYT _{S, T} (RYTP + 3) is a note code, that is, whether or not the next pattern data is a note code. If it is not a note code, the process proceeds to step S209. If it is a note code, the process proceeds to step S210. move on.

In step S209, a candidate note name group corresponding to the chord type TP is selected from the one-note table of the top note table, a note name is randomly selected from the candidate note name group, and the selected note name is entered. NC, and the process proceeds to step S220 in FIG. In step S210, a two-sound pair or a single sound is randomly selected. If it is determined in step S211 that there is one sound, the process of step S209 is performed. A candidate tone name group corresponding to the chord type TP is selected from the tone pair table, and two tone pairs are set as a set from the candidate tone name groups and randomly selected (if the number of pairs is one, the pair is selected. ), The note name code of the sound before the selected two-sound pair is NC
1 and the note name code of the subsequent sound is stored in NC2, and the process proceeds to step S213 in FIG.

Step S213 and subsequent steps in FIG. 13 are processing for a two-sound pair. First, in step S213, 2 is set in the register n, and in step S214, the note name code N
C1 and NC2 are converted into a note name code corresponding to the current chord by the chord root RT, and in step S215, BKP>
It is determined whether or not the number is 0, that is, whether or not the first top note is generated. If BKP is not greater than 0, the first top note is generated. Therefore, in step S216, a key code having a note name of NC1 is randomly selected within a predetermined range and stored in the register TPKC1 as the previous top note. move on. If BKP> 0, the top note is generated for the second and subsequent times, and therefore, in step S217, the key code (2) whose pitch is NC1 and which is closest to the previous top note TPCK in the predetermined range.
Is stored in the register TPKC1 as the previous top note, and the process proceeds to step S218.

In step S218, the previous top note T
The tone that is closest to PKC1 in the predetermined range and whose name is NC
The key code 2 (lower when there are two) is stored in the register TPKC2 as a later top note, and in step S219, this top note TPKC2 is stored in the register TPKC as the previous top note for the next processing. And return to the original routine.

The process after step S220 in FIG. 14 is a process for one tone.
Is set to 1 and the pitch name code NC is converted into a pitch name code corresponding to the current chord by the root chord RT of the chord in a step S221, and it is determined whether or not BKP> 0 in a step S222. If BKP is not greater than 0, the first top note is generated, so in step S223, a key code whose note name is NC in a predetermined range is randomly selected and stored in the register TPKC as the top note, and the routine returns to the original routine. . If BKP> 0, the top note is generated for the second time or later, and in step S224, the key code whose tone is NC and which is the tone closest to the previous top note TPCK in the predetermined range is NC (when there are two). Is stored in the register TPKC as the top note, and the process returns to the original routine.

By the above-described processing of the top note, a two-note pair or a one-note top note is generated. And 2
When the top note of the sound pair is generated, the key code of the previous top note is stored in the register TPKC1, and the key code of the next top note is stored in the register TPKC1.
The key code of the top note is stored in the register TPKC when the top note of one sound is generated. In addition, the key code of the previous top note for the next processing is held in the register TPKC.

In the voicing process of FIG. 15, a process of adding a harmony sound (additional sound) to the obtained top note is performed. In this processing, processing is performed by focusing on the connection of the lowest sound (bottom sound) of the additional sound so that the range of the additional sound does not suddenly change and becomes unnatural. First, it is determined in step 31 whether or not n = 2. If n = 2, it means that a top note of one sound has been generated. Therefore, an additional sound is generated by one sound in step S32 and thereafter. , N
If = 2, it means that the top note of the two-sound pair has been generated, and the additional sound is generated by the two-sound pair in step S302 and thereafter.

If there is one note in step S31, the pitch difference between the previous top note TPKC and the root RT of the chord is set in the register D in step S32, and the BK difference is set in step S33.
It is determined whether or not P> 0. If BKP is not greater than 0, the first additional sound is generated. Therefore, in step S34, either "1" or "2" of the set number of the voicing table (single sound table) is randomly selected and set in the register i. Proceed to step S38.

If BKP> 0 in step S33, it is not the first additional sound generation. Therefore, in step S35, the set No. is determined from the voicing table (single sound table) according to the chord type TP and the pitch difference D. 1 and set No. 1 The minimum value (absolute value is maximum) of the additional sound data is read out for each of 1 additional sound data in the register BTM1.
And the set No. 2 is stored in the register BTM2. Thereby, the candidate sound of the lowest sound is set No. 1 and set No. 1 Choose from two.

Next, in step S36, the top note T
Each of the additional sound data BTM1 and BTM2 is added to the PKC and converted to a key code of the absolute pitch of the additional sound. In addition to storing the key code of the additional sound of No. 1 in the register BTM1, The key code of the additional sound 2 is stored in the register BTM2. Then, step S3
7, the previous additional sound BTMK of BTM1 and BTM2
A key code that is closer to C (the minimum key code of the additional sound) (lower when the pitch difference is the same) is selected, and the set No. (selected set No.) corresponding to the selected one is stored in the register i. Then, the process proceeds to step S38. Thus, the lowest note is determined to be a dense chord or an open chord so as to minimize a large pitch difference from the preceding lowest note.

In step S38, the voicing table
(One-tone table), responds to chord type TP and pitch difference D
Set No. Additional sound data of i (selection set No.)
Is read, and each additional sound data is stored in the register AD.₁(j) (j = 0
To the number of additional sounds -1), and
39, the additional sound data AD is added to the top note TPKC.₁(j)
Are added to the selected set No. Key of additional sound of i
Register code AD ₁(j), and rewrite
Backing part of 5 to 4 sounds from the first to the lowest
(A combination of pitches to be used) is determined. Next
In step S301, the selected set No. i additional sound
Key code BTMi is set to the last lowest tone for the next process
And stored in register BTMKC as additional sound
Store the top note TPKC in the register TPKC1,
The process proceeds to step S311 in FIG.

On the other hand, in the case of a two tone pair in step S31, the pitch difference between the previous top note TPKC1 and the chord root RT is set in the register D in step S302, and in step S303 whether BKP> 0 is satisfied. Is determined. B
If KP is not greater than 0, the first top note is generated. Therefore, in step S304, either "1" or "2" of the set number of the voicing table (two-tone pair table) is randomly selected and set in the register i. , Step S
Proceed to 308.

If BKP> 0 in step S303, it is not the first additional sound generation, so in step S305, the chord type T is obtained from the voicing table (two-tone pair table).
Set No. of additional sound 1 according to P and pitch difference D. 1 and set No. 1 The minimum value of the additional sound data for each of the set Nos. 1 additional sound data in register BTM
1 and the set No. 2 is stored in the register BTM2.

Next, in step S306, step S3
No. 6 in the same manner as in Set No. 6. 1 and the additional sound data BTM1 of the set No. 1 2 is converted into the key code of the absolute pitch and stored in the registers BTM1 and BTM2.
From TM2, a key code that is close to the last additional sound BTMKC of the last tone (lower when the pitch difference is the same) is selected, and a set No. (selected set No.) corresponding to the selected one is registered in register i. And the process proceeds to step S308.

In step S308, the selected set No. is selected from the voicing table (two-tone pair table) according to the chord type TP and the pitch difference D. The additional sound data of the additional sound 1 and the additional sound 2 of i are read out, and the additional sound data of the additional sound 1 are sequentially stored in the register AD ₁ (j) (j = 0 to the number of additional sounds−1). Register each additional sound data of sound 2 in register A
D ₁ (j), and in step S309,
The additional sound data AD ₁ (j) is added to the previous top note TPKC1, the additional sound data of the additional sound 1 is converted into a key code, and stored in the register AD ₁ (j). In addition, the additional sound data AD is stored in the back top note TPKC2.
₂ (j) is added to convert the additional sound data of the additional sound 2 into key codes, respectively, and stored in the register AD ₂ (j). In this way, with respect to the flow of the backing sound of the two-sound pair, the additional sound and all four additional sounds are determined by voicing having a flow as a two-sound pair. And
In step S310, the key code AD of the subsequent additional sound 2
₂ The minimum value of (j) is stored in the register BTMKC as an additional sound of the previous lowest sound for the next processing, and the flow advances to step S311 in FIG.

By the above processing, a set of additional sounds of two sound pairs corresponding to the two sound pairs of the top note or a set of additional sounds corresponding to one sound is generated, and the additional sound of the two sound pairs is generated. The key code of the preceding additional sound is stored in the register AD ₁ (j), and the key code of the subsequent additional sound is stored in the register AD ₂ (j) 2. When one additional sound is generated, the key code of the additional sound is stored in the register AD ₁ (j). In addition, the key code of the lowest sound of the preceding additional sound for the next processing is stored in the register BTMKC.

In the processing shown in FIG. 16, 1 is set in the register m in step S311, and the time until the next data of the rhythm pattern (time until the next timing) is stored in the register GTM in step S312. This time GTM is multiplied by 0.8 and stored in the register GTM as the gate time of the backing part.
4 and subsequent processes are performed. Note that the processing after step S314 is performed once when the top note and the additional sound are generated by one sound (n = 1) according to the determination in step S322.
When a sound pair is generated (n = 2), it is performed twice.

First, at step S314, the timing RY is stored in the register BK (BKP) of the backing part memory.
T _{S, T} (RYTP) is stored, and the register BK (BKP +
1) stores the top note TPKCm in the register BK
The gate time GTM is stored in (BKP + 2). Then, in step S315, the pointer BKP of the backing part memory is increased by 3, and in step S316, the counter K for the number of additional sounds is reset.

Next, at step S317, the timing RY is stored in the register BK (BKP) of the backing part memory.
T _{S, T} (RYTP) is stored, and the register BK (BKP +
The additional sound ADm (K) is stored in 1), and the register BK (BK
The gate time GTM is stored in (P + 2). Then, in step S318, the counter K for the number of additional sounds is incremented by 1 and the pointer BKP in the backing part memory is increased by 3. In step S319, it is determined whether or not K has reached the number of additional sounds. If not, step S31
7, and if the number of additional sounds has been reached, the process proceeds to step S320.

Next, at step S320, the pointer RYTP of the rhythm pattern memory is incremented by 2, and at step S321, the register m is incremented by 1 to determine at step S322 whether or not m> n. The process returns to step S314 because the process for the back sound in the two-sound pair remains, and if m> n, the process for the back sound of the one or two-sound pair has been completed, so the original routine (backing part generation) Return to

According to the above processing, the additional sound of the set of one note and the set of two notes, or the additional note of the set of two notes and the set of two notes, corresponding to the timing of the note code in the rhythm pattern memory. Is generated and stored in the backing part memory together with the gate time. As shown in FIG. 11 (steps S18 and S19), these processes (top note, voicing) are performed on a note code at a certain timing in the rhythm pattern memory for each bar in the backing part generation process. When the backing part generation process is completed, a top note and additional sound corresponding to each bar and each passage type are generated for the entire music.

In the drum part generation process shown in FIG. 17, the pointer P in the pattern sequence memory is
The TNP is reset, and the drum part memory is cleared in step S42. Next, in step S43, the phrase type number PTN (PTNP) in the pattern sequence memory
Is set in the register T, the number of measures PTN (PTNP + 1) of the passage type is set in MJN, the pointer PTNP is increased by 2 in step S48, and the end code of the pattern sequence memory is detected in step S49 in step S43. The process of steps S44 to S49 is repeated for each phrase while updating the registers T and MJN.

In step S44, the drum pattern of one measure corresponding to the style number S and the phrase type number T is additionally stored in the drum pattern memory.
In step S4, the counter MJN of the number of measures is decremented by one.
At 6, it is determined whether or not MJN = 0. And MJ
If N = 0, the bar code is written at the end of the data in the drum part memory in step S47, and step S47 is executed.
Returning to step S44, if MJN = 0, the processing of each measure of the passage has been completed, and the flow goes to step S48. Then, the same processing is repeated for each passage. When the end code is detected in step S49, the process returns to the main routine.

By the above-described drum part generation processing, a drum pattern for one measure corresponding to the type of each measure is repeated and recorded by the number of measures for each measure, and a measure line code is inserted between measures. Be recorded.

In the base part generation process of FIG. 18, first, in step S51, the pointer PTNP in the pattern sequence memory is reset, and in step S52
To reset the pointer BSP in the base part memory,
The processing after step S53 is repeated for each phrase type. That is, in step S53, the phrase type number PTN (PTNP) of the pattern sequence memory is set in the register T, and the number of measures PTN of the phrase type is stored.
(PTNP + 1) is set in MJN, and step S50
In step 4, the pointer PTNP is increased by 2, and the processing in steps S54 to S503 is performed for each phrase type while updating the registers T and MJN in step S53 until the end code of the pattern sequence memory is detected in step S505.

In the processing for each passage type, one bar
In step S54, which is the head of
Reset the inter BP and execute steps S55 to S
At 501, processing for one measure is performed. And one bar
In each process, the base pattern memory
Key code BSPTN_{S, T}(BP + 1) to the register K
C, and in step S56, the key code KC
Timing BSPTN _{S, T}Chord data corresponding to (BP)
Data from the chord progression memory and register the root tone and type.
It is stored in the star RT, TP.

Next, in step S57, the key code KC is pitch-converted according to the root chord RT and type TP of the chord and set in the register KC. In step S58, the timing BSPTN is stored in the register BS (BSP) of the base part memory.
_{S, T} (BP) is stored, the key code KC is stored in the register BS (BSP + 1), and the register BS (BSP + 2) is stored.
The key-on time BSPTN _{S, T} (BP + 2). Then, in step S59, the write pointer BSP of the base part memory and the read pointer BP of the base pattern memory are each increased by 3, and in step S501, it is determined whether or not BSPTN _{S, T} (BP) is an end code.

If the end code is not detected in step S501, the process returns to step S55 to continue the processing within one measure. If the end code is detected, the measure number counter MJN is decremented by one in step S502.
At 3, it is determined whether MJN = 0. And MJ
If N = 0, the process returns to step S54, and if MJN = 0, the processing of each measure of the passage ends. Then, the same processing is repeated for each passage, and step S505
When the end code of the pattern sequence memory is detected in step (5), the process returns to the main routine.

As described above, the performance data of each part is generated in the backing part memory 6, the base part memory 7, and the drum part memory 8. The finally created performance data of a plurality of parts for one music may be output in any format.

Although the pitch of the top note and the pitch of the additional sound may be determined according to only the chord, in this embodiment, the pitch of the top note and the pitch of the additional sound are determined based on the melody and chord data. Therefore, performance data suitable for the chord is generated.

In terms of musical restrictions of other parts to the melody, usable pitches are limited to some extent by the chords and the tonality of the melody. In some cases, pitches that should not be used are frequently selected, and the selectable pitches to avoid this are limited, so that performance data cannot be obtained naturally. However, in this embodiment, it is possible to select a continuous pitch of a two-tone pair. Of these, the previous one should not be used much, but is used as a so-called decorative sound which is good for a short time. This makes it possible to select more pitches than when pitches are independently selected one by one, thereby obtaining natural performance data.

By looking at the generation of the top note, it can be understood that this is a counter melody to the melody. That is, this technique can be used as a countermeasure generation method.

When the same continuous sound is selected as the top note of a two-sound pair, additional sounds having different pitches for the preceding sound and the following sound may be selected as the additional sounds. In this case, the pitch of the additional sound when the same sound is continuous may be stored in a table, and the pitch of the additional sound may be selected from this table.

[0076]

As described above, according to the first aspect of the present invention,
According to the automatic arranging device of the present invention, since there is no information for designating the pitch of each rhythm pattern, the storage capacity of the rhythm pattern can be reduced, and the sound selected from any of the note name candidates can be reduced. It is possible to easily generate rich sounding performance information including a name and an additional sound suitable for the selected note name. Further, since any one of a plurality of tone name candidates including non-chord constituent tones usable for the supplied chord is selected, performance information suitable for the chord can be generated. Since sounds other than sounds can also be generated, various performance information can be created.

According to the automatic arranging device of the second aspect of the present invention, since there is no information for designating the pitch of each rhythm pattern, the storage capacity of the rhythm pattern can be reduced. It is possible to easily generate rich sounding performance information composed of a note name selected from any of the name candidates and an additional sound suitable for the selected note name. Furthermore, since any one of a plurality of pitch name candidates is selected with reference to the pitch information of the melody, performance information suitable for the melody can be generated.

According to the automatic arrangement device of the third aspect of the present invention, since there is no information for designating the pitch of each rhythm pattern, the storage capacity of the rhythm pattern can be reduced, and It is possible to easily generate rich sounding performance information composed of a note name selected from any of the name candidates and an additional sound suitable for the selected note name. Further, since any one of the plurality of tone name candidates is selected with reference to the previously generated performance information, it is possible to generate performance information having a natural flow.

According to the automatic arrangement device of the fourth aspect of the present invention, in addition to the effects of the first to third aspects, since a plurality of additional sound candidates are provided for one sound name candidate, a small storage capacity is required. Can generate a lot of performance information.

[Brief description of the drawings]

FIG. 1 is a block diagram of an automatic music arrangement device according to an embodiment of the present invention.

FIG. 2 is a diagram conceptually showing a top note table in the embodiment.

FIG. 3 is a diagram conceptually showing a voicing table in the embodiment.

FIG. 4 is a diagram showing a format of a chord progression memory in the embodiment.

FIG. 5 is a diagram showing a display example of a phrase configuration input in the embodiment.

FIG. 6 is a diagram showing a format of a pattern sequence memory in the embodiment.

FIG. 7 is a diagram showing a format of a rhythm pattern memory in the embodiment.

FIG. 8 is a diagram showing a format of a base pattern memory in the embodiment.

FIG. 9 is a diagram showing a format of a backing part memory and a base part memory in the embodiment.

FIG. 10 is a flowchart of a main routine in the embodiment.

FIG. 11 is a flowchart of a backing part generation process in the embodiment.

FIG. 12 is a part of a flowchart of a top note process in the embodiment.

FIG. 13 is another part of the flowchart of the top note process in the embodiment.

FIG. 14 is another part of the flowchart of the top note process in the embodiment.

FIG. 15 is a part of a flowchart of a voicing process in the embodiment.

FIG. 16 is another part of the flowchart of the voicing process in the embodiment.

FIG. 17 is a flowchart of a drum part generation process in the embodiment.

FIG. 18 is a flowchart of a base part generation process in the embodiment.

[Explanation of symbols]

1 CPU, 4 melody memory, 5 chord progression memory, 6 backing part memory, 12 rhythm pattern memory.

Claims (4)

[Claims] An automatic arranging device for generating performance information of a part other than a melody to be added to a melody, wherein a plurality of rhythm patterns that at least indicate a sounding timing and do not have pitch information are stored. Rhythm pattern storage means, selection means for selecting a rhythm pattern of a song to be created from the plurality of rhythm patterns, chord progression supply means for supplying a chord progression corresponding to the melody, and for each chord, other than the melody A note name candidate storage means which can be used as performance information of a part and stores a plurality of note name candidates including note names other than chord constituent sounds, and for each chord and for each note name candidate, An additional sound storing means for storing an additional sound to be added; and a rhythm pattern selected from the rhythm pattern storing means, For each of the sounding timings of the chords, any one of a plurality of pitch name candidates usable in the chord indicated by the supplied chord progression is selected, and the supplied chord and the additional tone corresponding to the selected pitch name candidate are selected. Is read from the additional sound storage means, and together with the sound name information of the additional sound and the sound name information of the selected sound name candidate,
And a performance information generating means for generating performance information corresponding to the note name information as performance information of a part other than the melody. 2. An automatic arrangement apparatus for generating performance information of a part other than a melody to be added to a melody, wherein the rhythm stores at least a rhythm pattern indicating a sounding timing and having no pitch information. Pattern storage means, pitch information supply means for supplying pitch information of the melody, chord progression supply means for supplying chord progression corresponding to the melody, and for each chord, as performance information of parts other than the melody. Available note name candidate storage means for storing a plurality of available note name candidates; additional sound storage means for storing, for each chord, and for each note name candidate, an additional sound to be added to the note name; A rhythm pattern is read from the rhythm pattern storage means, and a plurality of tones corresponding to the chord indicated by the supplied chord progression are generated at each sounding timing of the rhythm pattern. Among the name candidates, referring to the pitch information of the melody corresponding to the sounding timing and selecting any of them, the supplied chord and the additional sound corresponding to the selected note name candidate are stored in the additional sound storage means. Performance information generation for reading out the note name information of the additional note and the note name information of the selected note name candidate, and generating performance information corresponding to the note name information as performance information of a part other than the melody. Means for automatic arrangement. 3. An automatic arrangement device for generating performance information of a part other than a melody to be added to a melody, wherein the rhythm stores at least a rhythm pattern indicating a sounding timing and having no pitch information. Pattern storage means, chord progression supply means for supplying a chord progression corresponding to the melody, and note names storing a plurality of note name candidates usable for each chord as performance information of parts other than the melody. Candidate storage means; additional sound storage means for storing an additional sound to be added to the note name for each chord and for each note name candidate; reading a rhythm pattern from the rhythm pattern storage means; For each of the plurality of note name candidates corresponding to the chord indicated by the supplied chord progression, one of the plurality of note name candidates is referred to by referring to the previously generated performance information. And selecting the supplied chord and the additional sound corresponding to the selected note name candidate from the additional sound storage means, and selecting the note name information of the additional sound and the note name information of the selected note name candidate. In addition, a performance information generating means for generating performance information corresponding to the note name information as performance information of a part other than the melody, and an automatic arrangement device. 4. The additional sound storage means stores a plurality of additional sound candidates for each chord and each note name candidate, and the performance information generating means stores an additional sound candidate selected from the plurality of additional sound candidates. The automatic arrangement device according to claim 1, wherein the sound candidates are used as performance information.