JP2638905B2 - Automatic composer - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to an automatic composer, and more particularly to an automatic composer of a type that automatically generates a melody according to a chord progression and a melody feature parameter.

[Background] The applicant of the present application filed a Japanese Patent Application No. 62-121037 (filed on May 20, 1987) and a Japanese Patent Application No. 62-325179 (December 24, 1987) with reference to chord progression and melody feature parameters ( We have proposed an automatic composer that automatically creates a melody based on the melody's character and style.

Regarding chord progression, these applications cite a method in which a user directly inputs a chord progression, and a method in which a chord progression is automatically generated by a Markov model. However, the former method assumes that the user has the ability to create chord progressions, and thus cannot be used by users without musical knowledge of chords. Also, in the latter method, a very large number of chord progressions can be generated by randomizing the transition frequency between codes, but only one chord progression can be obtained at a time. There is a problem that many trials must be repeated until a chord progression (or final song) is obtained.

In the case of an automatic composer of the type described above, the characteristics of the final song depend to a large extent on the chord progression chosen. Therefore, there is a need for a technique for automatically generating a chord progression such that a song intended by the user can be efficiently obtained.

[Object of the Invention] That is, the present invention is an improvement of the invention of the above-mentioned patent application, and provides an automatic composer in which the burden of composing on a user is reduced by automatically generating a desired chord progression efficiently and efficiently. The purpose is to do.

[Constitution of the Invention] In order to achieve the above object, the present invention sets and inputs the degree of sensation of a song in an automatic music machine having a melody generating means for generating a melody based on chord progression information and a melody feature parameter. The present invention is characterized in that a setting input means and a chord progression generating means for generating the chord progression information with the degree of the set feeling as a target are provided.

According to the present invention, the chord progression serving as the basic information for composition is set input means for setting the degree of feeling of the music, and the chord progression generating means for generating a chord signal in accordance with the set degree of feeling. And formed by Therefore, the user only has to set the degree of feeling of the music via the setting input means for a desired chord progression (eventually, a desired music).
Therefore, the burden of composition on the user is reduced, and even a person who is not proficient in musical knowledge can enjoy composition using the automatic composer.

In one configuration example, the chord progression generation means includes a storage means for storing chord progressions of a plurality of songs, an evaluation means for evaluating a degree of sense of each chord progression stored in the storage means, Selecting means for comparing the evaluation result with the degree of feeling from the setting input means and selecting an optimum chord progression.

In another configuration example, the chord progression generation means automatically generates a chord progression on a random basis, an evaluation means for evaluating a degree of a sense of each chord progression from the generation means, and each evaluation of the evaluation means. Selecting means for comparing the result with the degree of feeling from the setting input means and selecting an optimum chord progression.

Example An example of the present invention will be described below with reference to the drawings.

Overall Configuration FIG. 1 shows the overall configuration of the automatic music composer according to the present embodiment. The CPU 1 is a control device for realizing a chord progression automatic generation function and an automatic music function in the present apparatus. The automatic music function is the same as that of the above-mentioned Japanese Patent Application No. 62-325176. Various variables and data used during the operation of the CPU 1 are temporarily stored in the work memory 2. The input device 3 inputs a motif, a type of pulse scale (used for controlling rhythm), a type of scale, and a degree of feeling as basic information of chord progression. The chord progression database 4 is a memory for storing chord progressions of a plurality of songs. The motif memory 5 stores the input motif. The melody feature parameter memory 6 stores a melody feature parameter expressing a melody feature obtained by analyzing a motif and chord progression. The production rule memory 7 stores music knowledge (production rules) for classifying non-harmonic sounds included in the melody. This musical knowledge is used when classifying non-harmonic sounds included in the motif, and when adding non-harmonic sounds to the arpeggio. The pulse scale memory 8 is a memory for storing various pulse scales. At the start of composition, a user can select a desired pulse scale from this set of pulse scales. The selected pulse scale is used to generate the melody rhythm (length sequence). The scale data memory 9 is a memory for storing data representing various scales, and the user can select a scale to be used in the music from the memory 9 before composing. The melody data memory 10 stores the data of the completed melody. The monitor 11 includes a CRT, a sound source, a sound system, etc., and outputs and displays a composition result and other messages.

Hereinafter, the present embodiment will be described separately for chord progression generation and automatic music.

Chord Progression Generation In this embodiment, the degree of feeling is set and input from the input device 3 in order for the user to access a desired chord progression. On the other hand, the CPU 1 operates the chord progress database 4
, Each chord progression is read out, and the degree of each sense is evaluated. Then, each evaluation value is compared with the degree of the sense that has been set and input, and the chord progression that matches the best is selected.

FIG. 2 shows a configuration example of an input device for setting and inputting the degree of feeling. In this example, two types of sensations “brightness” and “essence” are prepared, and the brightness is specified by the brightness switch 3-1 and the essence is specified by the essence switch 3-2. It is performed by The degree of each sense is input from the degree volume 3-3.

FIG. 3 shows an example of the chord progression database 4. At address 0, the number of songs (chord progressions) LIMIT is stored (see (A)), and at address 1 to address LIMIT, the head address of the data of each chord progression is stored (see (B)). For example, data 100 at address 1 is 1
This indicates that the beginning of the chord progression data of the music piece is stored at address 100. The actual chord progression data is as shown in (C) and (D) of FIG. In this example, the code data is stored in the even address and the tone length data is stored in the odd address. In the code data, the upper 8 bits represent the code type, and the lower 8 bits represent the root of the code. Specifically, for the chord types, for example, 0: major, 1: minor, 2: diminished, 3: augmented, 4: sustained, 5: seventh, 6: minor seventh, 7: minor six, 8: six, 9: Data is assigned like Major Seventh. For root data, for example, 0: C, 1: C ^# , 2; D, 3: E ^♭ , 4: E, 5: F, 6: F ^# , 7: G, 8: A
^♭ , 9: A, a: B ^♭ , and b: B. The sound length data is represented by an integral multiple of the minimum sound length of one. For example, the data 000 at the address 100 and the data 10 at the address 101 in FIG. 3 indicate that the note length is 16 times the minimum in the C major code.

FIG. 4 is a list of variables used in the flow of chord progression generation described below.

FIG. 5 shows the general flow of chord progression generation for the designation of brightness. At 5-1 the user inputs the degree of brightness through the switches 1-1 and 1-3 of the input device 1. On the other hand, the CPU 2
N is initialized (5-2), and the total number of songs (chord progressions) at address 0 of the chord progression database 5 is read into LIMIT (5-3). Then, the code signal counter N is initialized to "1" (first music piece) (5-4), and thereafter, in the loops 5-5 to 5-9, the chord progression of the N music piece is evaluated. That is, the chord progression data of the Nth tune is read from the chord progression database 5 (5-6), the degree of brightness is calculated (5-7), and the calculated value is closest to the degree of brightness selected by the user. For example, the value is stored (5-8), the chord progress counter N is incremented (5-9), and the count N exceeds the total number of songs (LIMIT) (5-9).
-5), repeat the above loop processing. Finally 5-10
Then, the chord progression closest to the degree of IDEGREE selected by the user is selected.

FIG. 6 shows details of 5-6 in FIG. In 6-1, the pointer P is initialized to the start address of the chord progression of the N-th track of interest, and in 6-2, the start address of the next tune (the data indicating the end of the chord progression of interest) is stored in EOF. ) Is set, and the code counter I is initialized to 0 in 6-3. And 6-4 to 6-9
In this loop, the I-th chord data in the chord progression of the N-th music is set in CD (I), and its duration data is set in CR (I). 6-10 out of the loop
Then, the total number I of chords included in the chord progression of the Nth music is set in CDNO.

FIG. 7 shows details of 5-7 in FIG. In this example,
The degree of brightness is determined by calculating the ratio of the major chords included in the chord progression by regarding the major chords as bright chords. For details, see 7
At -1, the total length ML of the major chord is initialized to 0,
The full length AL of the music is initialized to 0, and the chord counter I is initialized to 1 at 7-2. Then, in a loop 7-3 to 7-8 7-3, code type information is extracted from the code data, and in a loop 7-4, it is determined whether or not it is a major system. If not the major system, only the accumulation of the pitch AL is performed as shown in 7-6, but if the system is the major system, the accumulation of the duration ML which is the major system is performed together (7-5).
reference). This processing is performed by the code counter I when the total number of codes is CD.
Repeat until it becomes NO (7-7, 7-8). As a result,
In ML, the entire note length of the major chord in the focused chord progression is set, and in AL, the total length of the chord progression is set. Therefore, the ratio DEGREE (N) occupied by the total pitch of the major chord is calculated by taking the ratio of both (7).
-9).

