[go: up one dir, main page]

CN112926024A - Hadamard quadrature modulation signal generation method, device, terminal and medium - Google Patents

Hadamard quadrature modulation signal generation method, device, terminal and medium Download PDF

Info

Publication number
CN112926024A
CN112926024A CN202110106032.XA CN202110106032A CN112926024A CN 112926024 A CN112926024 A CN 112926024A CN 202110106032 A CN202110106032 A CN 202110106032A CN 112926024 A CN112926024 A CN 112926024A
Authority
CN
China
Prior art keywords
hadamard
row vector
signal
generating
splicing
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.)
Granted
Application number
CN202110106032.XA
Other languages
Chinese (zh)
Other versions
CN112926024B (en
Inventor
李晓明
郑波浪
李建龙
刘伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Shengzhe Science & Technology Co ltd
Original Assignee
Beijing Shengzhe Science & Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Shengzhe Science & Technology Co ltd filed Critical Beijing Shengzhe Science & Technology Co ltd
Priority to CN202110106032.XA priority Critical patent/CN112926024B/en
Publication of CN112926024A publication Critical patent/CN112926024A/en
Application granted granted Critical
Publication of CN112926024B publication Critical patent/CN112926024B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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 a Hadamard quadrature modulation signal. The method comprises the following steps: for each signal packet, determining a decimal value that matches the signal packet; the signal grouping is obtained by grouping 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 groups. According to the technical scheme, the whole Hadamard matrix does not need to be generated and stored in advance, and the expenses of software and hardware resources are greatly saved.

Description

Hadamard quadrature modulation signal generation method, device, terminal and medium
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 a Hadamard quadrature modulation signal.
Background
The row vectors of the Hadamard matrix have good pairwise orthogonality, and therefore 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, and a specific row vector of the hadamard matrix is 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 thus, the way of extracting a specific row vector in the hadamard matrix may cause waste of hardware resources.
Disclosure of Invention
The embodiment of the invention provides a method, a device, a terminal and a medium for generating a Hadamard quadrature modulation signal, so as to save the expenses of software and hardware resources.
In a first aspect, an embodiment of the present invention provides a method for generating a hadamard quadrature modulation signal, including:
for each signal packet, determining a decimal value that matches the signal packet; the signal grouping is obtained by grouping 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 groups.
In a second aspect, an embodiment of the present invention further provides a device for generating a hadamard quadrature modulation signal, including:
a signal grouping decimal value determining module for determining, for each signal grouping, a decimal value matching the signal grouping; the signal grouping is obtained by grouping input digital signals to be transmitted;
and the Hadamard orthogonal modulation signal generation module is used for generating a data row matched with the decimal value in a Hadamard matrix in real time and mapping the data row into an orthogonal modulation signal matched with the signal group.
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 executable 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, the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the method for generating a hadamard quadrature modulation signal according to any embodiment of the present invention.
In the technical scheme of the embodiment of the invention, the specific Hadamard row 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 does not need to be generated in advance and stored, and the expenditure 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 apparatus according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a hadamard quadrature modulation signal generation apparatus according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of a terminal in a fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example one
Fig. 1 is a flowchart of a method for generating a hadamard quadrature modulation signal according to an embodiment of the present invention, where the embodiment is applicable to a situation where a digital signal to be transmitted is hadamard modulated, and the method can be executed by a device for generating a hadamard quadrature modulation signal according to an embodiment of the present invention, and the device can be implemented in a software and/or hardware manner and can be generally integrated in a terminal.
As shown in fig. 1, the method for generating a hadamard quadrature modulation signal provided in this embodiment includes:
s110, determining a decimal value matched with each signal packet; the signal grouping is obtained by grouping input digital signals to be transmitted.
And grouping the digital signals to be transmitted to obtain each signal group, and modulating each signal group based on the Hadamard row vector.
Optionally, before determining the decimal value matched with the signal packet for each signal packet, the input digital signals to be transmitted are grouped according to a preset spread spectrum signal length.
The preset spreading signal length is related to a spreading factor, for example, if the spreading factor is K, the preset spreading signal length N is 2^ K, where K may be any positive integer, and this is not limited in this embodiment of the present invention.
For example, if the preset spreading factor is 10, which means that 10 bits of information can be transmitted per preset spreading signal, the digital signals to be transmitted may be grouped according to the preset spreading factor of 10, for example, each 10 bits of information are grouped in turn from the first bit of information.
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 certain signal packet is "0110", it is converted into decimal "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 groups.
For each signal packet, generating a data row in the hadamard matrix matching the decimal value corresponding to the signal packet in real time (i.e. the number of rows of the data row is equal to the decimal value), and mapping the data row to an orthogonal modulation signal matching the signal packet.
For example, if the decimal value corresponding to a certain signal packet is "6", the 6 th row of 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 of data is mapped to the orthogonal modulation signal matched with the signal packet. For example, if the digital signal to be transmitted is a baseband signal, the 6 th row of data is mapped to a baseband modulation signal matched with the signal packet.
As an alternative implementation, generating the data row in the hadamard matrix that matches the decimal value may specifically be:
converting the decimal value into a binary sequence; iteratively generating a Hadamard row vector as the data row according to the binary sequence and the Hadamard basis matrix; wherein the iteration number is the length of the binary sequence.
Wherein, the Hadamard basis matrix can be [ +1] or [ -1 ].
In this embodiment, the hadamard fundamental matrix is iterated a plurality of times to generate hadamard row vectors, and the number of rows of the hadamard row vectors is a decimal number. Specifically, the hadamard basis matrix is iterated for a plurality of times according to each binary data in the binary sequence, the iteration times are equal to the length of the binary sequence, that is, the iteration times are equal to the number of binary values in the binary sequence.
For an n-th order hadamard matrix, the number of rows (i.e., decimal values) l of the hadamard row vector is 0,1, …, n-1.
Converting decimal values l into binary sequences [ a ]m-1,am-2,…,a1,a0]Wherein m is＝log2n,
Figure RE-GDA0002986200640000051
Further, as an optional implementation manner, iteratively generating a hadamard row vector according to the binary sequence and the hadamard basis matrix may specifically be:
taking the Hadamard basis matrix as the Hadamard row vector;
sequentially acquiring a binary number value as current negation indication information according to the reverse order of the binary sequence;
generating a splicing row vector according to the current negation indication information and the Hadamard row vector, and updating the Hadamard row vector after splicing the splicing row vector with the Hadamard row vector;
and returning to execute the operation of sequentially acquiring a binary number value as the current negation indication information according to the reverse order of the binary sequence until all the binary number values in the binary sequence are acquired.
Wherein the reverse order of the binary sequence is referred to as a0To am-1The order of (a).
First, the hadamard basis matrix is taken as a hadamard row vector.
Secondly, according to a0To am-1Sequentially obtaining a binary value as current negation indication information, generating a splicing row vector according to the current negation indication information and the Hadamard row vector, splicing the splicing row vector on the Hadamard row vector, then updating the Hadamard row vector, and repeating the steps until the binary value a is obtainedm-1And finishing Hadamard row vector updating as the current negation indication information.
And when each round of iteration updating of the Hadamard row vector is carried out, the updated Hadamard row vector is a row vector spliced by the Hadamard row vector before updating and the corresponding spliced row vector.
Generating a splicing row vector according to the current negation indication information and the Hadamard row vector, wherein negation of the Hadamard row vector is used as the splicing row vector according to whether the current negation indication information is a valid value or not, or the Hadamard row vector is directly used as the splicing row vector.
For example, when the hadamard row vector is [1,1,1,1], when the current negation indication information is a valid value, the concatenation row vector is [ -1, -1, -1, -1], and after the concatenation row vector [ -1, -1, -1] is concatenated to the hadamard row vector [1,1,1,1], a further row of hadamard row vectors is obtained as [1,1,1,1, -1, -1, -1 ]; when the current negation indication information is not a valid value, the splicing row vector is [1,1,1,1], the splicing row vector [1,1,1,1] is spliced in the Hadamard row vector [1,1,1,1], and then the Hadamard row vector after the row is [1,1,1,1,1 ].
Optionally, when the binary value is 1, when the binary value is taken as the current negation indication information, the current negation indication information is an effective value; when the binary value is 0, the current negation indication information is not a valid value when the binary value is used as the current negation indication information.
As a specific implementation manner, generating a splicing row vector according to the current negation indication information and the hadamard row vector may specifically be:
when the current negation indication information is 1, negating the element symbols of the Hadamard row vector to obtain the spliced row vector; and when the current negation indication information is 0, taking the Hadamard row vector as the splicing row vector.
For example, when the hadamard row vector is [1,1,1,1], and when the current negation indication information is 1, the concatenation row vector is [ -1, -1, -1, -1 ]; when the current negation indication information is 0, the concatenation row vector is [1,1,1,1 ].
The process is circulated until am-1And as the current negation indication information, generating a splicing row vector according to the current negation indication information and the Hadamard row vector, splicing the splicing row vector on the Hadamard row vector, and then updating the Hadamard row vector, wherein the updated Hadamard row vector is the Hadamard row vector of the ith row in the Hadamard matrix.
Illustratively, in a Hadamard basis matrix of [ +1 [)]According to a binary sequence [ a ]m-1,am-2,…,a1,a0]And iteratively generating a Hadamard row vector with a row number l by using the Hadamard basis matrix. Wherein the number of iterations is equal to the length m of the binary sequence.
Assume a Hadamard row vector in an iterative process to
Figure RE-GDA0002986200640000071
Where k is 1,2,3, …, m indicates the number of iterations,
Figure RE-GDA0002986200640000072
is Hadamard basis matrix [ +1]. At 1 st iteration, negation indicating information f1＝a0The Hadamard row vector after iteration is
Figure RE-GDA0002986200640000073
At the k-th iteration, negation indicating information fk＝ak-1The Hadamard row vector after iteration is
Figure RE-GDA0002986200640000074
At the m-th iteration, negation indicating information fm＝am-1The Hadamard row vector after iteration is
Figure RE-GDA0002986200640000075
At this time
Figure RE-GDA0002986200640000076
Namely the finally generated Hadamard row vector.
For the k-th iteration, when the information f is indicatedkWhen 0, the concatenation row vector is the same as the current hadamard row vector, i.e. the current hadamard row vector is added
Figure RE-GDA0002986200640000077
Copy one copy and splice in the current Hadamard row vector
Figure RE-GDA0002986200640000081
To obtain a tail of
Figure RE-GDA0002986200640000082
When the indication information fkWhen the vector number is 1, the splicing row vector is the row vector obtained by inverting the current Hadamard row vector
Figure RE-GDA0002986200640000083
I.e. the current hadamard row vector
Figure RE-GDA0002986200640000084
Copy one copy and invert the symbol according to the element symbol to obtain
Figure RE-GDA0002986200640000085
Re-spliced at the current Hadamard row vector
Figure RE-GDA0002986200640000086
To obtain a tail of
Figure RE-GDA0002986200640000087
Figure RE-GDA0002986200640000088
Taking row 5 as an example for generating an 8-th-order hadamard matrix, the binary sequence into which decimal value l ═ 5 is converted is [ 101%]If Hadamard basis matrix
Figure RE-GDA0002986200640000089
Is [ +1]Then, at the 1 st iteration, the negation indicating information f1＝a01, the Hadamard row vector after iteration
Figure RE-GDA00029862006400000810
In the 2 nd iteration, negation indicating information f2＝a10, the Hadamard row vector after iteration
Figure RE-GDA00029862006400000811
In the 3 rd iteration, negation indicating information f3＝a21, the Hadamard row vector after iteration
Figure RE-GDA00029862006400000812
Taking row 5 as an example for generating an 8-th-order hadamard matrix, the binary sequence into which decimal value l ═ 5 is converted is [ 101%]If Hadamard basis matrix
Figure RE-GDA00029862006400000813
Is [ -1]]Then, at the 1 st iteration, the negation indicating information f1＝a01, the Hadamard row vector after iteration
Figure RE-GDA00029862006400000814
In the 2 nd iteration, negation indicating information f2＝a10, the Hadamard row vector after iteration
Figure RE-GDA00029862006400000815
In the 3 rd iteration, negation indicating information f3＝a21, the Hadamard row vector after iteration
Figure RE-GDA00029862006400000816
In the technical scheme of the embodiment of the invention, the specific Hadamard row 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 does not need to be generated in advance and stored, and the expenditure of software and hardware resources is greatly saved.
In the technical scheme, the characteristic of iterative generation of the Hadamard matrix is adopted, and the 1 xn Hadamard row vector is iteratively generated on one dimension according to the needed Hadamard matrix row number and the Hadamard basic matrix, so that the implementation mode is simple, and only negation, copying and copying operations are needed.
Example two
The present embodiment is embodied on the basis of the foregoing embodiment, and as an optional implementation manner, taking the hadamard fundamental matrix as the hadamard row vector may specifically be:
storing the Hadamard basis matrix as the Hadamard row vector into a storage unit;
correspondingly, when obtaining a non-last binary value as the current negation indication information according to the reverse order of the binary sequence, splicing the spliced row vector to the hadamard row vector and then updating the hadamard row vector may include: splicing the splicing row vector to the Hadamard row vector and then updating the Hadamard row vector in the storage unit;
when the last binary value is obtained as the current negation indication information according to the reverse order of the binary sequence, generating a spliced line vector according to the current negation indication information and the hadamard line vector, and updating the hadamard line vector after splicing the spliced line vector to the hadamard line vector, which may include: and acquiring the Hadamard row vector in the storage unit, generating a splicing row vector of the Hadamard row vector according to the current negation indication information, and splicing the splicing row vector with the Hadamard row vector to obtain a final Hadamard row vector.
In the present embodiment, the hadamard row vectors in the iterative process are stored by the storage unit. Before iteration, the storage unit stores Hadamard basis matrix
Figure RE-GDA0002986200640000091
A in binary sequence0～am-2When the current negation indication information is used for updating the Hadamard row vector, the iterated Hadamard row vector is used for updating the Hadamard row vector stored in the storage unit; a in binary sequencem-1When the current negation indication information is used for updating the Hadamard row vector, the Hadamard row vector in the storage unit is used for generating a splicing row vector, and the splicing row vector is spliced on the Hadamard row vector to obtain the maximum valueAnd finally, the Hadamard row vector is obtained, and the Hadamard row vector stored in the storage unit is not updated by using the iterated Hadamard row vector, so that the storage space is saved.
As a specific implementation manner, as shown in fig. 2, the operation of generating the data rows in the hadamard matrix in real time, which match the decimal values, may be implemented by the cooperation of the parsing unit, the iteration control unit, the inverse splicing unit, and the storage unit. Wherein,
and the resolving unit is used for converting the decimal value into a binary sequence.
And the iteration control unit is connected with the analysis unit and the negation splicing unit and is used for sequentially controlling the negation splicing unit by taking the binary numerical values in the binary sequence as negation indication information in the process of Hadamard row vector iteration generation.
The inverse splicing unit is connected with the storage unit and used for performing iterative updating on the Hadamard row vector in the storage unit under the control of the iterative control unit, specifically, the inverse splicing unit can be used for copying the Hadamard row vector in the storage unit and splicing the copied Hadamard row vector into the original Hadamard row vector to update the Hadamard row vector in the storage unit, or the inverse sign of the Hadamard row vector in the storage unit is copied and then spliced into the original Hadamard row vector to update the Hadamard row vector in the storage unit.
And the storage unit is used for storing the Hadamard row vector in the iteration process.
Optionally, in each iteration process of the hadamard row vector, if it is determined that the current negation indication information is valid (for example, 1) according to a binary value in the binary sequence, the iteration control unit controls the negation splicing unit to copy the hadamard row vector in the storage unit, negate the symbol according to the element symbol, splice the original hadamard row vector, and update the hadamard row vector in the storage unit; and if the current negation indication information is determined to be invalid (if the current negation indication information is 0) according to the binary number value in the binary sequence, controlling the negation splicing unit to copy the Hadamard row vector in the storage unit, splicing the copied Hadamard row vector in the original Hadamard row vector, and updating the Hadamard row vector in the storage unit. And further, the final Hadamard row vector is output outwards in the storage unit, so that the data row of the Hadamard row vector is mapped into an orthogonal modulation signal matched with the signal packet.
Furthermore, in order to save the storage space, when the iteration control unit iterates the hadamard row vector for the last time, the negation splicing unit may be controlled not to update the hadamard row vector in the storage unit and then output the final hadamard row vector, that is, the final hadamard row vector is not stored in the storage unit, but the hadamard row vector in the storage unit is controlled to be output once outwards first, and then the hadamard row vector in the storage unit is controlled to be output once again outwards according to negation indication information of the last iteration or the negation splicing unit is controlled to copy the hadamard row vector in the storage unit and output once outwards after negating symbols according to the element symbols.
That is, at the m-th iteration, the storage unit stores the Hadamard row vector as
Figure RE-GDA0002986200640000111
To save memory space, the iteration control unit controls not to generate
Figure RE-GDA0002986200640000112
Then outputs the Hadamard row vector, and the Hadamard row vector stored in the storage unit can be output firstly
Figure RE-GDA0002986200640000113
At fm＝am-1When the value is equal to 0, the Hadamard row vector stored in the storage unit is read
Figure RE-GDA0002986200640000114
Output again once at fm＝am-1When the vector is equal to 1, the inverse splicing unit is controlled to copy the Hadamard row vector in the storage unit
Figure RE-GDA0002986200640000115
Output the inverted symbol again after being output according to the element symbol。
For those parts of this embodiment that are not explained in detail, reference is made to the aforementioned embodiments, which are not repeated herein.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a device for generating a hadamard quadrature modulation signal according to a third embodiment of the present invention, where this embodiment is applicable to a situation of performing hadamard modulation on a digital signal 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 grouping decimal value determining module 310 and a hadamard quadrature modulation signal generating module 320. Wherein,
a signal grouping decimal value determining module 310 for determining, for each signal grouping, a decimal value matching the signal grouping; the signal grouping is obtained by grouping input digital signals to be transmitted;
and a hadamard quadrature modulation signal generating module 320, configured to generate, in real time, data rows in a hadamard matrix that match the decimal values, and map the data rows into quadrature modulation signals that match the signal groups.
In the technical scheme of the embodiment of the invention, the specific Hadamard row 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 does not need to be generated in advance and stored, and the expenditure of software and hardware resources is greatly saved.
Optionally, the hadamard quadrature modulation signal generating module 320 specifically includes: a numerical system conversion unit and a Hadamard row vector generation unit, wherein,
a decimal value system conversion unit for converting the decimal value into a binary sequence;
a Hadamard row vector generating unit, configured to iteratively generate a Hadamard row vector as the data row according to the binary sequence and the Hadamard basis matrix; wherein the iteration number is the length of the binary sequence.
Further, a hadamard row vector generating unit, specifically configured to use the hadamard basis matrix as the hadamard row vector; sequentially acquiring a binary number value as current negation indication information according to the reverse order of the binary sequence; generating a splicing row vector according to the current negation indication information and the Hadamard row vector, and updating the Hadamard row vector after splicing the splicing row vector with the Hadamard row vector; and returning to execute the operation of sequentially acquiring a binary number value as the current negation indication information according to the reverse order of the binary sequence until all the binary number values in the binary sequence are acquired.
Optionally, the hadamard row vector generating unit is specifically configured to, when the current negation indication information is 1, negate an element symbol of the hadamard row vector to obtain the spliced row vector; and when the current negation indication information is 0, taking the Hadamard row vector as the splicing row vector.
Optionally, the hadamard basis matrix is [ +1] or [ -1 ].
As an optional implementation manner, the hadamard row vector generating unit is specifically configured to store the hadamard basis matrix as the hadamard row vector into a storage unit; when a non-last binary value is obtained according to the reverse order of the binary sequence and serves as current negation indication information, the splicing row vector is spliced on the Hadamard row vector, and then the Hadamard row vector in the storage unit is updated; and when the last binary value is obtained according to the reverse order of the binary sequence and serves as the current negation indication information, obtaining the Hadamard row vector in the storage unit, generating a spliced row vector according to the current negation indication information and the Hadamard row vector, and splicing the spliced row vector to the Hadamard row vector to obtain the final Hadamard row vector.
Optionally, the apparatus further comprises: 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 each signal group.
The apparatus for generating a hadamard quadrature modulation signal may execute the method for generating a hadamard quadrature modulation signal provided in any embodiment of the present invention, and has functional modules corresponding to the executed method for generating a hadamard quadrature modulation signal and advantageous effects.
Example four
Fig. 4 is a schematic diagram of a 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 other means, for example, in fig. 4.
The memory 420 is a non-transitory computer-readable storage medium, and can be used for storing a software program, a computer-executable program, and program instructions corresponding to a method for generating a hadamard quadrature modulation signal according to an embodiment of the present invention, including:
for each signal packet, determining a decimal value that matches the signal packet; the signal grouping is obtained by grouping 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 groups.
The processor 410 executes software program instructions stored in the memory 420 to execute various functional applications of the terminal and data processing, that is, to implement a method for generating a hadamard quadrature modulation signal in any of the embodiments of the method described above.
The memory 420 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal, and the like. Further, the 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
An embodiment of the present invention further provides a storage medium containing computer-executable instructions, which when executed by a computer processor, perform a method for generating a hadamard quadrature modulation signal, the method including:
for each signal packet, determining a decimal value that matches the signal packet; the signal grouping is obtained by grouping 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 groups.
Optionally, the computer-executable instructions, when executed by a computer processor, may be further configured to perform a method for generating a hadamard quadrature modulation signal according to any of the embodiments of the present invention.
From the above description of the embodiments, it is obvious for those skilled in the art that the present invention can be implemented by software and necessary general hardware, and certainly, can also be implemented by hardware, but the former is a better embodiment in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, and includes several instructions for enabling a terminal (which may be a personal computer, a server, or a network device) to execute the methods according to the embodiments of the present invention.
It should be noted that, in the embodiment of the apparatus for generating a hadamard quadrature modulation signal, the units and modules included in the apparatus are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be implemented; in addition, specific names of the functional units are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present invention.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. 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, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims (10)

