EP2119073A1 - Procede de generation de signaux mutuellement orthogonaux dont le spectre est controle - Google Patents
Procede de generation de signaux mutuellement orthogonaux dont le spectre est controleInfo
- Publication number
- EP2119073A1 EP2119073A1 EP08775694A EP08775694A EP2119073A1 EP 2119073 A1 EP2119073 A1 EP 2119073A1 EP 08775694 A EP08775694 A EP 08775694A EP 08775694 A EP08775694 A EP 08775694A EP 2119073 A1 EP2119073 A1 EP 2119073A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- complex
- spectra
- signals
- matrix
- mutually orthogonal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/12—Generation of orthogonal codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
- H04J13/004—Orthogonal
Definitions
- the present invention relates to a method of generating mutually orthogonal signals whose spectrum is controlled.
- Spectral spread audio tattooing uses time signals with a broad spectrum - the extended spectrum.
- the tattoo uses either one or more signals stored in a dictionary for symbol modulation.
- signals whose inter-correlation product is zero it is preferred to use signals whose inter-correlation product is zero, as this facilitates correlation detection.
- Cross-correlation of signals is a particular form of the dot product. It can thus be said that to look for signals that are not correlated with one another is to choose a family of mutually orthogonal signals.
- tattooing we need signals whose spectrum is under control, that is to say that correspond to a particular template.
- an AAC (Advanced Audio Coding) coded signal at 24 kbit / s per channel occupies a band in the order of
- the tattoo must be as discreet as possible, it will be modulated and formatted taking into account the properties of psychoacoustics. To guarantee a precise shaping, below the masking curve guaranteeing the inaudibility of the mark, the signal to be modulated must have a perfectly white spectrum.
- the generation of real time signals of mutually orthogonal given length is generally done, either by an orthogonalization technique of a family of time signals, generally random, or by use of the rows or columns of the actual Hadamard matrices.
- orthogonalization technique of a family of time signals, generally random, or by use of the rows or columns of the actual Hadamard matrices.
- Each of these techniques of the prior art has the disadvantage of producing signals whose power spectrum is difficult to control.
- variations of dynamics of 60 dB and more are observed on the power spectrum, the spectrum being chopped and not very regular.
- the technique of actual Hadamard matrices can produce only signals of length 2 or multiples of 4.
- WO-A-0077962 discloses a method for generating orthogonal complex spectra in low numbers, typically seven, by discretizing the phase of each complex sample. This method has the disadvantage of providing only a limited number of sequences.
- the present invention provides a method of generating a plurality of discrete spectra s (i) of Q dimension, mutually orthogonal and with controlled power, where i denotes the spectrum number, these spectra representing time signals in the spectral domain and being of constant ⁇ module in a set of spectral line designation G and zero everywhere else, the method being remarkable in that it consists of:
- the invention allows the generation mutually orthogonal discrete spectra of any length, in desired number and at controlled power. In addition, it is not necessary to construct the entire complex Hadamard matrix.
- the step of determining at least a portion of the complex Hadamard matrix consists in obtaining a column of a rotation matrix calculated from predetermined rotation and permutation keys applied to a matrix. of reference Hadamard.
- the method further comprises a step of decomposition of the order d R of the reference Hadamard matrix into a product of factors and a sub-step of calculating the least common multiple of the set. of these factors for the determination of the reference Hadamard matrix.
- choosing the least common multiple means that the phases of the complex spectrum generated will be as far apart as possible. This increases the robustness to noise.
- the method further comprises a step of determining a signal
- T denotes the number of temporal dimensions
- F qJ denotes the Fourier matrix of order q ⁇ , so as to generate a plurality of mutually orthogonal time signals s (i).
- the present invention also proposes a method for generating a family of time signals, which is remarkable in that it consists in combining mutually orthogonal time signal families generated by a method as briefly described above and whose spectral supports are disjoint.
- the use of families of complex spectra with disjoint power spectra makes it possible to quantify the signal in the transformed domain by using progressive signal frequency modeling by orthogonal complex spectra. This way of proceeding gives directly to each step optimal scale factors for the complex spectra, without requiring reoptimization of the preceding factors, contrary to the prior art, which uses a Gram-Schmidt method for this reoptimization.
- the present invention also provides the use of mutually orthogonal complex time signals or spectra generated by a method as briefly described above for spectral spreading in spread spectrum transmission systems.
- these signals or spectra are spread spectrum in the transmitted band and power of value 1, unlike the Hadamard sequences used in the current American system IS95 code division multiple access.
- audio coders they can be used as quantization dictionaries in predictive coders.
- the quantization is performed by two fast algorithms: on the one hand, by fast Fourier transform for the passage in the frequency domain and, on the other hand, for the scalar product involved in the quantization.
- the present invention also provides the use of mutually orthogonal complex time signals or complex spectra generated by a method as briefly described above for audio tattooing and its detection.
- these spectra can be directly used for tattooing in the frequency domain, their ideally white power spectrum in the transmitted band (s) allowing their precise shaping by psychoacoustic weighting, which is an important property to ensure the character inaudible tattoo.
- the spectra of the prior art do not allow this precise formatting, since their power spectrum has a significant variation in dynamics.
- the complex spectra of the invention also have the advantage of being easily modulated as such, in defined frequency bands, in code access multiplex transmission systems.
- the time domain signals in audio tattooing, they can be directly used for spread spectrum tattooing, where a symbol of K b bits is represented by K b orthogonal signals.
- K b bits is represented by K b orthogonal signals.
- the present invention also provides the use of mutually orthogonal complex spectrums with controlled power spectrum generated by a method as briefly described above for encoding or representing audio signals, the audio signals being quantized by means of a dictionary or family of dictionaries with real or complex values.
- these spectra can be used as quantization dictionaries for the signals coming from a discrete Fourier transform.
- the quantization is for example performed by a fast algorithm whose structure is derived from the way in which the dictionary is constructed, in a particular embodiment, by Kronecker products of small-size basic matrices.
- the present invention also provides the use of mutually orthogonal complex time signals or spectrums with controlled power spectrum generated by a method as briefly described above for the optimization of metrology excitation data.
- the fact that the generated sequences have an ideally flat spectrum in the band is likely to improve the accuracy of the detection compared to the current use of the pseudo-noise sequences generated by shift registers, whose correlation function has a parasitic term with respect to its ideal value, which is a Dirac.
- the invention proposes a device for generating a plurality of discrete spectra S (i) of dimension Q that are mutually orthogonal and with controlled power, i denoting the number of the spectrum, these spectra representing time signals in the spectral domain and being of constant ⁇ module in a set of spectral line designation G and zero anywhere else, the device being remarkable in that it comprises:
- the present invention further provides a computer program product that can be loaded into a programmable apparatus, characterized in that it includes instruction sequences for implementing a method as briefly described above, when this program is loaded and executed by the programmable device.
- FIG. 1 is a graph representing the power spectrum of the signals generated, in a particular embodiment of the invention.
- FIG. 2 is a flowchart illustrating the main steps of a time signal generation method according to the present invention, in a particular embodiment
- FIGS. 3 to 6 are flowcharts detailing various operations performed to obtain a column of a matrix of rotations of a complex Hadamard matrix according to the present invention, in a particular embodiment
- FIG. 7 is a flowchart illustrating the process according to the present invention in all its generality
- FIG. 8 is a flowchart illustrating in more detail the so-called "band calculation” method implemented in the flowchart of FIG. 7;
- FIG. 9 is a flowchart illustrating in more detail the so-called "band preparation” step implemented in the flowchart of FIG. 8;
- FIG. 10 is a flowchart illustrating in greater detail the spectral calculation step implemented in the flowchart of FIG. 8;
- FIG. 11 is a flowchart illustrating in more detail the so-called "exponential" step implemented in the flowchart of FIG. 10;
- FIG. 12 is a flowchart illustrating in greater detail the step of calculating the extension of FIG. 9 in the case of complex spectra;
- Fig. 13 is a flowchart illustrating in more detail the step of extending Fig. 10 in the case of complex spectra
- Fig. 14 is a flowchart illustrating in more detail the step of preparing the extension in the case of complex spectra
- Fig. 15 is a flowchart illustrating in more detail the step of extending Fig. 10 in the case of real signals
- FIGS. 16 to 19 illustrate examples of application of the present invention, in particular embodiments; and - Figure 20 schematically shows a device adapted to implement the present invention, in a particular embodiment.
- the invention applies to the case of real or complex discrete signals. Below are some notations and definitions that will be used in the rest of the description.
- the number of signals generated is noted Ns.
- the signals to be generated will be noted s (i), where 0 ⁇ i ⁇ Ns, where i is the variable that designates the signal number.
- Each signal s (i) can be seen indifferently, either as a signal of length Ls, or as an application of [0; Ls-1] c N (N being the set of natural numbers), or as a vector of dimension ls. This last interpretation, that is to say the vectorial interpretation, is preferred here.
- each signal s (i) is a vector of E Ls (the Cartesian product of the vector space E at the power Ls) where E is either the body of the reals 9? (in the case of a real-valued signal), that is the body of the complexes C (in the case of a signal with complex values).
- E is either the body of the reals 9? (in the case of a real-valued signal), that is the body of the complexes C (in the case of a signal with complex values).
- the values of the signal s (i) are denoted s (i) [n], where 0 ⁇ n ⁇ Ls, where n is the variable which designates the time sample.
- F ( ⁇ ) -F ( ⁇ ) n1 (n) (1.2) where F (n) denotes the conjugate matrix of F (n) , F (n) denotes the transposed matrix of the matrix F (n) and (n) denotes the identity matrix of order n.
- F and F are respectively the Discrete Fourier Transform (DFT) matrix and the inverse Discrete Fourier transform matrix.
- DFT Discrete Fourier Transform
- F the matrix F will be used in two different contexts: to transform a complex spectrum with a controlled power spectrum into a time signal, and
- the power spectrum of the time signal is given as a function of the complex spectrum by:
- 1. Note that Fourier matrices are complex Hadamard matrices.
- the complex Hadamard matrices also have the following properties: - if H is a complex Hadamard matrix, if P, Q are permutation matrices, if C, D are diagonal matrices whose non-null elements of the diagonal have a module of 1, then PCHD Q is also a complex Hadamard matrix; - If G and H are two complex Hadamard matrices of respective orders g and h, then G ® H is a complex gham Hadamard matrix.
- the operation ⁇ 8> is the product of Kronecker or tensor product.
- the low frequency F min is linked to the index S min and to the sampling frequency F e by: s 1 ⁇ mIn - F min - p
- Ls is the number of samples of the DFT defined by equation (1.3).
- Phases are the only degrees of freedom of the system.
- the signals form a free family in the space of the signals of length Ls, they are orthogonal to each other, or, in other words, they are not correlated with each other.
- the spectrum of signals Frequencies are then perfectly white over the entire frequency band and the correlation function of the orthogonal temporal signals, derived by inverse Fourier transform, is equal to a Dirac distribution, an interesting property in many applications.
- the time signals will be real when the property of symmetry with complex conjugate (equation (1.5)) will be verified.
- ⁇ s (i> is (i) M, w ,, (Wi ⁇ ) ⁇ *: tr 2
- the module 20 calculates the ith column of a matrix of rotations of a complex Hadamard matrix H cle whose generation depends on a key.
- z ⁇ (n) 0 2 ⁇ ⁇ 1 , to go from the entire rotation to the corresponding complex number of module 1.
- a key is used to obtain distinct signal families. In an application of the present invention tattooing signal files, this allows for separate tattoos that can be superimposed without interacting.
- the key is an integer which makes it possible to generate two permutations of Ns elements and twice Ns integer rotations of order ⁇ , that is to say a number from 1 to [NS! . ⁇ NS ] 2 .
- the keys are used to initialize a generator making it possible to extract the necessary information.
- the introduction of the key allows to introduce a secret in the process of generating the sequences and thus to restrict the possibility of their use to the owners of the key only.
- the module 22 transforms a vector of rotations of Z dR into a complex vector with a discrete spectrum of C Ls .
- the complex spectrum s (i) can be used as such, which has been shown in Figure 2 by an arrow output algorithm. Otherwise, the generation of mutually orthogonal time signals is performed by the module 24 which transforms a complex vector s (i) in C Ls and controlled spectrum into a controlled discrete spectrum time vector of E Ls .
- the module 24 is an application module of a reverse discrete Fourier transform of order Ls. This operation is well known to those skilled in the art. It does not depend on i.
- this module calculates a column of the matrix H cle .
- This has the advantage of avoiding the construction of the complete matrix and thus simplifying and accelerating calculations.
- the matrix of the rotations is expressed thus: ⁇ ⁇
- H r ef is the reference complex Hadamard matrix canonically constructed by the process as a function of d R ;
- auxiliary functions ⁇ c hg, ⁇ c iecoi, Pcie hg and p c iecoi is trivial.
- the permutations can be performed for example by scrambling algorithms well known in cryptography and the rotations can be initialized by a random function for introducing a secret. In the context of the description of the process, these calculated and known auxiliary functions are assumed.
- d R - 100 DF (d R ) - ⁇ 2; 2; 5; 5 ⁇ and Nf - 4.
- the complex Hadamard matrix H ref of reference constructed by the method is defined by:
- n i + f i- ( n 2 + f 2 - (n 3 + • • • ))
- H ref is an integer matrix
- Figure 3 shows the organization of the process of calculating the ith column of the rotation matrix H de [.] [I].
- Step 302 consists in performing the permutation ⁇ c ie, cor (i) and then to calculate directly ref H [.] [ ⁇ collar key (i)]. To this last matrix is added, at step 304, the contribution of the rotations according to equation (1.8).
- a basic example of workflow a) and b) is illustrated in the flowchart of Figure 4.
- a variable n is initialized to the value dR, a variable D to the value 2, a variable i to the value 0 and a variable ⁇ to the value 1.
- test 402 consisting in checking if n is congruent to zero modulo D, that is, if n is a multiple of D.
- test 402 If the test 402 is negative, a test 404 consisting in verifying if n is 1 is carried out.
- test 404 If the test 404 is negative, the value of the variable D (step 406) is incremented by one unit and the test 402 is returned. If the test 404 is positive, the variable Nf, which designates the number of factors, is assigned. from the decomposition of dR, the value of i (step 408) and the algorithm ends.
- test 402 If the test 402 is positive, a test 410 is performed consisting in checking whether ⁇ is congruent to zero modulo D.
- step 412 If the test 410 is negative, the variable ⁇ is assigned the value of the variable D. ⁇ (step 412) and step 414 is passed. If the test 410 is positive, it goes directly to step 414.
- Step 414 consists in assigning the variable n the value of the variable n / D, incrementing the value of the variable i by one, and assigning the variable fi the value of the variable D. Then, we return to test 402. Returning to FIG. 3, the operation 302 for calculating the column
- I j and q are calculated progressively.
- a variable I is initialized to the value 0 and a variable c to the value of the auxiliary function ⁇ c ié, ⁇ ⁇ (i) -
- a variable j is initialized to the value 1 and a variable a to the value 0 (step 504). Then, one tests during a test 506 if j> Nf, Nf denoting the number of prime factors of dR. If the 506 test is positive, the value of the variable a to the variable H ref [1] [c] (step 508), the value of the variable I (step 510) is incremented by one unit and returns to the test 502.
- the next step 516 is to assign the value of a + - - c, - I, to
- step 518 the value of variable j is incremented by one and the value of variable x is assigned to variable I and the value of variable y to variable c.
- operation 304 consists of calculating the column H of [.] [I] by calculating the
- an initialization step 600 firstly consists in initializing a variable I at the value 0, a variable c at the value of the auxiliary function ⁇ c ié, coi (i), a variable h the value of H ref [c] and a variable r to the value of the auxiliary function p c ie, cor (i) [.] -
- the set Q makes it possible to express the values of a signal f of A as a function of Q in E, ie f: Q ⁇ E; x ⁇ -> f (x).
- a signal is comparable to f, an element of the set of functions of Q in E, denoted by F (Q 1 E), ie f ⁇ F (Q 1 E).
- the set F (Q 1 E) is known as a vector space, and thus, as before, we will equate the signals f with vectors of the vector space F (Q 1 E).
- a key named key has been associated to them, possibly unique, which allows the generation of a variety of weakly correlated signals families.
- G is the definition of the constraints of the system: each constraint cg has
- FIG. 7 illustrates the process according to the present invention in all its generality.
- the constraint G is segmented into its constraints by ego band, cgi, cg 2 , etc.
- Each band g a gives rise to the generation (via the modules 70, 71, 72, etc.) of a signal s a (i) and of its variant s a (i) in the Fourier domain, having a controlled spectrum .
- the signals thus created are multiplied (via the modules 700, 701, 702, etc.) by a factor c a which controls the power of the signal in this band.
- the signals are then added in a module
- the factors c a can be modified without changing the orthogonality (non correlation) of the spectra and signals, they modify only the balancing of the power of the signals s (i, c) and s (i, c).
- the method in all its generality illustrated in FIG. 7 uses the so-called "band calculation" method (in the modules 70, 71, 72, etc.).
- the band calculation is illustrated in more detail on the flowchart of FIG. 8. It includes a step 80 called “band preparation” which makes it possible to determine once and for all the generation parameters that will be used by the so-called “calculation” method. spectral "illustrated by block 82.
- Spectral calculation method allows the generation of the complex spectrum S (i) of the ith band signal g a.
- the signal s (i) is obtained at the output of the module 84, by a discrete inverse Fourier transform of its complex spectrum s a (i), by a simple implementation of the formula
- the band preparation step is illustrated in greater detail in the flowchart of FIG. 9.
- This mechanism is composed of a so-called "extension calculation” module 90 which determines, as a function of the constraint cg a and the dimensions of the system, the dimension a, R Hadamard matrices (and thus the maximum number of the family of signals) and PRLG extension data to be used for the extension.
- the preparation module 300 is the one described above in conjunction with FIGS. 3 and 4.
- the flowchart of FIG. 10 shows in greater detail the organization of the spectral calculation step implemented by the block 82 of FIG. 8. This step includes:
- a so-called "exponential” step 106 which consists of calculating the complex numbers corresponding to the calculated rotations and normalizing them by a scale factor making it possible to obtain the power property controlled.
- an initialization step 110 firstly consists of initializing a variable I at the value 0. Then a test 112 consists in checking whether the value of the variable I has reached the maximum number d a , R of family signals. If this is the case, the procedure ends. Otherwise, we calculate
- FIGS. 12 and 13 show the calculation steps in the case of complex signals. This case is the simplest because there is no symmetrization constraint.
- FIG. 12 illustrates in greater detail the step 90 of calculating the extension of FIG. 9 in the case of complex signals.
- a step 120 the value of the band g a is assigned to the variable prlg a .
- a step 122 the value of
- FIG. 13 illustrates in greater detail step 108 of extension of FIG. 10 in the case of complex spectra.
- the variable s (i) [.] Is initialized to the value 0 and during a step
- step 140 we begin with steps of initialization of d a , R at the value 0 (step 140), extension data prg a to the empty set (step 142) and variable I to the value 0 (step 144). .
- J a, R is assigned to the variable k the value of g a [l] (step 150). Note that the value of ⁇ a is different depending on whether the signals are real or complex.
- step 160 add k to the extension data (step 160), increment by one unit the value of d a , R (step 162) and then go to step 154.
- This extension of preparation removes the elements of g which is undesirable.
- the dimension d a , R can have a value different from
- the variable I is then incremented by one unit (step 166) and then returns to test 134.
- a first example concerns the tattooing of audio files.
- FIG. 16 shows, by way of nonlimiting example, that the method according to the invention makes it possible to provide time signals or their Fourier variants with discrete spectra controlled at the level of the modulation of the messages.
- the data received from the transmission channel are processed in order to reconstitute the messages sent.
- the process of Figure 16 can be used to power a read-only memory (ROM), which avoids boarding the process.
- ROM read-only memory
- the binary message is modulated (within a block 1600) by the signal allocated to the user #i for whom the binary data is intended.
- the signal is then processed to be transmitted on the mobile radio channel 1602.
- the user #i performs the correlation of the received signal (block 1604). Since the signals are orthogonal, the user # i will only detect, in the stream he receives, the data that is intended for him.
- These signals can also be used in metrology, where they can make it possible to optimize the excitation data to be supplied to the studied system, as shown in FIG. 17. This makes it possible to increase the relevance of the result of the measurement performed on the system. system studied.
- the method of Figure 17 can be used to power a ROM, which avoids boarding the process.
- a typical case of use in metrology is the measurement of the impulse response of acoustic rooms.
- a long periodic signal sequence is emitted by a loudspeaker, each period of which is flat spectrum or controlled according to the case.
- the periodic signal will be filtered by the impulse response of the room.
- the signal is retrieved from a microphone for processing.
- the percussion response of the room is obtained by making the cross correlation between the signal received by the microphone and the transmitted sequence.
- the transmitted sequence has a correlation function equal to a Dirac distribution. This is precisely the case of the time signals which are the subject of the present invention.
- Correlation is performed by taking a sequence of twice the size of the desired impulse response.
- An efficient way of performing the correlation is to perform the discrete Fourier transform of the received signal, to multiply the frequency signal obtained by the conjugate complex of the Fourier transform of the orthogonal sequence and to perform a fast inverse Fourier transform of the received signal. resulting signal.
- the signals are generated in the spectral domain, it is sufficient to store in ROM the frequency version of the sequence.
- These signals can also be used as a basis for encoding or representing signals.
- these signals may be used in digital audio coding as illustrated by way of example in FIG. 18.
- the use of orthogonal complex spectrums in the frequency domain makes it possible to code the speech or audio signal directly in this domain.
- the quantization noise shaping can be performed so that the noise faithfully follows the masking curve over the specified frequency bands.
- the coding device illustrated in FIG. 18 comprises a dictionary in which the complex spectra generated according to the method of the invention are stored. This type of dictionary is used in the coding or decoding of audio signals to implement the quantization and inverse quantization step.
- the signals are generated by Kronecker products of base matrices
- the scalar product of the signal to be quantified by all the waveforms of the dictionary can then be efficiently obtained by a fast algorithm involving butterflies such as of the Fast Fourier Transform (TFR) or that of the actual Hadamard transform.
- TFR Fast Fourier Transform
- the dictionary is expanded by taking different matrices as generating matrices. For example, for an order 2, there are 64 possible basic matrices, the elements of each matrix being orthogonal and chosen in (1, -1, i, -i). More specifically, Figure 18 illustrates the use of mutually orthogonal complex spectra in a time-domain predictive coder.
- the contribution of the filtering of an emitted signal s e (n) with zero excitation (block 180) is first removed from the signal (subtractor 182) to give the target t.
- the target t in the frequency domain is obtained by Fast Fourier Transform of t (block 184).
- the complex samples of the signal are quantized by a quantizer 186 defined by a dictionary containing the Ns orthogonal complex vectors s (0), ..., s (Ns - 1).
- Ns - 1 The numerator is equal to the scalar product of t ⁇ h ⁇ by all the waveforms of the dictionary generated by a Kronecker product of elementary matrices for which an effective algorithm of the "Hadamard transform" type is realized.
- the resulting structure is based on a butterfly structure similar to that of the TFR.
- the computation of the optimal index amounts to computation of the index i op t which maximizes [t ⁇ s (i)] 2 .
- a particular example of implementation is obtained by segmenting the spectrum into frequency bands, contiguous or not, of variable length, possibly with areas of zero amplitude at high frequencies.
- Fig. 19 shows an example of using mutually orthogonal signals in the case of audio tattooing.
- the complex signals or spectra are generated according to the description given above, the method illustrated being either on-board or off-line, the signals being stored once and for all in a ROM.
- the resynchronization and the correlation are first carried out between the received signal and the set of signals of the reception dictionary.
- the detected signal is the one that gives the maximum correlation.
- FIG. 2 A device 200 implementing the methods in accordance with the invention is illustrated in FIG. This device may be for example a microcomputer 200 connected to different peripherals, at least some of which may provide information to be processed according to the invention.
- the device 200 may comprise a communication interface 2000 connected to a network (not shown).
- the device 200 furthermore comprises storage means 2002, such as a hard disk. It may also include a reader of 2004 information carriers such as floppy disks, CD-ROMs or memory cards 2006.
- the information carrier 2006 and the storage means 2002 may contain software implementation data of the invention. as well as the code of the invention which, once read by the device 200, will be stored on the storage means 2002.
- the program enabling the device to implement the invention may be stored in read-only memory (by example a ROM) 2008.
- the program can be received via the network, to be stored in the same manner as described above.
- the device 200 is connected to a microphone 2010 via an input / output card 2012.
- the data to be processed according to the invention will in this case be an audio signal.
- This same device includes a 2014 screen to visualize the information to be processed or to interface with the user, who can set some modes of treatment, using a keyboard 2016, a mouse or any other way.
- a CPU 2018 executes the instructions for implementing the invention, instructions stored in the ROM 2008 or in the other storage elements.
- the programs and processing methods stored in one of the (non-volatile) memories, for example the ROM 2008 are transferred to a random access memory (for example, a RAM) 2020, which then contains the executable code of the invention as well as the variables necessary for the implementation of the invention.
- a communication bus 2022 allows communication between the different sub-elements of the microcomputer 200 or linked to it.
- the representation of the bus 2022 is not limiting and in particular, the central unit 2018 is capable of communicating instructions to any sub-element of the microcomputer 200 directly or via another sub-element of the microcomputer 200.
- the device described here is likely to contain all or part of the treatment described in the invention.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Complex Calculations (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0753737A FR2913548A1 (fr) | 2007-03-09 | 2007-03-09 | Procede de generation de signaux mutuellement orthogonaux dont le spectre est controle |
PCT/FR2008/050391 WO2008122744A1 (fr) | 2007-03-09 | 2008-03-07 | Procede de generation de signaux mutuellement orthogonaux dont le spectre est controle |
Publications (1)
Publication Number | Publication Date |
---|---|
EP2119073A1 true EP2119073A1 (fr) | 2009-11-18 |
Family
ID=38477097
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP08775694A Withdrawn EP2119073A1 (fr) | 2007-03-09 | 2008-03-07 | Procede de generation de signaux mutuellement orthogonaux dont le spectre est controle |
Country Status (4)
Country | Link |
---|---|
US (1) | US8154984B2 (fr) |
EP (1) | EP2119073A1 (fr) |
FR (1) | FR2913548A1 (fr) |
WO (1) | WO2008122744A1 (fr) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2934696A1 (fr) * | 2008-08-01 | 2010-02-05 | Groupe Ecoles Telecomm | Procede de generation de sequences de codes pour des communications a acces multiples par repartition de codes et systeme associe. |
US8416641B2 (en) * | 2010-04-28 | 2013-04-09 | Semiconductor Components Industries, Llc | Acoustic distance measurement system having cross talk immunity |
US10868628B1 (en) * | 2019-04-02 | 2020-12-15 | Huawei Technologies Co., Ltd. | Method and apparatus for generating and implementing spectrally-efficient orthogonal codes for wireless communications |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
IL114471A0 (en) * | 1994-07-12 | 1996-01-31 | Usa Digital Radio Partners L P | Method and system for simultaneously broadcasting and analog signals |
US6724741B1 (en) * | 1998-06-29 | 2004-04-20 | L-3 Communications Corporation | PN code selection for synchronous CDMA |
US6314125B1 (en) * | 1998-12-09 | 2001-11-06 | Qualcomm Incorporated | Method and apparatus for the construction and transmission of binary quasi orthogonal vectors |
CA2376858C (fr) | 1999-06-11 | 2006-02-14 | Templex Technology, Inc. | Systeme et appareil de communication avec code orthogonal synchrone |
US7242722B2 (en) * | 2003-10-17 | 2007-07-10 | Motorola, Inc. | Method and apparatus for transmission and reception within an OFDM communication system |
US20070036202A1 (en) * | 2005-03-11 | 2007-02-15 | Hongya Ge | Code, signal and conjugate direction design for rapidly-adaptive communication receivers and electromagnetic, acoustic and nuclear array processors |
-
2007
- 2007-03-09 FR FR0753737A patent/FR2913548A1/fr not_active Withdrawn
-
2008
- 2008-03-07 US US12/530,540 patent/US8154984B2/en not_active Expired - Fee Related
- 2008-03-07 EP EP08775694A patent/EP2119073A1/fr not_active Withdrawn
- 2008-03-07 WO PCT/FR2008/050391 patent/WO2008122744A1/fr active Application Filing
Non-Patent Citations (1)
Title |
---|
See references of WO2008122744A1 * |
Also Published As
Publication number | Publication date |
---|---|
US20100103811A1 (en) | 2010-04-29 |
WO2008122744A1 (fr) | 2008-10-16 |
FR2913548A1 (fr) | 2008-09-12 |
US8154984B2 (en) | 2012-04-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Rekik et al. | Speech steganography using wavelet and Fourier transforms | |
EP2681889B1 (fr) | Procede de modulation d'un signal multiporteuse de type oqam, programme d'ordinateur et modulateur correspondants | |
EP2603862B1 (fr) | Procédé d'analyse de signaux fournissant des fréquences instantanées et des transformées de fourier glissantes et dispositif d'analyse de signaux | |
EP2828848B1 (fr) | Procédé et système pour incorporer et détecter un motif | |
Ahani et al. | A sparse representation-based wavelet domain speech steganography method | |
FR3098973A1 (fr) | Procédé de séparation d’un signal acoustique de mélange en une pluralité de M contributions sonores ; Produit programme d’ordinateur et support lisible d’informations associés. | |
CN112309426A (zh) | 语音处理模型训练方法及装置和语音处理方法及装置 | |
EP2119073A1 (fr) | Procede de generation de signaux mutuellement orthogonaux dont le spectre est controle | |
Kumar et al. | Secured speech watermarking with DCT compression and chaotic embedding using DWT and SVD | |
Galleani et al. | Direct time-frequency characterization of linear systems governed by differential equations | |
EP3200384B1 (fr) | Procédé d'execution de calcul cryptographique et application a la classification par machines a vecteurs de support | |
CN105283915A (zh) | 数字水印嵌入装置、数字水印检测装置、数字水印嵌入方法、数字水印检测方法、数字水印嵌入程序以及数字水印检测程序 | |
EP3482524B1 (fr) | Procédé de génération des paramètres caractérisant un protocole cryptographique | |
Hoffmann | Rate of convergence for parametric estimation in a stochastic volatility model | |
Adrian et al. | Synthesis of perceptually plausible multichannel noise signals controlled by real world statistical noise properties | |
WO2012085215A1 (fr) | Procede et systeme pour l'authentification multi-modale multi-seuil utilisant le partage de secret | |
EP2126904B1 (fr) | Procede et dispositif de codage audio | |
Kurada et al. | Speech bandwidth extension using transform-domain data hiding | |
Mirarab et al. | A novel wavelet based ICA technique using Kurtosis | |
Saadi et al. | A novel adaptive watermark embedding approach for enhancing security of biometric voice/speech systems | |
EP2045957B1 (fr) | Calcul de preuve d'appartenance d'un secret à un intervalle, mettant en oeuvre und décomposition binaire | |
Gunjal et al. | Optimised adaptive speech coder for software defined radio | |
Rao et al. | Speech Steganography Using DWT with IPDP-MLE Approach for Defence Applications | |
Kumar et al. | A Novel Speech Steganography Mechanism to Securing Data Through Shift Invariant Continuous Wavelet Transform with Speech Activity and Message Detection | |
WO2010000966A1 (fr) | Procédé de simulation d'un circuit électronique comportant au moins une partie analogique avec une densité spectrale de puissance |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20090828 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: LOZACH, BRUNO Inventor name: LE GUYADER, ALAIN Inventor name: BOLLO, JOSE |
|
DAX | Request for extension of the european patent (deleted) | ||
17Q | First examination report despatched |
Effective date: 20110128 |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20161012 |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: LOZACH, BRUNO Inventor name: LE GUYADER, ALAIN Inventor name: BOLLO, JOSE |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20170223 |