FIG. 8 is a detail of 5-8 in FIG. If the difference between the current DEGREE (N) and the degree of brightness IDEGREE set by the user is smaller than the previous minimum value MLN, the difference is M
It is set to IN (8-1, 8-2). Therefore, at the stage of entering 5-10 of the general flow (FIG. 5), the register MIN stores the minimum difference between the evaluation value of the chord progression brightness in the chord progression database 5 and the brightness level set by the user. Contains a value.

In the flow of FIG. 9 (details of 5-10), a chord progression having a difference between the minimum values is selected. That is, the chord progression counter N is initialized to 1 (9-1), and for the chord progression of the Nth tune, it is checked whether DEGREE (N) is equal to the minimum value MIN (9-2).
The flag FN (N) is set to 1 (9-3). This is repeated from N = 1 to LIMIT (9-4, 9-
5). As a result, in the array {FN (N)}, a flag with “1” set indicates a chord progression whose corresponding chord progression best matches the one specified by the user in terms of brightness. It indicates that there is.

FIG. 10 shows a general flow when the degree of essence is specified as the specification of the sense. Here, the essence-based code is a code excluding major, minor, and seventh. In step 10-1, except for the point that the essence switch 1-2 and the degree switch 1-3 are operated and the point of determining whether or not it is an essence system in step 10-2, the brightness related to the brightness described above is used. Since the processing is the same as that of the flow (FIGS. 5 to 9), further description is omitted.

In the above embodiment, the chord progression database 5 is used as a chord progression source, but the invention is not limited to this. For example, means for automatically generating a chord progression on a random basis can be used. FIG. 11 shows an example of this kind of generation flow. In the figure, D (i, j) represents the frequency of transition from code i to code j. This array {D (i, j)} is stored in a frequency table memory (not shown). RND is a function for generating random numbers uniformly distributed within a predetermined range.

According to the flow of FIG. 11, the first chord progression is set at 11-1 and 11-2. From (11-3) to (11-11), the (i + 1) -th code is obtained by adding the weight of the random number to the transition frequency from the i-th code. That is, after the register max is initialized to 0 (11-3) and the number of executions j is initialized to 0 (11-4), a = P (CD (i), j) + RND
To determine the code transition frequency a into which the random number is introduced (11
-5) If the value is larger than max (11-6), the value of max is updated with that value (11-7), and the code data j is assigned to the register CD (i + 1) of the (i + 1) th code data. (11-8). By repeating this process a predetermined number of times, the (i + 1) -th code is determined. Thereafter, i is incremented, and until i reaches a predetermined numerical value (11-12, 11-13), the next code generation processing 11-3 to 11-3
Repeat 11-11.

Therefore, each time the processing of FIG. 11 is performed, one chord progression is generated. The generated chord progression is evaluated in the above-described manner, and is compared with the degree of the feeling specified by the user. The process of FIG. 11 is terminated when the process is executed an appropriate number of times.

The frequency table {D (CD (i), j)} in FIG. 11
May not be required if desired. Alternatively, a plurality of frequency tables and the degree of sensation such as brightness for each table are stored, a frequency table closest to the amount of sensation specified by the user is found, and a slight random number is assigned to the frequency table to obtain a plurality of frequency tables. May be obtained, and the user can select a desired chord progression.

Automatic Composition The automatic composition apparatus of this example employs an approach of composing a sound by dividing the sound into a harmony and a non-harmony. The chord progression information, motifs (melody input from the user) generated as described above, pulse scale used for controlling the rhythm or length sequence of the generated melody, and the basic scale are used as basic data for composition. Is given. Each sound included in the motif is identified as a harmony or a non-harmony by using chord information used in each section. The part excluding the non-harmonic tone from the motif is the arpeggio of the motif (dispersion chord). From this arpeggio, features of the arpeggio and characteristic elements included in the tone of the arpeggio are extracted. In addition, for motifs that are distinguished between a harmonious sound and a non-harmonic sound, music knowledge for classifying the non-harmonic sound (which is stored in a production rule data memory described later) is used. The type (characteristic) of each non-harmonic sound included in the motif can be extracted. That is, information (characteristics of non-harmonic sounds) indicating what non-harmonic sounds are distributed in the motif and how are obtained. Further, from the chord progression, the hierarchical structure and tonality structure of the music are extracted. The features of the arpeggio, the features of the non-harmonics, the hierarchical structure of the music, the tonal structure, and the like constitute the melody feature parameters.

The generation of the melody includes an arpeggio generation step, a non-harmonic sound addition step, and a pitch sequence generation step. In the arpeggio generation step, arpeggio generation is controlled by the hierarchical structure extracted from the chord progression information. When a new arpeggio is generated according to the hierarchical structure, the arpeggio features are generated from the arpeggio features (features of the arpeggio extracted from the motif or modified versions thereof) and correspond to the generated arpeggio styles. By applying the chord, an arpeggio represented by a pitch sequence is generated. A non-harmonic tone is added to the arpeggio generated in this manner. The music knowledge described above is again used to add non-harmonic sounds. The pitch sequence of the melody is completed by adding a non-harmonic sound to the arpeggio.
On the other hand, the melody note length sequence is obtained as follows. In other words, the basic rhythm (length sequence) is optimally combined or optimally divided using a pulse scale so as to have a target number of notes (for example, the total number of harmony and non-harmony). Which note is divided or combined at which position depends on the weight of each pulse point of the selected pulse scale. Therefore, consistent rhythm control is possible.

<Composition general flow> Fig. 12 shows the composition general flow.

In the initial setting of 12-1, basic information for composing is input by the user to the automatic music machine. The information that the user informs the automatic composer includes (1) BEAT, (2)
The pulse scale type (3) scale (4) fully automatic or motif input is shown. BEAT is the length of one measure represented by the number of notes of the basic unit length (the shortest note), and thus defines the time signature of a song. For example, if the basic unit length of a note is a sixteenth note for a quadruple tune,
If BEAT = 16 is set, the length of one bar is 4 beats. 12−
The pulse scale selected in step 1 is information for temporarily controlling the rhythm of a song composed by the automatic composer. The pulse scale is a scale in which each pulse point having an interval of the basic unit length is weighted to indicate the ease of combining notes or dividing notes (see FIGS. 17 and 22). ),
The use of this pulse scale controls the melody tone train. Therefore, selecting the type of the pulse scale corresponds to selecting the rhythmic feature of the song composed by the automatic composer. The type of scale (for example, diatonic scale) selected in 12-1 is the scale used by the automatic composer in composing music. Further, in the initial setting 12-1, the user determines whether to compose the music automatically or to perform it based on the motif. In the case of full automatic, as data necessary for composition,
(1) chord progression, (2) production rules (3)
The pulse scale is read into the work memory 10 (4-
3), (1) basic rhythm (tone length pattern),
An essence composed of (2) arpeggio features (PCi: see FIG. 15) and (3) non-harmonic features (RSi: see FIG. 15) is generated according to the user's instructions (12-4). On the other hand, in the composition mode using motifs,
Motif (input melody) other than the above data as 5
(1) Rhythm (2) as essence
Arpeggio pattern (3) Features of arpeggio pattern,
(4) Non-harmonic features are extracted from this motif (12-5). In particular, non-harmonic features are obtained by inference based on production rules. In both cases of the fully automatic mode and the motif use mode, a chord progress evaluation 12-7 is performed, where (1) a hierarchical structure, (2) a tonality structure, and (3) a scale are extracted from the chord progress information. This hierarchical structure expresses the consistency and diversity of the songs inherent in the chord progression. Further, the tonality structure defines a key (fundamental tone) of a scale used in each section. The process indicated by "scale" is for using a specific scale in a certain special chord section regardless of the initially set scale. With the processing up to 12-7, the "analytical work" for composition has been completed. For example, the characteristics of the arpeggio are information necessary for generating an arpeggio pattern, and the characteristics of the non-harmonic sound characterize the non-harmonic sound added to the arpeggio. The production rule is used to infer whether the non-harmonic sound added to the arpeggio is appropriate. The tonality structure also restricts the melody sound candidates in each section. The hierarchical structure can be used to determine whether to generate a new arpeggio pattern. The pulse scale is used for generating a rhythm. In melody generation 12-8, (1) selective generation of arpeggio patterns (LLi: see FIG. 15), (2) setting of a range of arpeggio patterns (3) generation of arpeggios of pitch expression (4) non-harmonic sounds (5) Rhythm generation is performed.

