JPH0887271A - Compression method and expansion method for playing information - Google Patents

Abstract

PURPOSE: To compress playing information in order to reduce the data amount of playing information which specifies the interval of sound constituting musical tone and the sounding time by deleting a repeated part so as not to overlap the repetition part when the existence of a repetition is detected. CONSTITUTION: SMFs of many musics are stored in a memory. An SMF1 equivalent to one music specified by a control system is separated every channel by an MIDI CH separation block 2. A block 3 detects a (▵t+event) block repeat and when there exists a repetition in the playing information pattern, the block 3 detects the repetition. A block 4 performs an R(repeat) coding processing, deletes the repeated part detected by the block 3 so as not to overlap the repetition part and adds necessary signals. A merge processing block 5 merges the signals to which multi-channel R coding processings are performed into an original SMF format. Thus, ▵t is in integrated into one body and a compressed file 6 is produced.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to compression and decompression of performance information, and in particular, compression for reducing the amount of performance information data designating the pitches and durations of notes constituting musical tones and the performance once compressed. Regarding decompression of information.

[0002]

2. Description of the Related Art For example, a MIDI signal is used as performance information for designating a pitch and a tone generation time of notes constituting a tone. MI
The DI signal is stored in a memory or the like and transmitted in the form of SMF (standard MIDI file). Such a MIDI signal is used in a system called communication karaoke, instead of a karaoke device of the type that reads data recorded in a storage medium such as a conventional optical disk.

In this communication karaoke, if karaoke music, lyrics, related images (moving image or still image), etc. are transmitted as they are in the form of information of signals output from an optical disk or the like, the amount of data is enormous, so that a musical tone is generated. The information is transmitted as a MIDI signal from the station to a terminal provided at each user's place of use, and the lyrics are transmitted as a character code, and the data of a desired song is distributed as necessary. As such an example, the "JOYSOUND" system manufactured by EXXING Co., Ltd. is known. A technique for efficiently processing the repeated portion of the musical score data of a melody consisting of notes and signals is Japanese Patent Publication No.
1-91697, this is MID
It is not based on the I signal, but based on the existence of a musical score using symbols such as repetition, S
It is not a technique for compressing existing performance information expressed by MF. Further, Japanese Laid-Open Patent Publication No. 4-147192 discloses a technique for patternizing a repeated portion of a musical score, but sufficient data compression cannot be expected.

The systems proposed so far, including the above-mentioned conventional online karaoke system, are classified as shown in Table 1 below.

[0005]

[Table 1]

[0006]

As can be seen from Table 1, when the MIDI signal is used, the quality of the sound reproduced from the CD, LD, etc. is not the same, but if the quality is improved, the data is not reproduced. It can be seen that the amount increases. If the amount of data is large, real-time communication cannot be performed unless a high-speed digital line such as ISDN is used, and the memory capacity required for storing and storing data also increases, leading to an increase in cost. This problem is an obstacle for the online karaoke system to spread to general households. In addition to communication problems, compression of data amount is also required in so-called package karaoke system in which performance information of many songs is stored in a large-capacity memory such as a hard disk.

As it is said that music is a repetitive art, performance is often repeated in a certain pattern. However, since performance information such as MIDI signals treats the sequence of events that occur on the time axis as they are, the compression of the amount of data is limited to the general digital signal compression technique. Therefore, in communication karaoke that distributes performance information and package type karaoke systems that store data of many songs in memory,
Cost reduction and communication time reduction by compressing / reducing data volume are required.

Therefore, according to the present invention, a performance information compression method capable of compressing performance information so as to significantly reduce the data amount of the performance information designating the pitches and onset times of notes constituting a musical tone, and the compression method. An object of the present invention is to provide a performance information expanding method capable of expanding the generated performance information to obtain basic performance information.

[0009]

In order to achieve the above-mentioned object, in the present invention, attention is paid to the fact that performance information is repeated in fixed time units and there is an overlapping portion, such a repeating portion is detected, and this is deleted. In addition, a signal indicating the position of the deleted repeated portion is inserted so that the compressed information can be correctly reproduced at the time of reproduction, and at the time of reproduction, the compressed performance information is decompressed using this signal to restore the original The performance information is obtained.

That is, according to the present invention, the step of dividing the performance information into parts of a predetermined time unit by receiving the performance information designating the pitch and the pronunciation time of the notes constituting the musical tone, and the step of dividing the performance information Comparing the performance information obtained for each part in chronological order, and determining whether or not the pattern of change in the performance information in the time axis direction is continuous for two or more parts and the performance information is repeated. When,
When it is determined that there is repetition in the determining step, a step of counting the number of repeated parts, and when it is determined that there is repetition in the determining step, deleting the repeated parts so that they do not overlap And, when it is determined that there is repetition in the determining step, information indicating that the pattern is repeated in the portion deleted by the deleting unit, and the repetition of the pattern counted in the counting step. And a step of adding information indicating the number of times, the method for compressing performance information is provided.

