DE3943801B4 - Device for generating source sound data - Google Patents

Abstract

Apparatus for generating source sound data for storing the same in a memory by processing musical sound signals with repeating signal patterns, comprising:
- an interval detector (12) for determining the interval of the audio signal, which corresponds to the fundamental frequency of the audio signal, using a Fourier transformation, and
A filter device (15) which receives the input musical tone signal and is designed with a comb filter characteristic in order to let only signal components of the fundamental frequency and harmonic harmonics pass through,
characterized in that
The phases of the frequency components obtained are adapted to one another in the interval detector (12) after a Fourier transformation has been carried out, then a Fourier transformation is carried out again and the period of the peak values in the output data is finally determined,
- A data screening device (16) eliminates repetitive data, which is done by shifting a data area of the determined interval width over the entire signal data and examining areas around the start and end point of the respective shifted area and that the correct position of the .. ,

Description

The invention relates to a device for generating source sound data according to the preamble of the claim. With such a device, it is necessary to use various ones Generate data from an input signal. Also need data compressed and recorded. With musical sound data, interval data must be be determined. Compression takes place e.g. B. in blocks. Compressing and also the recovery of repetition periods takes place in one signal z. B. by a digital signal processor.

Sound sources, such as those found in electronic Musical instruments used are e.g. analog sound sources, the z. B. consist of VCO, VCA and VCF and digital sound sources, which have a programmable tone generator or a ROM, from which sound data are read. One is also used as a digital sound source those used from the tones of musical instruments source sound data determined by sampling and this Stores data in a memory.

As for storing source sound data usually a memory large capacity extensive efforts are required to design procedures so that storage space is saved. Which also includes especially looping d. H. a process that the periodicity exploits the musical tone signals and bit compression z. B. by nonlinear quantization.

The loop formation also serves Sounds too generate that longer are as the original sampled sound. A musical tone typically consists of a non-tone component, as they e.g. B. when striking a piano key or when blowing a wind instrument and a periodic tone component. The non-tone component represents a formant part with a non-fixed part periodicity The signal has a specific signal interval in the sound component on. By repeating n (integer) of the interval as a loop domain an extended one Sound can be generated using little space.

When looping exists a problem known as loop noise. For loop noise it happens due to a special distribution of frequencies. The Noise falls even if its level is lower than that of white noise. Several factors are likely responsible for loop noise.

One of the factors is that the loop period does not exactly match the signal period of a source tone signal. If e.g. B. a source tone of 401 kHz is looped with a period of 400 Hz, the signal obtained by looping only has frequencies that correspond to an integer multiple of the loop period. The fundamental frequency of the source tone is shifted to 400 Hz, with harmonic harmonics with frequencies of 800 Hz, 1600 Hz, ... It can be shown that when there is a 1% offset between the source tone frequency and the loop frequency, the loop formation a nth order harmonic is formed as follows, which is heard as loop noise: C n = (sin (n-0.01)) / (π (n-0.01)) (a)

wobei m diejenige ganze Zahl ist, die am dichtesten bei a liegt. Der Verzerrungsfaktor wird für a = 0,5; 1,5; 2,5; ... am größten und für 1,0; 2,0; 3,0 ... am kleinsten.Another factor is that non-even harmonics are generated, ie kth order harmonics, where k is non-even. Strictly speaking, the source signal, which appears periodic at first glance, is not periodic with several harmonics that are of an odd order. When forming loops, these harmonics are forcibly shifted to neighboring even harmonics. This distortion generated during loop formation can be heard as loop noise. If the harmonic loop harmonics have a frequency component that is a times the loop frequency, where a is not necessarily an integer, the distortion factor as formed in looping is a function of a given by the following equation :

where m is the integer closest to a. The distortion factor becomes for a = 0.5; 1.5; 2.5; ... largest and for 1.0; 2.0; 3.0 ... smallest.

It is believed that the above two factors the main for the Loop noise are. In any case, the loop noise generated when the loop period is an integer multiple of Is source tone period.

The frequency components of the loop noise have a spectral distribution that is in the Playback is undesirable, so it should be removed as much as possible.

On the other hand, the scanned ones and stored source sound data those that were directly digitized, So that the sound Quality on the quality depends on scanning. If the sound has many noise components when sampled, also contains the read out and reproduced signal these noise components. When a musical tone is sampled with so-called vibrato, it is Tone slightly frequency modulated. This leads to the formation of loops sideband generated in frequency modulation to non-even numbers Harmonics, which is reproduced as loop noise.

To start and stop looping are common two points of the same level, in particular of level 0 are used.

This selection of loop points is difficult and time consuming as it follows a trial and error procedure he follows. Points with approximately the same level are used as start and Endpoints set.

For the looping it is necessary to change the fundamental frequency of the Capture source sound data. conventional the procedure is such that the Musical data. low pass filter (LPF) to filter out high frequency noise components. The number of zero crossings through the low-pass filter is then determined, to determine the interval. This procedure requires that the Music sound for longer time is maintained since the interval of the fundamental tone is only measured can be if a larger number of zero crossings counted becomes. The procedure can be so do not apply to fast fading tones.

