Short packet data transmission method and system based on mixed sparse vector codes

Abstract

The invention relates to the technical field of wireless communication, and discloses a short packet data transmission method and system based on a mixed sparse vector code, applied to a sending end, and the method comprises the following steps: responding to a short packet data transmission signal sent by a receiving end, and carrying out data transmission on any bit of data information; mapping the bit data information to the initial sparse vector by adopting a non-zero block-scattered non-zero element-non-zero value mixed sparse mapping mode to obtain a first sparse vector and a second sparse vector; performing random expansion on the first sparse vector and the second sparse vector by adopting different powers to obtain a mixed sparse vector; and converting the mixed sparse vector to a time domain to obtain a corresponding mixed sparse vector signal, and transmitting the mixed sparse vector signal to a receiving end. According to the method, the non-zero block index, the scattered non-zero element index and the non-zero value are mapped by adopting the non-zero block-scattered non-zero element-non-zero value mixed sparse mapping mode, so that the transmission efficiency of the short packet data is improved, the potential error rate is reduced, and the reliable transmission of the short packet data is ensured.

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-ground network, digital twins, immersive virtual reality, etc. These application scenarios have extremely high requirements for data transmission reliability and transmission latency. Since these application scenarios often involve frequent data transmission, such as instant status updates and control instructions, the traditional long data packet transmission mechanism may not meet the low latency requirements. Short packet data transmission focuses on fast and efficient processing and transmission of small data packets, reducing transmission latency, and ensuring instant interaction of information, thereby supporting real-time interaction and user experience in advanced application scenarios.

[0003] However, the complex dynamic communication environment has brought great challenges to the existing short packet data transmission based on sparse vector codes. Taking the Internet of Vehicles scenario as an example, real-time information interaction is required between vehicles, between vehicles and roadside units, and between vehicles and base stations. Vehicles need to upload the collected sensor data in a timely manner, and base stations need to accurately transmit control commands to vehicles, which places extremely high requirements on the reliability and transmission delay of short packet data transmission. However, in the Internet of Vehicles communication scenario, due to the presence of dense buildings, trees, mountains, etc., the signal propagation path is rich, and the wireless channel exhibits frequency selective fading characteristics. In addition, the rapid relative movement between vehicles and base stations causes the wireless channel to exhibit time selective fading characteristics. The dual time-frequency selectivity of the wireless channel will introduce serious inter-carrier interference during the data transmission process. Therefore, how to perform reliable short packet data transmission is a problem that needs to be solved.

[0004] At present, the existing short packet transmission method based on sparse vector coding (SVC) maps the 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-frequency for transmission. At the receiving end, decoding can be achieved by simply detecting the index position of the scattered non-zero elements of 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 a hybrid sparse vector code to solve the problem that the existing short packet data transmission method based on sparse vector code 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, 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 element 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 code provided in the embodiment of the present invention receives a short packet data transmission request, adopts a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value, maps each bit data information of the short packet data to a non-zero block index, a scattered non-zero element index and a non-zero value, and transmits it in the time-frequency domain after random expansion of the codebook. Compared with bit mapping using only scattered non-zero elements, the transmission efficiency of the short packet data is improved, while the potential bit error rate is reduced, and the reliable transmission of the short packet data is guaranteed.

[0011] In an optional implementation manner, any bit data information includes first bit data information, second bit data information and third bit data information, and 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, so as 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 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;

[0015] A mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map 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 hybrid sparse vector code provided by the embodiment of the present invention provides a basic framework for subsequent mapping by clarifying the length of the initial sparse vector, the non-zero block length and the number of scattered non-zero elements. 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. The coding efficiency is improved by finely dividing the bit data information and adopting different mapping rules.

[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] bit-interleaving 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 data information after modulation to a non-zero value.

[0024] The short packet data transmission method based on hybrid sparse vector code provided by the 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 to obtain the corresponding sparse vector, 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 an 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 the hybrid sparse vector code provided by the embodiment of the present invention determines the powers corresponding to the non-zero blocks and scattered non-zero elements in the initial sparse vector, and generates a hybrid sparse vector by randomly expanding the codebook matrix. The codebook matrix can help to reorganize and expand the original sparse information according to the established power allocation, and the random expansion helps to resist channel fading and improve the success rate of decoding at the receiving end. In addition, the coding reliability can be improved by using different powers for random expansion.