Further, according to the present invention, the step of dividing the performance information into parts of a predetermined time unit in response to the performance information designating the pitch and the pronunciation time of the notes constituting the musical tone, and the step of dividing the performance information The performance information obtained for each part is compared in chronological order, and a part of the performance information whose change pattern in the time axis direction is 2 is excluded.
When the performance information is repeated, the step of determining that the performance information is repeated, the step of counting the number of repeated parts when it is determined that the performance information is repeated, and the step of determining are performed. When it is determined that there is repetition, a step of deleting different portions that are not repeated in the repeated part so that other portions do not overlap, and when it is determined that there is repetition in the determining step, A performance information compression method comprising: information indicating that pattern repetition occurs in a portion deleted by the deleting step and information indicating the number of times the pattern is repeated counted by the counting step. Provided.

Further, according to the present invention, the step of dividing the performance information into parts of a predetermined time unit in response to the performance information designating the pitches of the notes constituting the musical tone and the pronunciation time, and the step of dividing the performance information The data is sequentially compared on a part-by-part basis from the first part in the obtained part string, the same part number is assigned to the parts of substantially the same data, and the file A is created; The part numbers are checked, and when duplicate numbers appear, a step of creating a new file B by deleting them, and comparing the file A and the file B from the first part to the part number by part, If a different part number appears, or if there is no part in the file B to compare with the part in the file A, the jumper to be inserted. Incrementing the level for identification in each of the marks and tags, the file B
An incremented jump mark of the level is inserted immediately before a different part number in the file, and the level is incremented immediately before a part number in the file B that is the same as the different part number in the file A. The step of inserting a tag and the different part number in the file A and the part immediately after the tag in the file B immediately after the tag are inserted are compared on a part-by-part basis. , The performance information compression method is provided.

Further, according to the present invention, a step of receiving performance information designating a pitch and a pronunciation time of notes constituting a musical sound and dividing the performance information into parts of a predetermined time unit, and a file having no initial content Creating C, and
Setting a pointer of the file C indicating the position in the file C to the head of the file C, creating a part list initially having no content, and setting a variable i to the first part number of the file A Step, a part number confirmation step of determining whether or not the variable i is in the part list, and if there is no part number indicated by the variable i in the part number confirmation step, the pointer is stored in the file C. A first pointer position determining step of determining whether or not the pointer is at the end, and when the pointer position is other than the end of the file C, a jump mark JUMP (n) is set at the position where the pointer is currently.
, Then move the pointer to the end of the file C, and then tag TAG at the position of the pointer.
(N) is inserted, the variable n is incremented by one, and when the pointer position is the end of the file C, the performance information of the part indicated by the variable i of the file A is stored in the file C. Is added to the part list, the variable i is added to the part list, and the pointer is moved to the end of the file C. If there is a part number indicated by the variable i in the part number confirmation step, the pointer is added. Is at the beginning of the part indicated by the variable i of the file C, and a second pointer position determination step; and when the pointer position is other than the beginning of the part indicated by the variable i of the file C, Jump mark JUMP at the position where the pointer is currently
(N) is inserted, then the pointer is moved to the head position of the part indicated by the variable i in the file C, and then the tag TAG (n) is inserted at the position of the pointer, and the variable n is set to one. After the step of incrementing, when the pointer is the head of the part indicated by the variable i of the file C, after the step of moving the pointer to the head position of the next part, and the step of moving the two, A next part number setting step of searching the next part in the file A, and setting the next part number of the file A in the variable i if it exists,
A performance information compression method is provided in which the part number confirmation step and the next part number setting step are repeatedly performed until the file A has no next part.

Further, according to the present invention, a compressed performance information file including a jump mark and a tag, which is inserted to reproduce the repeated part and deletes the repeated part of the performance information and which has a level, is stored in the memory. The step of detecting the tag for the compressed performance information file loaded in the memory, the step of detecting the jump marks in the level order for the compressed performance information file loaded in the memory, There is provided a performance information decompression method, which comprises the step of, when the jump mark is detected, the level of the tag detected previously and the address of the memory for designating control of reading data from the memory. It

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT A preferred embodiment of the present invention will be described below with reference to the drawings. FIG. 1 shows a first performance information compression method according to the present invention.
It is a flow chart which shows an example. Before explaining the flowchart of FIG. 1, a communication karaoke system as an example to which the present invention is applied will be described with reference to FIGS. 2 and 3. FIG. 2 is a schematic block diagram showing an example of a communication karaoke system in which MIDI information as karaoke information is compressed and transmitted from a station (host) to each terminal by the performance information compression method of the present invention. In FIG. 3, two types of transmission / accumulation files A and B are prepared for both the data that the station does not compress and the data that has been compressed in advance by the performance information compression method of the present invention, depending on the capabilities of the terminal and the line. 3 is a schematic block diagram showing a configuration example in which two files are selectively used. The communication line (network) uses ISDN to determine which file to read and transmit.
It is performed by determining whether the line is a high-speed line or a general public line, or by detecting the expansion capability on the terminal side. 2 and 3
In any of the systems, a MID obtained by previously compressing karaoke information for several thousand songs as a package in a memory such as a hard disk on the terminal side by the performance information compression method of the present invention.
It can be stored as I information. In this case, information about a new song or a song with a low request frequency that is not stored in the memory of the terminal can be transmitted from the station to the terminal using the communication line.