As another method of determining the interval, mention should be made of one that consists in performing fast Fourier transform to detect the peak levels of the musical sound data. However, if the fundamental frequency is lower than the sampling frequency f _s , it is not possible to determine the fundamental frequency with this method, which leads to low fidelity. In addition, there are tones in which the fundamental is significantly weaker than the harmonics, which also makes it difficult to reliably determine the peaks of the fundamental.

Except for the loop formation to save storage capacity also the above Bit compression of the source sound data used. In practice, this is done z. B. in that several predefined filters, the one that is selected on block by block Basis to the highest Compression leads each block consisting of several samples.

For Such a filter choice will be given to each block with 16 samples Signal amplitude preceded by header or parameter data, e.g. B. Area or filter data. The filter data serve to be a filter select the highest Compression leads or where the compression is chosen so that it is optimal for coding is. There are e.g. B. Filters with three operating modes used, namely directly with PCM, with first order and with second order. The differential filter first and second order are effective when decoding or reproducing as an IIR filter, so that when Decode or play back the first scan of a block or two samples preceding the block are required as initial values are.

If differential filter first or second order for the first block of source sound data is selected, but one is missing previous scan, which results in one or two data as initial values must be stored in a memory. The hardware for the decoder is therefore becoming more extensive, which leads to circuit integration and cost reduction not wanted is.

In the US 4,433,604 describes a device for generating source sound data in which an interval of regular signal components is determined for an analog signal. This analog signal is converted into a digital signal, which is subjected to a Fourier transformation and a data compression. The compressed data is then subjected to an inverse Fourier transformation. The periods of peak values are determined from the signal values obtained in this way and represented as interval values. This should make it possible to store musical tone signals without high storage requirements.

From the EP 0 207 17 A1 a digital signal transmission device is known in which absolute values multiplied by coefficients are compared with one another. A filter is then selected from a large number of filters which delivers the smallest of these compared values.

Furthermore describes the EP 0 241 922 A2 a sound signal generator in which sound signals are compressed, for which purpose a digital coding method is used. This significantly reduces the number of bits of all compressed data compared to the original signal data.

Finally, in the US 4,641,564 describes a method for generating source sound data in which regions of predetermined lengths of a waveform of a musical sound signal are generated. For this purpose, changes at sampling points of a given period are determined and compared with corresponding values of an adjacent period. From this comparison, differences between individual samples are obtained that are small in themselves. The differences of a given following period are then added to the determined values of an immediately preceding period in order to obtain an accurate and high quality sound signal.

It is an object of the invention Specify device for generating source sound data in excellent sound quality.

This object is achieved according to the invention a device according to the claim solved.

So the present invention sees in particular a data screening device and a time base correction block in front.

With the data screening device an area of predetermined length over the entire signal data shifted, and areas around the start and The end point of the respective shifted area is examined. The correct location of the area is then decided when the compared neighboring areas are similar. That is, from different sentences of values becomes the sentence with the greatest correlation the start and end points selected.

The musical sound data is so with the help compressed by filters, the type of filter depends on the type of sound data. In order to If the filtering is optimal, a pseudo signal is generated before the audio data attached. There is a block-wise compression, the block length and the interval of the recurring Matched patterns become.

The interval length is determined automatically with high accuracy even if only a few sample data for disposal stand. Automatically determining the correct location of a recurring Pattern is made with high precision carried out. The compressions lead due to the mentioned adjustment to high integration without it being necessary special hardware is available to deliver. Loop noise can also be reduced.

The invention is illustrated below of an embodiment illustrated by figures. It demonstrate:

1 a block diagram of an apparatus for generating source sound data;

2 a musical tone signal;

3 a flowchart for explaining how an interval length is determined;

4 a block diagram for explaining how peak values are determined;

5 a musical tone signal with envelope;

5 a diagram for explaining the decay curve for a musical tone signal;

7 a block diagram for explaining an envelope formation;

8th a characteristic of an FIR filter;

9 a signal after envelope correction of the musical tone signal;

10 a diagram illustrating the characteristics of a comb filter;

11 a flowchart for explaining a recording method using a comb filter;

12 a diagram for explaining how the start and end of a loop area are determined;

13 a flow chart for explaining how signals are formed using the optimal loop position;

14A and B a musical tone signal before or after time base correction;

15A and B Diagrams for explaining blocks for bit compression;

16 a signal as obtained by multiple loop signals being joined together;

17 a formant area after envelope correction;

18 a diagram for explaining the signal processing before and after the selection of a loop area;

19 a block diagram for explaining the function of bit compression and coding;

20 a diagram illustrating the content of a data block as obtained by bit compression and coding;

21 a diagram illustrating the content of the headers of a music signal; and

22 a block diagram of a system with audio processing unit.

Based on 1 Various functions are explained which take place between the sampling of a music source signal and the storage in a memory. The music source data signal is on one connector 10 entered. It can be a signal that was recorded directly by a microphone or a signal that is supplied in analog or digital form from a recording medium for digital audio signals.

According to the device 1 Source data formed have experienced a so-called loop formation, which is now based on the musical tone signal 2 is explained. Immediately after the start of the generation of a tone, the tone contains non-tone components such as, for example, B. from hitting a key or from blowing on a wind instrument. Therefore, a so-called formant range FR with inaccurate signal periodicity is first generated. A repeated repetition of the same signal form follows, which corresponds to the musical interval (distance or pitch) of the musical tone.