[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 transmitting end is obtained. 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, so as to obtain 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 to obtain the first sparse vector 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 element in the initial sparse vector.

[0032] The short packet data transmission method based on hybrid sparse vector code provided in the embodiment of the present invention starts the transmission of short packet data by sending a short packet data transmission signal to the transmitting end, and receives a reliable hybrid sparse vector signal obtained after the transmitting end encodes the short packet data. The short packet data can be obtained by accurately decoding the hybrid sparse vector signal.

[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, convert the mixed sparse vector signal into the frequency domain to obtain a mixed sparse vector;

[0035] Determine a non-zero block length of a 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 code provided in the embodiment of the present invention can achieve accurate decoding to obtain accurate first bit data information by utilizing prior information such as block structured sparsity and non-zero blocks generated during the encoding process, and preferentially recovering the index of non-zero blocks.

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

[0042] Determine the number of scattered non-zero elements of 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;

[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 second sparse vector, the third sparse vector and the new measurement matrix of 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 the non-zero blocks and using the block structured sparsity and prior information such as the number of scattered non-zero elements generated in the encoding process to restore the index of the scattered non-zero elements.

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

[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 a new measurement matrix of the mixed sparse vector and the initial residual;

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

[0053] Determine 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;

[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 iteration 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, and the index set of scattered non-zero elements is obtained.

[0056] The short packet data transmission method based on hybrid sparse vector code provided in 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 code provided by the embodiment of the present invention obtains sparse vectors corresponding to non-zero values ​​on the basis of obtaining sparse vectors corresponding to non-zero blocks and scattered non-zero elements respectively, obtains accurate third bit data information through symbol demodulation and deinterleaving, and improves 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 by adopting 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 element 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 is used for responding 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, adopting a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map the bit data information to an initial sparse vector, so as 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 element in the initial sparse vector;

[0069] An expansion module, used for randomly expanding 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 element 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 being 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, wherein 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 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. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0078] 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;

[0079] 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;

[0080] Figure 3 is an interaction flow chart of 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 of comparing block error rate performances of various sparse vector codes according to an embodiment of the present invention;

[0085] Figure 8 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] Fig. 9 is a structural block diagram of another short packet data transmission device based on hybrid sparse vector code according to an embodiment of the present invention;

[0087] Fig.10 It is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0088] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the 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 creative work are 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, mapping bit data information to a small number of non-zero indexes of a sparse vector, and randomly expanding the sparse vector to a low-dimensional sequence through a non-orthogonal codebook, and finally mapping 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 may 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 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 hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the bit data information to the initial sparse vector, and obtain a first sparse vector and a second sparse vector, wherein the first sparse vector is obtained based on the bit data information of the non-zero block mapped to the initial sparse vector, and the second sparse vector is obtained based on the bit data information of the scattered non-zero element mapped to the initial sparse vector. Specifically, taking the Internet of Vehicles scenario as an example, the short packet data to be transmitted can be a control command of the vehicle to collect sensor data or 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 a vehicle-mounted communication device, and the receiving end is generally a base station. If the short packet data to be transmitted is a control instruction, the transmitting end is generally a base station, and the receiving end is generally a vehicle-mounted communication device. The hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value refers to mapping any bit data information to non-zero blocks, scattered non-zero elements and non-zero values ​​respectively. Among them, non-zero blocks refer to continuous non-zero elements, which are the main part of the bit data information; scattered non-zero elements refer to independent non-zero elements, which are scattered in space; non-zero values ​​include non-zero blocks and scattered non-zero elements, which are directly related to the effective bit data information actually carried. By using a mixed sparse mapping mode of non-zero blocks-scattered non-zero elements-non-zero values ​​for bit mapping in the encoding process, the reliability of the encoding is improved compared to using only scattered non-zero elements for bit mapping.

[0093] Step S102, randomly expanding the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector. Specifically, the encoding process includes the bit mapping process in the above step S101 and the random expansion process in step S102, and the non-zero elements in the bit data information are randomly expanded in the form of a mixture of block structure and scattered structure, rather than randomly expanding the non-zero elements one by one, thereby providing additional block structure information, which can provide support for the subsequent decoding process, and at the same time, using different powers for random expansion improves the coding 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 the 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 a wireless channel, thereby efficiently and reliably completing the transmission of the short packet data. Optionally, the mixed sparse vector signal can be represented 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 value 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 code provided in the embodiment of the present invention receives a short packet data transmission request, adopts a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value, maps each bit data information of the short packet data to a non-zero block index, a scattered non-zero element index and a non-zero value, and transmits it in the time-frequency domain after random expansion of the codebook. Compared with bit mapping using only scattered non-zero elements, the transmission efficiency of the short packet data is improved, while 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, a short packet data transmission signal is sent 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, receiving a mixed sparse vector signal corresponding to each bit of data information in the short packet data to be transmitted by the transmitting end, any mixed sparse vector signal is obtained 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, mapping the bit data information to the initial sparse vector, obtaining a first sparse vector and a second sparse vector, randomly extending the first sparse vector and the second sparse vector using different powers to obtain a mixed sparse vector, converting the mixed sparse vector to the time domain to obtain the first sparse vector based on the bit data information mapped to the non-zero block in the initial sparse vector, and the second sparse vector based on the bit data information mapped to the scattered non-zero element in the initial sparse vector. Specifically, the mixed sparse vector obtained by the transmitting end using the mixed sparse mapping mode and random extension contains a priori information of the block structure, which can improve the decoding reliability of the receiving end.

[0101] The short packet data transmission method based on hybrid sparse vector code provided in the embodiment of the present invention starts the transmission of short packet data by sending a short packet data transmission signal to the transmitting end, and receives a reliable hybrid sparse vector signal obtained after the transmitting end encodes the short packet data. The short packet data can be obtained by accurately decoding the hybrid sparse vector signal.

[0102] In this embodiment, 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. Figure 3 is an interaction flow chart of 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, such as 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 uses a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit data information in the short packet data to be transmitted, and maps the bit data information to the 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; 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 to 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 code includes a transmitting end and a receiving end, and 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] Step S302: 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. 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] 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 continuous non-zero elements. The number of scattered non-zero elements represents the number of positions in the initial sparse vector for independently placing non-zero elements.