FIG. 4 is an SM describing performance information of one song.
It is a block diagram which shows the whole concept of the procedure of compressing F and creating a compression file. The SMFs for many songs are stored in a memory such as a hard disk, and the SMF 1 for one song specified by a control system (not shown) is MI.
DI CH (channel) separation block 2 separates each channel. That is, the instrument (sound source) to be played
The following processing is performed for each channel corresponding to. Block 3 is for detecting a (Δt + event) block repeat. That is, when a pattern of performance information described later has a repeat (repeat), this is detected. The next block 4 is to perform R (repeat) coding processing, in which the overlapping portion detected in block 3 is deleted so as not to overlap and a necessary signal is added. The next merge processing block 5 combines the signals subjected to the R coding processing for multiple channels as in the original SMF format, and as a result, Δt (delta time) is unified and compressed. File 6 is created.

FIG. 5 is a diagram showing a change mode of a data string in the case where a repeated portion is detected from the SMF description, an overlapping portion is deleted, and a compressed file obtained as a result of compression is created. In FIG. 5, “EVENT” indicates “event” of the MIDI signal, “T” indicates time information similar to “Δt”, and “R” indicates “repeat”. FIG. 6 shows the format of the information “T” or “R” shown in FIG. This data has an 8-bit structure as shown in the drawing, and each bit indicates the shown contents. FIG. 7 shows 1
As an example, a score with repeating parts is shown.
In this example, the second bar and the third bar have the same pattern.

Now, returning to the flow chart of FIG. 1, a first embodiment of the performance information compression method of the present invention will be described.
This flow corresponds to block 3 and block 4 shown in FIG. At the beginning of each channel in step S1, △
It is represented by t, and Σ is the cumulative total of Δt (e) in step S2.
Δt (e) and variable e indicating each event are 0
To initialize. In step S3, Δt (e) is read, in step S4, it is incremented by Δt (e), and in step S5, it is determined whether or not ΣΔt (e) exceeds 1920. This number 1920 is quarter note 1
The number of ticks per piece is 480, and 1
The measure is four quarter notes long (ie the time signature is 4 /
This corresponds to the length of one bar in the case of 4). Tic
k is the minimum time unit in SMF. This step S5 is to divide the performance information SMF into parts (one bar in this example) of a predetermined time unit. Step S6 is repeatedly executed until one bar has elapsed in step S5, and the event map (EVENT MAP) is executed.
Create i. The event map i is a set of events for each part. In step S7, e is incremented by 1. When one bar is completed, 1920 is subtracted from the total of Δt in step S8, and the previous bar (i
It is determined whether or not the event map (i-1) of -1) and the contents of the event map i of the current bar i match.
If they do not match, i is incremented by 1 in step S11. If they match, the latter part of the duplicated data is deleted in step S10, and the repeat event (Repeat) is repeated.
Event) is created. The repeat event corresponds to "R" shown in FIG. 5 and has the data format shown in FIG. In FIG. 6, (ID1, ID0) = (0,0) and (ID
1, ID0) = (0,1) is T, (ID1, ID
0) = (1,0) and (ID1, ID0) = (1,1)
Is R. The simple repeat and the section designation repeat are performed on a channel-by-channel basis, and the channel is determined based on the event immediately before the repeat byte. -Δt in FIG.
s is minus △ t-start,-△ te is minus △
It means t-end, and −Δts and −Δte are expressed as absolute values by subtracting minus. Note that step S
In 10, the number of repeat detections is counted and described as the number of repeats in the repeat event in FIG. After step S10, step S11 is executed. Step S
After 11, the e is set to 0 in step S12 and the process goes to step S6. In step S13, it is determined whether event maps have been created for all the data, and YES
Then, this flow ends.

When the performance information of the piece of music shown in the musical notation of FIG. 7 is processed by the flow of FIG. 1, from the comparison of the event maps, it is determined that the second bar as the repetition of the parts having the same pitch and the same sounding time. The third measure is detected. FIG.
In the above embodiment, when the pattern of change in the performance information in the time axis direction is continuous for two or more parts, that is, when the contents of the event map completely match, it is judged that there is repetition, but as another example, When a specific match is detected, it can be regarded as a repetition and different parts can be described as they are.