<Variable list, data format> The list of main variables used in the flow described later
The data format is shown in FIG. 14 to FIG. The data format is merely an example, and any other appropriate data format can be used.

<Initial settings> Initial settings in the composition general flow (Fig. 12)
FIG. 19 shows an example of the details of (1). Select with this initial setting
The meaning of BEAT, the type of pulse scale (PULS), the type of scale (ISCALE), and the meaning of fully automatic or motif input have been described with reference to FIG. 12, and will not be described here. The value of PULS is a pointer to a specific pulse scale stored in the pulse scale memory 8 (FIG. 1), and the value of ISCALE is a pointer to specific scale data stored in the scale data memory 9.

<Data Reading> As shown in the composition general flow of FIG. 12, after initial setting, data reading is performed at 12-3 or 12-5. In the case of full automatic, motif data is not read because no motif is used as basic data for composition. The reading of each data will be described below.

FIG. 20 shows an example of chord progression data used for composition in the chord progression database 4 (FIG. 1). 21st
The figure is a flowchart for loading the chord progress data. In the memory map shown in FIG. 20, the code type (CDi) is placed at an even address, and the length of the code is placed at the next address (odd address). For example, CDi with hexadecimal value of the display 507 represents the code G _7th, CRi code length with a value of 10 indicates that a 16 times the fundamental time length (e.g., sixteenth note) .

In FIG. 21, the register CDi contains the i-th appearing code of the tune to be composed, and CRi contains the length thereof.
CDNO contains the total number of codes. The other points are apparent from the description of FIG. 21 and will not be described.

FIG. 22 shows an example of pulse scale data stored in the pulse scale memory 8 (FIG. 1). FIG. 23 is a flowchart for loading the pulse scale of the type selected in the initial setting from the pulse scale memory 8. In this example, the pulse scale type (PUL) selected in the initial setting to select the rhythm characteristics of the song to be composed
S) indicates a specific address (for example, 0) in the pulse scale memory 8, and the address contains the start address of the selected pulse scale data. The start address stores the number of sub-scales (scales having only weights of 0 and 1) constituting the pulse scale, and data of each sub-scale is stored in the subsequent address. For example, the normal pulse scale has five sub-scales FFFF, 5555, 1111, 0101, and 0001.
(Hexadecimal representation) and the corresponding binary representation is shown in FIG. In the case of the normal pulse scale, the first pulse point (the rightmost position in FIG. 17) has a maximum weight of 5, which indicates that the rhythm generated when the normal pulse scale is selected. Indicates that a note is most likely to be present at the first position of each section (measure).

FIG. 24 shows the production rule data memory 7 (No. 1).
2) shows an example of production rule data stored in FIG. FIG. 25 is a flowchart for reading the data stored in the memory 6. The entire production rule expresses musical knowledge for classifying non-harmonic sounds included in the melody, and each production rule data includes lower limit data Li and a function type as data that prescribes a premise of the rule. Function instruction data X to indicate
i, upper limit data Ui, and data Y as the conclusion of the rule
It has i and Ni. The function is a numerical expression of the feature of the melody to be analyzed, and an example thereof is shown in FIG. 41 described later.
It is a premise (proposition) of the production rule that the value Fxi of the function represented by the data Xi is equal to or more than Li and equal to or less than Ui (Li ≦ Fxi ≦ Ui), and the conclusion when this premise is satisfied is data It is indicated by Yi, and the conclusion when this premise is not satisfied is indicated by data Ni. When the data Yi or Ni has a positive value, the value indicates the number of the next production rule to be referred in forward inference,
When it has a negative value, the type of the non-harmonic sound is represented by its absolute value. Forward inference always starts with one rule, and this rule is called a root. Forward finding ends when it finds a negative conclusion Yi or Ni.

In the case of address assignment of the production rule data shown in FIG. 24, the data of each production rule is stored in five consecutive addresses starting from the address of the lower limit data Li. For details, Li is an address divisible by 5.
Xi is stored at the address of remainder 1 divided by 5, Ui is stored at the address of remainder 2, Yi is stored at the address of remainder 3, and Ni is stored at the address of remainder 4.

In FIG. 25, RULENO is set with the total number of production rules. The other points are clear from the above description and the description of the flow.

FIG. 26 shows an example of motif data (melody data) stored in the motif memory 5. FIG. 27 is a flowchart for reading the motif data that is the basis of the composition.
In the case of FIG. 26, the pitch data MDi of the note is stored at the even address, and the pitch data MRi of the note is stored at the next odd address. The number of notes in the motif is set in MDNO in FIG.

 This concludes the description of data reading.

<Generation of essence> In a fully automatic composition mode that does not use a motif, after data is read, rhythm, arpeggio pattern features, and non-harmonic features are generated as the essence of the song (No. 12).
Figure 12-4). FIG. 28 shows a flowchart of this essence generation. These essences are specified by the user or generated automatically. For example, the setting of the reference rhythm pattern in 22-1 is performed when the automatic rhythm pattern generation unit is selected, for example, when the time signature is 4/4 time and the pulse scale is normal. Is automatically generated as a reference rhythm pattern or the user inputs a favorite rhythm pattern. 22-2 Arpeggio pattern feature setting and 22
The feature setting of the non-harmonic tone of -3 is also performed automatically or by user input. FIG. 29 exemplifies a flowchart for automatically setting the features of the arpeggio pattern by random number generation and the like, and FIG. 30 exemplifies a flowchart for setting the non-harmonic features by the user inputting them.

PC in feature setting of arpeggio pattern (Fig. 29)
_{1 to} PC ₅ are the number of harmony to form an arpeggio in a section (for example, a bar) of a predetermined length, the highest harmony, the lowest harmony, the maximum value of the difference between adjacent harmony, the adjacent sum. The minimum value of the difference between voices is shown (see FIG. 15). Each PC
Can be generated for each section, and can be obtained by setting upper and lower limits of possible values and generating a random number therebetween. Alternatively, a series of PCs for the progress of the music may be prepared in a database, and a desired PC series may be selected.

In the non-harmonic feature setting in Fig. 30,
Displaying the keyword corresponding to each non-harmonic tone type a,
The user is prompted for input (24-2). The sequence of the non-harmony identifier a input by the user is entered in the RSi array (24−
3, 24-6, 24-7). When the code EOI indicating the end of the input is called, the number of non-harmonics is put in RSNO and the flow exits (24-8).

<Extraction of essence> In the composition mode using a motif, after reading data, the essence (rhythm, arpeggio pattern, arpeggio pattern feature, and non-harmonic feature) of the song is extracted from the motif (Fig. 12, 12-). 6).

The rhythm evaluation of the motif is illustrated in FIG. 31, the arpeggio pattern extraction is illustrated in FIG. 35, the arpeggio pattern feature extraction is illustrated in FIG. 38, and the non-harmonic feature extraction is illustrated in FIG. 39. In these flows, each essence is performed for each section (measure).

In the rhythm evaluation of FIG. 31, Ps in 25-1 contains position information indicating the number of the note at the beginning of the measure of the target bar, and Pss is the head of the bar indicated by Ps in Pss. Length of note protruding into previous bar (basic time expression)
, And Pe contains the positional information of the last note of the target bar (the note immediately preceding the first note of the next bar). Rr shown in 25-2 is a 16-bit register for storing the rhythm pattern of the target bar. If the length of one bar is 16, the first bit position of the register rr indicates the first basic time of the bar. Similarly, the Nth bit position represents the Nth basic time from the beginning of the bar. The processing from 25-3 to 25-9 is
In this process, the positions of the notes from the note Ps to the note Pe of the motif are obtained using the motif note length data MRi, and are written in the corresponding bit positions of the register rr. For example, if a result of 0001000100010001 is obtained as rr, this pattern rr indicates that a sound is generated at the first beat, second beat, third beat, and fourth beat of the target bar.

Details of the calculation of Ps, Pss, Pe, and Pee are shown in FIGS. 32 to 34. Pee represents the length of the note following Pe, that is, the length of the note at the beginning of the next bar interrupting the target bar.