[0108] 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] Among them, 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 rounding down operation; N represents the length of the initial sparse vector; L represents the non-zero block length of the initial sparse vector.

[0113] Step S3023: The transmitting end determines 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. Specifically, the second bit of 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 the rounding down 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 of the initial sparse vector.

[0116] Step S3024: The transmitting end uses a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map the first bit of data information to the index of the non-zero block to obtain 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 when performing bit mapping. Through bit mapping, the first sparse vector corresponding to the first bit of data information is obtained.

[0117] Step S3025, the transmitting end adopts a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map the second bit data information to the index of the scattered non-zero element to obtain 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 when performing 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] 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] 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] Step S305: The transmitting end bit-interleaves 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] 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, that is, 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, that is, the amplitude of the bit sequence is modulated to carry the bit data information.

[0125] In step S307, the transmitting end adopts a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value to map the symbol corresponding to the modulated third bit data information to a non-zero value. Specifically, by bit-mapping the phase symbol or the amplitude symbol, a third sparse vector corresponding to the third bit data information is obtained, and the third sparse vector includes a phase symbol and a phase symbol, or an amplitude symbol and an index corresponding to the amplitude symbol, etc. By finely dividing the bit data information and adopting different mapping rules, the 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, so that the overall coding is more efficient, and more short packet data can be transmitted under the same spectrum resources, or less spectrum resources are occupied when the same amount of short packet data is transmitted, thereby improving the spectrum utilization. Optionally, the spectrum utilization obtained by using the hybrid sparse vector code can be determined by the following formula (6), and the following formula (8) is the spectrum utilization obtained by using the 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 less 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 It 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 of 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 represents the block length actually used for data transmission when sparse vector code is used 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 represents 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 of the sparse vector when the 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: a first bit data information, a second bit data information and a third bit data information. The first bit data information is subjected to non-zero block mapping, and is 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, and is 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. Among them, 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] Step S3081, the transmitting end determines the first power corresponding to the non-zero block in the initial sparse vector and the second power corresponding to the scattered non-zero element. Specifically, since the sparse vector after bit mapping contains two types of non-zero blocks and scattered non-zero elements, in order to achieve the best coding performance, different powers are allocated to the non-zero blocks and the scattered non-zero elements, that is, the first power and the second power. It should be noted that the sum of the first power and the second power is 1.