Further, the detection accuracy of the presence / absence of coincidence between parts may be roughened, that is, a predetermined error allowable range may be provided in the matching between the pitch and the pronunciation time. By doing this, due to slight noise and playing mistakes,
It is possible to prevent the pattern from being recognized as a non-identical pattern even though it is originally a repeated part, and as a result, it is possible to increase the number of parts recognized as repeated and improve compression efficiency. Furthermore, the fluctuation of the time axis on the performance,
Alternatively, the compression efficiency can be increased by expanding the permissible range such as the fluctuation of the playing strength to such an extent that the playing (playback) is not affected so much. In addition to comparison of parts, if a certain pitch appears repeatedly in the same part, for example, in the case of performance information of a percussion instrument such as a drum, this is detected and deleted so as not to overlap,
It is also possible to describe in pitch units by the same processing as that shown in FIG. In the present invention, the detection is performed for each part in a predetermined time unit, but this one part does not necessarily have to be the same as one bar, and can be a fraction thereof or a multiple thereof. Furthermore, two or more types of part time are provided, and for example, while detecting in units of one bar, half of that time is detected.
It is also possible to perform repeated detection in the unit of time.

In the first embodiment shown in FIG. 1, it is judged to be repetitive when the contents of consecutive parts are the same, but the melody over several bars is often repeated. . A method capable of compressing even in such a case will be described in the second and third embodiments. Figure 2
3 is a diagram schematically showing an SMF before compression, which is composed of eight parts. In FIG. 23, the second to fourth parts and the fifth to seventh parts overlap. Therefore, in order to remove redundancy, one possible method is to delete three overlapping parts, leaving only five parts as shown in FIG. In this case, "after the reproduction for the time of (t1 + t2 + t3 + t4) from the beginning, jump to the time point t1 has elapsed from the beginning"
Will be described. That is, a description is provided in which the total sum of Δt of each part is calculated and the reproduction position is reset according to the elapsed time from the reproduction start point. However, according to this method, when it becomes necessary to re-edit a part, the description section must be similarly edited. Also, the more complicated the description, the more complicated the time recalculation.

In the above-mentioned Japanese Patent Laid-Open No. 61-91697, the abbreviation symbol of the score is coded and stored together with the note information, and control is performed in accordance with the abbreviation symbol at the time of reproduction. According to this, although the problem of redundancy and the problem of re-editing are solved, the composition of modern music becomes complicated, and there are cases where the composition of music cannot be represented correctly by simply coding the ellipsis. As in the example shown in FIG. 25,
D. S. It is common to omit repetition when returning and playing again by (Dalseño), but it is impossible to write selective performance information instructed by annotations in this way by the technique of the above publication. Further, the technique of the above publication presupposes a musical score using symbols such as repetition as described above.

Therefore, in the second and third embodiments of the performance information compressing method of the present invention, the performance information is serially described with respect to the performance information that includes the same part described multiple times. By providing a jump mark and a tag that can be distinguished from each other and indicating the repetition of music, it is possible to describe with a small amount of information. In addition, complicated performance information can be described by including a condition value (level) in the jump mark.

FIG. 13 is a diagram showing the structure of jump marks and tags. Both are non-performance information ID, channel I
It has a D and a level ID. The level ID identifies the same marks or indicates the order.
In the second and third embodiments, when performance information over a plurality of parts (bars in each embodiment) is repeated, the repetition is deleted and jump marks and tags are inserted, resulting in the same compressed file. Is what makes In the second embodiment, in addition to the original file A, a file B without duplication
The number of steps is larger than that of the third embodiment described later in that it is necessary to create once. However, since it is suitable for understanding the procedure of compression, the second embodiment will be described first, and then the third embodiment having a higher utility value will be described.
14 and 15 are diagrams showing the concept of detecting and deleting the same part. As shown in the score of Part 1 of FIG. 14, when a music piece described by 7 bars and ellipses is expanded, it becomes as shown in the lower portion of FIG. Note that the numbers in the circles are entered for convenience, and it is not known at this point which bar and which bar have the same performance information.

FIG. 15 is a diagram showing a method for detecting an overlapping portion from this data string when there is performance information as shown in the lower part of FIG. The performance information is arranged in units of measures on the time axis as shown in the upper part of FIG. Here, the data is compared from the first bar x to the subsequent bars. If they match, give the part number (1 in this case) in ascending order.
When performance information is not created by copying parts, fluctuations in the time axis direction are included, so data filing, quantizing, and cognitive methods are used.
In this way, the file containing the information with the part numbers is A, and the file containing the information with the duplicated parts deleted is B. FIG. 16 shows these two files A and B and the compressed file finally created by the second embodiment of the performance information compression method of the present invention. When both the files A and B are read and different parts appear, the level n is incremented, the jump mark J (n) is inserted in the file B, and the part appearing next to the file A is returned to the tag T (n). Insert.

The level n is for mutually identifying each of the jump mark J and the tag T, and is incremented by 1, 2, 3, ... As a natural number. A method of inserting the jump mark J and the tag T is shown in the lower part of FIG. That is, the file A and the file B are compared with each other in the part number from the first part, and when different part numbers appear, the file A or the file A is compared.
When the part of the file B to be compared with the part of the file B does not exist, the level n for identifying the jump mark and the tag to be inserted is incremented, and the file B is incremented.
Insert a jump mark with incremented level immediately before the different part number in the
Insert the level-incremented tag immediately before the part number in the same file B as the different part number in. After the different part numbers in the file A are compared with the part numbers immediately after the tag of the file B is inserted, the part numbers are compared on a part-by-part basis. If different part numbers appear, the same insertion operation as above is performed. Insertion is done.

FIG. 17 and FIG. 18 are diagrams showing an example in which the performance information of a complicated repetitive piece of music can be compressed using the second embodiment. FIG. 17 shows an example of such a complicated piece of music. FIG. 18 is a diagram showing files A and B before compression and a compressed file.

A method of modifying SMF and SMF as the MIDI signal information file and inserting the jump mark and the tag will be described below. The SMF includes: -MIDI event: Performance information-META event: Non-performance information Both events have time information Δt, so M
The ETA (meta) event can be inserted by designating a time position relative to the MIDI event. In addition, the META event can define the data format that it has. In normal SMF, there is no concept of a part, but an identifier (P
The part number can be described in the SMF by defining a meta event having an ART ID).

Next, the definition of the part will be described. For example, each part corresponding to one bar is designated by a part number as shown in FIG. Therefore each part starts with a META event and is a sequence of MIDs in the SMF.
It is an I event group. This MET event
Abbreviated as A (PART, x). META (PART, x) → Δt: META ID: P
ART ID: PARTNO x. For comparison, note on of MIDI event is N
ote on → △ t: MIDI Note on I
D: MIDI channel: Pitch: Volume SMF has the structure shown in FIG.

The insertion position of META (PART, x) is
It is free, but since it is used for detection of repeats, it is better to insert it in a unit of less than expected repeats. For example, when creating an SMF based on the score as shown in FIG.
The creator is the MIDI of "A, B, C, D, E"
Create performance information, and follow the actual performance procedure by copying and pasting data, etc.
The MIDI performance information string that has become "CE" is stored in the SMF, but the repetition symbol on the score and META (PART,
It is possible to create an SMF as shown in FIG. 21 by creating a rule of how to put x).

Alternatively, when the creator creates an ordinary SMF that is completely unrelated to the creation procedure as described above, in order to automatically detect the repeated portion, one bar = 1 part on the side receiving the SMF. META (PA
RT, x) should be inserted. Bar breaks in SMF have already been defined in the SMF format. ME
Information such as TA (time signature), S
It can be easily known by reading from the MF. According to the above example, when META (PART, x) is inserted, the SMF becomes as shown in FIG. In either case, the repetitive part is detected without any problem. Further, since META (PART, x) is inserted for the purpose of detection, there is no problem in playing the performance even if it does not exist in the finally compressed file.

Next, a third embodiment of the performance information compression method of the present invention will be described. META (PA
The SMF in which RT, x) is inserted is SMF A, and SM
The compressed file obtained by compressing FA is SMF C. This compressed file SMFC is a standard MID
Since it is different from the I file format, it is not always appropriate to call it SMF, but here, for convenience, SMF C
I will keep it.

Next, some definitions will be made. (A)
PART LIST (Part list): A column of part numbers. (B) f _p C (file pointer): compressed file SM
An indication of an arbitrary position in the contents of FC.

The jump mark J and the tag T are described as follows using the META event. META (JUMP, Ch, y) META (TAG, Ch, z)

A compressed file SMF including these as a set
Describe in C as follows. META (JUMP, Ch, y) → Δt: META I
D: JUMP ID: MIDI channel Ch: Level y META (TAG, Ch, z) → Δt: META I
D: TAG ID: MIDI channel Ch: Level z

By adding a level to each of the jump mark and the tag, even a complicated performance procedure can be described in a unified format and correctly reproduced.

Now, the MIDI channel will be described. In MIDI, a MIDI channel (Ch) is added to a MIDI event so that information that a plurality of musical instruments are playing simultaneously can be transmitted. For example, a piano-related event has Ch = 1 and a bass has C
With h = 2, the receiving side separates events by channel and transfers each to an appropriate sound source. This concept is exactly the same in SMF. Although different performances are performed for each musical instrument, since they are mixed on SMF, the events in SMF A are separated for each channel in repeated detection, and compression description is performed for each channel independently. To the final SMF C,
It is desirable to record while synthesizing. Even after synthesis
Each event has a MIDI channel so that the jump mark and tag of each channel can be identified.
For simplicity of description, SMF A is described herein as including only single channel events.