In the calculation flow of Ps and Pss in FIG. 33, beat is the length of one measure (basic time length representation), bar is the number of the target measure (represents the measure number specified by the user. The designated measure number is 1). If it is less than or greater than the number of bars in the song (mno), it is an input error.
Ps = 1 and Pss = 0 are set (27-4, 27-5). The reason for setting Ps = 1 is that in the case of the first measure, the first note of the measure is the first note of the song or the first note of all motif data, and the reason for setting Pss = 0 is the preceding measure. Is not present. A ₁ obtained in 27-2 is the length from the beginning of the music to the bar at the front of the target bar, and this length a ₁ is the length obtained by accumulating the motif duration data MRi from the beginning. Compare with S (27-2, 27-8, 27-10, 27-1
2). When S = a ₁ holds, the next note of the i-th pitch data finally accumulated in S starts from the beginning of the target bar. Therefore, Ps = i + 1 and Pss = 0 (27−
9). On the other hand, when S> a ₁ holds, the note having the note length data added last to S, that is, the i-th note is the first note of the target bar. Therefore, Ps = i. The Pss = MRi-S + a ₁ to (27-9).

The calculation flow of Pe and Pee shown in FIG. 34 performs processing very similar to that of FIG. However the length of the beginning of the song to the rear bar line of the target bar enters the a _1, the description thereof is omitted for other points.

In the arpeggio pattern extraction flow shown in FIG. 35, an arpeggio pattern {LLi} is extracted from the motif of the target bar. An outline of the processing is as follows. For the measure indicated by Ps and Pe, the corresponding chord in the chord progression information is used to determine whether the motif data is a harmony, and the sound determined to be a harmony is determined. On the other hand, the corresponding note that constitutes the chord is searched for from the chord, and the data in the form of LL is obtained. To be more specific, first, the first note (Ps) to be evaluated is extracted from the motif data. The last note (Pe) is obtained (29-1). Next, constituent sound data is generated from the chord data (29-2, FIG. 36, FIG. 37).
Figure). As shown in FIG. 36, the chord constituent sound data memory stores chord constituent sounds for each type of chord whose root is C.
It is stored in the lower 12 bits of 16 bits. Each bit position represents each note name, and the lowest bit position is C (C). For example, cc = 0091 (hexadecimal) has "1" in the bit positions of "do", "mi" and "so", and represents a major constituent sound of C. Now, assuming that the code of the target section is Gmaj, the CD is
0007 (hexadecimal). From the chord configuration sound data memory,
The major chord constituent sound data cc (= 0091) at the address specified by the upper 8 bits of the CD is read out, and the lower 12 bits are replaced by the root value indicated by the lower 8 bits of the CD as shown in FIG. By turning to the left, the bit of "1" is moved to bit positions 7, 11, and 2 representing S, S, and L, and the chord constituting sound of Gmaj is expressed. In this way, chord constituent sound data is generated from the chord of the target section. Next, the scale counter i and the harmony sound counter k are initialized (29-3, 29-4). The process of 29-5 is a process of converting the pitch data MDi of the motif into the same data formation as the chord configuration sound data cc. For example, the sound of “G” is converted to data mm having “1” in bit position 7.

At 29-6, it is checked whether or not this pitch data mm is a chord constituent sound. This can be determined by taking the logical product (mm∧cc) of the pitch data mm and the chord constituent sound data cc. In 29-7 to 29-13, it is checked which of the bits “1” of the chord constituent sound data cc matches the bit “1” of the pitch data mm of the motif, and as a result c To the arpeggio pattern data LLk. At 29-15, the counter i is advanced to the next note, and LL is calculated until the note number reaches Pe (29-16). The LLNO of 29-17 contains the number of chords (length of the arpeggio pattern) in the target section.

The features of the arpeggio pattern in FIG. 38 are derived from the extraction results {LLi} and LLNO of the arpeggio pattern in FIG.

In the feature extraction of the non-harmonic sound in FIG. 39, the pattern of the type of the non-harmonic sound distributed in the motif of the target section is obtained. Set the non-harmonic counter and note counter (33
-2, 33-3), when the note of interest is a non-harmonic tone (33-4), a function F representing the characteristic element of the motif centered on the note is calculated, and forward inference by the production rule is performed. By executing, the type of non-harmonic sound is obtained and substituted into RSj (33-5 to 33-8). By performing this non-harmonic classification processing until Pe is reached, the arrangement of the types of non-harmonic sounds of the motif of the target section is set in the array {RSj}. The total number of non-harmonic tones in the target section is entered in the PSNO of 33-11.

The details of the process for determining whether or not the MDi shown in 33-4 is a non-harmonic tone are shown in FIG. This discriminating process is the same as the process of discriminating whether or not the note of interest is a harmony in the extraction of the arpeggio pattern (FIG. 35), and focuses on the constituent sounds of the chord in the target section. It can be determined based on whether or not the note name of the note that is present is included.

In the calculation of the function F in 33-6, in forward inference, a condition or a factor of a motif (melody) necessary for classifying a non-harmonic tone is calculated. FIGS. 41 to 49 show specific examples. In this example, as a function F, F ₁ : the number of a note (non-harmonic) at which the harmony is located (the position of the rear harmony) F ₂ : the number of notes before the note of interest F ₃ : Number of non-harmonic tones from forward harmony to backward harmony F ₄ : Pitch difference between forward harmony and backward harmony F ₅ : Non-harmonic pitch distribution between forward and backward harmony F ₆ : Whether the melody pitch from front harmony to backward harmony monotonically changes F ₇ : backward harmony F ₈ : Calculates the pitch difference between the preceding chord and the preceding chord, and the pitch difference between the preceding chord and the preceding chord (the pitch from the front chord). (Fig. 41). In addition, information indicating whether the beat is a weak beat or a strong beat, and information for distinguishing a sound duration may be added to the set of functions F. The flowchart for calculating each function F is clear from the description of the function itself, so the description is omitted.

Details of the forward inference in 33-7 are shown in FIG. First, the rule number pointer P is set to "1" indicating the rule that is the root of the production rules (44-1). Thereafter, it is checked whether or not the prerequisite part (Lp ≦ Fxp ≦ Up) of the rule indicated by the rule number pointer P is satisfied. If the rule is satisfied, the data Yp of the positive conclusion part of the rule is used as a pointer to the next rule. If not, the data Np of the negative conclusion part of the rule is used as a pointer to the next rule. However, when the data Yp and Np are negative values, the final conclusion has been reached, and the absolute values (−Yp and −Np) are set in the conclusion register as identifiers of the non-harmonic tone types. According to the flow, when the condition Lp> Fxp of 44-3 or the condition Fxp> Up of 44-5 is satisfied, the precondition Lp ≦ Fxp ≦ Up of the rule P is not satisfied, so the data Np of the negative conclusion part of the rule is not satisfied. Is substituted into a (44-4, 44-6). In other cases, since the premise is satisfied, the data Yp of the positive conclusion part of the rule P is entered in a (44-2). This a is substituted into P (44-7). When P is a positive value, the process returns to the next rule check as the next rule number pointer, and when P is negative, -P is set to the non-harmonic classification. The result is (44-8, 44-9).

As an example of the classification of non-harmonics, in the calculation of the function F, F ₁ = 1: the rear harmonics are one after the non-harmonics of interest F ₂ = −1: the forward harmonics are focused on F ₃ = 1 in front of the non-harmonic to be played, the number of notes between the preceding and following harmony is one F ₄ = 8: The pitch difference between the preceding and following harmony is 8 F ₅ = 2 : The non-harmonic between the preceding and following harmony is distributed in the middle of the pitch of the preceding and following harmony. F ₆ = 1: The melody from the front harmony to the rear harmony has a monotonous change in pitch. F ₇ = 1: Proceed with a pitch difference of 1 to the backward harmony F ₈ = 7: Proceed with a pitch difference of 7 from the forward harmony
Let's make an inference using the data shown in Figure 24.

First, when P = 1 (root), the premise 0 ≦ F ₂ ≦ 0 is not satisfied because F ₂ = −1. Therefore, the negative conclusion part N ₁ = 3 of the root becomes the pointer of the rule to be checked next.

At P = 3, the prerequisite 0 ≦ F ₁ ≦ 0 of Rule 3 is not satisfied because F ₁ = 1. Therefore, N ₃ =
5 becomes the pointer of the next rule.

At P = 5, the premise 0 ≦ F ₄ ≦ 0 of Rule 5 does not hold because F ₄ = 8. Therefore, N ₅ = 6
Becomes P.

At P = 6, the premise 1 ≦ F ₆ ≦ 1 of rule 6 holds because F ₆ = 1. Therefore, Rule 6
Positive conclusion part of the data Y ₆ = 7 next the pointer P of the access rules of.

At P = 7, the premise 3 ≦ F ₈ ≦ ∞ of Rule 7 holds because F ₈ = 7. Here, Y ₇ = −2 (negative). Therefore, the conclusion = 2 (the identifier of the classified non-harmonic sound).