1. A method for generating a hadamard quadrature modulation signal, comprising:
for each signal packet, determining a decimal value that matches the signal packet; the signal grouping is obtained by grouping 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 groups.
2. The method of claim 1, wherein generating rows of data in a hadamard matrix that match the decimal values comprises:
converting the decimal value into a binary sequence;
iteratively generating a Hadamard row vector as the data row according to the binary sequence and the Hadamard basis matrix; wherein the iteration number is the length of the binary sequence.
3. The method of claim 2, wherein iteratively generating a hadamard row vector from the binary sequence and a hadamard basis matrix comprises:
taking the Hadamard basis matrix as the Hadamard row vector;
sequentially acquiring a binary number value as current negation indication information according to the reverse order of the binary sequence;
generating a splicing row vector according to the current negation indication information and the Hadamard row vector, and updating the Hadamard row vector after splicing the splicing row vector with the Hadamard row vector;
and returning to execute the operation of sequentially acquiring a binary number value as the current negation indication information according to the reverse order of the binary sequence until all the binary number values in the binary sequence are acquired.
4. The method of claim 3, wherein generating a spliced row vector according to the current negation indication information and the Hadamard row vector comprises:
when the current negation indication information is 1, negating the element symbols of the Hadamard row vector to obtain the spliced row vector;
and when the current negation indication information is 0, taking the Hadamard row vector as the splicing row vector.
5. The method of claim 2, wherein the hadamard basis matrix is [ +1] or [ -1 ].
6. The method of claim 3, wherein using the Hadamard basis matrix as the Hadamard row vector comprises:
storing the Hadamard basis matrix as the Hadamard row vector into a storage unit;
when a non-last binary value is obtained according to the reverse order of the binary sequence and is used as the current negation indication information, the splicing row vector is spliced on the Hadamard row vector and then the Hadamard row vector is updated, and the method comprises the following steps:
splicing the splicing row vector to the Hadamard row vector and then updating the Hadamard row vector in the storage unit;
when the last binary value is obtained as the current negation indication information according to the reverse order of the binary sequence, generating a splicing row vector according to the current negation indication information and the Hadamard row vector, and updating the Hadamard row vector after splicing the splicing row vector on the Hadamard row vector, wherein the method comprises the following steps:
and acquiring the Hadamard row vector in the storage unit, generating a spliced row vector according to the current negation indication information and the Hadamard row vector, and splicing the spliced row vector with the Hadamard row vector to obtain a final Hadamard row vector.
7. 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.
8. An apparatus for generating a hadamard quadrature modulated signal, comprising:
a signal grouping decimal value determining module for determining, for each signal grouping, a decimal value matching the signal grouping; the signal grouping is obtained by grouping input digital signals to be transmitted;
and the Hadamard orthogonal modulation signal generation module is used for generating a data row matched with the decimal value in a Hadamard matrix in real time and mapping the data row into an orthogonal modulation signal matched with the signal group.
9. A terminal, characterized in that the terminal comprises:
one or more processors;
a memory for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-7.
CN202110106032.XA 2021-01-26 2021-01-26 Hadamard quadrature modulation signal generation method, device, terminal and medium Active CN112926024B (en)

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 true CN112926024A (en) 2021-06-08
CN112926024B 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 (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6611494B1 (en) * 1999-05-19 2003-08-26 Agere Systems Inc. Orthogonal sequence generator
US20140198236A1 (en) * 2013-01-16 2014-07-17 Inview Technology Corporation Generating Modulation Patterns for the Acquisition of Multiscale Information in Received Signals
US20140211039A1 (en) * 2013-01-31 2014-07-31 Inview Technology Corporation Efficient Transforms and Efficient Row Generation for Kronecker Products of Hadamard Matrices
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

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6611494B1 (en) * 1999-05-19 2003-08-26 Agere Systems Inc. Orthogonal sequence generator
US20140198236A1 (en) * 2013-01-16 2014-07-17 Inview Technology Corporation Generating Modulation Patterns for the Acquisition of Multiscale Information in Received Signals
US20140211039A1 (en) * 2013-01-31 2014-07-31 Inview Technology Corporation Efficient Transforms and Efficient Row Generation for Kronecker Products of Hadamard Matrices
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)

