Signal sending method, signal receiving method, device and storage medium

Abstract

The embodiment of the invention provides a signal sending method, a signal receiving method, user equipment, network equipment and a computer readable storage medium, and the method comprises the steps: dividing user data into packet header data and packet body data, carrying out the first coding processing of the packet header data, and obtaining a packet header coding sequence; and performing second coding processing on the packet body data to obtain a packet body coding sequence, and mapping the packet header coding sequence and the packet body coding sequence into a multi-channel carrier signal through orthogonal frequency division multiplexing, so that the packet header coding sequence and the packet body coding sequence coded by a plurality of users are mapped into different frequency domains of the multi-channel carrier signal. Data sending and receiving of a plurality of users in a user identification-free random access scene are realized, a base station does not need to distribute a special communication line based on a scheduling-free communication protocol, access authorization does not need to be completed in advance, signaling overhead is saved, and communication time delay can be reduced.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communication technology, and in particular to a label stack processing method, an information processing method, and a message processing method. Background Art

[0002] Large-scale machine-type device communication has become one of the key application scenarios of the fifth generation of wireless communication (5G), which aims to provide massive connections for emerging short packet data communication and sporadic traffic communication services. As a promising transmission protocol, scheduling-free random access has attracted more and more attention due to its energy saving and latency reduction characteristics. However, due to the massive number of connections, it is difficult to assign different encoders or pilots to a large number of users.

[0003] In the related art, through random access without user identification, a shared public code book can serve a large number of non-cooperative users without allocating a unique pilot to each user in advance. Most signal detection methods for random access without user identification consider the synchronization situation, but due to the different transmission distances between users and the lack of precise frequency synchronization, the received signal may be affected by time and frequency offsets, resulting in phase rotation in the frequency domain and time domain, respectively. How to provide highly reliable and efficient random access services for users without identification is an issue that needs to be discussed and solved urgently. Summary of the invention

[0004] The embodiments of the present application provide a signal sending method, a signal receiving method, a user device, a network device and a computer-readable storage medium, aiming to provide a highly reliable and efficient random access service for unidentified users.

[0005] In a first aspect, an embodiment of the present application provides a signal sending method, which is applied to a user device, and the method includes: dividing user data into packet header data and packet body data; performing a first encoding process on the packet header data to obtain a packet header coding sequence; performing a second encoding process on the packet body data to obtain a packet body coding sequence; mapping the packet header coding sequence and the packet body coding sequence into a multi-channel carrier signal through orthogonal frequency division multiplexing, and sending the multi-channel carrier signal.

[0006] In a second aspect, an embodiment of the present application provides a signal receiving method, which is applied to a network device, and the method includes: receiving multi-channel carrier signals; demodulating the multi-channel carrier signals to obtain baseband data; dividing the baseband data into packet header received data and packet body received data according to a receiving timing; performing a first decoding process on the packet header received data to obtain packet header decoded data; performing a second decoding process on the packet body received data to obtain packet body decoded data; and obtaining user data based on the packet header decoded data and the packet body decoded data.

[0007] In a third aspect, an embodiment of the present application provides a user device, comprising: one or more processors; a memory, on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement: the signal sending method as described in the first aspect.

[0008] In a fourth aspect, an embodiment of the present application provides a network device, comprising: one or more processors; a memory, on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement: the signal receiving method as described in the second aspect.

[0009] In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a program executable by a processor, and when the program executable by the processor is executed by the processor, it is used to implement: the signal sending method as described in the first aspect or the signal receiving method as described in the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 A schematic diagram of a communication system provided in one embodiment of the present application;

[0011] Figure 2 A schematic diagram of the structure of a multi-channel transmitter provided in one embodiment of the present application;

[0012] Figure 3 A schematic diagram of the structure of a receiver provided in one embodiment of the present application;

[0013] Figure 4 A flowchart of a signal sending method provided in one embodiment of the present application;

[0014] Figure 5 A flowchart of performing a first encoding process on packet header data provided by an embodiment of the present application;

[0015] Figure 6 A schematic diagram of a redundant encoding process provided for an example of the present application;

[0016] Figure 7 A flowchart of performing a second encoding process on the package body data provided in an embodiment of the present application;

[0017] Figure 8 A flowchart of a signal receiving method provided in one embodiment of the present application;

[0018] Fig. 9 A schematic diagram of a sequence splicing process provided as an example of the present application;

[0019] Fig.10 A decoding flow chart of an outer tree decoder provided as an example of the present application;

[0020] Fig.11 A schematic diagram of a process for performing path iteration based on a multi-stage graph model provided as an example of this application;

[0021] Fig.12 A schematic diagram of the structure of a communication device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0022] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0023] It should be noted that, although the functional modules are divided in the device schematic diagram and the logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart. The terms "first", "second", etc. in the specification, claims and the above drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0024] In the description of the embodiments of the present application, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in the embodiments of the present application based on the specific content of the technical solution.

[0025] In the embodiments of the present application, the words "further", "exemplarily" or "optionally" are used to indicate examples, illustrations or descriptions, and should not be interpreted as being more preferred or more advantageous than other embodiments or designs. The use of the words "further", "exemplarily" or "optionally" is intended to present related concepts in a specific way.

[0026] The technical solutions of the embodiments of the present application can be applied to various communication systems, such as: Wideband Code Division Multiple Access (WCDMA), Evolved Universal Terrestrial Radio Access Network (E UTRAN), Next Generation Radio Access Network (NG RAN), Long Term Evolution (LTE), Worldwide Interoperability For Microwave Access (WiMAX), Fifth Generation (5G), such as New Radio Access Technology (NR), and future communication systems, such as 6G systems.

[0027] The technical solution of the embodiment of the present application can be applied to various communication technologies, such as microwave communication, optical wave communication, millimeter wave communication, etc. The embodiment of the present application does not limit the specific technology and specific device form used.

[0028] In the related art, large-scale machine-to-machine communication is to provide large-scale machine-to-machine connections for millions of devices in smartphones and smart home and smart city use cases. It is one of the key application scenarios of the fifth generation of wireless communication (5G). Its purpose is to provide massive connections for emerging short packet data communications and sporadic traffic communication services. As a promising transmission protocol, scheduling-free random access has attracted more and more attention due to its energy saving and latency reduction characteristics. However, due to the massive connections, it is very difficult to assign different encoders or pilots to a large number of users in the implementation process. In order to alleviate this problem, user-identified random access has become a promising and practical communication paradigm. This communication architecture serves a large number of non-cooperative users through a shared public code book without the need to assign a unique pilot to each user in advance. In this way, the receiving end only needs to recover the user message set without identifying the user identity corresponding to these messages, thereby improving communication efficiency and saving resources.

[0029] In the related art, signal detection methods for random access without user identification mostly consider the synchronous case. In fact, due to the different transmission distances between users and the lack of precise frequency synchronization, the received signal may be affected by time and frequency offsets, resulting in phase rotation in the frequency domain and time domain, respectively. In some asynchronous scenarios, asynchronous scenarios with only time offset or frequency offset are usually studied. However, as a time-frequency offset coupling is an inevitable situation, receivers designed only for asynchronous scenarios with time offset or frequency offset cannot be applied to time-frequency offset coupling systems.