A number n of periods of this repetitive waveform is used as the loop domain LP. It lies between a loop start point LP _S and a loop end point LP _E. The formant area FR and the loop domain LP are recorded in a memory, and for playback, the formant area is first played, and then the loop domain LP is played repeatedly for a desired period of time.

The input musical tone signal is in a sampling block 11 scanned, e.g. B. at 38 kHz. A 16-bit signal is obtained before sampling. The sampling corresponds to the A / D conversion of analog input signals.

In a subsequent interval detector 12 the fundamental frequency, ie the frequency f _{0 of} the fundamental, is determined.

The principle of the interval detector 12 will now be explained. The musical tone signal sometimes has a fundamental frequency that is significantly lower than the sampling frequency f _s , so that it is difficult to determine the interval by only sampling the peaks in the musical tone along the frequency axis. It is therefore necessary to use the spectrum of harmonic overtones.

wobei a(ω) und ϕ(ω) die Amplitude bzw. Phase der Obertöne bedeuten. Wenn die Phasenverschiebung ϕ(ω) für jeden Oberton auf Null gesetzt wird, kann obige Formel wie folgt umgeschrieben werden:

The musical tone signal f (t), the interval of which is to be determined, can be expressed by Fourier expansion as follows:

where a (ω) and ϕ (ω) mean the amplitude or phase of the overtones. If the phase shift ϕ (ω) is set to zero for each overtone, the above formula can be rewritten as follows:

The peaks of the signal thus adjusted f (t) correspond to integer multiples of the periods of all overtones of the signal at t = 0. The peaks only show the period of the fundamental.

Based on this principle, we will now use 3 the sequence of steps for detecting the interval is described.

Musical sound data and a value "0" become a real part input 31 and an imaginary part 33 of a transformation block 33 fed for fast Fourier transform.

For the fast Fourier transform, if the interval is designated x (t): a n cos (2π f n t + θ) (3), x (t) can be given by

wobei die folgende Gleichung n = –∞ cosθ = (exp(jθ) + exp(–jθ))/2 (6)benutzt wird. Durch Fourier-Transformation erhält man die folgende Gleichung:

in der δ(ω – ω_n) eine Deltafunktion beschreibt.This can be written in complex notation as

where the following equation n = -∞ cosθ = (exp (jθ) + exp (–jθ)) / 2 (6) is used. The following equation is obtained by Fourier transformation:

in which δ (ω - ω _n ) describes a delta function.

In a subsequent block 34 the absolute value, ie the root of the sum of the squares of the real and the imaginary part of the data is calculated after the fast Fourier transformation.

By using the absolute value Y (ω) of X (ω), the phase component stands out, so that the following applies:

This becomes the phase adjustment for all high ones Frequency components executed in the musical sound data. The phase components can by setting the imaginary parts adjusted to 0 become.

The normalization value calculated in this way becomes part of another block as real data 36 for fast Fourier transformation, which in this case is designed as a block for inverse fast Fourier transformation. While this data arrives at an input for real data, the value "0" is fed to an input for imaginary data. The inverse fast Fourier transform can be expressed by

The so after the inverse quick Fourier transform musical data obtained are used as a signal which corresponds to the synthesis of the cosine waves, where the proportions higher Frequency adjusted in phase are.

The peak values of the source sound data thus produced are recorded in a peak detector 37 determined. The peak points are those points where the peaks coincide for all frequency components. In a subsequent block 38 the peak values are sorted by descending values. The interval follows by measuring the periods of the peaks determined.

4 illustrates an arrangement of the peak detector block 37 of 3 to determine the peaks, ie the maximum values of the musical sound data.

It should be noted that within of musical sound data a big one Number of peaks with different values is present. On Interval can be found by the distance between peaks is determined.

According to 4 becomes a sequence of musical sound data resulting from the inverse Fourier transform through an input terminal 41 an (N + 1) level shift register 42 fed, and it is via registers a _{-N / 2,} ..., a ₀ , ..., a _{N / 2} to an output terminal 43 delivered. The shift register 42 acts as a window of width (N + 1) samples with respect to the sequence of musical sound data. The sample values become a maximum value detector via this window 44 fed. Since the musical sound data first reaches register a _{-N / 2} and then is transported to register aN / 2, (N + 1) scanning musical data from the registers becomes the maximum value detector 44 transfer.

The maximum value detector 44 is designed so that when z. B. the value from the middle register a ₀ of all values became maximum, this value as the maximum value to the output connection 45 gives. The width (N + 1) of the window can be set as desired.

The envelope of the sampled digital musical tone signal is in an envelope detector 13 obtained with the help of the interval data. The envelope signal that is in 5 denoted by B is obtained by connecting the peaks in the musical tone signal A in succession. It indicates a change in volume since the time the sound was generated. The envelope is described by parameter ADSR (Attack Time / Decay Time / Sustain Level / Release Time). In the case of a piano tone, part A (Attack Time T _A ) describes the time that elapses between pressing a key and the time until the desired volume is reached. The second part D (Decay Time T _D ) is the time that elapses between the time the desired volume is reached and the time a volume is reached that is maintained. The third portion S (Sustain Level L _S ) indicates the volume held, while the last portion R (Release Time T _R ) indicates the time between the release of a key and the decay of a tone. The times T _A , T _D and T _R can also be understood as changes in the volume. Envelope parameters other than the above four parameters can also be used.