Next, the compression procedure of the third embodiment will be described with reference to the flow charts of FIGS. There are two passes in the flow of the compression procedure. The first pass is shown in Figure 8.
, The same part in SMF A is detected and M
The ETA (PART, x) is rewritten. MIDI filtering or MIDI quantizing may be used at the stage of comparison in order to regard the two parts as the same. This is particularly effective when the content of the SMF is a record of the actual performance of the performer. That is,
Even if you try to play the same part, the MIDI events cannot be exactly the same in the actual performance, so MID
I filtering and MIDI quantizing are performed to improve the detection rate of the same part and thus improve the compression rate. MIDI filtering is such as deleting MIDI events that are not intended by the performer and correspond to extremely short notes. MIDI Quantize improves the detection rate by requantizing the temporal fluctuations of pronunciation into large time slots. Also,
The same applies to volume. The above is the method used for comparison, and it is natural that it is not used for the contents of the finally generated file. The second path is from SMF A to SMF, as shown in Figure 9.
C is generated.

In FIG. 8, "j ++" and "i ++" are variables "j".
This is the step of incrementing "i". The variable i indicates the original part to be compared, and the variable j indicates the part to be compared. In this flow, part i and part j
When the contents of the above match, it is judged that there is a repetition, and the MET
A (PART, j) is changed to META (PART, i).

Next, a concrete compression method will be described with reference to FIG. In the third embodiment, it is not necessary to use the file corresponding to the file B shown in FIG. 16 described in the second embodiment. That is, the SM corresponding to the file A in FIG.
The final compressed file SMF C is obtained from F A without using the file B.

File initially having no contents in step S21
Create C (SMF C) and indicate the position in file C
Set the pointer of file C to the beginning of file C,
Create a parts list without initial content. Next step S
Set the first part number of file A to variable i in 22
Then, in the next step S23, the variable i is added to the part list.
Determine if there is. The part number indicated by the variable i is
When there is no pointer f pC is at the end of file C
It is determined in step S24 whether or not the pointer f_pC position
Is other than the end of the file C, step S25
And pointer f_pJump mark at the current position of C
(N) is inserted, then pointer f_pC is the end of file C
Move to the tail, then pointer f_pTag TA at position C
Insert G (n) and increment the variable n by one.
Pointer f_pWhen C position is the end of file C,
In step S26, the variable i of the file A is stored in the file C.
The information of the part indicated by is added and the variable is added to the part list.
i is added and the pointer is moved to the end of the file C.
Let

In the confirmation step of the part number, it is indicated by the variable i.
Pointer f_pC is Phi
Check whether it is at the beginning of the part indicated by variable i
The judgment is made in step S29. Point at the next step S30
F_pThe position of C is indicated by the variable i in the file C.
Pointer f if not at the beginning_pC is present
Insert the jump mark JUMP (n) in the position
Input f_pC is the destination of the part indicated by variable i in file C
Move to the head position, then move the pointer f_pTag at position C
Insert TAG (n) and increment variable n by one
It Pointer f pC is indicated by the variable i in file C above
If it is the beginning of the part,
F_pMove C to the beginning of the next part. This 2
After one of the two moving steps S28 or S31
Then, in step S32, the next part in file A is detected.
And if it exists, the next par of file A is stored in variable i.
Set the phone number. After that, the next part in file A
After the part number confirmation step S23,
Repeat up to the part number setting step S32.
It

FIG. 10 shows the SM before the start of the path 1 shown in FIG.
FIG. 10 is a diagram showing F A, SMF A obtained after the end thereof, and SMF C obtained after the end of pass 2 shown in FIG. 9; In the figure, A, B, C ... Show the contents of each part, and the numbers 1, 2, 3 ... Show the part numbers. Further, SMF C shows a state in which a jump mark and a tag are added.

Next, a method of expanding the performance information compressed by each of the above-described embodiments so as to be reproduced on the terminal side of communication karaoke or the like will be described. FIG. 11 is a block diagram showing an embodiment of a performance information reproducing apparatus (expansion apparatus) used for realizing the performance information expanding method of the present invention. The storage device 10 is, for example, a large-capacity hard disk, in which a large number of compressed files SMF C shown in FIG. 10 are stored. Of these, the SMF C of the desired song is read out according to the address instruction of the control device (not shown) and loaded into the memory 12. After this, before playback, SM
A search for tags in FC is performed. That is, the reader 14 reads the contents of the memory 12 according to the instruction of the address counter 16 and searches for a tag. Separator 18 outputs the output signal of reader 14, namely SMF C
The MIDI event, the jump level value, and the tag level value are separated and extracted from. Each time a tag is detected as a result of the search, the tag address memory 26 stores the tag level value given from the separator 18 and the address given from the address counter 16 in association with each other in the form of a table shown in FIG. Go. Thus one SMF
All C are searched to complete the table shown in FIG.

After that, in order to start reproduction, first, the address counter 16 and the level counter 22 are initialized.
During reproduction, the tag level value from the separator 18 is not written to the tag address memory 26 (or the tag level value is not output from the separator 18). M output from the separator 18
The IDI event is given to the corresponding sound source (not shown) (for each channel). A jump level value is given to the level comparator 20 as one of the output signals of the separator 18. The level counter 22 outputs the count value to the level comparator 20, the level comparator 20 compares the two input levels, and outputs a signal for incrementing the level counter 22 by 1 when the two input levels match, and outputs a gate signal to the gate 24. give. The gate 24 gives the output count value of the level counter 22, that is, the level value (match level value) of the detected jump mark to the selector 28 when receiving the gate signal. The selector 28 reads the address of the tag corresponding to the jump level from the tag address memory 26 and loads it into the address counter 16. The address counter 16 sequentially reads the data in the memory 12 according to the loaded address.

In this way, one S in the memory 12 is
The expansion operation is performed by sequentially outputting MIDI events while reading the contents of MF C, and the reproduction of one song is completed by reading all the data of SMF C.

In the above description of the configuration shown in FIG. 11, a method of searching the position of the tag and preloading the address thereof before the reproduction is used, but if the decompressor has a sufficient processing capability. For example, without reading the tag in advance, it is possible to perform the reproduction at the same time while searching the tag. In the case of such a configuration, the tag address memory 26 shown in FIG. 11 becomes unnecessary.

[0048]

As described above in detail, according to the performance information compression method of the present invention, the data amount of the performance information for designating the pitch and the duration of the notes constituting the musical tone such as the MIDI signal is set to the melody. By removing the repetition of
According to the performance information decompression method of the present invention, the performance information compressed by such reduction can be decompressed to reproduce the original repetitive performance information, thereby reducing the communication cost. Reduction and elimination of memory capacity problems. In addition, in a communication karaoke system or the like, when image information and character information are transmitted together with the original performance information signal or are stored in a memory, the data amount of the performance information can be reduced, so that it is easy to handle these additional information. Becomes

[Brief description of drawings]

FIG. 1 is a flowchart showing a first embodiment of a performance information compression method of the present invention.

FIG. 2 is a block diagram of a communication karaoke system as an example to which the performance information compression method and the performance information decompression method of the present invention are applied.

FIG. 3 is a block diagram showing another configuration example of a communication karaoke system as an example to which the performance information compression method and the performance information decompression method of the present invention are applied.

FIG. 4 is a block diagram showing the concept of a performance information compression method of the present invention.

FIG. 5 is a diagram illustrating a method of a performance information compression method of the present invention.

FIG. 6 is a format diagram of a signal used in the first embodiment of the performance information compression method of the present invention.

FIG. 7 is a score of a part of a music piece to be compressed in the first embodiment of the performance information compression method of the present invention.

FIG. 8 is a flowchart showing a part of a third embodiment of the performance information compression method of the present invention.

FIG. 9 is a flowchart showing another portion of the third embodiment of the performance information compression method of the present invention.

FIG. 10 is a diagram illustrating a compressed file creation process in the third embodiment of the performance information compression method of the present invention.

FIG. 11 is a block diagram showing an example of a reproducing device which realizes the performance information expanding method of the present invention.

12 is a diagram showing the contents of a tag address memory in FIG.

FIG. 13 is a diagram showing a data structure of a jump mark and a tag in the second embodiment of the performance information compression method of the present invention.

FIG. 14 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 15 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 16 is a diagram illustrating a compression procedure of a second embodiment of the performance information compression method of the present invention.

FIG. 17 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 18 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 19 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 20 is a diagram illustrating a compression procedure of a second embodiment of the performance information compression method of the present invention.

FIG. 21 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 22 is a diagram illustrating a compression procedure of the second embodiment of the performance information compression method of the present invention.

FIG. 23 is an SMF before compression according to the performance information compression method of the present invention.
It is a figure which shows typically.

FIG. 24 is an SMF of FIG. 23 of the performance information compression method of the present invention.
It is a figure explaining one method of compressing.

[Explanation of symbols]

 1 SMF (Standard MIDI File) 2 MIDI Channel Separation Block 3 Block Repeat Detection Block 4 R (Repeat) Encoding Processing Block 5 Merge Processing Block 6 Compressed File 10 SMF C Storage Device 12 Memory 14 Reader 16 Address Counter 18 Separator 20 Level comparator 22 Level counter 24 Gate 26 Tag address memory 28 Selector

─────────────────────────────────────────────────── ───

[Procedure amendment]

[Submission date] December 15, 1994

[Procedure Amendment 1]

[Document name to be amended] Statement

[Correction target item name] Fig. 25

[Correction method] Added

[Correction content]

FIG. 25. S. It is a figure which shows the example of the score containing (Dalsegno).

Claims (7)