<Evaluation of Chord Progression> The apparatus of this embodiment makes the best use of chord progression for composition. In other words, the 12
In the chord progression evaluation shown in -7, the hierarchical structure and tonality structure of the music are found using the given chord progression as a clue. The hierarchical structure relates to the consistency and diversity of the music, and is used for controlling the generation of arpeggios in melody generation described later. On the other hand, the tonality structure represents a change in tonality (key) as the music progresses, and is used to select a scale key used in each section in melody generation described later. Further, in the chord progress details, a process for planning the use of a special scale for a section of the special code is also executed.

Hereinafter, the extraction of the hierarchical structure will be described in detail with reference to FIGS. 51 to 53.

The flow shown in FIG. 51 is a flow for calculating the similarity of the chord progression between blocks in units of a block having a length such as a passage.

First, the length SUM of the song is obtained by accumulating the length CRi of each chord of the card progress information (45-1), and the length of the block indicated by barno (number of measures) is used to express the basic tone length. After conversion, the block length is set to 1 (45-2), and the music length SUM is divided by the block length 1 to calculate the number m of blocks included in the music (45-3). The counter i for the reference number of the block to be compared is initialized to "0" (45-4).

In steps 45-8 to 45-18, the code similarity Vij between the i-th block and the j-th block (j ≧ i) is calculated. As a function of similarity, You are using Where l is the length of the block, Vs
Represents the number of matching codes obtained when the code of the i-th block and the code of the j-th block are compared for each reference tone length. The similarity function Vij takes a value from 0 to 100. When the similarity function Vij is 100, the chord progression of the two blocks completely matches (100%), and when 0, the chord progression completely does not match.

The calculation of the similarity between the i-th block and the j-th block starts from the position of j = i (45-6), and every time the similarity is obtained, the similarity with the next block is calculated by j = j + 1. (45-20, 45-7) When the operation is performed until the final block is reached (45-19), the i-th block is shifted (45-22, 45-5) by i = i + 1, and i is the final block. Repeat the process until.

As a result, as the similarity Vij of the code of the j-th block to the i-th block, Is obtained. Vij = Vji, that is, the code similarity of the j-th block to the i-th block is equal to the code similarity of the i-th block to the j-th block. Vii = 100.

Calculation result of code coincidence between blocks in Fig. 50 ｛Vi
j｝ is used in the generation of the hierarchical structure data in FIG.

In FIG. 52, c is a counter for calculating the hierarchical structure, and the hierarchical structure identifier of the j-th block is set in Hj. Hj takes an integer value of 0, 1, 2,... As a value. This is a, a'b, b 'in ordinary expressions.
(See HIEi in FIG. 16). In the flow shown in FIG. 52, a block having the same value (even value) as the hierarchical structure identifier of the reference block is attached to a block having a 100% code match with a certain reference block (46-10, 46-1).
1) A block having a code progression that is a modification of the code progression of the reference block is assigned a hierarchical structure identifier of a value obtained by adding 1 to the hierarchical structure identifier of the reference block, as a block having a code progression that modifies the code progression of the reference block ( 46-12, 46-13). A block having a similarity of less than 70% is treated as a block having a hierarchical structure independent of the reference block. The first block of the music is selected as the first reference block (46-2), and the blocks that match 100% or 70 to 100% with this reference block have Hj = 0 and Hj = 1, respectively. The flag flj of these blocks is set to "1" in order to indicate the evaluation value and indicate the completion of the evaluation. Of the blocks of the song whose evaluation has not been determined in the first evaluation loop (46-2 to 46-15), the youngest block becomes the reference block in the next evaluation loop (46-46).
3, 46-4, 46-6), and the hierarchical structure identifier of this reference block is 2. Hereinafter, the same processing is repeated. As a result, all blocks of the song have the hierarchical structure identifier Hj.

The process of FIG. 53 is a process of converting the hierarchical structure in block units obtained in FIG. 52 into hierarchical structure data in measure units. That is, the hierarchical structure identifier for the a-th measure is set in HIEa in FIG.

Next, extraction of the tongue structure will be described with reference to FIGS. 54 to 57. In order to extract the tonality structure from the chord progression, the present embodiment takes into account the properties of the tongue structure of general music. The characteristics are as follows: (a) The tonality tends to maintain the same tonality rather than changing frequently in the progress of the music.

(B) The constituent sounds of a chord are on a musical scale of a specific tonality.

(C) When transposition occurs, it is easier to turn to a close relative such as a genus key or a subordinate key than to an unrelated key.

It is.

In order to provide the tonality structure to be extracted with the above properties, in the present embodiment, a tonality distance is defined between the chords, and if the chord in the current section has a tonality of a predetermined distance from the tonality in the previous section. The tonality of the current section is considered to be the same as the tonality of the previous section.

FIG. 57 exemplifies the mutual tonality processing of the chords. As can be seen from this figure, codes having a parallel tone relationship (for example, Am
And C) are zero, and thus have the same tonality (C). In addition, the tonality distance with respect to a chord that is completely 5 degrees below or completely 5 degrees is 2 or −2. Now Key C Datonic Scale (Doremi Fasoraside)
, The six chords C, Am, G, Em, F, and Dm within the tonality distance of ± 2 from chord C all have their chord constituent sounds on the diatonic scale of key C. As will be described later, in the present embodiment, the tonality is maintained for a chord change within the tonality distance ± 2.

In FIG. 54, in the processing from 48-1 to 48-5, tonality distance data is assigned to each code in the chord progression according to the definition of the tonality distance illustrated in FIG. That is, set to "0" as the tonality KEY ₁ for the first chord within 48-1 in 48-2～48-5, the first code tonality of CD ₁ tonality KEYi subsequent encoding CPi It is calculated by calculating the distance from KEY ₁ . 48-3
Its tonality is shown in FIG.

The CDi∧ooff in 50-1 is extracted in i-th code root data CDi (see FIG. 14), the result is a ₁ and a ₂
Is assigned to On the other hand root data of the first code CD ₁ enters in st. As shown in 50-5, root data a ₁ 50-
Each time to go around the loop of 3～50-6 is turn on 5 degrees, root data a ₂ is to be turn under 5 degrees (counterclockwise the ring shown in 57 FIG, or clockwise Equivalent). In 50-3, a ₁ = st holds only when CDi
Is obtained when the root sound data i is turned up 5 degrees, and 50-
In a 4, a ₂ = st is satisfied because the root data of CDi is i
Is turned 5 times or less. Therefore, for the former, i × (−2) is inserted into x as the tonality distance (50−
7) For the latter, insert i × 2 into x. From 50-9
50-17 is, and code CDi of interest as the first code CD ₁ is, both or major system or minor system, by or not, is where you are converting the x. For example, CD ₁ is Am
If CDi is Gmaj, x = + 4 by 50-7 (for comparison between root sounds A and G). This must be x = -2 according to FIG. In this case, in FIG. 56, the process proceeds from 50-10 to 50-11 and 50-13, and x = -2 is obtained by x = x-6. Also CD ₁
Is Cmaj and CDi is Bmin, x = -10 by 50-8
It has become. This must be x = -4 according to the definition of the tonality distance in FIG. In this case, the 56th
In the figure, 50-14 advances to 50-15, 50-17, and x = x
By +6, x = -4 is obtained. Calculation result x in Fig. 56
Is transferred to KEYi.

An example of the processing from 48-1 to 48-5 is shown in (1) of FIG.
Chord progression _{C, C, F, G 7} , Bb, F, as against G _7, c, tonality distance _{{KEY}, KEY 1 = 0} , KEY 2 = 0, KEY 3 = +
2, KEY ₄ = -2, KEY ₅ = +4, KEY ₆ = +2, KEY ₇ =-
2. KEY ₈ = 0 is obtained.

The tonality distance {KEY} obtained in this way is the following 48
In the processing from −6 to 48−14, conversion is performed so as to have the tonality property described above. In other words, the tonality data immediately before
When the tonality data of the current chord is located within ± 2 from the immediately preceding tonality data skey, the tonality data of the current code is converted to the immediately preceding tonality data to maintain the tonality. , Is regarded as modulation only when the distance exceeds ± 2, and the value obtained by ± 2 from the tonality data of the current code is used as final tonality data.

The processing side from 48-6 to 48-14 is shown in FIG. 55 (2).
Chord progression _{C, C, F, G 7} , Bb, F, as tonality for _{G 7, C {KEY},} 0,0,0,0,2,2,0,0 is obtained.

In this manner, a tonality structure having a desired property as a musical piece is extracted in the data format of the distance expression.