It is noted that in the envelope detector 13 the overall rate of decay of the signal is obtained concurrently with envelope data as e.g. B. are given by the above-mentioned parameters ADSR. This fall time data takes a reference value "1" from the time of sound generation during the attack time T _A and then falls smoothly as by 6 illustrated.

The function of the envelope detector 13 according to 1 is now based on the flowchart of 7 illustrated.

The principle used is similar to that used when determining the envelope of an amplitude amplitude Dulated (AM) signal is used. The envelope is determined by assuming that the interval determined corresponds to the carrier frequency for an AM signal. The envelope data is used in reproducing musical tones that are formed based on the envelope data and the interval data.

The musical sound data is through an input connector 51 an absolute value output block 52 supplied, which determines the absolute value of the signal height data of the musical tones. This absolute value data is a digital FIR (Finite Impulse Response) filter block 55 fed. This FIR block 55 serves as a low-pass filter, the clipping characteristic of which is determined by the fact that filter coefficients are supplied to it, which are initially in an LPF coefficient generator 54 based on interval data generated through an input port 53 are fed.

The filter characteristic according to the example of 8th has zero points at multiples of the fundamental frequency (f ₀ ). In the 5 Envelope data illustrated with B can be obtained from the musical sound data signal A in 5 can be obtained by attenuating the frequencies of the fundamental and the overtones by the FIR filter. The formula applies to the filter characteristics H (f) = k * (sin (π f / f 0 )) / f (11) in which f _{0 represents} the fundamental frequency, ie the interval of the musical tone signal.

Based on 1 it will now be explained how pitch data for the formant part FR and the loop domain LP are generated from the pitch data of the sampled musical tone signal.

In a first block 14 to generate the loop data, the sampled musical sound data are divided, which are determined using the previously determined envelope curve B in accordance with 5 won (or it is multiplied by the reciprocal of the data). This is used to generate an envelope correction that ensures a constant amplitude, as shown in 9 is shown. This corrected signal, more precisely the corresponding signal height data, is filtered in order to also generate pitch data in which other components besides the sound components are weakened, or in other words in which the sound components are emphasized. Sound components are frequency components with integer multiples of the fundamental frequency f ₀ . The data is passed through a high pass filter (HPF) to detect low frequency components such as. B. remove vibrato frequencies that are present in the signal corrected with the envelope. This is followed by a comb filter with a frequency characteristic as shown in dot-dash lines in 10 is indicated, ie with a frequency characteristic with frequency bands that are integer multiples of the fundamental frequency f ₀ . This allows only the signals present in the HPF signal to pass through, thereby weakening non-tone components or noise components. If necessary, the data is also passed through a low pass filter (LPF) to remove noise components that are superimposed on the output signal from the comb filter.

Since musical sound data generally have a constant interval, ie a constant fundamental frequency, energy concentration occurs in the vicinity of the fundamental frequency f ₀ and integral multiples thereof. In contrast, noise components have a uniform frequency distribution. When editing the entered musical sound data using a comb filter with the frequency characteristic as described in 10 is shown in dash-dotted lines, therefore only frequency components of the fundamental frequency or integer multiples thereof pass through the filter substantially unattenuated, while other components are weakened, thereby improving the signal / noise ratio. In the 10 The frequency characteristic of a comb filter can be represented by the formula H (f) = [(cos (2π f / f 0 ) + 1) / 2] N (12) are illustrated, in which f _{0 is} the fundamental frequency of the input signal, ie the frequency of the fundamental tone with a certain interval. N is the number of stages of the comb filter.

The musical tone signal, the noise components of which have been reduced in the manner mentioned, is fed to a circuit which determines repeated waveforms. Such waveforms, such as. B. the loop domain LP according to 2 is separated and the remaining part is recorded, e.g. B. in a semiconductor memory. The stored musical sound data signal contains the non-sound component and part of the noise. This ensures that the loop noise is reduced when the repeated signal part is played back.

The frequency characteristics of the HPF, the comb filter and the LPF are determined on the basis of the fundamental frequency f ₀ , ie on the basis of the interval data as it comes from the block 12 be won.

A method of signal recording using said filtering will now be described with reference to 11 illustrated. In a step S1, the fundamental frequency f _{0 of} the input analog signal or the associated digital input signal is determined. In a step S2, the input analog signal is filtered by a comb filter of the type described above in order to generate an analog or digital output signal. In a step S3 it is ensured that only data from the fundamental frequency band and Frequency bands of harmonic multiples can be passed. The output signal is stored in a step S4.

With the described recording method the musical tone signal is sent through a comb filter, the only allows the fundamental and harmonic harmonics to pass through Non-tone components and noise components attenuate to the signal-to-noise ratio improve. When loops are formed, musical sound data with attenuated noise components repeated to suppress the noise.

In one block 16 To recognize the loop domain, the musical tone signal is examined for repeated waveforms in order to determine from tone components that are components of the aforementioned tone, which were emphasized by the filtering method described. The loop start point LP _S and the loop end point LP _{E are} formed with these.