[0137] 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 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 the scattered non-zero element is 1, Figure 5 It can be seen that under different signal-to-noise ratios, the optimal power allocation rate of the non-zero block of the hybrid sparse vector code is about 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 value must be guaranteed to be 1.

[0142] 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 a 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] Step S311: The receiving end converts the mixed sparse vector signal into the frequency domain for any mixed sparse vector signal to obtain a mixed sparse vector, and any bit data information includes first bit data information, second bit data information and third bit data information. Specifically, in order to obtain specific bit data information contained in the mixed sparse vector signal, the mixed sparse vector signal can be transformed into the frequency domain by inverse discrete Fourier transform after removing the cyclic prefix to obtain a mixed sparse vector.

[0145] Step S312, the receiving end determines the non-zero block length of the mixed sparse vector. Specifically, since the mixed sparse vector contains two types of non-zero blocks and scattered non-zero elements, in order to efficiently decode, the diluted vectors corresponding to the non-zero blocks and the scattered non-zero elements are decoded respectively. Optionally, the first sparse vector corresponding to the non-zero block is decoded first.

[0146] 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 the 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 submatrix; v d represents the first correlation value between the d-th submatrix 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] Step S315, the receiving end obtains 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. Specifically, all elements in the (B-1)L+1th column to the BLth column of the measurement matrix of the mixed sparse vector are changed to zero, and the zeroed matrix is ​​used as the new measurement matrix of 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 eliminated from the new measurement matrix, thereby avoiding the erroneous identification of the index of the non-zero block in the subsequent identification of scattered non-zero elements.

[0153] 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 data information. Specifically, the bit recovery method corresponding to the bit mapping is used to recover the first bit data information mapped to the non-zero block. Optionally, the bit recovery is a prior art and will not be described in detail here.

[0154] Step S317, the receiving end determines the number of scattered non-zero elements of the mixed sparse vector, the first power corresponding to the non-zero block 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 work.

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

[0156] 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 of the non-zero block, the first sparse vector corresponding to the non-zero block can be removed from the mixed sparse vector by the following formula (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] 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, a sparse recovery problem as shown in equation (14) is constructed, 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 an initial residual and a 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] 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 formula (15), focusing on the corresponding relationship between the initial residual and the new measurement matrix of the mixed sparse vector, so as to evaluate the matching degree.

[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] Step S3213: The receiving end determines the maximum second correlation value from at least one second correlation value, and determines the second index corresponding to the maximum second correlation value in the second sparse vector. Specifically, the position where the second maximum correlation value appears is most likely to have scattered non-zero elements, so the second index used to identify the position can be determined to provide support for subsequent bit recovery.

[0169] 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 by 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] 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 value of the scattered non-zero element corresponding to the second index, and completes the first iteration. Specifically, the initial residual is updated by the following formula (17), and the following formula (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, when the number of iterations is less than the preset number of iterations, repeat the above iteration process, 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, and obtain the index set of scattered non-zero elements. Specifically, after each iteration is completed, determine whether the number of iterations is greater than the preset number of iterations, if not greater than the preset number of iterations, continue to repeat the above steps S3212 to S3215 for iteration, and add the second index obtained in each iteration to the index set of scattered non-zero elements, if the preset number of iterations is reached, stop the iteration, and obtain the index set of scattered non-zero elements.

[0176] 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 the second bit data information. Specifically, the bit recovery method corresponding to the bit mapping is used to recover the second bit data information mapped to the scattered non-zero elements. Optionally, the bit recovery is a prior art and will not be described in detail here.

[0177] 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 formula (18).

[0178]

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

[0180] 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 is a schematic diagram of a bit recovery according to an embodiment of the present invention, such as Figure 6As shown, firstly, the mixed sparse vector is identified by the first index to obtain the first bit data information mapped to the non-zero block during encoding. Then, the sparse vector corresponding to the non-zero block is eliminated, and then the second index is identified to obtain the second bit data information mapped to the scattered non-zero elements during encoding. Finally, the non-zero value is obtained by non-zero value estimation, and the non-zero value is demodulated and bit deinterleaved to obtain the third bit data information mapped to the non-zero value during encoding.

[0182] In some optional embodiments, Figure 7 FIG. 1 is a schematic diagram of comparing block error rate performances of various sparse vector codes according to an embodiment of the present invention. Figure 7 As shown, when using a variety of sparse vector codes 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 of the constellation rotation sparse vector code. It can be seen that the hybrid sparse vector code proposed in the embodiment of the present invention has higher reliability than the existing sparse vector code scheme and can be used for efficient and reliable short packet data transmission.

[0183] The short packet data transmission method based on hybrid sparse vector code provided by the embodiment of the present invention receives a short packet data transmission request, adopts a hybrid sparse mapping mode of non-zero block-scattered non-zero element-non-zero value, maps each bit data information of the short packet data to a non-zero block index, a scattered non-zero element index and a non-zero value, transmits it in the time-frequency domain after random expansion of the codebook, and uses a priori information of block structured sparsity for decoding in the decoding stage of the receiving end, 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] In this embodiment, a short packet data transmission device based on a hybrid sparse vector code is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware for a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0185] This embodiment provides a short packet data transmission device based on a hybrid sparse vector code, which is applied to a transmitting end, such as Figure 8 As 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 treat any bit data information in the transmitted short packet data by adopting a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value, to map the bit data information to the initial sparse vector, so as 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 element in the initial sparse vector.