[0030] In addition, codeword conflicts between users are the performance bottleneck of random access without user identification. In order to solve this problem, non-orthogonal codebooks are usually used to expand the codebook space. However, too large a codebook space will lead to excessive application complexity, and there will still be residual user conflicts that cannot be resolved.

[0031] Therefore, how to effectively solve the user codeword conflict problem and provide a highly reliable and efficient random access solution for unidentified users is an issue that needs to be discussed and solved urgently.

[0032] To solve the above problems, the embodiments of the present application provide a signal sending method, a signal receiving method, a user device, a network device and a computer-readable storage medium, by dividing user data into header data and body data, and performing a first encoding process on the header data to obtain a header coding sequence, and performing a second encoding process on the body data to obtain a body coding sequence, and mapping the header coding sequence and the body coding sequence to a multi-channel carrier signal through orthogonal frequency division multiplexing, so that the header coding sequences and the body coding sequences encoded by multiple users are mapped to different frequency domains of the multi-channel carrier signal, thereby realizing data sending and receiving for multiple users in a random access scenario without user identification, based on a scheduling-free communication protocol, without the need for a base station to allocate a dedicated communication line, without the need to complete access authorization in advance, saving signaling overhead, and being able to reduce communication latency. The embodiment of the present application also uses a tree editor to segment and redundantly encode the packet header data to obtain multiple first packet header coding sequences, and maps and processes each first packet header coding sequence through the codewords in the preset public codebook to form a packet header coding sequence. Based on the random access scheme without user identification, the public codebook is used, and there is no need to allocate a unique pilot to each terminal device in advance. It can overcome the huge resource overhead caused by the use of independent codebooks when a large number of users access, and save pilot resource configuration. The embodiment of the present application confirms active codewords and corresponding equivalent channels from the received data through the public codebook, and uses active codewords and a check matrix to obtain multiple decoding paths. A multi-stage graph model is constructed through multiple decoding paths and equivalent channels. Path iteration is performed based on the multi-stage graph model to obtain packet header decoding data and perform channel reconstruction. It can effectively compensate for the signal phase rotation caused by time deviation and frequency deviation in asynchronous random access without user identification, overcome the performance loss caused by user codeword conflicts, and provide a highly reliable and efficient access scheme.

[0033] The embodiments of the present application are further described below in conjunction with the accompanying drawings.

[0034] Figure 1 is a schematic diagram of a communication system provided by an embodiment of the present application, such as Figure 1 As shown, in this embodiment, exemplarily, the communication system includes a base station 110 and a plurality of terminals 120 , and the base station 110 is communicatively connected to each of the terminals 120 .

[0035] It is understandable that the number of devices and the communication relationship between devices in the communication system of this embodiment can be expanded and changed according to actual needs, and are not specifically limited here.

[0036] The base station 110 in the embodiment of the present application may be an evolved NodeB (eNB), a transmission point (TRP), a next generation NodeB (gNB) in an NR system, a base station in other future mobile communication systems, or an access node in a wireless fidelity (WiFi) system, etc. The embodiment of the present application does not limit the specific technology and specific device form adopted by the network device.

[0037] The terminal 120 of the embodiment of the present application is an entity for receiving or transmitting signals on the user side, such as a mobile phone. The terminal device may also be referred to as a terminal device (terminal), a user equipment (User Equipment, UE), a mobile station (Mobile Station, MS), a mobile terminal device (Mobile Terminal, MT), etc. The terminal device may be a car with communication function, a smart car, a mobile phone (mobile phone), a wearable device, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality (Virtual Reality, VR) device, an augmented reality (Augmented Reality, AR) device, a communication device in industrial control (Industrial Control), a communication device in self-driving, a communication device in remote medical surgery, a communication device in smart grid (Smart Grid), a communication device in transportation safety (Transportation Safety), a communication device in smart city (Smart City), a communication device in smart home (Smart Home), etc. The embodiment of the present application does not limit the specific technology and specific device form adopted by the device.

[0038] The following is an example to illustrate the signal sending method and signal receiving method of the embodiment of the present application. Figure 1 Applications in the communication systems shown:

[0039] Assume that there are K users, that is, there are K terminal devices, one terminal device corresponds to one user, and each terminal device is configured with one transmitter. Figure 2 A schematic diagram of the structure of a multi-channel transmitter provided in an embodiment of the present application is shown in FIG. Figure 2 As shown, each transmitter includes a bit message generator, an outer tree encoder, an inner codeword mapper, a bit sparse random interleaver, a digital modulator, a low-density parity check encoder, a radio frequency transmission module and a transmitting antenna.

[0040] Take a terminal 120 sending a signal as an example: the bit message generator generates a binary message sequence as user data; the user data is divided into header data and body data, wherein the header data is sent to the outer tree encoder, and the body data is sent to the low-density parity check encoder. The outer tree encoder and the inner codeword mapper perform a first encoding process on the header data, wherein the outer tree encoder divides the input header data into multiple time slots, generates a check redundancy sequence and adds it to the end of each time slot data segment, and outputs the encoded sequence of each time slot. The inner codeword mapper selects the corresponding codeword from the preset public code book in each time slot according to the encoded sequence to complete the mapping, obtains the header encoding sequence, and generates a random interleaving pattern according to the encoded data of each time slot. The low-density parity check encoder, digital modulator and bit sparse random interleaver perform the second encoding process on the packet body data, wherein the low-density parity check encoder performs low-density parity check encoding on the input packet body data, and then performs digital modulation through the digital modulator, and the bit sparse random interleaver fills the digitally modulated sequence with 0 to a fixed length according to the random interleaving pattern obtained by the inner codeword mapper, and then performs bit interleaving to obtain the packet body coding sequence. The RF transmission module will map the header coding sequence and the packet body coding sequence into a multi-channel carrier signal through orthogonal frequency division multiplexing, and finally send the multi-channel carrier signal through the transmitting antenna.

[0041] A plurality of terminal devices transmit signals to a base station via a multi-channel carrier signal through the above signal transmission method, and the base station is equipped with a receiver. Figure 3 A schematic diagram of the structure of a receiver provided in an embodiment of the present application is shown in FIG. Figure 3 As shown, the receiver includes a low-density parity check decoder, a digital demodulator, a bit-sparse random deinterleaver, a time-frequency offset estimation correction module, a joint channel reconstruction and conflict resolution module, an outer tree decoder, an activity and channel joint estimation module, multiple RF receiving modules, and a receiving antenna array, wherein one RF receiving module corresponds to one receiving antenna.