In the investigation block 16 loop points are selected that are separated from each other by an integer multiple of the interval of the musical tone signal. The selection principle is explained below. As just mentioned, the loop point spacing must be an integer multiple of the interval as given by the fundamental frequency of the musical tone signal. By exactly determining the interval, the loop point distance can be determined.

Since the loop spacing is predetermined after the interval has been determined, two points are selected which are spaced apart by the stated distance. Then the signals around these points are examined and a correlation is established. An evaluation function is now explained which uses the convolution or sum formation of products with respect to sampling points in the area of the two points mentioned. The convolution is carried out several times for sets of all points in order to determine the correlation of the signals. The musical sound data are successively fed to a unit for adding up products, e.g. B. a digital signal processing device, which is described below. The convolution is calculated and issued there. The set of two points for which the convolution becomes maximum is regarded as the set of the correct loop start point LP _S and the correct loop end point LP _E.

In 12 a _{0 is} a candidate point for the loop starting point LP _S. b ₀ is accordingly a candidate for the loop end point LP _E. Additional amplitude data a _–N , ..., a _–2 , a _–1 , a ₀ , a ₁ , a ₂ , ..., a _N in several points, here (2N + 1) points before and after the candidate point a ₀ are also shown. Correspondingly, amplitude points b- _N , ..., b _-2 , b _-1 , b ₀ , b ₁ , b ₂ , ..., b _{N are} present before and after the candidate point b ₀ . The estimation function E (a ₀ , b ₀ ) then becomes:

The convolution around points a ₀ and b ₀ follows from equation (13). The sets of candidates a ₀ and b ₀ are gradually changed until all loop point candidates are examined. Those for which the evaluation function E becomes maximum are regarded as loop points.

In addition to the convolution method, e.g. B. the method of mean squares can also be used to find loop points. The following equation then applies:

In this case, the correct ones are then Points before the evaluation function becomes minimal.

The optimal loop point selection method described above can be used whenever analog signals are digitized with repeated periods to form loop data. The process is described below using the flow chart of 13 further illustrated.

According to 13 an analog signal with repeated waveform is converted into a digital signal with multiple sampling points in a step S11. In a step S12, sampling points are selected which are separated from one another by the repetition period. In a step S13, values for a predetermined evaluation function are calculated on the basis of sampling points which are located in the vicinity of the two selected points. The selected points are then shifted in a step S14 with the distance maintained until a predetermined number of shifts has been reached. If the latter is the case, the set that shows the greatest correlation is selected from the calculated values. Then, in a step S16, those sample data between the selected points are extracted as sample data for the repeated signal.

In the loop point determination block 16 according to 1 the loop start point LP _S and the loop end point LP _E are thus determined on the basis of the interval. From the distance of the points, which can span several intervals of the fundamental, follows an interval change ratio, which results in a time base correction block 17 is used.

The time base correction is carried out in order to adapt the intervals of different source sound data to one another when these data are stored in a memory. Instead of the interval change ratio, the interval data as used by the interval detector can be used for this purpose 12 supplies.

The interval normalization procedure carried out in the time base correction block is now based on 14 explained.

14A represents the musical tone signal before companding the time base while 14B the corresponding signal then shows. The timelines are divided into blocks for quasi-direct bit compression and coding, as explained below.

With signal A before the time base correction, the loop domain LP is generally not in direct relation to a block. With the signal according to 14B the loop domain LP is companded in the time base so that it is an integer multiple (m times) of a block length or block period. The loop domain is also shifted along the time axis so that the loop start point LPS and the loop end point LP _E coincide with the boundaries of blocks. The time base correction, ie companding the time base and shifting in the manner mentioned, ensures that loops can be formed for an integer number (m) of blocks, thereby normalizing the interval of the source sound data during recording.

A pitch signal value "0" can be inserted with an offset ΔT from the foremost block boundary of the musical tone signal. This data value "0" serves as a pseudo data value so that filters which require an initial value for the data compression can be selected. This is explained below using a 21 block compression illustrated.

15 shows the structure for a block for signal amplitude values after the time base correction, which data is then subjected to bit compression and coding, as explained later. There is h amplitude data in one block (number of samples or words). In the present case, the interval normalization consists in a time base companding in which the number of words within n periods (according to the constant time period T _w) 2 ), ie within the loop period LP, are an integer multiple (m times) of the number of words h in the block. The interval normalization preferably consists in that the loop start point LP _S and the loop end point LP _{E are} each shifted to block boundaries. If this is the case, it becomes possible to avoid errors when switching blocks, which is the case when decoding with the aid of a bit compression and coding system.

In 15A Words WLP _S and WLP _E in each block are the samples at the loop start and end points LP _S and LP _E , more precisely the samples are immediately before a loop end point LP _E in the corrected signal. If there is no shifting, the specified start and end points do not necessarily coincide with the block boundaries, so that as shown in 15B is shown, the words WLP _S and WLP _{E are} at any position within the blocks. In any case, however, the number of words between the words WLP _S and WLP _{E is} m times the number of words h in a block, where m is an integer, which means that the interval is normalized.

Companding a time base Music signal with the normalization just mentioned can be different Species. For example, it can be done that the amplitude values of the sampled signals are interpolated using a filter for superordinate Scanning is used.