In FIG. 54, from 48-15 to 48-25, the tonality structure data of the distance expression is being converted into the pitch name expression representing the root of the scale. In this tone name expression, C is assigned a numerical value of “0”, C # is assigned a numerical value of “1”,. For example, assume that the first chord of a song is Cmaj, the i-th chord is Fmaj, and the tonality of this Fmaj is "2" in the distance expression. The corresponding pitch name expression is “5”. For this conversion, the process proceeds with 48-15 than 48-16,48-17, where _{a 1 = KEY 1 -KEYi × 7} /2 is performed, KEY ₁ = 0, KEYi =
Since at 2 a ₁ = -7 next, a ₁ = 5 next by the processing of 48-18,48-19, which is KEYi (48-20). If the first chord of the song is a major chord, KEY ₁ = 00
ff∧CD ₁ gives the root of the scale of the first chord section, but in the case of a minor system, according to the relationship of Am = C,
KEY ₁ = (00ff∧CD ₁ +3) mod12 is executed to obtain the root note of the scale of the first chord section (48-16, 48-21 to 48
-23).

FIG. 55 (3) shows an example of processing from 48-15 to 48-25.
When chord progression is _{C, C, F, G 7} , Bb, F, G 7, C, scale of the keys used in each code section (tonic)
Becomes C, C, C, C, F, F, C, C.

As will be described later, each tone of the melody generated in each chord section is selected from a scale using the tonality structure data extracted by the above processing as the main tone.

Next, scale evaluation will be described with reference to FIG. The purpose of this processing is to use a special scale as a scale for melody generation for a section where a special code is used. In Figure 58, ISCA
LE is the scale selected in the initial setting 12-1 (FIG. 12). If the code CDi is the deminish code "dim", set the combination deminish scale as the scale SCACEi to be used in that section, and set the code CDi
When i is an augment code "aug", set the whole tone scale as the scale, and when code CDi is the seventh code "7th", dominant as the scale
7th scale is set. As the tones of these chord sections, the root note of the chord is used instead of the tonality data obtained in the tonality structure extraction processing. Therefore, in a section other than these exceptional chord sections, a scale of the type selected in the initial setting is used as a scale, and its tonic is determined by tonality data obtained by the above-described tonality structure extraction processing.

<Melody Generation> In the apparatus of the present embodiment, data serving as a basis for composition is given from the outside, and the basic data is internally analyzed and evaluated, and then the operation of melody generation is started.

FIG. 59 illustrates a schematic flow of the melody generation shown in 12-8 of the composition general flow (FIG. 12). In FIG. 59, HIEi is hierarchical structure data for each code section extracted in the previous chord progress evaluation, and as shown in 53-2 to 53-4, this hierarchical structure data HIEi is an arpeggio pattern (L
L) is used for generation control. Details of this control will be described later. Further, the hierarchical structure data can be used to control the range of the arpeggio pattern (LL) as shown in 53-5 and 53-6.

The arpeggio pattern (LL) is converted to a pitch expression format, that is, a melody data format (arpeggio) by using the chord data CDi (53-7). Then, a non-harmonic tone is added to this arpeggio in accordance with the production rules (53-8). The production rules used for adding the non-harmonic sounds are the same as those used for classifying the non-harmonic sounds included in the motif, and therefore, the reversibility is established with respect to the analysis and synthesis of the melody.

By adding a non-harmonic tone to the arpeggio, the pitch sequence of the melody is completed. After completing the melody pitch line,
This is the generation of a melody pitch sequence (rhythm pattern) (53
-9). Here, a basic rhythm pattern (Essence generation 4-4 or Essence extraction 4
The pitch sequence determined in -6) is transformed by the pulse scale selected in the initial setting 4-1 and converted into a pitch sequence having the same number of notes as the pitch sequence of the melody.

The generation of an arpeggio, the addition of a non-harmonic tone, and the generation of duration data are executed for each chord section in the case of the flow shown in FIG. Therefore, in 53-10, the melody data generated in a certain section is moved to the continuous area.

FIG. 60 is a detailed flowchart of generation, saving, and loading of an arpeggio pattern (sound pattern) (53 in FIG. 59)
-2, 53-3, 53-4). In this example, the control of the arpeggio pattern LL by the hierarchical structure data HIEi is performed as follows. First, it is determined whether or not the focused phrase is a section structurally different from the past phrase by comparing the hierarchically structured data of the focused phrase with the past hierarchically structured data. A new arpeggio pattern LL is generated only for a passage recognized as a section having a different structure. This generation is performed based on the feature parameter PC of the arpeggio pattern described above. A new arpeggio pattern will be added to passages recognized as having the same structure.
LL is not generated. Instead, of the arpeggio patterns generated in the past, an arpeggio pattern generated in a section having the same structure as the section of interest is used.

For example, suppose a tune composed of four passages, and assume that the structures of these four passages are a, b, c, and a, respectively. Since the structure a of the first phrase is a structure not seen in the past, an arpeggio pattern is generated according to the feature parameters of the arpeggio pattern. Similarly, since the second and third phrases also have new structures b and c which have not been seen in the past, arpeggio patterns are independently generated. However, the final passage has the same structure a as the first passage of the song. Therefore, the arpeggio pattern generated for the first phrase is used as it is as the arpeggio pattern for the final phrase.

Generating a new arpeggio pattern for a phrase having a new structure means that another motif is generated from the phrase having the new structure. If the arpeggio pattern generated for the first measure of a passage is repeatedly used for subsequent measures of the passage, a motif having a length of one measure will be recognized. Generally, the length of a motif is one to several measures, and the length of the motif often changes in the middle of a song. Considering this, in the example of FIG. 60, when a phrase having a new structure is detected, one or two measures can be used as the length of the motif in the phrase. When a two-bar motif is selected, an arpeggio pattern is generated independently for the first bar and the second bar of the passage, and the odd-numbered bars that follow use the arpeggio pattern of the first bar and the even bars that follow. The second measure uses the arpeggio pattern of the second measure.

A sound (LL) data buffer is prepared for referencing the hierarchical structure data in the past section and repeating the arpeggio pattern in the past section. FIG. 61 shows an example of the sound data buffer.

Referring to FIG. 60, the bar counter in the passage (the section for each barno shown in FIG. 51) is set to "1" at 54-1. In 54-2, the hierarchical structure data HIEi of the current measure is compared with the hierarchical structure data HIEi-1 of the immediately preceding measure, whereby
Check whether the passage has started. For example, | HIEi-HIE
When i−1 | ≧ 2 holds, the passage is started. If it is determined that the passage has started, the bar counter in the passage is reset to "1" (54-3). Subsequently, the sound type data buffer is searched to determine whether the current phrase is a phrase for which an arpeggio pattern should be newly generated (54-4). The search of the sound data buffer is performed as follows. First, data at address 0 of the sound pattern data buffer (data indicating how many sets of sound patterns have already been generated) is read, and data indicated by subsequent addresses 1 to N as addresses (each data). The head information of the sound pattern is sequentially read, and the hierarchical structure data indicated by the upper 8 bits is compared with the hierarchical structure data HIEi of the current bar. If there is no hierarchical structure data (for example, data having the same value as HIEi or a value of (HIEi-1)) equal to the hierarchical structure data HIEi of the current bar in the sound type data buffer, the current bar newly sets the arpeggio pattern. This is the first measure of the passage to be generated. When a head having the same hierarchical structure data is found, the following arpeggio pattern is loaded as the arpeggio pattern of the current bar. In the case of a new passage, first determine how many measures the motif is composed of (54-5). This determination can be realized by random number generation, for example. When a two-bar motif is reached, the flag fl is set to "1" (54-7, 54-
8) An arpeggio pattern is newly generated for the next bar (the second bar of the passage). Then, an arpeggio pattern is generated (see FIG. 62) and saved in the sound pattern data buffer (54-9).
A header is created by Ei × 0100 + measure counter value × 0010 + the number of measures of the motif, the number N of the sound group at address 0 of the sound data buffer is incremented, the address of the header is written to the address N, and from that address. writes header, LLNO (length of the generated arpeggio _{pattern), LL 1, LL 2 ......} LL LLNO (data of the generated arpeggio pattern). Thereafter, other melody generation processing is performed (54-10), and the bar counter is incremented (54-11).

If it is found in step 54-2 that the phrase has not changed, the flag fl is checked (54-13). When fl = 1, the current measure is 2 in the phrase that generates a 2-bar motif.
Since this is the second measure, an arpeggio pattern is generated again, loaded into the sound data buffer (54-15), and the flag fl is reset to "0" (54-16). When fl = 0, the header corresponding to the hierarchical data HIEi of the current bar is searched from the buffer, and when the length information of the motif indicated by the header is one bar, the sound pattern data following the header is searched. When the motif is two measures long, the remainder of the measure counter is compared with the measure number of the header, and if they match, the tone data following the header is loaded as the arpeggio pattern of the current measure.