[0042] Take the signal received by base station 110 as an example: the receiving antenna array receives multi-channel carrier signals, and multiple radio frequency receiving modules demodulate the multi-channel carrier signals respectively to obtain baseband data; the baseband data is divided into packet header received data and packet body received data according to the receiving timing. The activity and information joint estimation module, the outer tree decoder and the joint channel reconstruction and conflict resolution module perform a first decoding process on the packet header received data to obtain packet header decoded data. Among them, the activity and channel joint estimation module is based on multiple groups of packet header received data, and a group of packet header received data corresponds to a time slot symbol. For each group of packet header received data, the activity and channel joint estimation module identifies at least one active codeword of the time slot symbol corresponding to the group of data and restores the equivalent channel corresponding to the active codeword, and restores the active codeword to the corresponding binary sequence according to the public code book to obtain the group of packet header received data, that is, the sequence set corresponding to the time slot symbol. The outer tree decoder completes data splicing and reorganization by checking redundant spans for the sequence sets corresponding to multiple groups of packet header received data, and obtains all possible paths; the joint channel reconstruction and conflict resolution module completes the channel reconstruction of conflicting users and the channel estimation of non-conflicting users based on the equivalent channels and all possible paths corresponding to each group of packet header received data, and estimates the time offset and frequency offset values ​​to obtain the packet header decoded data. The time-frequency offset estimation correction module, the bit sparse random deinterleaver, the digital demodulator and the low-density parity check decoder perform the second decoding processing on the packet body received data to obtain the packet body decoded data. Among them, the time-frequency offset estimation correction module confirms the most correct time offset and frequency offset estimation values ​​as the final estimation values ​​according to the multiple groups of time offset and frequency offset estimation values ​​generated by the joint channel reconstruction and conflict resolution module and the degree of rotation of the constellation diagram of the packet body received data; the bit sparse random deinterleaver performs bit deinterleaving on the packet body received data to obtain the first packet body decoding sequence; the digital demodulator performs digital demodulation on the bit deinterleaved data; the low-density parity check decoder completes multi-user channel decoding according to the digitally demodulated data, the channel estimation value and the final estimation value to obtain the packet body decoding data. Finally, the user data is obtained according to the packet header decoding data and the corresponding packet body decoding data.

[0043] The above example is based on a scheduling-free communication protocol. There is no need for the base station to allocate a dedicated communication line, and there is no need to complete access authorization in advance, thereby saving signaling overhead and reducing communication delay; based on a random access scheme without user identification, a public code book is used, and there is no need to allocate a unique pilot to each terminal device in advance. This can overcome the huge resource overhead caused by the use of independent code books when a large number of users access, and save pilot resource configuration; through the joint channel reconstruction and conflict resolution module, the signal phase rotation caused by time deviation and frequency deviation in asynchronous random access without user identification can be effectively compensated, overcoming the performance loss caused by user codeword conflicts, and providing a highly reliable and efficient access solution.

[0044] Figure 4This is a flow chart of a signal sending method provided by an embodiment of the present application. Figure 4 As shown, the signal sending method can be but is not limited to being applied to a user equipment, or as Figure 1 In the terminal 120 of the communication system provided. Figure 4 In the embodiment of the present invention, the signal sending method may include but is not limited to steps S1100, S1200, S1300, and S1400.

[0045] Step S1100: Divide the user data into header data and body data. The user data is the data that needs to be sent and generated by the user device according to the user input. For example, assume that there are K users, Figure 2 Taking the transmitter provided as an example, the bit message generator generates a binary message sequence m according to the bit symbols input by user k, k = 1, 2, ..., K. k , the message sequence length is B bits, of which the first B p bits of data are header data, and the remaining B c bits of data are the packet data, B p +B c =B.

[0046] Step S1200: Perform a first encoding process on the packet header data to obtain a packet header encoding sequence.

[0047] In one embodiment, Figure 5 This is a flowchart of performing a first encoding process on packet header data provided by an embodiment of the present application. Figure 5 As shown, step S1200 at least includes but is not limited to step S1210, step S1220, and step S1230.

[0048] Step S1210: segmenting and redundantly encoding the packet header data through a tree encoder to obtain R first packet header encoding sequences, where R is an integer greater than or equal to 1.

[0049] For example, Figure 2 Taking the transmitter provided as an example, the message sequence m is encoded by the outer tree encoder, i.e., the tree encoder. k The first B in p The header data of bits is split to obtain multiple sub-header sequences, where the sequence length of each sub-header sequence may be unequal, and each sub-header sequence corresponds to a time slot. A redundant check sequence is generated for each time slot except the first time slot, that is, the first sub-header sequence, through the check matrix, and a coding sequence is obtained after adding the sub-header sequence corresponding to the time slot, where the first sub-header sequence and each coding sequence are of equal length. Specifically, the outer tree encoder converts B pThe header data of bits is divided into R sub-blocks, each sub-block is J bits long, where the length of the data bit w(r) contained in the rth sub-block is m bits. r Bit, yes The tree encoder introduces a check bit to the rth sub-block, that is, a redundant check sequence is generated through the check matrix, and the length of the redundant check sequence is l r bits, so that the total length of each sub-block is m r +l r = J. It can be understood that the first sub-block is all data bits and does not contain a redundant check sequence, that is, m 0 = J, and l 0 = 0. Let p(r) be the redundant check sequence of the rth sub-block, whose length is l r bits, the redundancy check sequence p(r) is determined by the following formula:

[0050]

[0051] Among them, G l, is a matrix that obeys Bernoulli distribution, and the number of 0 and 1 has the same probability of occurrence in statistics. In the calculation of the above redundant check sequence, all addition operations are modulo-2 additions, thus ensuring that the redundant check sequence p(r) is a binary sequence. For example, Figure 6 A schematic diagram of a redundant encoding process provided for an example of the present application is shown in FIG. Figure 6 As shown, it is assumed that the packet header data is divided into 5 sub-blocks, corresponding to time slots 1 to 5 respectively. The first sub-block w(0) is a data bit and does not contain a redundant check sequence; the redundant check sequence p(1) of the second sub-block w(1) is generated according to w(0) and the check matrix G; the redundant check sequence p(2) of the third sub-block w(2) is generated according to w(0), w(1) and the check matrix G; the redundant check sequence p(3) of the fourth sub-block w(3) is generated according to w(0), w(1), w(2) and the check matrix G; the redundant check sequence p(4) of the fourth sub-block w(4) is generated according to w(0), w(1), w(2), w(3) and the check matrix G.

[0052] After adding a redundant check sequence to each sub-block except the first sub-block, R first packet header coding sequences are obtained. The R first packet header coding sequences are represented as v p =[v p (0),v p (1),…,v p (R-1)] T , where v p (r) is determined by the following formula:

[0053]

[0054] Among them, v p (r) represents the rth sequence among the R first packet header coding sequences, 0≤r<R, w(r) represents the rth data block among the R data blocks obtained by segmenting the packet header data, and p(r) represents the redundant check sequence corresponding to w(r).

[0055] Step S1220: mapping each first packet header coding sequence with a codeword in a preset common codebook to obtain a second packet header coding sequence corresponding to each first packet header coding sequence, wherein the common codebook has multiple codewords, and each first packet header coding sequence is mapped with one codeword.

[0056] For example, Figure 2 Taking the transmitter provided as an example, the packet header data is segmented and redundantly encoded by the outer tree encoder to obtain R first packet header encoding sequences v p (r) After that, the inner codeword mapper receives the R first packet header coding sequences v generated by the outer tree encoder. p (r), and complete the first packet header encoding sequence v one by one according to the preset public code book p (r) and the codeword mapping process. Taking the rth time slot as an example, the inner codeword mapper converts the first packet header encoding sequence v of user k into p (r) is converted into a binary choice vector Where N = 2 J . Only in The value of the element is 1, and the values ​​of the other positions are 0. is the first packet header encoding sequence v of user k p (r) Convert the number to decimal and add 1 to the value.