If the loop period for a music signal is not an integer multiple of the sampling period, so that there is an offset in the amplitude values in the loop start point LP _S and in the loop end point LP _E , the amplitude corresponding to the amplitude value in the start point can be found adjacent to the loop end point by that z. B. parent scanning is used to implement the loop period.

Such a loop period, which is not an integer multiple of the sampling period, can be set to be an integer multiple of the block period, which is done by the time base correction method described above. If time base companding by e.g. B. 256-fold higher-level sampling, the amplitude error between the values for the start point LP _S and the end point LP _E can be reduced to 1/256.

After the loop domain LP is determined and corrected in the time base, loop domains LP are appended to one another, as by 16 to generate loop data. The signal according to 16 is obtained in that a single loop domain LP according to 148 is picked out and this one domain is linked several times. The linking of loop domains takes place in a loop signal generation block 21 ( 1 ).

Since the loop data is formed by repeating a loop domain LP several times, a start block with the word WLP _{S is} immediately followed by an end block with the word WLPE, which corresponds to the loop end point WLP _E , more precisely the point immediately before this point. So that coding for bit compression can take place, at least the end block must be stored directly before the start block of the loop domain LP. More generally speaking, at the time of bit compression and encoding Block basis the parameters for the start block, ie the data for bit compression and coding for each block, e.g. B. range or filter selection data, which will be described below, can only be formed on the basis of data of the start and end blocks. This technique can also be used in the case where music data consists only of loop data without formants.

With this procedure, the same data is available for several sampling points before and after the loop start point LP _S and the loop end point LP _E. Therefore, the parameters for bit compression and coding in the blocks immediately before these points are the same, which can reduce errors and noise when reproducing the loops after decoding. The music data during playback are then stable and free of transition noise. In the embodiment, there are about 500 sample data in a loop area LP before the start block.

For the signal generation for the formant area FR, an envelope correction is carried out in a block 18 ( 1 ) executed according to the correction for loop data in the block 14 , The envelope correction is carried out by the fact that the sampled musical sound data by envelope data ( 6 ) which consist only of the data for falling signals, whereby amplitude values for a signal are obtained, as described in 17 is shown. With the output signal according to 17 accordingly, only the envelope curve becomes noticeable during the time period T _A , while there is constant amplitude in the other regions.

The envelope corrected signal is, if necessary, in a block 19 filtered. This is done with a comb filter with a frequency characteristic that z. B. corresponds to that with the dash-dotted line in 10 is shown. The comb filter data are formed on the basis of the interval data for the fundamental frequency, which data from the interval detector 12 to be delivered. The data are used to generate signal data from the formant area in the source sound data, which are finally stored in a memory.

In a subsequent time base correction block 20 there is a time base correction, as described above using the block 17 has been described. The time base correction is used to normalize the intervals for the sound data by companding the time base based on the interval changing ratio as it is in the block 16 was found, or based on the interval data as provided by the block 12 to be delivered.

In a mixer 22 the formant data and the loop data corrected with the same interval data or interval change ratios are mixed. To do this, a Hamming window is placed on the formant area formation signal from the block 20 applied. A fade-out type signal to be mixed with the loop data is generated which decays. On the loop data from the block 21 a similar Hamming window is used. A fade-out type signal to be mixed with the formant data is generated which grows. The two signals are mixed (or faded) to produce a musical tone signal that represents the source sound data. As loop data to be stored, data can be picked out which comes from a loop domain which is somewhat away from the cross-faded area, thereby reducing the loop noise when loop signals are reproduced. In this way, pitch data of a source tone signal is generated that has a formant area (non-tone components) and loop data (repeated, regular data).

The starting point for the loop data signal can also start with the loop for the formant-forming signal be connected.

To determine the loop domain and Mixing the formant area and the loop data is initially done by Hand mixed. One hears then the result and it will be based on the loop start and endpoints processed more precisely.

So it will be before the more precise loop range determination in block 16 is done, this determination and mixing is done by hand, and there is a trial listening as in the following 18 explained. Thereafter, the more detailed method described above is started from step S26 in 18 executed.

In the flow chart according to 18 the loop points are determined with a low accuracy in a step S21 by determining zero crossings or by optically checking the signal. In a step S22, the signal between the loop points is reproduced several times. In step S23, it is judged by listening whether the loop formation is done properly. If this is not the case, step S21 follows in order to determine loop points again. This process continues until a satisfactory result is obtained. If this is the case, a step S24 follows in which the signal z. B. is mixed by cross-fading with the formant signal. In a step S25 it is checked whether the auditory impression is good at the transition from the formant to the loops. If this is not the case, step S24 is repeated to mix again. If the auditory impression is good, step S26 follows in which the loop points are determined in accordance with the block 16 done with high accuracy. It takes place. Scanning z. B. with a resolution of 1/256 over the sampling period with z. B. 256-fold higher-level scanning. In a subsequent step S27, the interval conversion ratio for the interval normalization is calculated. In a step S28, the time base correction takes place according to the blocks 17 or 20 , In a step S29, the loop formation according to block 21 ( 1 ) executed. Mixing according to block 22 takes place in a subsequent step S30. The procedure from step S26 is done using the loop points as obtained in steps S21-S25. Steps S21-S25 can be omitted for full automation of looping.