[Claims] 1. A step of receiving performance information designating a pitch and a sounding time of notes constituting a musical sound and dividing the performance information into parts of a predetermined time unit, and the step of dividing the performance information. Comparing the performance information for each part in chronological order and determining whether or not the pattern of change in the performance information in the time axis direction is continuous for two or more parts and the performance information is repeated, When it is determined that there is repetition in the step, a step of counting the number of repeating parts, and when it is determined that there is repetition in the determining step, a step of deleting the repeated parts so that they do not overlap, When it is judged that there is repetition in the judgment step, it is indicated that the pattern is repeated in the part to be deleted by the deleting means. Information and, a step of adding information indicating the number of repetitions of counting pattern by the step of counting, performance information compression method having. 2. A step of receiving performance information designating a pitch and a sounding time of notes constituting a musical tone and dividing the performance information into parts of a predetermined time unit, and the step of dividing the performance information. The performance information for each part is compared in chronological order, and when the change pattern of the performance information in the time axis direction is continuous for two or more parts except for some performance information, it is determined that the performance information is repeated. And, when it is determined that there is repetition in the determining step, the step of counting the number of repeated parts, and when it is determined that there is repetition in the determining step, during repeated parts, repeated If there is repetition in the step of deleting, leaving a different part not to overlap other parts, The portion to be removed by the step of deleting the information indicating that the repetition of the pattern occurs, and a step of adding information indicating the number of repetitions of patterns counted by the step of counting, performance information compression method having. 3. A step of roughening the comparison accuracy by providing a predetermined error allowable range in the matching of the pitch of the note and the pronunciation time when the pattern of the change of the performance information in the time axis direction is compared in the judging step. The performance information compression method according to claim 1 or 2, further comprising: 4. A continuous pitch detecting step of judging whether or not a predetermined pitch is continuous and is repeated in each of the parts obtained by being divided into parts in the dividing step, and the continuous pitch. When it is determined that there is repetition in the detection step, the same pitch counting step that counts the number of times the information appearance of the repeated pitch, and when it is determined that there is repetition in the continuous pitch detection step, information of the repeated pitch And a pitch information deletion step of deleting so as not to overlap, and when it is determined that there is repetition in the continuous pitch detection step, information indicating that pitch repetition occurs in the portion deleted by the pitch information deletion step, and A step of adding information indicating the number of repetitions of the pitch counted in the same pitch counting step, Performance information compression method according to any one of claims 1 to 3. 5. A step of receiving performance information designating a pitch and a sounding time of notes constituting a musical sound and dividing the performance information into parts of a predetermined time unit, and parts obtained by the dividing step. Data is sequentially compared from the first part in the sequence in units of parts, the same part number is given to the parts of substantially the same data, and the file A is created; and the part number is checked from the beginning of the file A. When duplicate numbers appear, a step of creating a new file B by deleting them and comparing the file A and the file B from the first part to the other part numbers are performed. When it appears, or when there is no part of the file B to be compared with the part of the file A, each of the jump mark and tag to be inserted Incrementing the level for identification in the file B, inserting the jump mark incremented by the level just before the different part number in the file B, and the same file B as the different part number in the file A. A step of inserting the level-increased tag immediately before the part number in the file, and a part after the different part number in the file A and a part immediately after the tag in the file B are inserted as a unit And comparing the part numbers with each other, and when different part numbers appear, performing the same insertion as the inserting step, the performance information compression method. 6. A step of receiving performance information designating a pitch and a sounding time of notes constituting a musical sound, dividing the performance information into parts of a predetermined time unit, and creating a file C having no initial content. A step of setting a pointer of the file C indicating the position in the file C to the head of the file C, a step of creating a part list having no initial content, and a variable i indicating the first part number of the file A. A step of setting, a part number confirmation step of determining whether or not the variable i is in the part list, and a part number indicated by the variable i in the part number confirmation step, when the pointer is the file C
Pointer position first determining step of determining whether the pointer is at the end of the file C, and when the pointer position is other than the end of the file C, the jump mark JU is present at the current position of the pointer.
Inserting MP (n), then moving the pointer to the end of the file C, then inserting the tag TAG (n) at the position of the pointer and incrementing the variable n by one; When the position is at the end of the file C, the performance information of the part indicated by the variable i of the file A is added to the file C, the variable i is added to the part list, and the pointer is set to the file. If there is a part number indicated by the variable i in the step of moving to the end of C and the part number confirmation step, the pointer is set to the file C.
Second pointer position determining step for determining whether or not it is at the beginning of the part indicated by the variable i, and when the pointer position is other than the beginning of the part indicated by the variable i in the file C, the pointer is currently set. A jump mark JUMP (n) is inserted at a certain position, then the pointer is moved to the head position of the part indicated by the variable i of the file C, and then a tag TAG (n) is inserted at the position of the pointer, Incrementing the variable n by one; moving the pointer to the head position of the next part when the pointer is the head of the part indicated by the variable i of the file C; After one of the steps, the next part in the file A is searched, and if it exists, the next part of the file A is stored in the variable i. And a next part number setting step for setting a number, and the performance information is configured to be repeatedly executed from the part number confirmation step to the next part number setting step until the file A has no next part. Compression method. 7. A step of deleting a repeated portion of the performance information and loading a compressed performance information file including jump marks and tags, which are inserted to reproduce the repeated portion, with levels, into a memory. Detecting the tag in the compressed performance information file loaded in the memory, detecting the jump marks in the level order of the compressed performance information file loaded in the memory, and detecting the jump mark A performance information decompressing method, which comprises a step of performing control of reading data from the memory by designating a level of the tag detected earlier and an address of the memory when the tag is detected.