[0057] Let the public codebook matrix Where Lp is the codeword length of the public codebook, and the inner codeword mapper performs matrix and vector multiplication operations. Mapping is performed to obtain the first packet header encoding sequence v of user k in the rth time slot p (r) Mapping the corresponding second packet header coding sequence. In R time slots, the above operation is applied to the first packet header coding sequence of user k corresponding to each time slot, thereby completing the codeword mapping of each first packet header coding sequence corresponding to the packet header data, and obtaining R second packet header coding sequences corresponding to the packet header data.

[0058] Step S1230: The second packet header coding sequences corresponding to the R first packet header coding sequences are combined into a packet header coding sequence. Figure 2Taking the transmitter provided as an example, after the R first packet header coding sequences are mapped by the inner codeword mapper to obtain the corresponding R second packet header coding sequences, the R second packet header coding sequences are combined into a packet header coding sequence, that is, the packet header coding sequence is At this point, the encoding process of the packet header data portion of the user data of user k is completed.

[0059] Step S1300: Perform a second encoding process on the package body data to obtain a package body encoding sequence.

[0060] In one embodiment, Figure 7 This is a flow chart of performing a second encoding process on the package body data provided by an embodiment of the present application. Figure 7 As shown, step S1300 at least includes but is not limited to step S1310, step S1320, and step S1330.

[0061] Step S1310: Perform low density parity check code (LDPC) encoding on the packet body data to obtain a first packet body coding sequence. Figure 2 For example, for user k's B c bits of packet data, after encoding the packet data through the low-density parity check encoder, the length is The first body coding sequence.

[0062] Step S1320: digitally modulate the first body code sequence to obtain a second body code sequence. Figure 2 Taking the transmitter provided as an example, the length is obtained by the low-density parity check encoder. After the first package body code sequence is obtained, the first package body code sequence is digitally modulated by a digital modulator to obtain a second package body code sequence

[0063] Step S1330: Obtain a body code sequence according to the second body code sequence.

[0064] In one embodiment, step S1330 includes: encoding the second body coding sequence using a random interlaced pattern to obtain a third body coding sequence; and using the third body coding sequence as the body coding sequence. Figure 2 Take the provided transmitter as an example to obtain the second packet body coding sequence Then, the bit sparse random interleaver is used to Fill with 0 and interleave the bits to get the third body code sequence v c , that is, the package code sequence. Among them, the bit sparse random interleaver is based on the random interleaving pattern πk right Bit interleaving, that is, the third body coding sequence Among them, L c is the length of the second body encoding sequence.

[0065] In one embodiment, the random interlaced pattern π k Based on the first packet header encoding sequence v through a preset mapping function p Generate. For example, let the mapping function be The inner codeword mapper uses the mapping function According to each first packet header coding sequence v p (r) The corresponding decimal number Generate a random interlaced pattern π k ,It can be understood that one user corresponds to one random ,interleaving pattern.

[0066] Step S1400: Map the header code sequence and the body code sequence into a multi-channel carrier signal through orthogonal frequency division multiplexing, and send the multi-channel carrier signal. Figure 2 Taking the transmitter provided as an example, through the above-mentioned process, the packet header data of user k is encoded to obtain the packet header coding sequence The package body data of user k is encoded to obtain the package body encoding sequence v c ; Assume that a time slot symbol contains S carrier domains, S = Lp, and the RF transmission module will and v c Through orthogonal

[0067] Frequency division multiplexing is mapped to The multi-carrier signals are transmitted to the wireless channel through the transmitting antenna.

[0068] In one embodiment, the multi-channel carrier signal includes T time slot symbols, the header coding sequence occupies the first Tp time slot symbols of the T time slot symbols, the body coding sequence occupies the last Tc time slot symbols of the T time slot symbols, and the sum of Tp and Tc is equal to T. The number of second header coding sequences constituting the header coding sequence is equal to the number of the first Tp time slot symbols, that is, R is equal to Tp. In the first Tp time slot symbols of the multi-channel carrier signal, the R second header coding sequences of user k are mapped one-to-one to the first Tp time slot symbols; the body coding sequence v of user k is cIt is mapped to the remaining last Tc time slot symbols. It can be understood that the time slot symbol here is an orthogonal frequency division multiplexing (OFDM) symbol, and the packet header coding sequence and packet body coding sequence of different users are mapped to different carrier domains of the corresponding time slot symbol.

[0069] It can be understood that, in step S1100 to step S1400, for one signal transmission, multiple user data generated by multiple user devices or terminal devices execute steps S1100 to step S1400 in parallel to obtain a multi-channel carrier signal and then send it to the receiving side.

[0070] Figure 8 This is a flow chart of a signal receiving method provided by an embodiment of the present application. Figure 8 As shown, the signal receiving method can be but is not limited to being applied to a network device, or as Figure 1 In the base station 110 of the communication system provided. Figure 8 In the embodiment of the present invention, the signal receiving method may include but is not limited to steps S2100, S2200, S2300, S2400, S2500, and S2600.

[0071] Step S2100: receiving a multi-channel carrier signal, wherein the multi-channel carrier signal is a multi-channel carrier signal generated and sent by the user equipment on the sending side through the signal sending method provided by each of the above embodiments.

[0072] For example, Figure 3 Taking the provided receiver as an example, a multi-channel carrier signal sent by a user equipment is received through a receiving antenna array.

[0073] Step S2200: Demodulate the multi-channel carrier signals to obtain baseband data.

[0074] For example, Figure 3 Taking the provided receiver as an example, multiple RF receiving modules correspond one-to-one to the antennas in the receiving antenna array, and the RF receiving modules demodulate the multi-channel carrier signals received by the multiple corresponding receiving antennas in parallel to obtain baseband data and send them backwards.

[0075] Step S2300: Divide the baseband data into packet header received data and packet body received data according to the receiving timing.

[0076] In one embodiment, the multi-channel carrier signal includes T time slot symbols, the packet header received data occupies the first Tp time slot symbols of the T time slot symbols, the packet body received data occupies the last Tc time slot symbols of the T time slot symbols, and the sum of Tp and Tc is equal to T. Among them, in the first Tp time slot symbols, each time slot symbol carries a section of packet header received data, and multiple carrier domains in a time slot symbol respectively carry data of different users; the last Tc time slot symbols jointly carry the packet body received data, and in the Tc time slot symbols, different carrier domains are used to carry data of different users respectively.

[0077] Step S2400: Perform a first decoding process on the packet header received data to obtain packet header decoded data. The packet header received data includes packet header coding sequences of multiple users. The packet header received data includes multiple groups. In the first Tp time slot symbols, one time slot symbol corresponds to a group of packet header received data. For one user, Tp groups of packet header received data constitute a complete packet header part of the user.

[0078] In one embodiment, the expression of the packet header received data of the tth time slot symbol is:

[0079]