* Cited by examiner, † Cited by third party
Title
李娜 等: "基于哈达玛变换的LTE辅同步信号检测方法实现研究", 《重庆邮电大学学报(自然科学版)》, vol. 23, no. 3, pages 294 - 298 *

Also Published As

Publication number Publication date
CN112926024B (en) 2023-08-15

Similar Documents

Publication Publication Date Title
US11023801B2 (en) Data processing method and apparatus
AU2019101559A4 (en) Method and apparatus for generating random character string
CA2940647A1 (en) Solving digital logic constraint problems via adiabatic quantum computation
JP2004511046A (en) Method and apparatus for efficiently performing a linear transformation
US11397791B2 (en) Method, circuit, and SOC for performing matrix multiplication operation
CN111158680A (en) Page construction method, device, equipment and storage medium
CN111143446A (en) Data structure conversion processing method and device of data object and electronic equipment
CN117692129A (en) Data encryption transmission method and device, storage medium and computer equipment
US20250184116A1 (en) Homomorphic encryption system and operating method thereof
CN112926024A (en) Hadamard quadrature modulation signal generation method, device, terminal and medium
CN117708601B (en) Similarity calculation model training method, device, equipment and storage medium
CN111881916A (en) Character positioning method, device and equipment
CN109361399A (en) A kind of method, apparatus, equipment and storage medium obtaining byte sequence
Tsaknakis et al. A computationally efficient tensor completion algorithm
CN116152043B (en) Memory management method and device based on image processing and electronic equipment
US11379449B2 (en) Method, electronic device and computer program product for creating metadata index
CN111339546B (en) Method for generating data tag, electronic device and computer storage medium
CN113704563B (en) A message detection method, device, equipment and storage medium
CN119728754A (en) Method, apparatus and computer program product for processing network profiles
CN115390930A (en) Initialization method and device based on SAAS system
KR20250067742A (en) Method of reconstructing ciphertext for homomorphic encyption operation and computing device for performing the same
CN118410847A (en) Quantization method, quantization device, quantization equipment, quantization medium and quantization program product for sparse convolution operator
CN117909317A (en) Distributed digital ID generation method, device, electronic equipment and storage medium
CN118567606A (en) Pseudo-random number generation method, pseudo-random number generation device, computer equipment and storage medium
CN117152824A (en) Cross-scene face detection method and device

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