The amplitude values obtained in this way, which consist of the formant region FR and the loop domain LP, are applied in one to the mixer 22 following block 23 bit-compressed and encoded.

Various systems can be used for compression and encoding. One is suitable, as it is in JP-62-008629 A and JP-62-003516 A is proposed. There a predetermined number of h sample words with amplitude values are grouped in a block, and bit compression is carried out block by block. This highly effective system is described below using 19 briefly explained.

According to the block diagram 19 is coding on the recording side 70 and a decoding 90 is present on the reproduction side. The amplitude values x (n) of the source sound data signal become an input terminal 71 of the encoder 70 fed.

The amplitude values x (n) of the input signal are a FIR digital filter 74 fed that by a predictor 72 and an adder 73 is formed. A respective amplitude value x (n) of the prediction signal from the prediction element 72 becomes the adder 73 as a subtraction signal. fed. There it is subtracted from the input signal x (n) to produce a prediction error signal or a deviation signal d (n). The predictor 72 calculates the prediction value x (n) from a primary combination of the last p input values x (n - p), x (n - P + 1), ..., x (n - 1). The FIR filter 74 is referred to below as the coding filter.

With the highly effective system for bit compression and coding specified above, the source sound data falling within a predetermined period of time, ie a predetermined number h of words, which are grouped into blocks, are selected for each block. The coding filter 74 has optimal characteristics for this. It can be formed by defining several, in the example four, different characteristics in advance and then selecting the optimal characteristic, ie the one with which the highest compression ratio can be achieved. In the prediction link 72 For this purpose, one set of coefficients is stored in several, in the example four, sets of coefficient memories. A set of coefficients is selected in time multiplex.

The deviation signal d (n), which represents a predicted error, is over a summing point 81 fed to a bit compressor, which has a level shifter 75 (G) and a quantizer 76 having. There the compression takes place in such a way that the index part and the mantissa in the case of floating point commanation of the gain G or the output signal from the quantizer 76 correspond. A requantization is therefore carried out, in which the input data is through the level shifter 75 are shifted by a number of bits, which number corresponds to the gain G. This shifts the range and a predetermined number of bits of the bit shifted data is passed through the quantizer 76 removed. A noise shaping circuit 77 serves the quantized error between the output signal and the input signal of the quantizer 76 at a summing point 78 to form and this signal via a G ^-1 level shifter 79 to a predictor 80 to give. The predicted signal for the quantization error is used as a subtraction signal to the summing point 81 given in order to obtain a so-called error feedback. After this requantization by the quantizer 76 and the error feedback by the noise shaping circuit 77 is on an output connector 82 receive an output signal d (n).

The output signal d '(n) from the summing point 81 is the difference d (n) from the summing point 73 , minus the prediction signal e (n) for the quantization error as it is from the noise shaping circuit 77 is formed. The. Output signal d '' (n) from the G level shifter 75 corresponds to the output signal d '(n) from the summing point 81 multiplied by the gain G. The output signal d ^ (n) from the quantizer 76 is the sum of the output signals d '' (n) from the G level shifter 75 and the quantization error signal e (n) as from the summing point 78 is issued. After passing through the G ^–1 level shifter 79 and the predictor 80 , using the primary combination of the last r input signals, the quantization error e (n) is converted into the prediction signal e (n) for the quantization error.

After the coding described above, the source sound data is in the output signal d ^ (n) from the quantizer 76 converted, and they are on an output terminal 82 output.

Mode selection data for optimal filter selection is provided by an adaptive range prediction circuit 84 spent and z. B. the predictor 72 of the coding filter 74 and an output port 87 given. Range data for determining the bit shift number or the gains G and G ^-1 are also sent to the level shifters 75 and 79 and to an output port 86 given.

The playback side decoder 90 has an input port 91 on which a signal d ^ '(n) is supplied, which by transmitting or recording and reproducing the output signal d ^ (n) from the output terminal 82 from the encoder 70 is formed. This input signal becomes a summing point 93 via a G ^–1 level shifter 92 fed. The output signal x '(n) from the summing point 93 becomes a predictive link 94 fed and thereby converted into a prediction signal x (n), which then reaches a summing point 93 is given where to him the output signal d ^ '' (n) from the slide 92 is added. The sum signal is sent as a decoder output signal x ^ '(n) to an output terminal 95 given.

The range data and the mode selection data available at the output terminals 86 and 87 of encoder 70 are output on input terminals 96 respectively. 97 the deco dier 90 entered. The range data from the input port 96 be on the slider 92 transmitted to set its gain G ^-1 during the mode selection data from the input terminal 97 to the predictor 94 are given to set the prediction characteristic to match that of the predictor 72 of the encoder 70 matches.

With the decoder constructed in this way 90 is the output signal d ^ '' (n) from the slide 92 the product of the input signal d ^ '(n) and the gain G ^-1 . The output signal x ^ '(n) from the summing point 93 is the sum of the output signal from the slide 92 and from the prediction signal x '(n).

