CN112926024B - Hadamard quadrature modulation signal generation method, device, terminal and medium - Google Patents
Hadamard quadrature modulation signal generation method, device, terminal and medium Download PDFInfo
- Publication number
- CN112926024B CN112926024B CN202110106032.XA CN202110106032A CN112926024B CN 112926024 B CN112926024 B CN 112926024B CN 202110106032 A CN202110106032 A CN 202110106032A CN 112926024 B CN112926024 B CN 112926024B
- Authority
- CN
- China
- Prior art keywords
- hadamard
- vector
- line vector
- row
- signal
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 230000007274 generation of a signal involved in cell-cell signaling Effects 0.000 title claims description 8
- 239000011159 matrix material Substances 0.000 claims abstract description 61
- 238000013507 mapping Methods 0.000 claims abstract description 9
- 239000013598 vector Substances 0.000 claims description 205
- 238000001228 spectrum Methods 0.000 claims description 6
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 238000004590 computer program Methods 0.000 claims description 3
- 108010003272 Hyaluronate lyase Proteins 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000012804 iterative process Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000001351 cycling effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Computational Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
The embodiment of the invention discloses a method, a device, a terminal and a medium for generating Hadamard quadrature modulation signals. The method comprises the following steps: determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted; and generating data rows matched with the decimal values in the Hadamard matrix in real time, and mapping the data rows into orthogonal modulation signals matched with the signal packets. The technical scheme does not need to generate and store the whole Hadamard matrix in advance, so that the cost of software and hardware resources is greatly saved.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method, a device, a terminal and a medium for generating Hadamard quadrature modulation signals.
Background
The row vectors of the Hadamard matrix have good orthogonality, and can be used as spread spectrum codes or orthogonal modulation signals.
Typically, the hadamard matrix is generated in advance and stored as an off-line table, with specific row vectors of the hadamard matrix being extracted at the time of use. However, when the dimension of the hadamard matrix is large, the space required for storing the hadamard matrix is also large, and therefore, the manner of extracting the specific row vectors in the hadamard matrix results in waste of hardware resources.
Disclosure of Invention
The embodiment of the invention provides a method, a device, a terminal and a medium for generating Hadamard quadrature modulation signals, so as to save the cost of software and hardware resources.
In a first aspect, an embodiment of the present invention provides a method for generating a hadamard quadrature modulated signal, including:
determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
and generating data rows matched with the decimal values in the Hadamard matrix in real time, and mapping the data rows into orthogonal modulation signals matched with the signal packets.
In a second aspect, an embodiment of the present invention further provides a device for generating a hadamard quadrature modulated signal, including:
a signal packet decimal value determining module for determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
and the Hadamard orthogonal modulation signal generation module is used for generating data rows matched with the decimal values in the Hadamard matrix in real time and mapping the data rows into orthogonal modulation signals matched with the signal packets.
In a third aspect, an embodiment of the present invention further provides a terminal, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor, where the processor implements the method for generating a hadamard quadrature modulation signal according to any embodiment of the present invention when executing the program.
In a fourth aspect, an embodiment of the present invention further provides a computer readable storage medium, where a computer program is stored, where the program when executed by a processor implements the method for generating a hadamard quadrature modulated signal according to any embodiment of the present invention.
In the technical scheme of the embodiment of the invention, the specific Hadamard line vector used for generating the orthogonal modulation signal is generated in real time and is not extracted from the Hadamard matrix, namely, the whole Hadamard matrix is not required to be generated and stored in advance, so that the cost of software and hardware resources is greatly saved.
Drawings
Fig. 1 is a flowchart of a method for generating a hadamard quadrature modulation signal according to a first embodiment of the present invention;
fig. 2 is a schematic structural diagram of a hadamard row vector generating device in a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a hadamard quadrature modulation signal generating device in a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of a terminal according to a fourth embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be further noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings.
Before discussing exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart depicts operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently, or at the same time. Furthermore, the order of the operations may be rearranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figures. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example 1
Fig. 1 is a flowchart of a method for generating a hadamard quadrature modulated signal according to an embodiment of the present invention, where the method may be performed by a device for generating a hadamard quadrature modulated signal according to an embodiment of the present invention, and the device may be implemented in a software and/or hardware manner and may be generally integrated in a terminal.
As shown in fig. 1, the method for generating the hadamard quadrature modulation signal provided in this embodiment includes:
s110, determining decimal values matched with the signal packets for each signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted.
And grouping the digital signals to be transmitted to obtain signal groups, and modulating each signal group based on the Hadamard line vector.
Optionally, before determining, for each signal packet, a decimal value matching the signal packet, the input digital signal to be transmitted is grouped according to a preset spread spectrum signal length.
The preset spread spectrum signal length is related to a spreading factor, and for example, if the spreading factor is K, the preset spread spectrum signal length n=2ζ, where K may be any positive integer, which is not specifically limited in the embodiment of the present invention.
For example, if the preset spreading factor is 10, which represents that each preset spread signal can transmit 10 bits of information, the digital signals to be transmitted may be grouped according to the preset spreading factor 10, for example, from the first bit information, every 10 bits of information are grouped in sequence.
Optionally, for each signal packet, binary bit information in the signal packet is converted into a decimal value as a decimal value matching the signal packet. Illustratively, if the binary bit information in a signal packet is "0110", it is converted into a decimal value of "6" as a decimal value matching the signal packet.
And S120, generating data rows matched with the decimal values in the Hadamard matrix in real time, and mapping the data rows into orthogonal modulation signals matched with the signal packets.
For each signal packet, a data row in the hadamard matrix matching the decimal value corresponding to the signal packet (i.e. the number of rows of the data row is equal to the decimal value) is generated in real time, and mapped into a quadrature modulated signal matching the signal packet.
For example, if the decimal value corresponding to a certain signal packet is "6", the 6 th row data in the hadamard matrix is generated in real time, that is, the number of rows of the generated hadamard row vector in the hadamard matrix is 6, and the 6 th row data is mapped into the quadrature modulation signal matched with the signal packet. For example, if the digital signal to be transmitted is a baseband signal, the 6 th data is mapped to a baseband modulated signal that matches the signal packet.
As an optional implementation manner, the generation of the data row matched with the decimal value in the hadamard matrix may be specifically:
converting the decimal value into a binary sequence; iteratively generating Hadamard line vectors serving as the data lines according to the binary sequence and a Hadamard basic matrix; wherein the iteration number is the length of the binary sequence.
Wherein the Hadamard base matrix may be [ +1] or [ -1].
In this embodiment, the hadamard matrix is iterated for a plurality of times to generate hadamard row vectors, where the number of rows of the hadamard row vectors is a decimal value. Specifically, the hadamard base matrix is iterated for a plurality of times according to each binary data in the binary sequence, and the iteration times are equal to the length of the binary sequence, namely the iteration times are equal to the number of binary values in the binary sequence.
For an n-order hadamard matrix, the number of rows of hadamard row vectors (i.e. decimal values) l=0, 1, …, n-1.
Converting decimal value l into binary sequence [ a ] m-1 ,a m-2 ,…,a 1 ,a 0 ]Wherein m=log 2 n,
Further, as an optional implementation manner, the iterative generation of the hadamard row vector according to the binary sequence and the hadamard base matrix may be specifically:
taking the Hadamard base matrix as the Hadamard row vector;
sequentially acquiring a binary value as current inversion indicating information according to the reverse order of the binary sequence;
generating a spliced line vector according to the current inverse indication information and the Hadamard line vector, splicing the spliced line vector to the Hadamard line vector, and updating the Hadamard line vector;
and returning to execute the operation of sequentially acquiring a binary number value as the current inversion indicating information according to the reverse order of the binary sequence until all binary numbers in the binary sequence are acquired.
Wherein the reverse order of the binary sequence is represented by a 0 To a m-1 Is a sequence of (a).
First, the hadamard base matrix is used as a hadamard row vector.
Next, according to the formula of a 0 To a m-1 Sequentially acquiring a binary value as current inversion indicating information, generating a spliced line vector according to the current inversion indicating information and the Hadamard line vector, splicing the spliced line vector to the Hadamard line vector, and updating the Hadamard line vector, and circulating until the binary value a is obtained m-1 And finishing the Hadamard line vector updating as the current negation indication information.
And when each round of iterative updating of the Hadamard line vector is performed, the updated Hadamard line vector is a line vector formed by splicing the Hadamard line vector before updating with the corresponding spliced line vector.
And generating a spliced line vector according to the current inversion indicating information and the Hadamard line vector, namely taking the Hadamard line vector as the spliced line vector after inversion according to whether the current inversion indicating information is an effective value or directly taking the Hadamard line vector as the spliced line vector.
For example, when the Hadamard line vector is [1, 1], the concatenation line vector is [ -1, -1, -1, -1], the concatenation line vector [ -1, -1, -1, -1] spliced on the Hadamard line vector [1, 1] to obtain a Hadamard line vector [1, -1, -1, -1, -1] after more lines; when the current inverse indication information is not a valid value, the spliced line vector is [1, 1], and splicing the spliced row vectors [1, 1] to the Hadamard row vectors [1, 1] to obtain a Hadamard row vector [1,1,1,1,1,1,1,1] after more rows.
Optionally, when the binary value is 1, the binary value is used as the current inversion indicating information, and the current inversion indicating information is a valid value; when the binary value is 0, the current inversion indicating information is not a valid value when the binary value is used as the current inversion indicating information.
As a specific implementation manner, the generating a spliced row vector according to the current inversion indication information and the hadamard row vector may specifically be:
when the current inversion indication information is 1, inverting the element symbols of the Hadamard line vector to obtain the spliced line vector; and when the current inverse indication information is 0, taking the Hadamard line vector as the spliced line vector.
For example, when the Hadamard line vector is [1, 1], when the current negation indication information is 1, the concatenation line vector is [ -1, -1, -1, -1]; when the current inversion indication information is 0, the spliced row vector is [1, 1].
Cycling so as to make a m-1 And generating a spliced line vector according to the current inversion indication information and the Hadamard line vector as current inversion indication information, splicing the spliced line vector to the Hadamard line vector, and updating the Hadamard line vector, wherein the updated Hadamard line vector is the Hadamard line vector of the first line in the Hadamard matrix.
Exemplary, in the Hadamard basis matrix [ +1 [ +]When according to binary sequence [ a ] m-1 ,a m-2 ,…,a 1 ,a 0 ]And iterating the Hadamard basic matrix to generate a Hadamard row vector with a row number of l. Wherein the number of iterations is equal to the length m of the binary sequence.
Assuming hadamard row vectors in an iterative processDenoted, k=1, 2,3, …, m denotes the number of iterations, +.>Is a Hadamard matrix [ +1 [ + ]]. At iteration 1, the inverse indication signal is takenRest f 1 ＝a 0 The iterative Hadamard line vector is +.>At the kth iteration, the inverse indication information f is taken k ＝a k-1 The iterative Hadamard line vector is +.>At the mth iteration, the inverse indication information f is taken m ＝a m-1 The iterative Hadamard line vector is +.>At this time->The finally generated Hadamard line vector is obtained.
For the kth iteration, when the information f is indicated k When=0, the concatenated line vector is the same as the current hadamard line vector, i.e., the current hadamard line vectorCopy one copy and splice at current hadamard row vector +.>Is obtained from the tail part of (2)When the indication information f is reversed k When=1, the concatenated row vector is the current hadamard row vector inverted row vectorI.e. the current hadamard row vector +.>Duplicating a part and inverting the sign according to the element sign to obtain +.>Splicing the current Hadamard line vector +.>Is->
For example, in the 5 th row of the 8 th order Hadamard matrix, the decimal value l=5 is converted into a binary sequence of [ 10 1]]If hadamard base matrixIs [ +1]Then at iteration 1, the indication information f is inverted 1 ＝a 0 =1, iterative hadamard row vector +.>At the 2 nd iteration, the inverse indication information f 2 ＝a 1 =0, iterative hadamard row vectorAt the 3 rd iteration, the inverse indication information f 3 ＝a 2 =1, iterative hadamard row vector
For example, in the 5 th row of the 8 th order Hadamard matrix, the decimal value l=5 is converted into a binary sequence of [ 10 1]]If hadamard base matrixIs [ -1]Then at iteration 1, the indication information f is inverted 1 ＝a 0 =1, iterative hadamard row vector +.>At the 2 nd iteration, the inverse indication information f 2 ＝a 1 =0, iterative hadamard row vectorAt the 3 rd iterationTaking the inverse indication information f 3 ＝a 2 =1, iterative hadamard row vector
In the technical scheme of the embodiment of the invention, the specific Hadamard line vector used for generating the orthogonal modulation signal is generated in real time and is not extracted from the Hadamard matrix, namely, the whole Hadamard matrix is not required to be generated and stored in advance, so that the cost of software and hardware resources is greatly saved.
In the technical scheme, the characteristics of iterative generation of the Hadamard matrix are adopted, and according to the needed Hadamard matrix line numbers and the Hadamard basic matrix, the Hadamard line vectors of 1 multiplied by n are iteratively generated in one dimension, so that the implementation mode is simple, and only the operations of inversion, replication and copying are needed.
Example two
The embodiment is embodied on the basis of the foregoing embodiment, and as an optional implementation manner, the hadamard base matrix is used as the hadamard row vector, which may be specifically:
storing the Hadamard basic matrix as the Hadamard line vector into a storage unit;
correspondingly, when the non-last binary value is obtained as the current inversion indication information according to the reverse order of the binary sequence, the splicing row vector is spliced to the hadamard row vector, and then the hadamard row vector is updated, which may include: splicing the spliced row vectors to the Hadamard row vectors, and then updating the Hadamard row vectors in the storage unit;
when the last binary value is obtained as the current inversion indication information according to the reverse order of the binary sequence, generating a spliced row vector according to the current inversion indication information and the hadamard row vector, and after splicing the spliced row vector in the hadamard row vector, updating the hadamard row vector may include: and acquiring the Hadamard line vector in the storage unit, generating a spliced line vector of the Hadamard line vector according to the current inverse indication information, and splicing the spliced line vector to the Hadamard line vector to obtain a final Hadamard line vector.
In this embodiment, the hadamard row vectors in the iterative process are stored by the storage unit. Before iteration, the Hadamard basic matrix is stored in the storage unitA in the binary sequence 0 ～a m-2 When the Hadamard line vector is updated as the current inversion indication information, the iterative Hadamard line vector is used for updating the Hadamard line vector stored in the storage unit; a in the binary sequence m-1 When the Hadamard line vector is updated as the current inversion indication information, the Hadamard line vector in the storage unit is used for generating a spliced line vector, the spliced line vector is spliced on the Hadamard line vector to obtain a final Hadamard line vector, and the Hadamard line vector stored in the storage unit is not updated by using the iterative Hadamard line vector, so that the storage space is saved.
As a specific implementation manner, as shown in fig. 2, the operation of generating the data row matched with the decimal value in the hadamard matrix in real time may be implemented by cooperation of the parsing unit, the iteration control unit, the inversion splicing unit and the storage unit. Wherein,,
and the analysis unit is used for converting the decimal value into a binary sequence.
The iteration control unit is connected with the analysis unit and the inversion splicing unit and is used for controlling the inversion splicing unit by sequentially taking binary values in the binary sequence as inversion indication information in the iterative generation process of the Hadamard line vector.
The inverse splicing unit is connected with the storage unit and used for carrying out iterative updating on the Hadamard line vector in the storage unit under the control of the iterative control unit, and specifically, the Hadamard line vector in the storage unit is spliced after being copied and then updated after being spliced with the original Hadamard line vector, or the Hadamard line vector in the storage unit is copied and then is subjected to inverse symbol taking according to element symbols and then spliced with the original Hadamard line vector, and then the Hadamard line vector in the storage unit is updated.
And the storage unit is used for storing the Hadamard line vector in the iterative process.
Optionally, in each iteration process of the hadamard line vector, if the current inversion indication information is determined to be valid (for example, 1) according to the binary value in the binary sequence, the iteration control unit controls the inversion splicing unit to copy the hadamard line vector in the storage unit, invert the symbol according to the element symbol, splice the element symbol in the original hadamard line vector, and update the hadamard line vector in the storage unit; and if the current inversion indicating information is determined to be invalid (for example, 0) according to the binary values in the binary sequence, controlling an inversion splicing unit to copy and splice the Hadamard line vector in the storage unit to the original Hadamard line vector, and then updating the Hadamard line vector in the storage unit. Further, the final hadamard row vectors are output outwards in the storage unit to achieve mapping of the data rows of the hadamard row vectors into quadrature modulated signals matching the signal packets.
Further, in order to save storage space, when the iterative control unit iterates the hadamard line vector last time, the iterative control unit can control the inversion splicing unit to output the final hadamard line vector after not updating the hadamard line vector in the storage unit, namely, the final hadamard line vector is not stored in the storage unit, but the hadamard line vector in the storage unit is firstly controlled to be output once outwards, and then the hadamard line vector in the storage unit is controlled to be output once outwards again according to the inversion instruction information of the last iteration or the inversion splicing unit is controlled to copy the hadamard line vector in the storage unit to be output once outwards after the element symbol is inverted.
That is, at the mth iteration, the Hadamard line vector is stored in the memory cell asTo save memory space, the iterative control unit controls the non-generating unit to generate the dataGet->And then outputting the Hadamard vector, which can be stored in the storage unitAt f m ＝a m-1 When=0, the hadamard row vector stored in the memory cell is +.>Output once again, at f m ＝a m-1 When=1, the control inversion concatenation unit copies the hadamard row vector in the storage unit +.>And inverting the symbol according to the element symbol and then outputting the inverted symbol once.
The present embodiment is not explained in detail herein, and reference is made to the foregoing embodiments.
Example III
Fig. 3 is a schematic structural diagram of a device for generating hadamard quadrature modulated signals according to a third embodiment of the present invention, where the present embodiment is applicable to the case of hadamard modulation of digital signals to be transmitted, and the device may be implemented in a software and/or hardware manner and may be generally integrated in a terminal. As shown in fig. 3, the apparatus includes: a signal packet decimal value determining module 310 and a hadamard quadrature modulated signal generating module 320. Wherein,,
a signal packet decimal value determining module 310 for determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
and the hadamard orthogonal modulation signal generation module 320 is configured to generate, in real time, a data row matched with the decimal value in the hadamard matrix, and map the data row into an orthogonal modulation signal matched with the signal packet.
In the technical scheme of the embodiment of the invention, the specific Hadamard line vector used for generating the orthogonal modulation signal is generated in real time and is not extracted from the Hadamard matrix, namely, the whole Hadamard matrix is not required to be generated and stored in advance, so that the cost of software and hardware resources is greatly saved.
Optionally, the hadamard quadrature modulation signal generation module 320 specifically includes: a numerical value system conversion unit and a Hadamard line vector generation unit, wherein,
a numerical value system conversion unit for converting the decimal value into a binary sequence;
the Hadamard line vector generation unit is used for iteratively generating Hadamard line vectors serving as the data lines according to the binary sequence and a Hadamard base matrix; wherein the iteration number is the length of the binary sequence.
Further, the hadamard row vector generation unit is specifically configured to use the hadamard base matrix as the hadamard row vector; sequentially acquiring a binary value as current inversion indicating information according to the reverse order of the binary sequence; generating a spliced line vector according to the current inverse indication information and the Hadamard line vector, splicing the spliced line vector to the Hadamard line vector, and updating the Hadamard line vector; and returning to execute the operation of sequentially acquiring a binary number value as the current inversion indicating information according to the reverse order of the binary sequence until all binary numbers in the binary sequence are acquired.
Optionally, the hadamard row vector generating unit is specifically configured to invert the element symbol of the hadamard row vector to obtain the spliced row vector when the current inversion indication information is 1; and when the current inverse indication information is 0, taking the Hadamard line vector as the spliced line vector.
Optionally, the hadamard base matrix is [ +1] or [ -1].
As an optional implementation manner, the hadamard row vector generating unit is specifically configured to store the hadamard base matrix as the hadamard row vector into the storage unit; when acquiring a non-last binary value as current inversion indicating information according to the reverse order of the binary sequence, splicing the spliced row vector to the Hadamard row vector, and updating the Hadamard row vector in the storage unit; when the last binary value is obtained as the current inversion indicating information according to the reverse order of the binary sequence, the Hadamard line vector in the storage unit is obtained, a spliced line vector is generated according to the current inversion indicating information and the Hadamard line vector, and the spliced line vector is spliced to the Hadamard line vector to obtain the final Hadamard line vector.
Optionally, the apparatus further includes: and the signal grouping module is used for grouping the input digital signals to be transmitted according to the preset spread spectrum signal length before determining the decimal value matched with the signal grouping for each signal grouping.
The Hadamard orthogonal modulation signal generating device can execute the Hadamard orthogonal modulation signal generating method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the executed Hadamard orthogonal modulation signal generating method.
Example IV
Fig. 4 is a schematic hardware structure of a terminal according to a fourth embodiment of the present invention, where the terminal may be used to perform hadamard modulation on a digital signal to be transmitted. As shown in fig. 4, the terminal may include:
one or more processors 410, one processor 410 being illustrated in fig. 4;
a memory 420;
the processor 410 and the memory 420 in the terminal may be connected by a bus or otherwise, for example in fig. 4.
The memory 420 is used as a non-transitory computer readable storage medium, and can be used to store a software program and a computer executable program, for example, program instructions corresponding to a method for generating a hadamard quadrature modulation signal in an embodiment of the present invention, including:
determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
and generating data rows matched with the decimal values in the Hadamard matrix in real time, and mapping the data rows into orthogonal modulation signals matched with the signal packets.
The processor 410 executes various functional applications of the terminal and data processing by running software program instructions stored in the memory 420, i.e. implements a method for generating a hadamard quadrature modulated signal in any of the embodiments of the method described above.
Memory 420 may include a storage program area that may store an operating system, at least one application program required for functionality, and a storage data area; the storage data area may store data created according to the use of the terminal, etc. In addition, memory 420 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device.
Example five
A fifth embodiment of the present invention also provides a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform a method for generating a hadamard quadrature modulated signal, the method comprising:
determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
and generating data rows matched with the decimal values in the Hadamard matrix in real time, and mapping the data rows into orthogonal modulation signals matched with the signal packets.
Optionally, the computer executable instructions may also be used to perform the method of generating hadamard quadrature modulated signals provided by any embodiment of the present invention when executed by a computer processor.
From the above description of embodiments, it will be clear to a person skilled in the art that the present invention may be implemented by means of software and necessary general purpose hardware, but of course also by means of hardware, although in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, etc., including several instructions for causing a terminal (which may be a personal computer, a server, a network device, etc.) to perform the method according to the embodiments of the present invention.
It should be noted that, in the embodiment of the apparatus for generating hadamard quadrature modulated signals, each unit and module included are only divided according to the functional logic, but not limited to the above-mentioned division, so long as the corresponding functions can be implemented; in addition, the specific names of the functional units are also only for distinguishing from each other, and are not used to limit the protection scope of the present invention.
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.
Claims (9)
1. A method for generating a hadamard quadrature modulated signal, comprising:
determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
generating data lines matched with the decimal values in a Hadamard matrix in real time, and mapping the data lines into orthogonal modulation signals matched with the signal packets;
the generating the data row matched with the decimal value in the Hadamard matrix comprises the following steps:
converting the decimal value into a binary sequence;
iteratively generating Hadamard line vectors serving as the data lines according to the binary sequence and a Hadamard basic matrix; wherein the iteration number is the length of the binary sequence.
2. The method of claim 1, wherein iteratively generating hadamard row vectors from the binary sequence and hadamard base matrix comprises:
taking the Hadamard base matrix as the Hadamard row vector;
sequentially acquiring a binary value as current inversion indicating information according to the reverse order of the binary sequence;
generating a spliced line vector according to the current inverse indication information and the Hadamard line vector, splicing the spliced line vector to the Hadamard line vector, and updating the Hadamard line vector;
and returning to execute the operation of sequentially acquiring a binary number value as the current inversion indicating information according to the reverse order of the binary sequence until all binary numbers in the binary sequence are acquired.
3. The method of claim 2, wherein generating a stitched row vector from the current inverse indication information and the hadamard row vector comprises:
when the current inversion indication information is 1, inverting the element symbols of the Hadamard line vector to obtain the spliced line vector;
and when the current inverse indication information is 0, taking the Hadamard line vector as the spliced line vector.
4. The method of claim 1, wherein the hadamard base matrix is [ +1] or [ -1].
5. The method of claim 2, wherein taking the hadamard base matrix as the hadamard row vector comprises:
storing the Hadamard basic matrix as the Hadamard line vector into a storage unit;
when acquiring a non-last binary value as current inversion indicating information according to the reverse order of the binary sequence, splicing the spliced row vector to the hadamard row vector, and updating the hadamard row vector, wherein the method comprises the following steps:
splicing the spliced row vectors to the Hadamard row vectors, and then updating the Hadamard row vectors in the storage unit;
when the last binary value is obtained as the current inversion indicating information according to the reverse order of the binary sequence, generating a spliced row vector according to the current inversion indicating information and the hadamard row vector, and after splicing the spliced row vector in the hadamard row vector, updating the hadamard row vector, including:
and acquiring the Hadamard line vector in the storage unit, generating a spliced line vector according to the current inverse indication information and the Hadamard line vector, and splicing the spliced line vector to the Hadamard line vector to obtain a final Hadamard line vector.
6. The method of claim 1, further comprising, prior to determining, for each signal packet, a decimal value that matches the signal packet:
and grouping the input digital signals to be transmitted according to the preset spread spectrum signal length.
7. A hadamard quadrature modulated signal generation apparatus, comprising:
a signal packet decimal value determining module for determining, for each signal packet, a decimal value that matches the signal packet; the signal grouping is obtained by grouping the input digital signals to be transmitted;
the Hadamard orthogonal modulation signal generation module is used for generating data lines matched with the decimal values in the Hadamard matrix in real time and mapping the data lines into orthogonal modulation signals matched with the signal packets;
the Hadamard quadrature modulation signal generation module comprises:
a numerical value system conversion unit for converting the decimal value into a binary sequence;
the Hadamard line vector generation unit is used for iteratively generating Hadamard line vectors serving as the data lines according to the binary sequence and a Hadamard base matrix; wherein the iteration number is the length of the binary sequence.
8. A terminal, the terminal comprising:
one or more processors;
a memory for storing one or more programs,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-6.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110106032.XA CN112926024B (en) | 2021-01-26 | 2021-01-26 | Hadamard quadrature modulation signal generation method, device, terminal and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110106032.XA CN112926024B (en) | 2021-01-26 | 2021-01-26 | Hadamard quadrature modulation signal generation method, device, terminal and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112926024A CN112926024A (en) | 2021-06-08 |
| CN112926024B true CN112926024B (en) | 2023-08-15 |
Family
ID=76166490
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110106032.XA Active CN112926024B (en) | 2021-01-26 | 2021-01-26 | Hadamard quadrature modulation signal generation method, device, terminal and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112926024B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6611494B1 (en) * | 1999-05-19 | 2003-08-26 | Agere Systems Inc. | Orthogonal sequence generator |
| CN111565161A (en) * | 2020-04-28 | 2020-08-21 | 北京升哲科技有限公司 | Baseband transmitter, baseband receiver, modulation and demodulation system and terminal |
| CN111614373A (en) * | 2020-05-20 | 2020-09-01 | 北京升哲科技有限公司 | Spread spectrum signal transmission method, spread spectrum signal reception method, spread spectrum signal transmission device, spread spectrum signal reception device, and spread spectrum signal reception medium |
| CN112187684A (en) * | 2020-09-30 | 2021-01-05 | 北京升哲科技有限公司 | Soft demodulation method, device, receiver and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9277139B2 (en) * | 2013-01-16 | 2016-03-01 | Inview Technology Corporation | Generating modulation patterns for the acquisition of multiscale information in received signals |
| US9081731B2 (en) * | 2013-01-31 | 2015-07-14 | Inview Technology Corporation | Efficient transforms and efficient row generation for Kronecker products of Hadamard matrices |
-
2021
- 2021-01-26 CN CN202110106032.XA patent/CN112926024B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6611494B1 (en) * | 1999-05-19 | 2003-08-26 | Agere Systems Inc. | Orthogonal sequence generator |
| CN111565161A (en) * | 2020-04-28 | 2020-08-21 | 北京升哲科技有限公司 | Baseband transmitter, baseband receiver, modulation and demodulation system and terminal |
| CN111614373A (en) * | 2020-05-20 | 2020-09-01 | 北京升哲科技有限公司 | Spread spectrum signal transmission method, spread spectrum signal reception method, spread spectrum signal transmission device, spread spectrum signal reception device, and spread spectrum signal reception medium |
| CN112187684A (en) * | 2020-09-30 | 2021-01-05 | 北京升哲科技有限公司 | Soft demodulation method, device, receiver and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 基于哈达玛变换的LTE辅同步信号检测方法实现研究;李娜 等;《重庆邮电大学学报(自然科学版)》;第23卷(第3期);第294-298页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112926024A (en) | 2021-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Berztiss | A backtrack procedure for isomorphism of directed graphs | |
| AU2019101559A4 (en) | Method and apparatus for generating random character string | |
| EP3113020A1 (en) | Data processing device and method for processing serial tasks | |
| JP2004511046A (en) | Method and apparatus for efficiently performing a linear transformation | |
| US20200090552A1 (en) | Secure multi-party computation method, device, apparatus and computer-readable storage medium | |
| CN111444547B (en) | Method, apparatus and computer storage medium for data integrity attestation | |
| CN109828759B (en) | Code compiling method, device, computer device and storage medium | |
| CN112230927B (en) | File redirection method, code loading control method and device | |
| CN114499743A (en) | Communication data processing method, device, equipment and storage medium | |
| CN111143446A (en) | Data structure conversion processing method and device of data object and electronic equipment | |
| CN114138231B (en) | Method, circuit and SOC for executing matrix multiplication operation | |
| CN112926024B (en) | Hadamard quadrature modulation signal generation method, device, terminal and medium | |
| Winker et al. | Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I | |
| CN108196906B (en) | User instruction processing method and embedded device | |
| CN116346777A (en) | Dictionary tree domain name matching method, device, equipment and storage medium | |
| CN109361399A (en) | A kind of method, apparatus, equipment and storage medium obtaining byte sequence | |
| KR101976315B1 (en) | Method for constructing polar codes on binary symmetric channel and apparatus therefor | |
| CN111444548A (en) | Method, apparatus and computer storage medium for data integrity attestation | |
| CN111339546B (en) | Method for generating data tag, electronic device and computer storage medium | |
| CN116152043B (en) | Memory management method and device based on image processing and electronic equipment | |
| CN116088938B (en) | Continuous instruction processing method and system, electronic equipment and storage medium | |
| CN111444242B (en) | Method for checking data equivalence, electronic device and computer storage medium | |
| US11379449B2 (en) | Method, electronic device and computer program product for creating metadata index | |
| CN118797109A (en) | Character string matching method, device, equipment and medium | |
| CN117348927A (en) | MD5 computing method based on large-end system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |