A short packet data transmission method and system based on hybrid sparse vector code

Abstract

The present invention relates to the field of wireless communication technology, and discloses a short packet data transmission method and system based on a hybrid sparse vector code, which is applied to a transmitting end. The method comprises: in response to a short packet data transmission signal sent by a receiving end, using a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit data information, mapping the bit data information to an initial sparse vector to obtain a first sparse vector and a second sparse vector; randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a hybrid sparse vector; converting the hybrid sparse vector to the time domain to obtain a corresponding hybrid sparse vector signal, and transmitting it to the receiving end. The present invention uses the hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map to a non-zero block index, a scattered non-zero element index, and a non-zero value, thereby improving the transmission efficiency of the short packet data, reducing the potential bit error rate, and ensuring the reliable transmission of the short packet data.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a short packet data transmission method and system based on a hybrid sparse vector code. Background Art

[0002] With the maturity of wireless communication technology, many new application scenarios have emerged, such as the metaverse, integrated space-air-ground networks, digital twins, and immersive virtual reality. These application scenarios place extremely high demands on data transmission reliability and latency. Because these application scenarios often involve frequent data transmission, such as instant status updates and control commands, traditional long packet transmission mechanisms may not meet low-latency requirements. Short packet data transmission focuses on quickly and efficiently processing and delivering small data packets, reducing transmission latency and ensuring instant information exchange, thereby supporting real-time interaction and user experience in advanced application scenarios.

[0003] However, the complex and dynamic communication environment poses significant challenges to existing short-packet data transmission based on sparse vector codes. For example, in the connected vehicle (IoV) scenario, real-time information exchange is required between vehicles, between vehicles and roadside units (ROSs), and between vehicles and base stations. Vehicles must promptly upload collected sensor data, while base stations must accurately transmit control commands to vehicles. This places extremely high demands on the reliability and latency of short-packet data transmission. However, in IoV communication scenarios, due to the presence of dense buildings, trees, and forests, the signal propagation paths are complex, and the wireless channel exhibits frequency-selective fading. Furthermore, the rapid relative motion between vehicles and base stations causes the wireless channel to exhibit time-selective fading. This dual time-frequency selectivity of the wireless channel introduces significant inter-carrier interference during data transmission. Therefore, reliable short-packet data transmission remains a challenge that needs to be addressed.

[0004] Currently, existing short packet transmission methods based on sparse vector coding (SVC) map bit data information to a small number of non-zero indices in a sparse vector, randomly expand this sparse vector into a low-dimensional sequence using a non-orthogonal codebook, and finally map this sequence to time-frequency for transmission. At the receiving end, decoding is achieved by simply detecting the index positions of the scattered non-zero elements in the received signal. However, SVC only uses scattered non-zero elements for encoding and decoding, resulting in low efficiency and poor reliability of short packet data transmission. Summary of the Invention

[0005] In view of this, the present invention provides a short packet data transmission method and system based on hybrid sparse vector codes to solve the problem that the existing short packet data transmission method based on sparse vector codes only uses scattered non-zero elements for encoding and decoding, resulting in low efficiency and poor reliability of short packet data transmission.

[0006] In a first aspect, the present invention provides a short packet data transmission method based on a hybrid sparse vector code, which is applied to a transmitting end, and the method includes:

[0007] In response to a short packet data transmission signal sent by a receiving end, for any bit data information in the short packet data to be transmitted, a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the bit data information to an initial sparse vector to obtain a first sparse vector and a second sparse vector, where the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector;

[0008] Randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector;

[0009] The mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted is converted into the time domain to obtain a mixed sparse vector signal corresponding to each bit of data information, and transmitted to the receiving end.

[0010] The short packet data transmission method based on hybrid sparse vector codes provided in an embodiment of the present invention receives a short packet data transmission request and adopts a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map each bit of data information of the short packet data to a non-zero block index, a scattered non-zero element index, and a non-zero value. After random expansion of the codebook, the data is transmitted in the time-frequency domain. Compared with bit mapping using only scattered non-zero elements, the transmission efficiency of the short packet data is improved, the potential bit error rate is reduced, and the reliable transmission of the short packet data is guaranteed.

[0011] In an optional embodiment, any bit data information includes first bit data information, second bit data information, and third bit data information. In response to a short packet data transmission signal sent by a receiving end, for any bit data information in the short packet data to be transmitted, a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the bit data information to an initial sparse vector to obtain a first sparse vector and a second sparse vector, including:

[0012] Determine the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements;

[0013] Determining first bit data information based on the length of the initial sparse vector and a non-zero block length;

[0014] Determining second bit data information based on the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements;

[0015] Adopting a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value, mapping the first bit of data information to the index of the non-zero block to obtain a first sparse vector;

[0016] A mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the second bit of data information to the index of the scattered non-zero element to obtain a second sparse vector.

[0017] The short packet data transmission method based on a hybrid sparse vector code provided in an embodiment of the present invention specifies the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements. These parameters provide a basic framework for subsequent mapping. Based on the above information, the first bit data information and the second bit data information are determined and mapped to the non-zero block index and the index of the scattered non-zero element, respectively, to obtain the first sparse vector and the second sparse vector. By finely dividing the bit data information and adopting different mapping rules, the coding efficiency is improved.

[0018] In an optional embodiment, the method further includes:

[0019] The sum of the non-zero block length and the number of scattered non-zero elements is determined as the number of non-zero elements;

[0020] Determining the third bit of data information based on the number of non-zero value elements;

[0021] performing bit interleaving on the third bit of data information to obtain a bit sequence corresponding to the third bit of data information;

[0022] modulating a bit sequence corresponding to the third bit of data information to obtain a symbol corresponding to the modulated third bit of data information;

[0023] A mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the symbol corresponding to the third bit of modulated data information to a non-zero value.

[0024] The short packet data transmission method based on a hybrid sparse vector code provided in an embodiment of the present invention adds the non-zero block length and the number of scattered non-zero elements to obtain the number of non-zero elements, thereby determining the third bit data information, interleaving the third bit data information to improve data reliability, modulating the interleaved bit sequence into symbols, and mapping them to obtain corresponding sparse vectors, thereby improving coding efficiency.

[0025] In an optional implementation, randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector includes:

[0026] Determine a first power corresponding to a non-zero block and a second power corresponding to scattered non-zero elements in the initial sparse vector;

[0027] A mixed sparse vector is obtained based on the first power, the first sparse vector, the second power, the second sparse vector, and the codebook matrix.

[0028] The short packet data transmission method based on a hybrid sparse vector code provided in an embodiment of the present invention determines the power corresponding to the non-zero blocks and scattered non-zero elements in the initial sparse vector, and randomly expands the codebook matrix to generate a hybrid sparse vector. The codebook matrix can help reorganize and expand the original sparse information according to the established power allocation. The random expansion helps to resist channel fading and improve the success rate of decoding at the receiving end. In addition, the random expansion using different powers can improve the coding reliability.

[0029] In a second aspect, the present invention provides a short packet data transmission method based on a hybrid sparse vector code, which is applied to a receiving end, and the method includes:

[0030] Sending a short packet data transmission signal to the sending end;

[0031] A mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted transmitted by the receiving end is received. Any mixed sparse vector signal is obtained by mapping the bit data information to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit of data information in the short packet data to be transmitted, thereby obtaining a first sparse vector and a second sparse vector. The first sparse vector and the second sparse vector are randomly expanded using different powers to obtain a mixed sparse vector. The mixed sparse vector is converted into a time domain, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector.

[0032] The embodiment of the present invention provides a short packet data transmission method based on a hybrid sparse vector code. This method starts the transmission of short packet data by sending a short packet data transmission signal to a transmitter, receives a reliable hybrid sparse vector signal obtained after the transmitter encodes the short packet data, and accurately decodes the hybrid sparse vector signal to obtain the short packet data.

[0033] In an optional implementation manner, any bit of data information includes first bit of data information, second bit of data information, and third bit of data information, and the method further includes:

[0034] For any mixed sparse vector signal, the mixed sparse vector signal is converted into the frequency domain to obtain a mixed sparse vector;

[0035] Determine the non-zero block length of the mixed sparse vector;

[0036] Dividing the measurement matrix of the mixed sparse vector into a plurality of sub-matrices, and determining a first correlation value between each sub-matrix and the mixed sparse vector;

[0037] Determine a maximum first correlation value from the first correlation values ​​corresponding to the multiple sub-matrices, and determine a first index corresponding to the maximum first correlation value in the mixed sparse vector;

[0038] Obtaining a new measurement matrix of the mixed sparse vector based on the first index, the non-zero block length, and the measurement matrix of the mixed sparse vector;

[0039] Based on the new measurement matrix of the mixed sparse vector and the first index, bit recovery is performed to obtain first bit data information.

[0040] The short packet data transmission method based on hybrid sparse vector codes provided in an embodiment of the present invention utilizes prior information such as block structured sparsity and non-zero blocks generated during the encoding process to preferentially restore the index of non-zero blocks, thereby achieving precise decoding to obtain accurate first bit data information.

[0041] In an optional embodiment, the method further includes:

[0042] Determining the number of scattered non-zero elements of the mixed sparse vector, a first power corresponding to a non-zero block in the mixed sparse vector, and a first sparse vector corresponding to the first bit of data information;

[0043] Determine a second sparse vector corresponding to the scattered non-zero elements in the mixed sparse vector that are located at the number of scattered non-zero elements;

[0044] Obtaining a third sparse vector based on the mixed sparse vector, the first power, the first index, and the first sparse vector;

[0045] Based on the new measurement matrix of the second sparse vector, the third sparse vector and the mixed sparse vector, a sparse recovery problem is constructed;

[0046] Optimize the sparse recovery problem and obtain the index set of scattered non-zero elements;

[0047] Based on the index set of scattered non-zero elements and the second sparse vector, bit recovery is performed to obtain second bit data information.

[0048] The short packet data transmission method based on hybrid sparse vector code provided in an embodiment of the present invention can achieve accurate decoding to obtain accurate second-bit data information by eliminating the sparse vectors corresponding to non-zero blocks and utilizing prior information such as block structured sparsity and the number of scattered non-zero elements generated during the encoding process to restore the index of the scattered non-zero elements.

[0049] In an optional implementation, optimizing the sparse recovery problem to obtain an index set of scattered non-zero elements includes:

[0050] Determine the initial residual and the preset number of iterations;

[0051] In a first iteration, at least one second correlation value is obtained based on the new measurement matrix of the mixed sparse vector and the initial residual;

[0052] Determine a maximum second correlation value from the at least one second correlation value, and determine a second index corresponding to the maximum second correlation value in the second sparse vector;

[0053] Determining a value of a scattered non-zero element corresponding to the second index based on the second index, the new measurement matrix of the mixed sparse vector, and the third sparse vector;

[0054] Based on the third sparse vector, the second index, the new measurement matrix of the mixed sparse vector, and the values ​​of the scattered non-zero elements corresponding to the second index, the initial residual is updated to complete the first iteration;

[0055] When the number of iterations is less than the preset number of iterations, the above iterative process is repeated, and the second index obtained in each iteration is added to the index set of scattered non-zero elements until the number of iterations reaches the preset number of iterations, thereby obtaining the index set of scattered non-zero elements.

[0056] The short packet data transmission method based on hybrid sparse vector code provided by the embodiment of the present invention constructs a sparse recovery problem and optimizes it, continuously optimizes the index set of scattered non-zero elements in the iterative process, and improves decoding reliability and accuracy.

[0057] In an optional embodiment, the method further includes:

[0058] Obtaining a non-zero value based on the measurement matrix of the first sparse vector, the measurement matrix of the third sparse vector, the first index, the second index, and the mixed sparse vector;

[0059] The non-zero value is symbol-demodulated and deinterleaved to obtain the third bit of data information.

[0060] The short packet data transmission method based on hybrid sparse vector codes provided in an embodiment of the present invention obtains sparse vectors corresponding to non-zero values ​​based on sparse vectors corresponding to non-zero blocks and scattered non-zero elements, and obtains accurate third-bit data information through symbol demodulation and deinterleaving, thereby improving decoding reliability.

[0061] In a third aspect, a short packet data transmission system based on a hybrid sparse vector code is provided, the system comprising a transmitting end and a receiving end, and performing the following steps:

[0062] The receiving end sends a short packet data transmission signal to the sending end;

[0063] In response to the short packet data transmission signal sent by the receiving end, the transmitting end maps any bit data information in the short packet data to be transmitted to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a first sparse vector and a second sparse vector, where the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector;

[0064] The transmitting end randomly expands the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector;

[0065] The transmitting end converts the mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted into the time domain, obtains the mixed sparse vector signal corresponding to each bit of data information, and transmits it to the receiving end;

[0066] The receiving end receives the mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted transmitted by the sending end.

[0067] In a fourth aspect, the present invention provides a short packet data transmission device based on a hybrid sparse vector code, which is applied to a transmitting end, and the device includes:

[0068] a first mapping module, configured to respond to a short packet data transmission signal sent by a receiving end and, for any bit data information in the short packet data to be transmitted, map the bit data information to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a first sparse vector and a second sparse vector, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector;

[0069] An expansion module, configured to randomly expand the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector;

[0070] The transmission module is used to convert the mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted into the time domain, obtain the mixed sparse vector signal corresponding to each bit of data information, and transmit it to the receiving end.

[0071] In a fifth aspect, the present invention provides a short packet data transmission device based on a hybrid sparse vector code, which is applied to a receiving end, and the device includes:

[0072] A sending module, used for sending a short packet data transmission signal to a sending end;

[0073] A receiving module is used to receive a mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted by the transmitting end, wherein any mixed sparse vector signal is obtained by mapping the bit data information to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit of data information in the short packet data to be transmitted, thereby obtaining a first sparse vector and a second sparse vector, randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector, and converting the mixed sparse vector into a time domain, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector.

[0074] In a sixth aspect, the present invention provides a computer device comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, computer instructions stored in the memory, and the processor executing the computer instructions to thereby execute the short packet data transmission method based on a hybrid sparse vector code according to the above-mentioned first aspect or any corresponding embodiment thereof, or to execute the short packet data transmission method based on a hybrid sparse vector code according to the above-mentioned second aspect or any corresponding embodiment thereof.

[0075] In the seventh aspect, the present invention provides a computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a computer to execute the short packet data transmission method based on a hybrid sparse vector code according to the above-mentioned first aspect or any corresponding embodiment, or to execute the short packet data transmission method based on a hybrid sparse vector code according to the above-mentioned second aspect or any corresponding embodiment.

[0076] In an eighth aspect, the present invention provides a computer program product comprising computer instructions, the computer instructions being used to enable a computer to execute the short packet data transmission method based on a hybrid sparse vector code according to the first aspect or any corresponding embodiment thereof, or to execute the short packet data transmission method based on a hybrid sparse vector code according to the second aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0078] Figure 1 4 is a flowchart of a short packet data transmission method based on a hybrid sparse vector code applied to a transmitting end according to an embodiment of the present invention;

[0079] Figure 2 4 is a flowchart of a short packet data transmission method based on a hybrid sparse vector code applied to a receiving end according to an embodiment of the present invention;

[0080] Figure 3 is a flowchart of interaction between a transmitting end and a receiving end in a short packet data transmission system based on a hybrid sparse vector code according to an embodiment of the present invention;

[0081] Figure 4 is a schematic diagram of a bit mapping according to an embodiment of the present invention;

[0082] Figure 5 is a schematic diagram of a power allocation relationship of a non-zero block according to an embodiment of the present invention;

[0083] Figure 6 is a schematic diagram of bit recovery according to an embodiment of the present invention;

[0084] Figure 7 is a schematic diagram comparing block error rate performance of various sparse vector codes according to an embodiment of the present invention;

[0085] Figure 8 1 is a structural block diagram of a short packet data transmission device based on a hybrid sparse vector code according to an embodiment of the present invention;

[0086] Figure 9 1 is a structural block diagram of another short packet data transmission device based on a hybrid sparse vector code according to an embodiment of the present invention;

[0087] Figure 10 Schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0088] To make the purpose, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts shall fall within the scope of protection of the present invention.

[0089] Taking the Internet of Vehicles scenario as an example, short packet transmission is currently performed based on sparse vector codes, which maps bit data information to a small number of non-zero indexes of a sparse vector, and randomly expands the sparse vector to a low-dimensional sequence through a non-orthogonal codebook, and finally maps the sequence to time and frequency for transmission. At the receiving end, decoding can be achieved by simply detecting the non-zero index position of the received signal. However, SVC only uses non-zero elements for encoding and decoding, resulting in low efficiency and poor reliability of short packet data transmission. The short packet data transmission method based on hybrid sparse vector codes provided in an embodiment of the present invention adopts a hybrid sparse mapping mode of non-zero blocks-scattered non-zero elements-non-zero values, which improves the transmission efficiency of short packet data, while reducing the potential bit error rate and ensuring the reliable transmission of short packet data.

[0090] According to an embodiment of the present invention, an embodiment of a short packet data transmission method based on a hybrid sparse vector code is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0091] In this embodiment, a short packet data transmission method based on a hybrid sparse vector code is provided, which is applied to a transmitting end. Figure 1 is a flow chart of a short packet data transmission method based on a hybrid sparse vector code applied to a transmitting end according to an embodiment of the present invention, such as Figure 1 As shown, the process includes the following steps:

[0092] Step S101, in response to a short packet data transmission signal sent by a receiving end, for any bit data information in the short packet data to be transmitted, a hybrid sparse mapping mode of non-zero blocks, scattered non-zero elements, and non-zero values ​​is adopted to map the bit data information to an initial sparse vector, thereby obtaining a first sparse vector and a second sparse vector, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero blocks in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector. Specifically, taking the Internet of Vehicles scenario as an example, the short packet data to be transmitted can be sensor data collected by the vehicle or a control command from a base station, etc., including multiple bit data information. If the short packet data to be transmitted is sensor data, the transmitting end is generally an on-board communication device, and the receiving end is generally a base station. If the short packet data to be transmitted is a control command, the transmitting end is generally a base station, and the receiving end is generally an on-board communication device. The hybrid sparse mapping mode of non-zero blocks, scattered non-zero elements, and non-zero values ​​refers to mapping any bit data information to non-zero blocks, scattered non-zero elements, and non-zero values, respectively. Non-zero blocks are continuous non-zero elements, representing the primary portion of bit data information. Scattered non-zero elements are independent non-zero elements, scattered across space. Non-zero values ​​encompass both non-zero blocks and scattered non-zero elements, directly correlating to the actual valid bit data information carried. By employing a hybrid sparse mapping pattern of non-zero blocks, scattered non-zero elements, and non-zero values ​​for bit mapping during encoding, encoding reliability is improved compared to using only scattered non-zero elements for bit mapping.

[0093] In step S102, the first sparse vector and the second sparse vector are randomly expanded using different powers to obtain a mixed sparse vector. Specifically, the encoding process includes the bit mapping process in step S101 and the random expansion process in step S102. The non-zero elements in the bit data information are randomly expanded in a mixed form of block structure and scattered structure, rather than randomly expanding each non-zero element one by one. This provides additional block structure information, which can support the subsequent decoding process. At the same time, the random expansion using different powers improves encoding reliability.

[0094] Step S103, convert the mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted into the time domain, obtain a mixed sparse vector signal corresponding to each bit of data information, and transmit it to the receiving end. Specifically, for the mixed sparse vector corresponding to any bit of data information, the mixed sparse vector is mapped to multiple subcarriers through multi-carrier technologies such as orthogonal frequency division multiplexing. During the mapping process, the data transmission amount on each subcarrier can be dynamically adjusted according to the channel state information, more data is allocated to good subcarriers, and data transmission is reduced or avoided for subcarriers with poor quality, thereby realizing frequency selective scheduling. Then, in order to resist frequency selective fading, a cyclic prefix is ​​added to the mixed sparse vector located at the subcarrier. Since the mixed sparse vector is an abstract data representation form and cannot be transmitted through a wireless channel, it is converted into the time domain through an inverse discrete Fourier transform to obtain a mixed sparse vector signal for transmission. The mixed sparse vector signal is transmitted to the receiving end. Finally, the mixed sparse vector signal is transmitted to the receiving end through the wireless channel, thereby efficiently and reliably completing the transmission of the short packet data. Optionally, the mixed sparse vector signal can be expressed by the following formula (1).

[0095] y=FH T F H Gs+w=φs+w(1)

[0096] Where y represents the mixed sparse vector signal; F represents the discrete Fourier transform matrix; F H H represents the conjugate transposed matrix of the discrete Fourier transform matrix; T Represents the time domain channel matrix, which is a pseudo-circular matrix. The (p,q)th element of the matrix is ​​expressed as [H T ] p,q =h p,mod(p-q,M) , where h represents the channel gain, M represents the number of subcarriers, p represents the row index, q represents the column index, p,q∈[0,M-1]; G represents the codebook matrix; s represents the mixed sparse vector; w represents the mean is 0 and the variance is σ 2 The additive white Gaussian noise vector of φ represents the measurement matrix, φ=FH T F H G.

[0097] The short packet data transmission method based on hybrid sparse vector codes provided in an embodiment of the present invention receives a short packet data transmission request and adopts a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map each bit of data information of the short packet data to a non-zero block index, a scattered non-zero element index, and a non-zero value. After random expansion of the codebook, the data is transmitted in the time-frequency domain. Compared with bit mapping using only scattered non-zero elements, the transmission efficiency of the short packet data is improved, the potential bit error rate is reduced, and the reliable transmission of the short packet data is guaranteed.

[0098] In this embodiment, a short packet data transmission method based on a hybrid sparse vector code is provided, which is applied to a receiving end. Figure 2 is a flow chart of a short packet data transmission method based on a hybrid sparse vector code applied to a receiving end according to an embodiment of the present invention, such as Figure 2 As shown, the process includes the following steps:

[0099] Step S201: Send a short packet data transmission signal to the transmitting end. Specifically, the short packet data transmission signal is used to indicate the transmission of short packet data, and may also indicate the transmission of short packet data required by the receiving end, etc., which is not limited in the embodiment of the present invention.

[0100] Step S202: Receive a mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted by the transmitter. Any mixed sparse vector signal is obtained by mapping the bit data information to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit of data information in the short packet data to be transmitted, thereby obtaining a first sparse vector and a second sparse vector. The first sparse vector and the second sparse vector are randomly expanded using different powers to obtain a mixed sparse vector. The mixed sparse vector is converted to the time domain, where the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector. Specifically, the mixed sparse vector obtained by the transmitter using the mixed sparse mapping mode and random expansion contains prior information about the block structure, thereby improving decoding reliability at the receiver.

[0101] The embodiment of the present invention provides a short packet data transmission method based on a hybrid sparse vector code. This method starts the transmission of short packet data by sending a short packet data transmission signal to a transmitter, receives a reliable hybrid sparse vector signal obtained after the transmitter encodes the short packet data, and accurately decodes the hybrid sparse vector signal to obtain the short packet data.

[0102] In this embodiment, a short packet data transmission system based on hybrid sparse vector code is provided, which includes a transmitting end and a receiving end. Figure 3 FIG. 1 is a flow chart of interaction between a transmitter and a receiver in a short packet data transmission system based on a hybrid sparse vector code according to an embodiment of the present invention. Figure 3As shown, the receiving end sends a short packet data transmission signal to the transmitting end; in response to the short packet data transmission signal sent by the receiving end, the transmitting end maps any bit data information in the short packet data to be transmitted to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a first sparse vector and a second sparse vector, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector; the transmitting end randomly expands the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector; the transmitting end converts the mixed sparse vector corresponding to each bit data information in the short packet data to be transmitted into the time domain, obtains a mixed sparse vector signal corresponding to each bit data information, and transmits it to the receiving end; the receiving end receives the mixed sparse vector signal corresponding to each bit data information in the short packet data to be transmitted transmitted by the transmitting end.

[0103] In some optional implementations, the short packet data transmission system based on hybrid sparse vector codes includes a transmitting end and a receiving end. The detailed process of the system includes the following steps:

[0104] Step S301: The receiving end sends a short packet data transmission signal to the sending end. Figure 2 Step S201 of the illustrated embodiment will not be described in detail here.

[0105] In step S302, the transmitting end responds to the short packet data transmission signal sent by the receiving end, and maps any bit data information in the short packet data to be transmitted to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a first sparse vector and a second sparse vector. The first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector. Any bit data information includes first bit data information, second bit data information, and third bit data information.

[0106] Specifically, the above step S302 includes:

[0107] In step S3021, the transmitting end determines the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements. Specifically, the length of the initial sparse vector represents the total block length of the initial sparse vector, including the block length actually used for transmission and the block length not used for transmission. The non-zero block length represents the length of the non-zero block, that is, the length used to place consecutive non-zero elements. The number of scattered non-zero elements represents the number of positions in the initial sparse vector used to place independent non-zero elements.

[0108] In step S3022, the transmitting end determines the first bit data information based on the length of the initial sparse vector and the non-zero block length. Specifically, any bit data information is divided into first bit data information, second bit data information, and third bit data information, and each bit is mapped to a different position during the encoding process. Among them, any bit data information, first bit data information, second bit data information, and third bit data information in the short packet data to be transmitted satisfy the following formula (2). Optionally, the first bit data information mapped to the non-zero block can be determined by the following formula (3).

[0109] b=b1+b2+b3(2)

[0110] Wherein, b represents any bit of data information in the short packet data to be transmitted; b1 represents the first bit of data information; b2 represents the second bit of data information; and b3 represents the third bit of data information.

[0111]

[0112] Wherein, b1 represents the first bit of data information; represents the floor operation; N represents the length of the initial sparse vector; L represents the non-zero block length of the initial sparse vector.

[0113] In step S3023, the transmitting end determines the second bit data information based on the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements. Specifically, the second bit data information mapped to the scattered non-zero elements can be determined by the following formula (4).

[0114]

[0115] Wherein, b2 represents the second bit of data information; Represents a floor operation; N represents the length of the initial sparse vector; L represents the non-zero block length of the initial sparse vector; K represents the number of scattered non-zero elements in the initial sparse vector.

[0116] In step S3024, the transmitting end uses a mixed sparse mapping mode of non-zero blocks, scattered non-zero elements, and non-zero values ​​to map the first bit of data information to the index of the non-zero block, thereby obtaining a first sparse vector. Specifically, the index of the non-zero block identifies the specific position of the non-zero block in the initial sparse vector and can indicate the mapping position of the first bit of data information during bit mapping. Through bit mapping, a first sparse vector corresponding to the first bit of data information is obtained.

[0117] In step S3025, the transmitting end uses a hybrid sparse mapping mode of non-zero blocks, scattered non-zero elements, and non-zero values ​​to map the second bit data information to the index of the scattered non-zero elements, thereby obtaining a second sparse vector. Specifically, the index of the scattered non-zero element identifies the specific position of the scattered non-zero element in the initial sparse vector and can indicate the mapping position of the second bit data information during bit mapping. Through bit mapping, a second sparse vector corresponding to the second bit data information is obtained.

[0118] It should be noted that, since the number of bits specifically included in the first bit data information and the second bit data information is determined by the non-zero block length and the number of scattered non-zero elements, the number of bits to be transmitted can be flexibly adjusted by adjusting the non-zero block length and the number of scattered non-zero elements.

[0119] In step S303, the transmitting end determines the sum of the non-zero block length and the number of scattered non-zero elements as the number of non-zero elements. Specifically, since the non-zero value includes non-zero blocks and scattered non-zero elements, the sum of the non-zero block length and the number of scattered non-zero elements is the number of non-zero elements.

[0120] In step S304, the transmitting end determines the third bit of data information based on the number of non-zero value elements. Specifically, the third bit of data information mapped to the non-zero value can be determined by the following formula (5).

[0121] b3=(K+L)log2(M mod )(5)

[0122] Wherein, b3 represents the third bit of data information; L represents the non-zero block length of the initial sparse vector; K represents the number of scattered non-zero elements of the initial sparse vector; M mod Indicates the order of phase modulation or amplitude modulation, M mod Depends on the modulation method. If 16QAM modulation is used, then M mod is 4, using 64QAM modulation, then M mod is 6.

[0123] In step S305, the transmitting end performs bit interleaving on the third bit data information to obtain a bit sequence corresponding to the third bit data information. Specifically, before mapping the third bit data information, in order to improve the reliability of the third bit data information, the third bit data information is bit interleaved to obtain a corresponding bit sequence.

[0124] In step S306, the transmitting end modulates the bit sequence corresponding to the third bit data information to obtain a symbol corresponding to the modulated third bit data information. Specifically, the bit sequence can be phase modulated or amplitude modulated. When the bit sequence is phase modulated, a phase symbol is obtained, i.e., the phase of the bit sequence is modulated to reflect the bit data information. When the bit sequence is amplitude modulated, an amplitude symbol is obtained, i.e., the amplitude of the bit sequence is modulated to carry the bit data information.

[0125] In step S307, the transmitter uses a mixed sparse mapping scheme of non-zero blocks, scattered non-zero elements, and non-zero values ​​to map the symbol corresponding to the modulated third bit of data information to a non-zero value. Specifically, bit mapping is performed on the phase symbol or the amplitude symbol to obtain a third sparse vector corresponding to the third bit of data information. The third sparse vector includes a phase symbol and a phase symbol, or an amplitude symbol and an index corresponding to the amplitude symbol. By finely dividing the bit data information and using different mapping rules, coding efficiency is improved.

[0126] In some optional implementations, the spectrum efficiency can also be obtained based on the first bit data information, the second bit data information, the third bit data information and the length of the initial sparse vector. By mapping and processing each part of the bit data information separately, the organizational structure of the short packet data is optimized, making the overall coding more efficient, and being able to transmit more short packet data under the same spectrum resources, or occupying less spectrum resources when transmitting the same amount of short packet data, thereby improving spectrum utilization. Optionally, the spectrum utilization obtained by using a hybrid sparse vector code can be determined by the following formula (6), and the following formula (8) is the spectrum utilization obtained by using an existing sparse vector code. The hybrid sparse vector code adopts a hybrid sparse mapping mode. When the bit data information contains the same non-zero elements, the number of samples required for bit recovery using non-zero block mapping is less than the number of samples required for bit recovery using scattered non-zero element mapping, that is, the hybrid sparse vector code requires fewer time-frequency resources than the sparse vector code, so the spectrum efficiency of the hybrid sparse vector code is higher.

[0127]

[0128] Among them, SE HSVC represents the spectrum efficiency obtained by using hybrid sparse vector code, HSVC represents hybrid sparse vector code (HSVC); b1 represents the first bit of data information; b2 represents the second bit of data information; b3 represents the third bit of data information; M HSVCrepresents the block length actually used for data transmission when hybrid sparse vector code is used for short packet data transmission, which can be calculated by the compressed sensing theory formula, that is, the following formula (7); N represents the length of the initial sparse vector; L represents the non-zero block length of the initial sparse vector; K represents the number of scattered non-zero elements of the initial sparse vector; M mod Indicates the order of phase modulation or amplitude modulation.

[0129]

[0130] Among them, M HSVC represents the block length actually used for data transmission when hybrid sparse vector code is used for short packet data transmission; N represents the length of the initial sparse vector; L represents the non-zero block length of the initial sparse vector; K represents the number of scattered non-zero elements in the initial sparse vector.

[0131]

[0132] Among them, SE SVC represents the spectrum efficiency obtained by using sparse vector code, SVC represents sparse vector code; M SVC Indicates the actual block length used for data transmission when using sparse vector code for short packet data transmission. Referring to the above formula (7), it can be based on the length N of the sparse vector of the sparse vector code during bit mapping. SVC and the number of scattered non-zero elements K SVC Calculated; N SVC Indicates the length of the sparse vector when the sparse vector code is used for bit mapping; K SVC Indicates the number of scattered non-zero elements in the sparse vector when sparse vector code is used for bit mapping.

[0133] In some optional embodiments, Figure 4 is a schematic diagram of a bit mapping according to an embodiment of the present invention, such as Figure 4 As shown, for any bit data information, the bit data information is divided into three parts: first bit data information, second bit data information and third bit data information. The first bit data information is subjected to non-zero block mapping, mapped to the index of a non-zero block occupying a non-zero block length on the initial sparse vector. The second bit data information is subjected to scattered non-zero element mapping, mapped to the index of scattered non-zero elements occupying the number of scattered non-zero elements on the initial sparse vector. The third bit data information is first bit interleaved, then modulated, and finally mapped to a non-zero value occupying the number of non-zero value elements on the initial sparse vector. The number of non-zero value elements is the sum of the non-zero block length and the number of scattered non-zero elements.

[0134] Step S308: The transmitting end randomly expands the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector.

[0135] Specifically, the above step S308 includes:

[0136] In step S3081, the transmitter determines a first power corresponding to non-zero blocks and a second power corresponding to scattered non-zero elements in the initial sparse vector. Specifically, because the bit-mapped sparse vector contains both non-zero blocks and scattered non-zero elements, different powers, namely, a first power and a second power, are assigned to the non-zero blocks and scattered non-zero elements to achieve optimal coding performance. It should be noted that the sum of the first power and the second power is 1.

[0137] In step S3082, the transmitting end obtains a mixed sparse vector based on the first power, the first sparse vector, the second power, the second sparse vector, and the codebook matrix. Specifically, the mixed sparse vector can be obtained by the following formula (9).

[0138]

[0139] Specifically, x represents a mixed sparse vector, represents the complex domain, U represents the number of rows; α represents the first power; 1-α represents the second power; G represents the codebook matrix Represents the real number domain, U represents the number of rows, and N represents the number of columns. The codebook matrix in the embodiment of the present invention adopts a random Hadamard matrix, whose elements are composed of 1 and -1 and obey the Bernoulli distribution. Assuming that U is 4 and N is 5, the obtained codebook matrix can be expressed by the following formula (10); B represents the first sparse vector, B represents the index set of non-zero blocks; s C Represents the second sparse vector, and C represents the index set of scattered non-zero elements.

[0140]

[0141] In some optional embodiments, Figure 5 FIG. 1 is a schematic diagram of a power allocation relationship of a non-zero block according to an embodiment of the present invention, such as Figure 5 As shown, assuming that the non-zero block length is 3 and the position of scattered non-zero elements is 1, Figure 5 It can be seen that under different signal-to-noise ratios, the optimal power allocation ratio for non-zero blocks of the hybrid sparse vector code is approximately 0.64, that is, the first power is 0.64 and the second power is 0.36. Optionally, in actual situations, the first power and the second power can be adjusted individually, but the sum must be 1.

[0142] In step S309, the transmitting end converts the mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted into the time domain, obtains the mixed sparse vector signal corresponding to each bit of data information, and transmits it to the receiving end. Figure 1Step S103 of the illustrated embodiment will not be described in detail here.

[0143] Step S310: The receiving end receives the mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted transmitted by the transmitting end. Figure 2 Step S202 of the illustrated embodiment will not be described in detail here.

[0144] In step S311, the receiving end converts any mixed sparse vector signal into the frequency domain to obtain a mixed sparse vector, where any bit data information includes first bit data information, second bit data information, and third bit data information. Specifically, to obtain specific bit data information contained in the mixed sparse vector signal, the mixed sparse vector signal may be transformed into the frequency domain using an inverse discrete Fourier transform after removing the cyclic prefix to obtain the mixed sparse vector.

[0145] In step S312, the receiving end determines the non-zero block length of the mixed sparse vector. Specifically, because the mixed sparse vector contains both non-zero blocks and scattered non-zero elements, for efficient decoding, the diluted vectors corresponding to the non-zero blocks and scattered non-zero elements are decoded separately. Optionally, the first sparse vector corresponding to the non-zero block is preferentially decoded.

[0146] In step S313, the receiving end divides the measurement matrix of the mixed sparse vector into multiple sub-matrices and determines a first correlation value between each sub-matrix and the mixed sparse vector. Specifically, dividing the measurement matrix of the mixed sparse vector into multiple sub-matrices can simplify computational complexity and facilitate parallel processing or bit recovery using an iterative algorithm.

[0147] In step S314, the receiving end determines the maximum first correlation value from the first correlation values ​​corresponding to the multiple sub-matrices, and determines the first index corresponding to the maximum first correlation value in the mixed sparse vector. Specifically, the first correlation value between each sub-matrix and the mixed sparse vector can be calculated by the following formula (11), focusing on the correspondence between the non-zero elements in the sub-matrix and the mixed sparse vector, so as to evaluate the degree of matching. The position where the maximum first correlation value appears is most likely to have a non-zero element, so the first index used to identify the position can be determined by the following formula (12) to provide support for subsequent bit recovery.

[0148]

[0149] Where d represents the d-th sub-matrix; v d represents the first correlation value between the d-th sub-matrix and the mixed sparse vector; represents the conjugate transpose of the measurement matrix of the d-th submatrix; x represents the mixed sparse vector.

[0150]

[0151] Where B represents the first index; d represents the d-th submatrix; v d represents the first correlation value between the d-th submatrix and the mixed sparse vector; D represents the number of submatrices; max() represents finding the index corresponding to the maximum value of the element, for example, max({3,1,2})=3.

[0152] In step S315, the receiving end obtains a new measurement matrix for the mixed sparse vector based on the first index, the non-zero block length, and the measurement matrix for the mixed sparse vector. Specifically, all elements in columns (B-1)L+1 through BL of the measurement matrix for the mixed sparse vector are reset to zero, and the resulting zero-set matrix is ​​used as the new measurement matrix for the mixed sparse vector, where B represents the first index and L represents the non-zero block length. The codewords corresponding to the non-zero blocks are removed from the new measurement matrix, thereby preventing the indices of non-zero blocks from being mistakenly identified during the subsequent identification of scattered non-zero elements.

[0153] In step S316, the receiving end performs bit recovery based on the new measurement matrix of the mixed sparse vector and the first index to obtain the first bit of data information. Specifically, bit recovery is performed using a bit recovery method corresponding to the bit mapping to obtain the first bit of data information mapped to the non-zero block. Bit recovery is an optional technique and is not further described here.

[0154] In step S317, the receiving end determines the number of scattered non-zero elements in the mixed sparse vector, the first power corresponding to the non-zero blocks in the mixed sparse vector, and the first sparse vector corresponding to the first bit of data information. Specifically, the above information is determined to provide support for subsequent decoding.

[0155] In step S318, the receiving end determines a second sparse vector corresponding to the scattered non-zero elements in the mixed sparse vector. Specifically, by determining the second sparse vector of the scattered non-zero elements, support is provided for subsequent bit recovery corresponding to the scattered non-zero elements.

[0156] In step S319, the receiving end obtains a third sparse vector based on the mixed sparse vector, the first power, the first index, and the first sparse vector. Specifically, after performing bit recovery on the non-zero blocks, the first sparse vector corresponding to the non-zero blocks can be removed from the mixed sparse vector using the following equation (13) to obtain the third sparse vector.

[0157]

[0158] Among them, x C represents the third sparse vector; x represents the mixed sparse vector; α represents the first power; B represents the first index; φ Brepresents the non-zero element indicated by the first index in the observation matrix of the mixed sparse vector; Represents the non-zero element indicated by the first index in the mixed sparse vector.

[0159] In step S320, the receiving end constructs a sparse recovery problem based on the second sparse vector, the third sparse vector, and the new measurement matrix of the mixed sparse vector. Specifically, the sparse recovery problem is constructed as shown in the following equation (14), and decoding reliability is improved by optimizing the sparse recovery problem.

[0160]

[0161] in, represents the sparse recovery problem; K represents the number of scattered non-zero elements; x C represents the third sparse vector; φ represents the new observation matrix of the mixed sparse vector; Represents the second sparse vector.

[0162] Step S321: The receiving end optimizes the sparse recovery problem and obtains an index set of scattered non-zero elements.

[0163] Specifically, the above step S321 includes:

[0164] Step S3211: The receiving end determines the initial residual and the preset number of iterations. Specifically, the preset initial residual r (0) =x C , and determine the preset number of iterations J at the same time. After executing J iterations, the optimization of the sparse recovery problem is completed.

[0165] In step S3212, in the first iteration, the receiving end obtains at least one second correlation value based on the new measurement matrix of the mixed sparse vector and the initial residual. Specifically, the second correlation value can be determined by the following equation (15), focusing on the correspondence between the initial residual and the new measurement matrix of the mixed sparse vector, thereby evaluating the degree of matching.

[0166] u=|φ H r (j) | (15)

[0167] Wherein, u represents the second correlation value; φ H represents the conjugate transpose of the new measurement matrix of the mixed sparse vector; j represents the jth iteration; r (j) represents the residual at the jth iteration.

[0168] In step S3213, the receiving end determines a maximum second correlation value from the at least one second correlation value, and determines a second index corresponding to the maximum second correlation value in the second sparse vector. Specifically, the position where the second maximum correlation value occurs is most likely to contain scattered non-zero elements. Therefore, a second index used to identify this position can be determined to support subsequent bit recovery.

[0169] In step S3214, the receiving end determines the value of the scattered non-zero element corresponding to the second index based on the second index, the new measurement matrix of the mixed sparse vector, and the third sparse vector. Specifically, the corresponding non-zero element value is estimated according to the second index using the following formula (16).

[0170]

[0171] Where, j represents the jth iteration; C j represents the second index in the j-th iteration; represents the non-zero element value corresponding to the second index in the j-th iteration; represents the non-zero element indicated by the second index in the j-th iteration in the new observation matrix of the mixed sparse vector; express The conjugate transpose of x C Represents the third sparse vector.

[0172] In step S3215, the receiving end updates the initial residual based on the third sparse vector, the second index, the new measurement matrix of the mixed sparse vector, and the values ​​of the scattered non-zero elements corresponding to the second index, completing the first iteration. Specifically, the initial residual is updated using the following equation (17), and the following equation (17) is still used to update the residual in subsequent iterations.

[0173]

[0174] Where, j represents the jth iteration; r represents the residual; x C represents the third sparse vector; represents the non-zero element indicated by the second index in the j-th iteration in the new observation matrix of the mixed sparse vector; Represents the non-zero element value corresponding to the second index in the j-th iteration.

[0175] Step S3216: If the number of iterations is less than the preset number of iterations, the above iterative process is repeated, and the second index obtained in each iteration is added to the index set of scattered non-zero elements until the number of iterations reaches the preset number of iterations, thereby obtaining the index set of scattered non-zero elements. Specifically, after each iteration is completed, it is determined whether the number of iterations is greater than the preset number of iterations. If it is not greater than the preset number of iterations, steps S3212 to S3215 are repeatedly executed, and the second index obtained in each iteration is added to the index set of scattered non-zero elements. If the preset number of iterations is reached, the iteration is terminated, thereby obtaining the index set of scattered non-zero elements.

[0176] In step S322, the receiving end performs bit recovery based on the index set of the scattered non-zero elements and the second sparse vector to obtain second bit data information. Specifically, bit recovery is performed using a bit recovery method corresponding to the bit mapping to obtain the second bit data information mapped to the scattered non-zero elements. Optionally, bit recovery is a conventional technique and will not be described in detail here.

[0177] In step S323, the receiving end obtains a non-zero value based on the measurement matrix of the first sparse vector, the measurement matrix of the third sparse vector, the first index, the second index, and the mixed sparse vector. Specifically, the non-zero value is obtained by the following equation (18).

[0178]

[0179] in, Represents a non-zero value; represents a non-zero element indicated by a first index in the observation matrix of the first sparse vector and a non-zero element indicated by a second index in the observation matrix of the third sparse vector; express The conjugate transpose of ; x represents a mixed sparse vector.

[0180] In step S324, the receiving end performs symbol demodulation and deinterleaving on the non-zero value to obtain the third bit of data information. Specifically, since bit interleaving and symbol modulation are used for encoding, corresponding symbol demodulation and deinterleaving are used during decoding to obtain the third bit of data information.

[0181] In some optional embodiments, Figure 6 FIG. 1 is a schematic diagram of a bit recovery according to an embodiment of the present invention. Figure 6As shown, a first index is first identified on the mixed sparse vector to obtain the first bit of data information mapped to the non-zero block during encoding. Then, the sparse vector corresponding to the non-zero block is eliminated, and a second index is then identified to obtain the second bit of data information mapped to the scattered non-zero elements during encoding. Finally, a non-zero value is obtained through non-zero value estimation, and the non-zero value is demodulated and bit deinterleaved to obtain the third bit of data information mapped to the non-zero value during encoding.

[0182] In some optional embodiments, Figure 7 FIG. 1 is a schematic diagram comparing the block error rate performance of various sparse vector codes according to an embodiment of the present invention. Figure 7 As shown, when a variety of sparse vector codes are used for short packet data transmission, the total number of non-zero elements is set to 3, the number of bits of the transmitted bit data information is 23 bits, and the length of the sparse vector used for mapping is 80 subcarriers, so the spectrum efficiency of all schemes remains the same. Except for the sparse vector code, the other comparison schemes all use the QPSK (Quadrature Phase Shift Keying) modulation method. The lengths of the initial sparse vectors of the sparse vector code scheme, the enhanced sparse vector code scheme, the constellation rotated sparse vector code scheme and the hybrid sparse vector code scheme proposed in the embodiment of the present invention are 380, 94, 94 and 262 respectively. For the hybrid sparse vector code scheme proposed in the embodiment of the present invention, the non-zero block length is 2, and the number of scattered non-zero elements is 1. By Figure 7 It can be seen that under different signal-to-noise ratios, the block error rate performance of the hybrid sparse vector code scheme proposed in the embodiment of the present invention is better than that of the other three existing schemes. -5 The signal-to-noise ratio required by the hybrid sparse vector code is about 0.5 dB lower than that required by the constellation rotation sparse vector code. It can be seen that the hybrid sparse vector code proposed in the embodiment of the present invention is more reliable than the existing sparse vector code scheme and can be used for efficient and reliable short packet data transmission.

[0183] The embodiment of the present invention provides a short packet data transmission method based on hybrid sparse vector codes. By receiving a short packet data transmission request, a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map each bit of data information of the short packet data to a non-zero block index, a scattered non-zero element index and a non-zero value. After random expansion of the codebook, the data is transmitted in the time-frequency domain. In the decoding stage at the receiving end, prior information of block-structured sparsity is used for decoding, thereby improving the transmission efficiency of the short packet data, reducing the potential bit error rate, and ensuring the reliable transmission of the short packet data.

[0184] This embodiment also provides a short packet data transmission device based on a hybrid sparse vector code, which is used to implement the above-mentioned embodiments and preferred embodiments. Details already described will not be repeated here. As used below, the term "module" may refer to a combination of software and / or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, implementation using hardware, or a combination of software and hardware, is also possible and contemplated.

[0185] This embodiment provides a short packet data transmission device based on hybrid sparse vector code, which is applied to the sending end, such as Figure 8 Shown, including:

[0186] The first mapping module 801 is used to respond to the short packet data transmission signal sent by the receiving end, and to use a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map any bit data information in the short packet data to an initial sparse vector to obtain a first sparse vector and a second sparse vector, where the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector.

[0187] The expansion module 802 is configured to randomly expand the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector.

[0188] The transmission module 803 is used to convert the mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted into the time domain, obtain a mixed sparse vector signal corresponding to each bit of data information, and transmit it to the receiving end.

[0189] In some optional implementations, any bit of data information includes first bit of data information, second bit of data information, and third bit of data information, and the first mapping module 801 includes:

[0190] The first determining unit is configured to determine the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements.

[0191] The second determining unit is configured to determine the first bit of data information based on the length of the initial sparse vector and the non-zero block length.

[0192] The third determining unit is configured to determine the second bit of data information based on the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements.

[0193] The first mapping unit is configured to map the first bit of data information to the index of the non-zero block by adopting a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a first sparse vector.

[0194] The second mapping unit is configured to map the second bit of data information to the index of the scattered non-zero element by adopting a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a second sparse vector.

[0195] In some optional embodiments, the device further comprises:

[0196] The first determining module is configured to determine the sum of the non-zero block length and the number of scattered non-zero elements as the number of non-zero value elements.

[0197] The second determining module is configured to determine the third bit of data information based on the number of non-zero value elements.

[0198] The third determining module is configured to perform bit interleaving on the third bit data information to obtain a bit sequence corresponding to the third bit data information.

[0199] The modulation module is used to modulate the bit sequence corresponding to the third bit data information to obtain a symbol corresponding to the modulated third bit data information.

[0200] The second mapping module is used to map the symbol corresponding to the modulated third bit data information to a non-zero value by adopting a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value.

[0201] In some optional implementations, the expansion module 802 includes:

[0202] The fourth determining unit is configured to determine a first power corresponding to a non-zero block and a second power corresponding to scattered non-zero elements in the initial sparse vector.

[0203] The fifth determining unit is configured to obtain a mixed sparse vector based on the first power, the first sparse vector, the second power, the second sparse vector, and the codebook matrix.

[0204] This embodiment provides a short packet data transmission device based on hybrid sparse vector code, which is applied to the receiving end, such as Figure 9 Shown, including:

[0205] The sending module 901 is used to send a short packet data transmission signal to the sending end.

[0206] A receiving module 902 is configured to receive a mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted by the transmitter, wherein any mixed sparse vector signal is obtained by mapping the bit data information to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit of data information in the short packet data to obtain a first sparse vector and a second sparse vector, randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector, and converting the mixed sparse vector into the time domain, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector.

[0207] In some optional implementations, any bit of data information includes first bit of data information, second bit of data information, and third bit of data information, and the apparatus further includes:

[0208] The conversion module is used for converting any mixed sparse vector signal into the frequency domain to obtain a mixed sparse vector.

[0209] The first determining module is configured to determine a non-zero block length of the mixed sparse vector.

[0210] The second determination module is configured to divide the measurement matrix of the mixed sparse vector into a plurality of sub-matrices, and determine a first correlation value between each sub-matrix and the mixed sparse vector.

[0211] The third determination module is used to determine a maximum first correlation value from the first correlation values ​​corresponding to the multiple sub-matrices, and determine a first index corresponding to the maximum first correlation value in the mixed sparse vector.

[0212] The fifth determining module is configured to obtain a new measurement matrix of the mixed sparse vector based on the first index, the non-zero block length, and the measurement matrix of the mixed sparse vector.

[0213] The first recovery module is used to perform bit recovery based on the new measurement matrix of the mixed sparse vector and the first index to obtain first bit data information.

[0214] In some optional embodiments, the device further comprises:

[0215] The sixth determining module is used to determine the number of scattered non-zero elements in the mixed sparse vector, the first power corresponding to the non-zero blocks in the mixed sparse vector, and the first sparse vector corresponding to the first bit of data information.

[0216] The seventh determining module is configured to determine a second sparse vector corresponding to the scattered non-zero elements in the mixed sparse vector.

[0217] An eighth determining module is configured to obtain a third sparse vector based on the mixed sparse vector, the first power, the first index, and the first sparse vector.

[0218] The construction module is used to construct a sparse recovery problem based on the second sparse vector, the third sparse vector and the new measurement matrix of the mixed sparse vector.

[0219] The optimization module is used to optimize the sparse recovery problem and obtain the index set of scattered non-zero elements.

[0220] The second recovery module is used to perform bit recovery based on the index set of scattered non-zero elements and the second sparse vector to obtain second bit data information.

[0221] In some optional implementations, the optimization module includes:

[0222] The first determining unit is used to determine an initial residual and a preset number of iterations.

[0223] The second determining unit is configured to obtain, in a first iteration, at least one second correlation value based on a new measurement matrix of the mixed sparse vector and an initial residual.

[0224] The third determining unit is configured to determine a maximum second correlation value from the at least one second correlation value, and determine a second index corresponding to the maximum second correlation value in the second sparse vector.

[0225] The fourth determining unit is configured to determine a value of a scattered non-zero element corresponding to the second index based on the second index, the new measurement matrix of the mixed sparse vector, and the third sparse vector.

[0226] The updating unit is configured to repeat the above iterative process when the number of iterations is less than a preset number of iterations, and add the second index obtained in each iteration to the index set of scattered non-zero elements.

[0227] The iterative unit is used to repeat the above iterative process when the number of iterations is less than the preset number of iterations, and add the second index obtained in each iteration to the index set of scattered non-zero elements until the number of iterations reaches the preset number of iterations, thereby obtaining the index set of scattered non-zero elements.

[0228] In some optional embodiments, the device further comprises:

[0229] A ninth determination module is configured to obtain a non-zero value based on the measurement matrix of the first sparse vector, the measurement matrix of the third sparse vector, the first index, the second index, and the mixed sparse vector.

[0230] The third recovery module is used to perform symbol demodulation and deinterleaving on the non-zero value to obtain third bit data information.

[0231] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0232] The short packet data transmission device based on hybrid sparse vector code in this embodiment is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0233] The embodiment of the present invention also provides a computer device having the above Figure 8 and Figure 9 The short packet data transmission device based on hybrid sparse vector code is shown.