FIG. 62 shows details of the generation of the arpeggio pattern (sound pattern) executed in 54-9 and 54-15 in FIG. 56-1 ck
"no" indicates the number of chord components. The number of chord constituent sounds is obtained by counting the number of "1" in the 16 bits of chord constituent sound data (see FIG. 36). In the example of 62 view, and the control parameters of the arpeggio pattern that generates a PC ₁ to PC _5. r1 takes a random value in the range of ₁ to ckno, and means a chord component sound number (56-4). r ₂ is PC ₃
Take the random value of the octave code of (lowest note of the arpeggio pattern) ~ PC ₂ (highest note of the arpeggio pattern)
Indicates the octave number of the LL to be generated (56-5). a =
LL candidates generated by r ₁ + r ₂ × 0100 are calculated (56−
7) When this candidate a satisfies the condition of PC, the candidate a
Is adopted as LL (56-8, 56-12, 56-14). However, depending on the value of PC, the preceding LL (for example,
After LL ₁ ) has been determined, subsequent LL ₂ candidates may not permanently satisfy the PC requirements. For example, PC ₂ = 501 (the highest note of the arpeggio is the first chord component of the fifth octave), PC ₃ = 401 (the lowest note of the arpeggio is the first chord component of the fourth octave), and PC ₄ = 3 (the neighbor When PC ₅ = 3 (the minimum difference between adjacent LLs is three chord constituent sounds), LL ₁ is assumed as LL ₁ and LL ₁ = 403 (first). 's LL to match the fourth when the first chord member octave) is to obtain PC _4, PC ₅ conditions, when LL ₂ = 503 or 303 (constituting note number 3), which is PC ₂ Does not meet the requirements of PC ₃ . To prevent this, prepare a loop counter LOOPC and set the loop counter L
When OOPC exceeds a certain value (for example, 100) or more, candidate a is forcibly adopted as LL. (56-9, 56-10, 57-
11).

FIG. 63 shows details of the check 56-8 in FIG. LLi
In order for the candidate a to satisfy the condition of PC, (a) a ≦ PC ₂ (must be lower than the highest note) (b) a ≧ PC ₃ (must be higher than the lowest note) (c) | a−LLi −1 | ≦ PC ₄ (The difference from the previous LL is the maximum value PC ₄
(D) | a−LLi−1 | ≧ PC ₅ (the difference from the immediately preceding LL is the minimum value PC ₅
Must be satisfied). In the flow of FIG. 63, when these conditions are not satisfied, the flag OK is set to “0” (olda in the figure represents the immediately preceding LL; see 56-13).

FIG. 64 is a detail of 53-7 in FIG. The purpose is to convert the format of the arpeggio pattern LL indicated by (octave number + chord component number) to the format of melody pitch data indicated by (octave number + note name number) using the chord component sound data cc. And store it in MEDi.
The processing of 58-5 and 58-6 is performed by the chord number of LLi (LLi
When {00ff) is greater than the number of chord constituent notes (CKNO) of the chord in the current section, the process of changing the LLi chord constituent note number to the highest chord constituent note image in the chord constituent sounds in the current section. is there. In the figure, c is a counter of chord constituent sounds, LL
i∧ff00 is the octave number of LLi, and j is a note name counter.

FIG. 65 and FIG. 66 show details of the non-harmonic tone addition in 53-8 in FIG. The purpose of this processing is to add a desired non-harmonic sound to the arpeggio to complete the pitch sequence of the melody. For the addition of non-harmonic tones, the above-mentioned non-harmonic features {RSi}, tonal structure obtained from chord progression evaluation ｛KEY
i｝, a production rule expressing knowledge for classifying non-harmonic sounds is used. The added non-harmonic tone must satisfy the following conditions.

(B) The sound must be within a predetermined range. (B) The sound must be on a scale with the KEYi obtained in the chord progression evaluation as the main tone. (C) It must be a sound outside the chord structure. In FIG. 65, the loop outside 59-4 to 59-18 is a loop that repeats for the number of planned non-harmonic identifiers RSi. The loop from -5 to 59-16 repeats the number of notes in the arpeggio. In 59-8 to 59-14, each pitch data k in the range from the lower limit lo to the upper limit up is sequentially examined as non-harmonic candidates (see FIG. 67). When the pitch data k is a scale tone and a non-chord-structured sound, (59-8,
59-9), calculate the function F (59-10), perform forward inference based on the production rules (59-11), and check whether the conclusion matches the planned non-harmonic identifier RSi. (59-11). When they match, the pitch data k satisfies all of the above-mentioned conditions for non-harmonic sounds. Therefore, the non-chord tone counter nctct for counting the number of non-harmonics to be added is incremented, the pitch data k of the found non-harmonics is put in VMnctct, and the additional position j of the non-harmonics is set in POSTnctct. , The associated flag fl _j is set to “1” (59-19 to 59-22). In this example, at most one non-harmonic sound is added between harmonic sounds, and fl _j = 0 means that a non-harmonic sound has not yet been added between the harmonic sounds MEDj and MED _{j + 1.} Is shown.

Conclusion at 59-12 = When the condition of RSi is not satisfied,
Since the pitch data k of interest does not satisfy the condition as a non-harmonic tone, the pitch data k is incremented (59
-13), repeat the process. When k> UP is satisfied in 59-14, it means that a non-harmonic tone has not been added between the harmonics MEDj and MED _{j + 1} . Therefore, j is incremented (59-15), and the process proceeds to a check as to whether a non-harmonic sound can be added between the next harmonic sounds.

Details of the setting of the candidate sound in 59-6 are shown in FIG. In this example, the pitch is searched from 5 semitones above the higher tone of the preceding and following harmony notes MEDi and MED _{i + 1} to 5 semitones below the lower tone (62-5 to 62-7). ). However, when i = 0, that is, when an attempt is made to add a non-harmonic sound before the first harmonic sound in the section of interest, the pitch range from 5 semitones to 5 semitones below the first harmonic sound is set. (62-1, 2), when i = Vmedno, that is, when an attempt is made to add a non-harmonic tone after the last harmonic tone in the section of interest, a fifth semitone to a fifth semitone below the last harmonic tone Up to the pitch range (62-3, 4).

FIG. 71 shows details of checking whether or not the pitch data k in 59-8 is a scale tone. SCAUEi in the figure represents the type of the scale used in the section i, and is an address pointer of the scale data memory 5 as shown in FIG. The 12-bit scale data * SCALEi at this address is rotated by the KEYi obtained in the chord progression evaluation described above (65-
2). For example, when SCALEi is “0” (diatonic scale), the data represents Doremifasoraside having C as a main tone. When KEYi is “5” (F), the data
By turning it, it is converted into scale data a having F as the main tone. 65-3 is a process of converting the pitch data k (indicated by MD in the figure) into the same data format as the scale data, and as a result, the logical product of the b and the scale data a is "0"
Then, it is concluded that the pitch data k is not a scale note, and when the logical product is not "0", it is concluded that the pitch data k is a scale note (64-5-64-).
7).

Details of the calculation of F in 59-10 are shown in FIG. In this example, since only one non-harmonic sound is added between the preceding and succeeding harmonic sounds, some functions (F _{1 to} F _{3 in the} figure) are set to predetermined values.

Details of the forward inference of 59-11 are shown in FIG. 50 described above.

When the processing in FIG. 65 is completed, the total number of added non-harmonic sounds is stored in nctct, and the i-th in the array {Vi} is
The pitch data of the non-harmonic tone added i-th in the processing of FIG. 65 is stored, and the i-th of the array {POSTi} is
The position information of the i-th non-harmonic sound added in the processing of the figure is stored.

These data are converted to the format of the melody pitch sequence {VMEDi} by the processing in FIG. Array ｛VME
Di｝ is initially set to arpeggio {MEDi}. 60
-2 to 60-9 are arrays {POSTi}, {V
This is the process of sorting Mi｝. In 60-10 to 60 to 19, the pitch data VMi of the non-harmonic tone is inserted at the position indicated by the position data POSTi.

In this example, only one non-harmonic sound can be added between the harmonious sounds, but the processing may be changed so that a plurality of non-harmonic sounds can be added.

At this point, the pitch sequence of the melody is completed. The remaining processing is generation of a melody duration sequence.

FIG. 72 shows the flow of generating a melody duration string (53
-9 details). First, the number of notes of the reference rhythm pattern obtained by generation or extraction of the essence is calculated as the number of notes Vmedno (the number of data in the pitch sequence of the melody) generated in the section of interest.
, And the difference a between them is calculated (66-1). When the number of generated notes is smaller than the number of notes in the reference rhythm pattern (when a> 0), the optimal combination of notes by the pulse scale is repeatedly executed by the number of differences (66-2 to 66-).
6). When the number of generated notes is larger than the number of notes in the reference rhythm pattern (when a> 0), the optimum division of the notes is repeatedly executed by the difference (66-7 to 66-11). In this example, 16-bit data is used as the rhythm pattern data format, and each bit position is assigned to each timing.
Since it indicates that sound is generated at the bit position having the value of “1”, it is finally converted to the MER data format (66-1
2).

Details of the combining process are shown in FIG. In the figure, PSCALEj represents the j-th component scale of the pulse scale to be used, and RR is a rhythm pattern to be processed. Notes are combined by setting the point with the smallest pulse scale weight to "0" in the bit of RR "1". For example, if the reference rhythm pattern is And if one note is combined using the normal no pulse scale (see Figure 11), the result is Becomes

 This is obtained as follows.

First, RR is initially 0001 0001 0101 0001. On the other hand, the normal pulse scale is 1213 1214 1213 1215. The point where the normal pulse scale has the minimum weight among the bits “1” of the RR is the seventh position from the right end. The bit at this position becomes “0”. Thus, the resulting RR is 0001 0001 0001 0001, which is Is represented.

Details of the dividing process are shown in FIG. The division is performed by setting the point at which the weight of the pulse scale is maximum to "1" among the bits of RR "0". For example, rhythm pattern On the other hand, when dividing notes with the normal pulse scale, the result is Becomes

Details of conversion 66-12 to MER data format are shown in FIG. 75. In the figure, c ₁ is the counter of a note, c ₂ is a counter that measures the sound length of each note. In this example, since MER ₀ has a length until the first “1” appears from RR, it is possible to process notes that straddle a section boundary line (measure line) (measures against syncopation).

Details of the data movement 53-10 are shown in FIG. First, MER ₀
(The blank part at the beginning of the current generation section) is added to the duration data MELRmeldno of the last generated sound. Here, meldno represents the number of notes already generated. The pitch sequence generated this time
VMED _{1 to} VMEDvmedno are moved to MELD, and the generated tone length strings MER ₁ to MERvmedno are moved to MELR (70-2-70-
6). Update meldno and finish (70-7).

[Effects of the Invention] As described above, the present invention sets and inputs the degree of sensation of a song in order to obtain a chord progression in an automatic music machine of a type that automatically generates a melody based on a chord progression and a melody feature parameter. And a chord progression generating means for automatically generating a chord progression in accordance with the degree of feeling set by the setting inputting means. Therefore, the degree of feeling set by the user is reflected in the melody of the music via the chord progression, so that the user can obtain a desired music more efficiently. In addition, there is an advantage that even a person who has no musical knowledge about the chord can enjoy composing in accordance with the image.

[Brief description of the drawings]

FIG. 1 is an overall configuration diagram of an automatic music composer according to an embodiment of the present invention, FIG. 2 is a diagram showing an example of an input device for setting and inputting a degree of feeling, and FIG. 3 is an example of a chord progression database. FIG. 4, FIG. 4 shows a list of variables, FIG. 5 is a general flowchart of chord progression generation when a degree of brightness is designated, FIG. 6 is a flowchart of code data readout, FIG. A flowchart for calculating the degree of brightness, FIG. 8 is a flowchart for collating the degree of brightness,
FIG. 9 is a flowchart for selecting chord progression, FIG. 10 is a general flowchart for chord progression generation when the degree of essence is specified, FIG. 11 is a flowchart for generating chord progression in random numbers, and FIG. FIG. 13 is a flowchart showing the overall operation in the mode, FIG. 13 is a diagram showing a list of main variables used in the music composition process, FIG.
FIGS. 14, 15, 16, 17, and 18 show the format of data used, FIG. 19 shows a flowchart of initialization, and FIG. 20 shows an example of chord progression data , FIG. 21 is a flowchart for reading the chord progression data, FIG. 22 is a diagram illustrating pulse scale data stored in the pulse scale memory, FIG. 23 is a flowchart for reading pulse scale data, and FIG. 24 is a production rule FIG. 25 is a diagram exemplifying production rule data stored in a data memory, FIG. 25 is a flowchart for reading production rule data, FIG. 26 is a diagram exemplifying melody data (motif data) stored in a motif memory, FIG. Is a flowchart for reading melody data, FIG. 28 is a flowchart for generating essence, and FIG.
29 is a flowchart for setting the characteristics of the arpeggio pattern, FIG. 30 is a flowchart for setting the characteristics of the non-harmonic sound, FIG. 31 is a flowchart for evaluating the rhythm of the motif for each section, and FIG. 32 is Ps, Pe, Pss, Flowchart of calculation of Pee, FIG. 33 is a flowchart of calculation of Ps, Pss,
FIG. 34 is a flowchart for calculating Pe and Pee, FIG. 35 is a flowchart for extracting an arpeggio pattern of a motif, FIG. 36 is a diagram showing an example of constituent sound data of each chord, FIG.
FIG. 37 is a flowchart for generating constituent sound data from chord data, FIG. 38 is a flowchart for extracting arpeggio pattern features, FIG. 39 is a flowchart for extracting non-harmonic features, and FIG. 40 is a melody based on chords. Flowchart for classifying sounds into harmony and non-harmony, No. 41
Figure is a flowchart for calculating the function F representing the status of the analyte melody, the flow chart of FIG. 42 calculates functions F _1, the flow chart of FIG. 43 calculates the function F _2, FIG. 44 calculates the function F ₃ of the flowchart, the flowchart of FIG. 45 calculates the function F _4, a flowchart of the calculation of FIG. 46 is a function F _5, FIG. 47 is a flow chart for calculating the function F _6, 48
The figure shows a flowchart for calculating the functions F ₇ and F ₈ , FIG. 49 shows a flowchart for temporarily storing the calculated function F, FIG. 50 shows a flowchart for inferring the type of non-harmonic tone, and FIG. 51 shows the chord progression between blocks 52 is a flowchart for generating hierarchical structure data from the calculated coincidence, FIG. 53 is a flowchart for converting the hierarchical structure data of the block into the hierarchical structure data for each code section, and FIG. Figure is a flow chart for extracting a chord progression color tonality structure, Figure 55 Figure illustrating the extraction process of tonality structure, FIG. 56 is first code CD ₁ and the i-th code CDi
57 is a flowchart showing a definition of a tonal distance between chords, FIG. 58 is a flowchart showing a scale (scale) process, FIG. 59 is a flowchart of melody generation, and FIG. Figure 60 is a flowchart showing the generation, saving, and loading of sound patterns (arpeggios).
61 is a diagram illustrating a sound type data buffer, FIG. 62 is a flowchart of arpeggio pattern generation, FIG. 63 is a flowchart of a check in arpeggio pattern generation, FIG. 64 is a flowchart of converting an arpeggio pattern into a melody data format, Fig. 65 and Fig. 66 are flowcharts for adding a non-harmonic tone to an arpeggio, Fig. 67 shows a sequence of non-harmonic tone addition processing, and Fig. 68 sets a pitch range as a non-harmonic tone candidate. FIG. 69 is a flowchart of the calculation of the function F, FIG. 70 is a diagram showing an example of scale data stored in the scale data memory, FIG. 71 is a flowchart of the identification of scale notes, and FIG. FIG. 73 is a flowchart of the optimal combination of notes, FIG. 74 is a flowchart of the optimal division of notes, and FIG. ME rhythm pattern
FIG. 76 is a flowchart for converting the generated melody data to a continuous area. 1 ... CPU, 3 ... input device, 4 ... chord progress database, 6 ... melody feature parameter memory.

Continuation of the front page (56) References JP-A-62-187876 (JP, A) "Computepia" Vol. 9 No. 110 (December 1, 1975) Computer Age, Inc. 12-P. 19

Claims (1)

(57) [Claims] 1. A setting input means for setting and inputting a degree of sensation of a tune, a chord progression generating means for generating chord progression information based on the degree of sensation, and a melody characteristic parameter representing a character and a style of the melody. An automatic melody device comprising: a melody feature parameter assigning unit that generates a melody based on the chord progression information and the melody feature parameter.