[0187] The expansion module 802 is used 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 used 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 used 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 used 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 used 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 used to map the second bit 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 determination module is used 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 determination module is used to determine the third bit of data information based on the number of non-zero value elements.

[0198] The third determination module is used 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 used to determine the first power corresponding to the non-zero blocks in the initial sparse vector and the second power corresponding to the scattered non-zero elements.

[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 a hybrid sparse vector code, which is applied to a receiving end, such as Fig. 9 As shown, including:

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

[0206] The receiving module 902 is used to receive a mixed sparse vector signal corresponding to each bit data information in the short packet data to be transmitted by the transmitting end. Any mixed sparse vector signal is obtained by mapping the bit data information to the initial sparse vector using a mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value for any bit data information in the short packet data to be transmitted, so as to obtain 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, and the mixed sparse vector is converted into the time domain. 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 device further includes:

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

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

[0210] The second determination module is used to divide the measurement matrix of the mixed sparse vector into multiple 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 determination module is used 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 determination module is used to determine the number of scattered non-zero elements of 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 determination module is used to determine the 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.

[0217] An eighth determination 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 a 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 determination unit is used to obtain at least one second correlation value based on the new measurement matrix of the mixed sparse vector and the initial residual in the first iteration.

[0224] The third determining unit is configured to determine a maximum second correlation value from 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 used to determine 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.

[0226] The updating 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.

[0227] The iteration unit is used to repeat the above iteration 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 to obtain the index set of scattered non-zero elements.

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

[0229] The ninth determination module is used 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 Fig. 9 The short packet data transmission device based on hybrid sparse vector code is shown.

[0234] See also Fig.10 , Fig.10 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Fig.10 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, 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 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. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Fig.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 a dedicated 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 executable by at least one processor 10, so that at least one processor 10 executes 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, an application required for at least one function; the data storage area may store data created according to 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 arranged 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 comprises 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 method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, 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 hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. 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 part 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 existence of the computer program instruction in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc., and 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 accessible to the computer.

[0242] Although the embodiments of the present invention have been described in conjunction with 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 are all 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 element 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, and 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; Determine 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 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 the first sparse vector; The mixed sparse mapping mode of non-zero block-scattered non-zero element-non-zero value is adopted to map the second bit data information to the index of the scattered non-zero element 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; Perform 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 third bit data information after modulation to a non-zero value.

4. The method according to claim 1, characterized in that: The step of 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 a scattered non-zero element 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 the receiving end, the method comprises: 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 adopting 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, so as to obtain a first sparse vector and a second sparse vector, and the first sparse vector and the second sparse vector are randomly expanded with different powers to obtain a mixed sparse vector, and 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.

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: Determine the number of scattered non-zero elements of 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; 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 a 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; Determine 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; 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 iteration 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; The non-zero value is symbol-demodulated and deinterleaved to obtain the third bit of 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 by adopting 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 element 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 it 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