[0234] See also Figure 10 , Figure 10 is a structural diagram of a computer device provided by an optional embodiment of the present invention, such as Figure 10 As shown, the computer device includes: one or more processors 10, memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components utilize different buses to communicate with each other and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in the memory or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Equally, multiple computer devices can be connected, and each device provides part of the necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 10 A processor 10 is taken as an example.

[0235] The processor 10 may be a central processing unit, a network processor, or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit, a programmable logic device, or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic, or any combination thereof.

[0236] The memory 20 stores instructions that can be executed by at least one processor 10, so as to enable at least one processor 10 to execute the method shown in the above embodiment.

[0237] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created based on the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely located relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0238] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0239] The computer device further includes a communication interface 30 for the computer device to communicate with other devices or a communication network.

[0240] The embodiment of the present invention also provides a computer-readable storage medium. The above-mentioned method according to the embodiment of the present invention can be implemented in hardware, firmware, or implemented as a computer code that can be recorded in a storage medium, or implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and downloaded through a network and will be stored in a local storage medium, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state drive, etc.; further, the storage medium can also include a combination of the above-mentioned types of memory. It can be understood that a computer, a processor, a microprocessor controller or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor or hardware, the method shown in the above embodiment is implemented.

[0241] A portion of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the form in which the computer program instruction exists in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc. Accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium that can be accessed by the computer.

[0242] Although the embodiments of the present invention have been described with reference to the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations shall all fall within the scope defined by the present invention.

Claims

1. A short packet data transmission method based on hybrid sparse vector code, characterized in that: Applied to the sending end, the method includes: In response to a short packet data transmission signal sent by a receiving end, for any bit data information in the short packet data to be transmitted, a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the bit data information to an initial sparse vector to obtain a first sparse vector and a second sparse vector, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector; Randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector; The mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted is converted into the time domain to obtain a mixed sparse vector signal corresponding to each bit of data information, and the mixed sparse vector signal is transmitted to the receiving end.

2. The method according to claim 1, characterized in that Any bit data information includes first bit data information, second bit data information, and third bit data information. In response to the short packet data transmission signal sent by the receiving end, for any bit data information in the short packet data to be transmitted, a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the bit data information to an initial sparse vector to obtain a first sparse vector and a second sparse vector, including: Determining the length, non-zero block length, and number of scattered non-zero elements of the initial sparse vector; Determining the first bit of data information based on the length of the initial sparse vector and a non-zero block length; Determining the second bit of data information based on the length of the initial sparse vector, the non-zero block length, and the number of scattered non-zero elements; Adopting the non-zero block-scattered non-zero element-non-zero value hybrid sparse mapping mode, mapping the first bit data information to the index of the non-zero block to obtain the first sparse vector; The second bit data information is mapped to the index of the scattered non-zero element by adopting the mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain the second sparse vector.

3. The method according to claim 2, characterized in that The method further comprises: Determine the sum of the non-zero block length and the number of scattered non-zero elements as the number of non-zero elements; determining the third bit of data information based on the number of non-zero elements; Performing bit interleaving on the third bit data information to obtain a bit sequence corresponding to the third bit data information; Modulating a bit sequence corresponding to the third bit of data information to obtain a symbol corresponding to the modulated third bit of data information; The mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the symbol corresponding to the modulated third bit data information to a non-zero value.

4. The method according to claim 1, wherein The randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector includes: Determine a first power corresponding to a non-zero block and a second power corresponding to scattered non-zero elements in the initial sparse vector; The mixed sparse vector is obtained based on the first power, the first sparse vector, the second power, the second sparse vector, and a codebook matrix.

5. A short packet data transmission method based on hybrid sparse vector code, characterized in that: Applied to a receiving end, the method includes: Sending a short packet data transmission signal to the sending end; A mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted transmitted by the transmitter is received, and any mixed sparse vector signal is mapped to an initial sparse vector by using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit of data information in the short packet data to be transmitted, to obtain a first sparse vector and a second sparse vector, and the first sparse vector and the second sparse vector are randomly expanded using different powers to obtain a mixed sparse vector, and the mixed sparse vector is converted into a time domain, where the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector.

6. The method according to claim 5, characterized in that Any bit of data information includes first bit of data information, second bit of data information, and third bit of data information, and the method further includes: For any mixed sparse vector signal, convert the mixed sparse vector signal into a frequency domain to obtain a mixed sparse vector; Determining a non-zero block length of the mixed sparse vector; Dividing the measurement matrix of the mixed sparse vector into a plurality of sub-matrices, and determining a first correlation value between each sub-matrix and the mixed sparse vector; Determine a maximum first correlation value from the first correlation values ​​corresponding to the multiple sub-matrices, and determine a first index corresponding to the maximum first correlation value in the mixed sparse vector; Obtaining a new measurement matrix of the mixed sparse vector based on the first index, the non-zero block length, and the measurement matrix of the mixed sparse vector; Based on the new measurement matrix of the mixed sparse vector and the first index, bit recovery is performed to obtain the first bit data information.

7. The method according to claim 6, characterized in that The method further comprises: Determining the number of scattered non-zero elements of the mixed sparse vector, a first power corresponding to a non-zero block in the mixed sparse vector, and a first sparse vector corresponding to the first bit of data information; Determine a second sparse vector corresponding to the scattered non-zero elements in the mixed sparse vector that are located at the number of scattered non-zero elements; Obtaining a third sparse vector based on the mixed sparse vector, the first power, the first index, and the first sparse vector; constructing a sparse recovery problem based on the second sparse vector, the third sparse vector, and a new measurement matrix of the mixed sparse vector; Optimizing the sparse recovery problem to obtain an index set of scattered non-zero elements; Based on the index set of the scattered non-zero elements and the second sparse vector, bit recovery is performed to obtain the second bit data information.

8. The method according to claim 7, characterized in that The optimizing the sparse recovery problem to obtain an index set of scattered non-zero elements includes: Determine the initial residual and the preset number of iterations; In a first iteration, obtaining at least one second correlation value based on the new measurement matrix of the mixed sparse vector and the initial residual; Determine a maximum second correlation value from the at least one second correlation value, and determine a second index corresponding to the maximum second correlation value in the second sparse vector; Determining, based on the second index, the new measurement matrix of the mixed sparse vector, and the third sparse vector, a value of a scattered non-zero element corresponding to the second index; Based on the third sparse vector, the second index, the new measurement matrix of the mixed sparse vector, and the values ​​of the scattered non-zero elements corresponding to the second index, the initial residual is updated to complete the first iteration; When the number of iterations is less than the preset number of iterations, the above iterative process is repeated, and the second index obtained in each iteration is added to the index set of the scattered non-zero elements until the number of iterations reaches the preset number of iterations, thereby obtaining the index set of the scattered non-zero elements.

9. The method according to claim 8, characterized in that The method further comprises: Obtaining a non-zero value based on the measurement matrix of the first sparse vector, the measurement matrix of the third sparse vector, the first index, the second index, and the mixed sparse vector; Perform symbol demodulation and deinterleaving on the non-zero value to obtain the third bit data information.

10. A short packet data transmission system based on hybrid sparse vector code, characterized in that: The system includes a transmitting end and a receiving end, and performs the following steps: The receiving end sends a short packet data transmission signal to the sending end; The transmitting end, in response to the short packet data transmission signal sent by the receiving end, maps any bit data information in the short packet data to be transmitted to an initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to obtain a first sparse vector and a second sparse vector, wherein the first sparse vector is obtained based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector is obtained based on the bit data information mapped to the scattered non-zero elements in the initial sparse vector; The transmitting end randomly expands the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector; The transmitting end converts the mixed sparse vector corresponding to each bit of data information in the short packet data to be transmitted into the time domain, obtains a mixed sparse vector signal corresponding to each bit of data information, and transmits the mixed sparse vector signal to the receiving end; The receiving end receives a mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted transmitted by the sending end.

Images