[0080]

[0081] Among them, K a is the number of active users, t∈[1,…,Tp], Represented by the frequency deviation ε n The resulting phase shift matrix is Indicates the previous sequence

[0082] Phase shift of the product; cyclic shift matrix is the time bias τ n The matrix is ​​the identity matrix Each row of τ is circularly shifted left n elements; represents the complex Gaussian noise vector, For N c The DFT submatrix is ​​composed of the corresponding S row vectors extracted from the discrete Fourier transform (DFT) matrix of the point according to the subcarrier index vector s, where N c is the total number of carriers in a time slot symbol.

[0083] Represent the time deviation value ∈ of user n respectively n Sum frequency deviation τ n The phase rotation matrix caused in the frequency domain is expressed as:

[0084]

[0085]

[0086] in[·] s×s It means extracting the submatrix consisting of S rows and S columns corresponding to the vector s index in the matrix. The other variables are given by the following formula

[0087]

[0088] T=N cp +(t-1)(N cp +N c )

[0089] Where N cp is the cyclic prefix length, N c is the total number of subcarriers in one symbol.

[0090] H n, is the channel matrix of user n on the mth antenna, and its expression is:

[0091]

[0092] Where L n is the channel order, α n,, is the gain of user n channel on the mth antenna of the lth order, τ n, is the delay of the user n channel at the lth order, and Δf is the subcarrier spacing.

[0093] Since the frequency deviation value ∈ n After downlink synchronization, its absolute value is usually very small. Simplified to a diagonal matrix, the header receives data Can be rewritten as:

[0094]

[0095] in, For vector As a diagonal matrix composed of diagonal elements, The equivalent channel vector composed of the composite time-frequency offset and user channel is expressed as follows:

[0096]

[0097] in

[0098] User sends data is the packet header code sequence sent by user n in the tth time slot. If it is assumed that the channel is flat on the occupied S subcarriers, the packet header receives data It can be further rewritten as:

[0099]

[0100] Where Z is the complex Gaussian noise matrix, is the choice matrix consisting of the binary choice vectors of active users, is the phase rotation of the time-frequency offset experienced by the user at the tth symbol, where the phase rotation vector of user n is is the user channel, M is the total number of antennas. The unit orthogonal matrix is ​​used as the codebook matrix, that is, A = I Lp , then the packet header receives data Y t can be rewritten as:

[0101] Y t =C t ⊙P t H+Z

[0102] At this time, the entire variable to be estimated is a row-sparse matrix with at most K non-zero rows.

[0103] In one embodiment, the first decoding process of step S2400 at least includes but is not limited to steps S2410, S2420, S2430, S2440, S2450, and S2460.

[0104] S2410: Obtain Tp groups of the packet header received data from the Tp time slot symbols, each group of the packet header received data corresponds to a time slot symbol in the first Tp time slot symbols. Figure 3 Taking the receiver provided as an example, the activity and channel joint estimation module obtains the Tp group header receiving data Y from the first Tp time slot symbols based on the baseband data transmitted by multiple RF receiving modules t , Y t =C t ⊙P t H+Z,t∈[1,…,Tp].

[0105] S2420: For each group of the packet header received data, determine at least one active codeword corresponding to the time slot symbol to which the packet header received data belongs and an equivalent channel corresponding to each of the active codewords.

[0106] Specifically, for each group of the packet header received data, a weighted channel matrix corresponding to the packet header received data is determined; based on the energy detection value corresponding to each row in the weighted channel matrix and a preset energy detection threshold, at least one active codeword corresponding to the time slot symbol to which the packet header received data belongs is obtained, and an equivalent channel corresponding to each of the active codewords is obtained.

[0107] For example, Figure 3 Taking the receiver provided as an example, in the activity and channel joint estimation module, the minimum mean square error (MMSE) is first used to estimate each group of packet header received data to obtain the weighted channel matrix corresponding to the packet header received data, that is:

[0108]

[0109] because is row sparse, by setting a reasonable threshold, the matrix By performing energy hard decision on the rows, the active codeword set of the tth time slot symbol corresponding to the packet header received data can be detected at the same time. and estimate the equivalent channel corresponding to the active codeword Representation Matrix No. The row energy is greater than γ, where γ is the energy detection threshold preset in the receiver. Assume that user n selects the i-th codeword from codebook A for transmission in the t-th time slot symbol, then the equivalent channel of user n is

[0110] However, due to the limited codebook space and the competition among users for codewords, codeword conflicts may occur. Assume that K i Each user selects the i-th codeword for transmission, and the user set is Then the equivalent channel expression obtained by MMSE estimation is:

[0111]

[0112] Gather at this time The equivalent channels of all users in the network are superimposed on each other and cannot be estimated individually, resulting in data decoding failure.

[0113] S2430: Inversely map each of the active codewords into a binary sequence according to the codebook matrix, and obtain a sequence set corresponding to each of the first Tp time slot symbols.

[0114] For example, Figure 3Taking the receiver provided as an example, the outer tree decoder receives the active codewords of multiple time slot symbols generated by the activity and channel joint estimation module And the equivalent channel corresponding to the codeword The outer tree codewords will each group of active codewords The codebook matrix is ​​inversely mapped into a binary sequence to obtain a sequence set corresponding to each time slot symbol in the Tp time slot symbols.

[0115] S2440: Use the check matrix to perform sequence concatenation processing on all the sequence sets corresponding to the Tp time slot symbols to obtain multiple decoding paths. Figure 3 Taking the provided receiver as an example, all the sequence sets corresponding to the Tp time slot symbols are decoded by the outer tree decoder using a check matrix.

[0116] Specifically, selecting an untraversed binary sequence from a sequence set corresponding to the first time slot symbol among the Tp time slot symbols as the current decoding path;

[0117] A sequence splicing operation is sequentially performed on the second time slot symbol to the Tp-th time slot symbol among the Tp time slot symbols, and the sequence splicing operation includes: obtaining a check sequence according to the current decoding path and the check matrix, searching for the binary sequence matching the check sequence from the sequence set corresponding to the currently traversed time slot symbol, and splicing the data segment in the found binary sequence to the tail end of the current decoding path to obtain an updated current decoding path, and continuing to perform a sequence splicing operation on the next time slot symbol based on the updated current decoding path until the sequence splicing operation of the Tp-th time slot symbol is completed, and then returning to the step of selecting a binary sequence that has not been traversed from the sequence set corresponding to the first time slot symbol among the Tp time slot symbols as the current decoding path.

[0118] For example, Fig. 9 A schematic diagram of a sequence splicing process provided as an example of this application, Fig.10 The decoding flow chart of the outer tree decoder provided for an example of this application. Fig. 9 Shown and Fig.10 As shown, assume that there are 5 time slots, that is, Tp = 5. Traverse all sequences in the first time slot, starting from time slot 1, randomly select a sequence as the root of this decoding, and calculate the check sequence based on the root sequence and the check matrix.