20 shows a block of output data from the bit compressing encoder 70 , There are 1-byte header data (parameter data relating to compression or sub-data) RF and 8-byte scan data D _A0 -D _B3 . The header data RF is 4-bit area data, 2-bit mode selection data or filter selection data and two 1-bit flag data, such as. B. a data value LI, which indicates the presence or absence of a loop, and a data value EI, which indicates whether the last block of the signal is negative. Each sample of the amplitude data is represented by four bits after bit compression, while 16 samples of 4-bit data D _A0H -D _{B3L are contained} in the data D _A0 -D _B3 .

21 shows a block of bit-compressed and encoded amplitude data that corresponds to the beginning of the in 2 correspond to the musical tone signal shown. Only the amplitude data without the head are shown. For the sake of clarity, each block consists of only eight sample data. B. 16 sample data are available. This applies to the case of 15 ,

The quasi-instantaneous described above Bit compression and coding chooses either immediate PCM mode that directly entered the Outputs musical tone signal, or a differential filter mode first Order or such a second order, each the musical tone signal output filtered, which leads to output signals with the highest compression ratio.

When music tones are sampled from a memory and be read, the input of the musical tone signal begins in a tone generation starting point KS. If a differential filter mode first or second order, which needs an initial value, in first block after the tone generation starting point KS is selected, it would be necessary save an initialization value. However, it is desirable that this not is required. For this reason, in the initial period generates pseudo input signals after the tone generation starting point KS, that lead to, that the immediate PCM mode selected becomes. The data is then processed in such a way that Pseudo signals the input signals are processed.

This is done e.g. B. in that, as in 21 shown, a block with loud values "0" is arranged as a pseudo input signal block in front of the tone generation start point KS. This data "0" is treated as amplitude values and bit-compressed. This can be done by storing a block with the values "0" in a memory or by initially placing values "0" before the starting point KS when scanning musical tones, ie a quiet area before the sound is generated. At least one block of pseudo input signals is required.

The musical sound data including the pseudo input signals thus formed are determined by the on the basis of 19 illustrated system bit-compressed and encoded and then recorded, e.g. B. in a memory. The compressed signal is played back.

When playing music sound data With the pseudo input signal, the immediate PCM mode is activated first selected which eliminates the need for initial values for differential filters to determine first or second order in advance.

The delay in the beginning of the audio signals due to the pseudo input signal apparently leads to a bother of the sound signal since first There is silence. This bothers but not actually since the sampling frequency is 32 kHz, each with 16 samples in one block. This makes the delay about 0.5 msec, which in auditory sensation not noticeable.

The bit compression and coding and other signal processing described above are preferably carried out with the aid of a digital signal processor (DSP). 22 illustrates an embodiment of an audio signal processing unit 107 as a sound source unit that processes source sound data. Peripherals are also shown.

A host computer 104 , e.g. B. in the form of a conventional PC of a digital electronic musical instrument or a game device is sent to the audio signal processing unit 107 connected as a sound source unit so that the source sound data from the host computer 104 into the processing unit 107 Loading. The audio signal processing device (APU = Audio Processing Unit) 107 has a CPU 103 , such as a microprocessor, a digital signal processor DSP 101 and a memory 102 to save the source sound data. So there is at least the data just mentioned in the memory 102 saved. The DSP 101 performs a variety of processes, including readout control for the source sound data, but also loop bit expansion or restoration, interval conversion, envelope value addition or echo generation. The memory 102 also serves as a buffer for values that are generated during these processes. The CPU 103 controls the DSP 101 executed processes.

The digital musical sound data, as it finally comes after the completion of the various, by the DSP 101 Executed processes using the source sound data from the memory 102 are available through a D / A converter 105 converted and to a speaker 106 given.

In the embodiment, the source sound data by connecting the formant area and the loop domain together educated. The method described can also be based on source sound data applied that consist only of loop domains. The decoding side Facilities and the stores can also be arranged externally, also pluggable. The procedures are not only applicable to the generation of musical tones, but also on speech production.

Claims (1)

Apparatus for generating source sound data for storing the same in a memory by processing musical sound signals with repeating signal patterns, comprising: an interval detector ( 12 ) to determine the interval of the audio signal, which corresponds to the fundamental frequency of the audio signal, with the aid of a Fourier transformation, and - a filter device ( 15 ), which receives the inputted musical tone signal and is designed with a comb filter characteristic in order to pass only signal components of the fundamental frequency and harmonic harmonics thereof, characterized in that - in the interval detector ( 12 ) after carrying out a Fourier transformation, the phases of the frequency components obtained are matched to one another, then a Fourier transformation is carried out again and the period of the peak values in the output data is finally determined, - a data screening device ( 16 ) separates repetitive data, which is done by shifting a data area of the determined interval width over the entire signal data and examining areas around the start and end point of the respective shifted area and deciding on the correct position of the area when the compared Neighboring areas are similar, - a time base correction block ( 17 ) Adapts intervals of different signal data to each other, - a mixer ( 22 ) appends a pseudo input signal before the start of the input signal and - a compression-coding device ( 23 ) Compressed and encoded n periods of the signal data into compressed data words and into parameters that apply to compression, with compression coding blocks, each containing h sample words, the period of the signal data being constant, where m compression coding Blocks are formed which contain at least one start block and one end block, where h, m and n are natural numbers and the parameters for the start block are formed on the basis of the data for the start block and the end block.