[0119] According to the check sequence, in the next time slot, that is, time slot 2, a sequence whose check segment matches the check sequence is searched; if there is no sequence that can match the check sequence, the decoding fails, and a new sequence is randomly selected from the untraversed sequence in time slot 1 for decoding again; if there is a sequence whose check segment can match the check sequence, such as Fig. 9 For the third sequence in time slot 2, the data segment of the matching sequence is taken out and concatenated with the root sequence to form a new root for this decoding. Based on the new root sequence and the check matrix, a new check sequence is calculated. Based on the new check sequence, a sequence whose check segment matches the check sequence is searched in the next time slot, that is, time slot 3, and so on.

[0120] If it is possible to proceed to the last time slot, that is, the corresponding sequence can be matched in time slot 5 smoothly, then the data segments of the matched sequences from time slot 1 to time slot 5 are spliced ​​to output one or more decoding paths, and the decoding is completed. Return to time slot 1 and randomly select a new sequence from the untraversed sequence to decode again. Until all sequences in time slot 1 are traversed and the sequence splicing process is completed, all possible decoding paths are obtained. Among them, the reason for the appearance of multiple decoding paths in one decoding is that the check redundancy of the outer tree encoder is insufficient, resulting in the situation where multiple sequences meet the check constraints at the same time.

[0121] S2450: Construct a multi-stage graph model, wherein the multi-stage graph model includes a plurality of nodes and paths connecting the nodes, each of the paths corresponds to a decoding path, and each of the nodes corresponds to an equivalent channel. Figure 3 Taking the receiver provided as an example, the joint channel reconstruction and conflict resolution module receives the outer tree decoder and decodes to obtain all possible decoding paths and equivalent channels. The nodes are decoded,paths are taken as edges between nodes, and a multi-stage graph model is constructed.

[0122] S2460: Perform path iteration based on the multi-stage graph model, obtain a target path in each round of path iteration, restore packet header decoding data according to the target path, and reconstruct the channel according to the target path.

[0123] Specifically, multiple rounds of path iterations are performed based on the multi-stage graph model until there are no remaining paths in the multi-stage graph model. In each round of path iterations, the following processing is performed:

[0124] Taking the path with the smallest path weight in the current multi-stage graph model as the target path;

[0125] Determine whether the target path is a valid path according to a preset energy decision rule, and if the target path is not a valid path, delete the target path from the multi-stage graph model and perform the next round of path iteration;

[0126] In the case that the target path is a valid path, recovering the packet header decoding data of a user according to the target path, and determining the conflicting nodes and the non-conflicting nodes from the nodes corresponding to the target path;

[0127] Determine components of a reconstructed channel according to the equivalent channels corresponding to all the non-conflicting nodes;

[0128] For each of the conflicting nodes, eliminate the component of the reconstructed channel from the equivalent channel corresponding to the conflicting node;

[0129] The target path is deleted from the multi-stage graph model, and the next round of path iteration is performed.

[0130] After the target path is determined, the estimated values ​​of the time offset and frequency offset corresponding to the target path are determined according to the path weight corresponding to the target path.

[0131] For example, Figure 3 Taking the provided receiver as an example, in the joint channel reconstruction and conflict resolution module, after the multi-stage graph model is constructed, path iteration is performed based on the multi-stage graph model. Fig.11 A schematic diagram of a process for path iteration based on a multi-stage graph model provided for an example of this application, such as Fig.11 As shown, the path iteration process is as follows:

[0132] Step 1: After initializing the multi-stage graph, that is, constructing the multi-stage graph model, quantize the time offset and frequency offset values ​​within a certain range and calculate the weights of all paths in the current graph. The quantization range of the time offset is d = [1, 2, ..., D], and the quantization range of the frequency offset is q = [∈ (1) ,∈ (2) ,…,∈ (Q) ] T For any path p, the path weight is defined as:

[0133]

[0134] in is the first packet header coding sequence of user n in the Tpth time slot, and

[0135]

[0136] in m is the index in the quantized time offset vector d, and n is the index in the quantized frequency offset vector q.

[0137] Step 2: Find the path with the smallest path weight from the current multi-stage graph model As the target path. Among them, the path with the smallest path weight is obtained through the minimum weight path search, and it is made the most credible path, that is, the target path; the formula for the minimum weight path search is as follows:

[0138]

[0139] in, is the target path, that is, the path with the smallest path weight, For path The corresponding time bias estimate is, For path The corresponding frequency offset estimate.

[0140] Step 3: Determine the path according to the energy decision rule (a) Is it a valid path? If it is not a valid path, the path Delete it from the multi-stage model graph, recalculate all path weights, and perform the next round of path iteration. The formula of energy decision rule (a) is:

[0141]

[0142] in, For path Any two nodes v i (n i ) and v j (n j ), a is node v i (n i ) its own channel energy, b is node v j (n j ) its own channel energy,

[0143] If the path Any two nodes v i (n i ) and v j (n j ) can satisfy the above energy judgment rule (a), then the path is a valid path; if the path There is a node v in i (n i ) and v j (n j) cannot satisfy the above energy judgment rule (a), then the path Not a valid path.

[0144] Step 4: On the path In the case of a valid path, a user's packet header decoding data is restored according to this path, and the estimated values ​​of the time offset and frequency offset corresponding to this path are saved, wherein the corresponding estimated values ​​of the time offset and frequency offset are calculated according to the path According to the energy decision rule (b), the path The components of the reconstructed channel are determined based on the equivalent channels corresponding to all non-conflicting nodes. The formula of energy decision rule (b) is as follows:

[0145]

[0146] Among them, v j (n j ) is the path The node with the lowest energy in the path is γ, which is a threshold predefined by the receiver. Node v in i (n i ), if it can satisfy the above energy judgment rule (b), it is a non-conflicting node; if it cannot satisfy it, it is a conflicting node.

[0147] set up For path The set of non-conflicting nodes in reconstructs the components of the channel for:

[0148]

[0149] Step 5: According to the energy decision criterion (b), determine The conflicting nodes on the network are eliminated by applying serial interference to the components in the conflicting nodes. That is, the channel of the conflicting node is reconstructed. The formula for serial interference elimination is:

[0150]

[0151] The symbol ← represents the change of the variable Update operation.

[0152] Step 6: Delete the path from the current multi-stage graph model Keep only the path The conflicting nodes on the multi-stage graph model are updated for the next iteration. By reconstructing the channels of the conflicting nodes after each target path is confirmed and retaining them until the next iteration, the target paths obtained in each iteration can be free of conflicts, overcoming the performance loss caused by user codeword conflicts and improving the reliability and efficiency of access.

[0153] Step 7: If all paths in the multi-stage graph model have been deleted, that is, the multi-stage graph model is an empty graph, then all target paths and corresponding time-frequency offset estimates are output, and corresponding packet header decoding data is obtained through the target paths.

[0154] Step S2500: Perform a second decoding process on the packet body received data to obtain packet body decoded data. The packet body received data includes packet body coding sequences of multiple users. The packet body received data includes multiple groups, and the multiple groups of packet body received data are respectively mapped in different carrier domains of the last Tc time slots.

[0155] In one embodiment, the second decoding process of step S2500 at least includes but is not limited to steps S2510, S2520, S2530, and S2540.

[0156] S2510: Determine a target time offset and frequency offset estimation value from the multiple groups of time offset and frequency offset estimation values ​​according to the rotation degree of the constellation diagram of the received data. Figure 3 Taking the provided receiver as an example, the time-frequency offset estimation and correction module obtains multiple groups of time offset and frequency offset estimation values ​​from the joint channel reconstruction and conflict resolution module, and determines the target time offset and frequency offset estimation values ​​from the multiple groups of time offset and frequency offset estimation values ​​according to the rotation degree of the constellation diagram of the received data.

[0157] Among them, the degree of rotation of the constellation diagram is obtained by the following formula:

[0158]

[0159] in, is the symbol constellation diagram of the packet body data of user n after the phase rotation compensation corresponding to the kth group of time offset and frequency offset estimation values, represents the sum of all symbols whose real part is greater than 0. The table sums all symbols whose real part is less than 0.

[0160] The target time offset and frequency offset estimates are obtained using the following formula:

[0161]

[0162] S2520: Reconstruct an interleaving pattern according to the active codewords corresponding to each of the time slot symbols through a bit sparse random deinterleaver, and perform bit deinterleaving on the packet body received data according to the interleaving pattern to obtain the first packet body decoding sequence. Figure 3 Taking the provided receiver as an example, a bit sparse random deinterleaver reconstructs an interleaving pattern according to the active codewords corresponding to each of the time slot symbols generated by the activity and channel joint estimation module, wherein there are multiple reconstructed interleaving patterns, which correspond one-to-one to multiple carrier domains of the time slot symbol; multiple packet received data are bit deinterleaved one-to-one through multiple interleaving patterns to obtain first packet decoding sequences for multiple users.

[0163] S2530: Digitally demodulate and phase-rotate the first package body decoding sequence according to the target time offset and frequency offset estimation values ​​to obtain a second package body decoding sequence. Figure 3 Taking the provided receiver as an example, a digital demodulator performs digital demodulation and phase rotation compensation on the first packet body decoding sequence obtained from the bit sparse random deinterleaver according to the time offset and frequency offset estimation values ​​obtained from the time-frequency offset estimation and correction module to obtain a second packet body decoding sequence.

[0164] S2540: Perform LDPC code decoding on the second packet body decoding sequence to obtain the packet body decoding data. Figure 3 Taking the provided receiver as an example, the low-density parity check decoder obtains the second packet body decoding sequence from the digital demodulator, and performs LDPC code decoding on the second packet body decoding sequence to obtain packet body decoding data.

[0165] It can be understood that steps S2510 to S2540 are to perform the second decoding process on the packet body received data of multiple users in parallel to obtain the packet body decoded data of multiple users.

[0166] Step S2600: Obtain user data according to the packet header decoded data and the packet body decoded data.

[0167] The signal sending method and the signal receiving method provided in the above-mentioned embodiments of the present application are based on a scheduling-free communication protocol, do not require the base station to allocate a dedicated communication line, and do not need to complete access authorization in advance, thereby saving signaling overhead and reducing communication delay; based on a random access scheme without user identification, a public code book is used, and there is no need to allocate a unique pilot to each terminal device in advance, which can overcome the huge resource overhead caused by using an independent code book when a large number of users access, and save pilot resource configuration; through the joint channel reconstruction and conflict resolution module, the signal phase rotation caused by the time deviation and frequency deviation in the asynchronous random access without user identification can be effectively compensated, the performance loss caused by the user codeword conflict is overcome, and a highly reliable and efficient access scheme is provided.

[0168] Fig.12 Schematic diagram of the structure of a communication device provided by an embodiment of the present application. Fig.12 As shown, the communication device 2000 includes a memory 2100 and a processor 2200. The number of the memory 2100 and the processor 2200 may be one or more. Fig.12 In the example, a memory 2101 and a processor 2201 are taken; the memory 2101 and the processor 2201 in the network device can be connected via a bus or other means. Fig.12 The example of connecting through bus is taken in the following.

[0169] The memory 2101, as a computer-readable storage medium, can be used to store software programs, computer executable programs and modules, such as program instructions / modules corresponding to the method provided in any embodiment of the present application.

[0170] When the communication device 2000 is a user equipment, the processor 2201 implements the signal sending method provided in any of the above embodiments by running the software program, instructions and modules stored in the memory 2101.

[0171] When the communication device 2000 is a network device, the processor 2201 implements the signal receiving method provided in any of the above embodiments by running the software programs, instructions and modules stored in the memory 2101 .

[0172] The memory 2101 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function. In addition, the memory 2101 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device or other non-volatile solid-state storage device. In some instances, the memory 2101 further includes a memory remotely arranged relative to the processor 2201, and these remote memories may be connected to the 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 a combination thereof.

[0173] An embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute a signal sending method or a signal receiving method as provided in any embodiment of the present application.

[0174] An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, which are stored in a computer-readable storage medium. A processor of a computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes a signal sending method or a signal receiving method provided in any embodiment of the present application.

[0175] The system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of the system architecture and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0176] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0177] In hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0178] The terms "component", "module", "system", etc. used in this specification are used to represent computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program, or a computer. By way of illustration, both applications running on a computing device and a computing device can be components. One or more components may reside in a process or an execution thread, and a component may be located on a computer or distributed between two or more computers. In addition, these components may be executed from various computer-readable media having various data structures stored thereon. Components may communicate, for example, through local or remote processes based on signals having one or more data packets (e.g., data from two components interacting with another component between a local system, a distributed system, or a network, such as the Internet interacting with other systems through signals).

[0179] The above describes some embodiments of the present application with reference to the accompanying drawings, but does not limit the scope of the present application. Any modification, equivalent substitution and improvement made by a person skilled in the art without departing from the scope and essence of the present application shall be within the scope of the present application.

Claims

1. A signal sending method, the method being applied to a user equipment, the method comprising: Divide user data into packet header data and packet body data; Performing a first encoding process on the packet header data to obtain a packet header encoding sequence; Performing a second encoding process on the package body data to obtain a package body encoding sequence; The packet header coding sequence and the packet body coding sequence are mapped into a multi-channel carrier signal through orthogonal frequency division multiplexing, and the multi-channel carrier signal is sent.

2. The method according to claim 1, characterized in that The step of performing a first encoding process on the packet header data to obtain a packet header encoding sequence includes: The packet header data is segmented and redundantly encoded by a tree encoder to obtain R first packet header encoding sequences, where R is an integer greater than or equal to 1; Mapping each of the first packet header coding sequences through a codeword in a preset common codebook to obtain a second packet header coding sequence corresponding to each of the first packet header coding sequences, wherein the common codebook has a plurality of the codewords, and each of the first packet header coding sequences is mapped to one of the codewords; The second packet header coding sequences corresponding to R first packet header coding sequences are combined into the packet header coding sequence.

3. The method according to claim 2, characterized in that The R first packet header encoding sequences are represented as v p =[v p (0),v p (1),…,v p (R-1)] T , where v p (r) is determined by the following formula: Among them, v p (r) represents the rth sequence among the R first packet header coding sequences, 0≤r<R, w(r) represents the rth data block among the R data blocks obtained by segmenting the packet header data, and p(r) represents the redundant check sequence corresponding to w(r).

4. The method according to claim 3, characterized in that The p(r) is determined by the following formula: Among them, G l, is a matrix that follows a Bernoulli distribution.

5. The method according to claim 3, characterized in that: The performing a second encoding process on the package body data to obtain a package body encoding sequence includes: Performing low-density parity check code LDPC encoding on the packet body data to obtain a first packet body code sequence; Digitally modulating the first body code sequence to obtain a second body code sequence; The body encoding sequence is obtained according to the second body encoding sequence.

6. The method according to claim 5, characterized in that The step of obtaining the body coding sequence according to the second body coding sequence comprises: encoding the second package body code sequence using a random interlaced pattern to obtain a third package body code sequence; The third body coding sequence is used as the body coding sequence.

7. The method according to claim 6, characterized in that The random interleaving pattern is based on the first packet header coding sequence v through a preset mapping function. p generate.

8. The method according to claim 1, characterized in that The multi-channel carrier signal includes T time slot symbols, the header coding sequence occupies the first Tp time slot symbols of the T time slot symbols, the body coding sequence occupies the last Tc time slot symbols of the T time slot symbols, and the sum of Tp and Tc equals T.

9. A signal receiving method, the method being applied to a network device, the method comprising: Receiving multi-channel carrier signals; Demodulating the multi-channel carrier signal to obtain baseband data; Dividing the baseband data into packet header received data and packet body received data according to a receiving timing sequence; Performing a first decoding process on the packet header received data to obtain packet header decoded data; Performing a second decoding process on the received packet body data to obtain packet body decoded data; The user data is obtained according to the packet header decoded data and the packet body decoded data.

10. The method according to claim 9, characterized in that The multi-channel carrier signal includes T time slot symbols, the packet header receiving data occupies the first Tp time slot symbols of the T time slot symbols, the packet body receiving data occupies the last Tc time slot symbols of the T time slot symbols, and the sum of Tp and Tc equals T.

11. The method according to claim 10, characterized in that The first decoding process is performed on the packet header received data to obtain packet header decoded data, including: Acquire Tp groups of the packet header received data from the Tp time slot symbols, each group of the packet header received data corresponds to a time slot symbol among the first Tp time slot symbols; For each group of the packet header received data, determining at least one active codeword corresponding to the time slot symbol to which the packet header received data belongs and an equivalent channel corresponding to each of the active codewords; Inversely map each of the active codewords into a binary sequence according to a codebook matrix to obtain a sequence set corresponding to each of the first Tp time slot symbols; Perform sequence splicing processing on all the sequence sets corresponding to the Tp time slot symbols using a check matrix to obtain multiple decoding paths; Constructing a multi-stage graph model, the multi-stage graph model comprising a plurality of nodes and paths connected between the nodes, each of the paths corresponding to one of the decoding paths, and each of the nodes corresponding to one of the equivalent channels; Path iteration is performed based on the multi-stage graph model, a target path is obtained in each round of path iteration, packet header decoding data is restored according to the target path, and channel reconstruction is performed according to the target path.

12. The method according to claim 11, characterized in that The step of determining, for each group of the packet header received data, at least one active codeword corresponding to the time slot symbol to which the packet header received data belongs and an equivalent channel corresponding to each active codeword includes: For each group of the packet header received data, determining a weighted channel matrix corresponding to the packet header received data; According to the energy detection value corresponding to each row in the weighted channel matrix and a preset energy detection threshold, at least one active codeword corresponding to the time slot symbol to which the packet header received data belongs is obtained, and an equivalent channel corresponding to each of the active codewords is obtained.

13. The method according to claim 11, characterized in that The using of the check matrix to perform sequence splicing processing on all the sequence sets corresponding to the Tp time slot symbols to obtain multiple decoding paths includes: Selecting an untraversed binary sequence from the sequence set corresponding to the first time slot symbol among the Tp time slot symbols as the current decoding path; A sequence splicing operation is sequentially performed on the second time slot symbol to the Tp-th time slot symbol among the Tp time slot symbols, and the sequence splicing operation includes: obtaining a check sequence according to the current decoding path and the check matrix, searching for the binary sequence matching the check sequence from the sequence set corresponding to the currently traversed time slot symbol, and splicing the data segment in the found binary sequence to the tail end of the current decoding path to obtain an updated current decoding path, and continuing to perform a sequence splicing operation on the next time slot symbol based on the updated current decoding path until the sequence splicing operation of the Tp-th time slot symbol is completed, and then returning to the step of selecting a binary sequence that has not been traversed from the sequence set corresponding to the first time slot symbol among the Tp time slot symbols as the current decoding path.

14. The method according to claim 11, characterized in that The performing path iteration based on the multi-stage graph model, obtaining a target path in each round of path iteration, restoring packet header decoding data according to the target path, and performing channel reconstruction according to the target path, includes: performing multiple rounds of path iteration based on the multi-stage graph model until there is no remaining path in the multi-stage graph model, and performing the following processing in each round of path iteration: Taking the path with the smallest path weight in the current multi-stage graph model as the target path; Determine whether the target path is a valid path according to a preset energy decision rule, and if the target path is not a valid path, delete the target path from the multi-stage graph model and perform the next round of path iteration; In the case that the target path is a valid path, recovering the packet header decoding data of a user according to the target path, and determining the conflicting nodes and the non-conflicting nodes from the nodes corresponding to the target path; Determine components of a reconstructed channel according to the equivalent channels corresponding to all the non-conflicting nodes; For each of the conflicting nodes, eliminate the component of the reconstructed channel from the equivalent channel corresponding to the conflicting node; The target path is deleted from the multi-stage graph model, and the next round of path iteration is performed.

15. The method according to claim 14, characterized in that After determining the target path, the method further includes: According to the path weight corresponding to the target path, the estimated values ​​of the time offset and frequency offset corresponding to the target path are determined.

16. The method according to claim 15, characterized in that Performing a second decoding process on the received data of the packet body to obtain the packet body decoded data, including: Determining target time offset and frequency offset estimation values ​​from the multiple groups of time offset and frequency offset estimation values ​​according to the rotation degree of the constellation diagram of the received data; Reconstructing an interleaving pattern according to the active codewords corresponding to each of the time slot symbols through a bit sparse random deinterleaver, and performing bit deinterleaving on the packet body received data according to the interleaving pattern to obtain the first packet body decoding sequence; Digitally demodulate and perform phase rotation compensation on the first package body decoding sequence according to the target time offset and frequency offset estimation values ​​to obtain a second package body decoding sequence; The second packet body decoding sequence is decoded by LDPC code to obtain the packet body decoding data.

17. A user equipment, comprising: one or more processors; A memory having one or more programs stored thereon, when the one or more programs are executed by the one or more processors, the one or more processors implement: A signal sending method as described in any one of claims 1 to 8.

18. A network device comprising: one or more processors; A memory having one or more programs stored thereon, when the one or more programs are executed by the one or more processors, the one or more processors implement: A signal receiving method as described in any one of claims 9 to 16.

19. A computer readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the program implements: The signal sending method according to any one of claims 1 to 8; or A signal receiving method as described in any one of claims 9 to 16.

Images