Random access method, communication device, system, medium and program product

Abstract

The embodiment of the invention provides a random access method, communication equipment, a communication system, a computer readable storage medium and a computer program product. According to the random access method, a bit sequence is segmented, common codebook mapping is utilized, then a carrier signal is obtained after modulation, or random access is achieved in the modes of demodulation, compressed sensing, clustering processing and the like on the carrier signal, and therefore expenditure is reduced, the coding rate is improved, and more access users are supported.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communication technology, and in particular, to a random access method, a communication device, a communication system, a computer-readable storage medium, and a computer program product. Background Art

[0002] The Internet of Things (IoT) is the Internet of Things. It extends the user end of the Internet to any device and various devices to exchange information and communicate. At present, the IoT has been widely used in various fields such as industry, agriculture, medicine, and transportation. The number of IoT devices has exploded, that is, more and more communication devices / terminals need to communicate wirelessly.

[0003] In the Internet of Things, the communication between devices is more flexible and autonomous. A key feature of the IoT communication system is that the activity pattern of devices is usually sporadic, that is, only a small number of random devices are active at any given time, and only send short data packets to other communication devices such as base stations.

[0004] In the related art, for example, the random access method needs to add a large number of check bits to reconstruct the original message, which causes a lot of redundancy and reduces the coding rate. How to reduce redundant information, increase the coding rate and realize random access is an issue that needs to be discussed and solved urgently. Summary of the invention

[0005] The embodiments of the present application provide a random access method, a communication device, a communication system, a computer-readable storage medium, and a computer program product, which are intended to implement a random access method and related communication devices that require fewer time-frequency resources and have a higher coding rate.

[0006] In a first aspect, an embodiment of the present application provides a random access method, comprising: generating a first bit sequence; segmenting the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1; mapping the S second bit sequences to codewords in a public codebook respectively to obtain S codewords; modulating the S codewords to obtain a carrier signal; and sending the carrier signal. The access method of this embodiment is applicable to random access scenarios without user identification, and specifically, can be applied to various communication devices provided with a transmitting device.

[0007] In the second aspect, the embodiment of the present application provides a random access method, including: receiving a carrier signal; demodulating the carrier signal to obtain a baseband signal; obtaining an S-segment signal according to the baseband signal, wherein S is an integer greater than 1; performing compressed sensing decoding processing on the S-segment signal to obtain a codeword and a channel corresponding to the S-segment signal; performing clustering processing according to the codeword and channel corresponding to the S-segment signal to obtain a codeword clustering result; performing demapping processing according to the codeword clustering result and a public code book to obtain a message list. The access method of this embodiment is applicable to random access scenarios without user identification, and specifically, can be applied to various communication devices provided with a receiving device.

[0008] In the third aspect, the embodiment of the present application provides a random access method, including: a sending device generates a first bit sequence; the sending device performs segment processing on the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1; the sending device maps the S second bit sequences to codewords in a public codebook respectively to obtain S codewords; the sending device modulates the S codewords to obtain a carrier signal; the sending device sends the carrier signal; the receiving device receives the carrier signal; the receiving device demodulates the carrier signal to obtain a baseband signal; the receiving device obtains an S-segment signal according to the baseband signal; the receiving device performs compressed sensing decoding processing on the S-segment signal respectively to obtain the codeword and channel corresponding to the S-segment signal; the receiving device performs clustering processing according to the codeword and channel corresponding to the S-segment signal to obtain a codeword clustering result; the receiving device performs demapping processing according to the codeword clustering result and the public codebook to obtain a second bit sequence, and obtains a message list according to the second bit sequence. The access method of this embodiment is applicable to random access scenarios without user identification, and specifically, can be applied to various communication devices provided with a sending device and a receiving device.

[0009] In a fourth aspect, an embodiment of the present application provides a communication device, comprising: a transmitter; the transmitter at least comprises: a bit sequence generation module, a bit sequence segmentation module, a bit sequence mapping module, a modulation module, and a transmission module; the bit sequence generation module is used to generate a first bit sequence; the bit sequence segmentation module is used to segment the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1; the bit sequence mapping module is used to map the S second bit sequences to codewords in a public code book respectively to obtain S codewords; the modulation module is used to modulate the S codewords to obtain a carrier signal; the transmission module is used to send the carrier signal. The access method of the embodiment of the present application is applicable to random access scenarios, specifically, to random access scenarios without user identification.

[0010] In a fifth aspect, an embodiment of the present application provides a communication device, comprising: a receiver; the receiver comprises at least: a receiving module, a demodulation module, a compressed sensing decoding module, a clustering decoding module, and a demapping module; the receiving module is used to receive a carrier signal; the demodulation module is used to demodulate the carrier signal to obtain a baseband signal; the compressed sensing decoding module is used to obtain an S-segment signal according to the baseband signal, and perform compressed sensing decoding processing on the S-segment signal respectively to obtain a codeword and a channel corresponding to the S-segment signal, wherein S is an integer greater than 1; the clustering decoding module is used to perform clustering processing according to the codeword and channel corresponding to the S-segment signal to obtain a codeword clustering result; the demapping module is used to perform demapping processing according to the codeword clustering result and a public code book to obtain a second bit sequence, and obtain a message list according to the second bit sequence. The access method of the embodiment of the present application is applicable to random access scenarios, and specifically, can be applied to random access scenarios without user identification.

[0011] In a sixth aspect, an embodiment of the present application provides a communication system, comprising: a communication device including a transmitter as in the fourth aspect and a communication device including a receiver as in the fifth aspect.

[0012] In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a program executable by a processor, and the program executable by the processor is executed when the processor is running to implement the random access method as described in any one of the first aspect, the second aspect, or the third aspect.

[0013] In an eighth aspect, an embodiment of the present application provides a computer program product, comprising a computer program or computer instructions, wherein the computer program or the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer program or the computer instructions from the computer-readable storage medium, and the processor executes the computer program or the computer instructions, so that the computer device performs the random access method as described in any one of the first aspect, the second aspect, or the third aspect.

[0014] According to the random access method, communication device, communication system, computer-readable storage medium and computer program product provided by the embodiments of the present application, the random access method achieves random access by segmenting the bit sequence, mapping it using a common code book, and then modulating it to obtain a carrier signal, or demodulating, compressing, and clustering the carrier signal, thereby reducing overhead, increasing the coding rate, and supporting more access users. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 is a schematic diagram of a communication system for a random access method provided in an embodiment of the present application;

[0016] Figure 2 is a flowchart of a random access method provided by an embodiment of the present application;

[0017] Figure 3 is a flowchart of a random access method provided by an embodiment of the present application;

[0018] Figure 4 is a flowchart of a random access method provided by an embodiment of the present application;

[0019] Figure 5 is a schematic diagram of the structure of a communication device provided by an embodiment of the present application;

[0020] Figure 6 is a schematic diagram of the structure of a communication device provided by an embodiment of the present application;

[0021] Figure 7 is a schematic diagram of the structure of a communication system provided by an embodiment of the present application;

[0022] Figure 8 It is a schematic diagram of the structure of a communication node provided in one embodiment of the present application. DETAILED DESCRIPTION

[0023] 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.

[0024] 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.

[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] Large-scale IoT applications are mainly aimed at scenarios with sensors and data collection as the goal, such as smart cities, smart transportation, smart grids, modern logistics, modern agriculture, and environmental testing. Terminal devices include smart water and electricity meters, smart trash cans, logistics trackers, vending machines, container tags, and various sensor devices in agriculture / environment / industry. Large-scale IoT has the characteristics of a large number of terminal devices with wide coverage, short data packets, and strong sporadic and sparse communication services.

[0027] In order to adapt to the various new demands and challenges of large-scale Internet of Things, access mechanisms have also developed, such as authorization-based random access method, authorization-free random access method, semi-authorization-free large-scale random access method, and user-identity-free random access method.

[0028] The authorization-based random access method is mainly aimed at human-to-human communication scenarios. Therefore, this method is suitable for services with a small number of active users, a large amount of transmitted data, and a high transmission rate requirement. However, in large-scale IoT random access scenarios, due to the limited size of the preamble sequence resource pool, it is easy to cause serious access user collision problems. In order to implement the authorization-based random access method, it is necessary to schedule transmission resources for all devices, resulting in huge signaling overhead and delay. Therefore, a scheduling-free random access protocol can be used in large-scale access methods for massive users. That is, the device directly sends the message to the base station without prior declaration. For example, the authorization-free random access method.

[0029] The unlicensed random access method, that is, the random access method with source address, requires that the base station has completed ideal active user identity detection, channel estimation and signal synchronization before effective data transmission. The unlicensed random access method relies on pre-assigned non-orthogonal pilots representing the identity of the terminal or user equipment to perform joint activity detection and channel estimation to assist subsequent data transmission. However, there is still a large resource overhead in allocating pilots and codebook resources to massive user equipment one by one. In order to solve the above problems, a semi-unlicensed random access method is proposed in the related art.

[0030] At present, the semi-grant-free random access method has many problems in power allocation, resource scheduling, channel estimation, interference control, access and transmission overall solution, etc. Therefore, in response to the problem of large-scale Internet of Things, the user-identity-free random access method has become another solution.

[0031] Random access without user identification can support an unlimited number of potential users, and the system performance depends only on the number of activated users. Compared with previous random access methods, the random access method without user identification in the related art has many advantages, but there are still problems such as large resource overhead, high access delay, and low coding rate. For example, a random access method without user identification based on cascade coding requires the use of tree coding to add a large number of check bits to splice the segmented codewords together, which causes a lot of redundancy and reduces the coding rate. At the same time, since this method requires the deployment of large-scale antennas, a large number of potential user devices are located in the near-field area of ​​the antenna array, which makes the Rayleigh fading assumption of the channel inconsistent with the actual near-field channel characteristics, reducing the feasibility of the application.

[0032] Based on this, the present application provides a random access method, communication equipment, communication system, computer-readable storage medium and computer program product. The random access method provided in one embodiment of the present application adopts a scheduling-free transmission protocol, does not require the base station to coordinate transmission resources, saves signaling overhead and reduces access delay. The random access method provided in another embodiment of the present application is based on a random access protocol without user identification. Compared with the random access method with source address, it can overcome the huge resource overhead brought by the use of user independent codebooks and support more potential users. Furthermore, an embodiment of the present application can adopt a uniformly segmented encoding method to reduce the codebook dimension and the storage overhead of the system. At the same time, the sparsity of the near-field channel angle-distance domain is used to assist the design of the compressed sensing decoder, reducing the requirement for coherent block length or code length, and also using the similarity of user channels to connect segmented short codewords in series, eliminating redundant information, reducing overhead, and improving the coding rate.

[0033] The technical solution of the present application is applicable to random access application scenarios, and in particular to random access application scenarios without user identification. To facilitate understanding of the technical solution of the present application, the random access method without user identification is further described below using an application scenario of the technical solution of the present application.

[0034] Figure 1It is a schematic diagram of a communication system for a random access method provided by an embodiment of the present application, and the communication system includes a plurality of transmitting devices (transmitters) 101, 102, 103, and an adapted receiving device (receiver) 200. Each transmitting device 101 / 102 / 103 includes a cascaded bit message generator (bit sequence generation module) 111 / 112 / 113, a bit message splitter (bit sequence segmentation module) 121 / 122 / 123, a bit message mapper (bit sequence mapping module) 131 / 132 / 133 and a radio frequency transmission module (modulation module) 141 / 142 / 143 and a transmitting antenna (transmitting module) 151 / 152 / 153. The receiving device (receiver) 200 includes a large-scale receiving antenna array (receiving module) 210, and each antenna 211 / 212 / 213 in the array is connected to a radio frequency receiving module (demodulation module) 221 / 222 / 223. All the RF receiving modules 221 / 222 / 223 are combined and connected to an inner layer compressed sensing decoder (compressed sensing decoding module) 230 , and the inner layer compressed sensing decoder 230 is connected to an outer layer clustering decoder 240 (clustering decoding module).

[0035] The technical solutions of the embodiments of the present application can be applied to various communication systems, for example: wideband code division multiple access mobile communication system (WCDMA), evolved universal terrestrial radio access network (E-UTRAN) system, next generation radio access network (NG-RAN) system, long term evolution (LTE) system, worldwide interoperability for microwave access (WiMAX) communication system, fifth generation (5G) system, such as new generation radio access technology (NR), and future communication systems, such as 6G system.

[0036] The technical solution of the embodiment of the present application can apply large-scale random access without user identification or passive random access of near-field users. To facilitate the understanding of this solution, the aforementioned near-field is specifically described as follows.

[0037] When the distance d between the user equipment and the center point of the antenna <D 2 / λ, it can be approximated as near field, where λ is the carrier wavelength and D is the antenna aperture. Taking 64 antennas as an example, the distance d corresponding to the 2.6GHz carrier frequency is less than 229 meters.

[0038] 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.

[0039] The access node of 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.

[0040] The user equipment and user terminal of the embodiment of the present application are entities for receiving or transmitting signals on the user side, such as mobile phones. The terminal device may also be referred to as a terminal device (terminal), a user equipment (UE), a mobile station (MS), a mobile terminal device (MT), etc. The terminal device may be a car with communication function, a smart car, a mobile phone, a wearable device, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal device in industrial control (industrial control), a wireless terminal device in self-driving, a wireless terminal device in remote medical surgery, a wireless terminal device in smart grid (smart grid), a wireless terminal device in transportation safety (transportation safety), a wireless terminal device in smart city (smart city), a wireless terminal 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 terminal.

[0041] The communication device in the embodiment of the present application can be any network device capable of sending or receiving wireless signals, that is, a device capable of sending or receiving wireless signals, etc. The embodiment of the present application does not limit the specific technology and specific device form used by the communication device.

[0042] Figure 2 This is a flow chart of a random access method provided by an embodiment of the present application. Figure 2 As shown, the random access method is applied to the transmitting device 100, and the random access method may include but is not limited to steps S1100, S1200, S1300, S1400 and S1500.

[0043] Step S1000: Generate a first bit sequence.

[0044] In one embodiment, the first bit sequence is generated according to a message to be sent by a transmitting device, wherein there may be multiple transmitting devices.

[0045] In one embodiment, the first bit sequence is a binary bit sequence.

[0046] In another embodiment, the first bit sequence is generated by a bit sequence generation module or a bit message generator.

[0047] Step S1200: segment the first bit sequence to obtain a second bit sequence.

[0048] In one embodiment, the first bit sequence is processed in segments to obtain S second bit sequences, where S is an integer greater than 1.

[0049] In one embodiment, the first bit sequence is divided into S second bit sequences of length j. In some embodiments, j may be an integer greater than or equal to 8 and less than or equal to 16. For example, j is equal to 8, 10, 12, 14 or 16, etc.

[0050] In one embodiment, the second bit sequence is a binary bit sequence.

[0051] In another embodiment, after the second bit sequence is received by the bit message segmenter from the first bit sequence generated by the bit message generator, the bit message segmenter evenly segments or segments the sequence into several relatively short bit sequences, ie, short messages.

[0052] It should be noted that the bit message generator may also divide the first bit sequence into uniform segments, or divide the first bit sequence into non-uniform segments, or divide the first bit sequence into arbitrary segments.

[0053] Step S1300: Map the second bit sequence to codewords in the public codebook respectively.

[0054] In one embodiment, the S second bit sequences are respectively mapped to codewords in a public codebook to obtain S codewords.

[0055] In one embodiment, the public codebook includes 2 to the jth power codewords with a length of L, where L is an integer greater than 1.

[0056] It should be noted that the number of candidate values ​​of each codeword element in the public codebook may be X, where X is an integer greater than 1, and the Lth power of X is greater than or equal to the jth power of 2. This ensures that the number of codewords is sufficient.

[0057] In one embodiment, the value of L may be twice the number of active sending devices.

[0058] In one embodiment, the value of L may be an integer greater than or equal to 4; in another embodiment, L may specifically be 4, 6, 8, 12, 16, 24 or 32, etc.

[0059] In one embodiment, a codeword mapped to each second bit sequence is obtained from a public codebook according to a decimal value corresponding to each second bit sequence.

[0060] In one embodiment, a plurality of transmitting devices all use the same codebook.

[0061] In another embodiment, after obtaining the short messages generated by the bit message divider, the bit message mapper maps them one by one to a codeword in a public codebook, such as a column in a codebook matrix.

[0062] It is understandable that any second bit sequences can be selected to be mapped to code words in the public code book to obtain corresponding code words. That is, the bit message divider evenly divides the first bit sequence into S segments, but in this step, Q second bit sequences can be selected to be mapped to code words in the public code book to obtain Q code words, where Q is a positive integer and Q <= S.

[0063] Step S1400: modulate the codeword to obtain a carrier signal.

[0064] In one embodiment, S code words are modulated to obtain a carrier signal.

[0065] In another embodiment, the bit message mapper passes each codeword to the RF transmission module, and each codeword symbol is modulated onto a carrier signal.

[0066] It is understandable that any codewords can be selected for modulation to obtain a carrier signal. That is, S codewords are obtained by the bit message mapper, but in this step, P codewords can be selected for modulation to obtain a carrier signal, where P is a positive integer and P<=S.

[0067] Step S1500: Send a carrier signal.

[0068] In one embodiment, the transmitting antenna transmits the signal generated by the radio frequency transmitting module into the wireless space.

[0069] Through the random access method provided in the embodiment of the present application, the message that the device wants to send can be segmented and mapped into codewords respectively, and each symbol of the codeword can be sent through the transmitting antenna through the radio frequency transmission module. The embodiment of the present application can adopt a scheduling-free transmission protocol, without the need for the base station to coordinate transmission resources, saving signaling overhead and reducing access latency. At the same time, the uniformly segmented encoding method is adopted to reduce the codebook dimension and the storage overhead of the system. Furthermore, the random access method provided in the embodiment of the present application is based on a random access protocol without user identification. Compared with the random access method with source address, it can overcome the huge resource overhead brought about by the use of user-independent codebooks and support more potential user devices.

[0070] Figure 3 This is a flow chart of a random access method provided by an embodiment of the present application. Figure 3 As shown, the random access method is applied to the receiving device 200, and the random access method may include but is not limited to steps S2100, S2200, S2300, S2400, S2500 and S2600.

[0071] Step S2100: Receive a carrier signal.

[0072] In one embodiment, the receiving device 200 receives a carrier signal sent by a sending device.

[0073] In one embodiment, the carrier signal can be obtained by the method of the above embodiment.

[0074] Step S2200: demodulate the carrier signal to obtain a baseband signal.

[0075] In one embodiment, the carrier signal is demodulated into a baseband signal by a radio frequency receiving module.

[0076] Step S2300: sort the baseband signal to obtain S segments of signal, where S is an integer greater than 1.

[0077] In one embodiment, the baseband signal is time-synchronized to obtain S segments of signals, where S is an integer greater than 1.

[0078] In one embodiment, each of the S signal segments includes signals received by multiple antennas or multiple radio frequency receiving modules.

[0079] Step S2400: Perform compressed sensing decoding processing on the S segment signals respectively to obtain the codewords and channels corresponding to the S segment signals respectively.

[0080] In one embodiment, the codeword corresponding to each signal segment is identified through matching pursuit, and the corresponding channel is estimated to obtain the codeword and channel corresponding to each signal segment.

[0081] In one embodiment, after the inner compressed sensing decoder obtains the received signals from all the radio frequency receiving modules, it uses the compressed sensing algorithm to obtain the transmitted codeword and its corresponding channel vector.

[0082] It is understandable that any segment signal can be selected for compressed sensing decoding to obtain the corresponding codeword and channel. That is, the baseband signal is arranged in time synchronization to obtain S segment signals, but in this step, P segment signals can be selected for compressed sensing decoding processing to obtain the corresponding codeword and channel, where P is a positive integer and P <= S.

[0083] Step S2500: cluster the codewords and channels corresponding to the S-segment signal to obtain a codeword clustering result.

[0084] In one embodiment, the codewords corresponding to the S-segment signals are reorganized according to the similarity of the channels corresponding to the S-segment signals to obtain a codeword clustering result.

[0085] In one embodiment, the outer clustering decoder uses a clustering algorithm to regroup codewords of the same device segment based on the codewords and their channels recovered by the inner compressed sensing decoder to obtain a codeword clustering result.

[0086] Step S2600: Perform demapping processing according to the codeword clustering result and the public codebook to obtain a message list.

[0087] In one embodiment, step S2600 may include steps S2610 and S2620.

[0088] Step S2610: Obtain a second bit sequence according to the index of the codeword in the codeword clustering result in the public codebook.

[0089] Step S2620: Obtain a message list according to the second bit sequence.

[0090] In one embodiment, step S2620 may include steps S2621 and S2622.

[0091] Step S2621: perform concatenation processing on the second bit sequence to obtain the first bit sequence.

[0092] Step S2622: Obtain a message list according to the first bit sequence.

[0093] In one embodiment, step S2600 may perform demapping processing according to the codeword clustering result and the public codebook to obtain S second bit sequences sent by at least one transmitting device, and then obtain the first bit sequence sent by the at least one transmitting device according to the S second bit sequences sent by the at least one transmitting device. Further, a message list sent by the at least one transmitting device may be obtained according to the first bit sequence sent by the at least one transmitting device.

[0094] Through the random access method provided in the embodiment of the present application, it is possible to receive signals sent by all activated devices through multiple receiving antennas, and decode to obtain a list of messages sent by at least one activated device.

[0095] The random access method provided in the embodiment of the present application is applied to a receiver. The receiver is configured with a large-scale receiving antenna array. Each antenna in the receiving antenna array inputs the received carrier signal into a radio frequency receiving module. The radio frequency receiving module demodulates the carrier signal into a baseband signal. After the inner layer compressed sensing decoder obtains the received baseband signal from all radio frequency receiving modules, it uses the compressed sensing algorithm to obtain the transmitted codeword and its corresponding channel vector. The outer layer clustering decoder uses a clustering algorithm to reorganize the codewords of the same device segment based on the codewords and their channels recovered by the inner layer compressed sensing decoder, and demaps them, and finally outputs a list of transmission messages.

[0096] The embodiment of the present application can adopt the design of the sparseness-assisted compressed sensing decoder in the near-field channel angle-distance domain, reducing the requirement for coherent block length or code length. Furthermore, the random access method provided by the embodiment of the present application adopts short codewords of similarity series segmentation of user channels, which eliminates redundant information and significantly improves the coding rate compared to the tree coding and decoding scheme.

[0097] Figure 4 This is a flow chart of a random access method provided by an embodiment of the present application. Figure 4 As shown, the random access method is applied to a communication system including a transmitting device 100 and a receiving device 200, and the random access method may include but is not limited to steps S3100, S3200, S3300, S3400, S3500 and S4100, S4200, S4300, S4400, S4500, S4600.

[0098] Step S3100: The sending device generates a first bit sequence.

[0099] Step S3200: The sending device performs segmentation processing on the first bit sequence to obtain S second bit sequences.

[0100] Step S3300: The sending device maps the S second bit sequences to codewords in the public codebook respectively to obtain S codewords.

[0101] Step S3400: The transmitting device modulates S code words to obtain a carrier signal.

[0102] Step S3500: The sending device sends a carrier signal.

[0103] Step S4100: The receiving device receives a carrier signal.

[0104] Step S4200: The receiving device demodulates the carrier signal to obtain a baseband signal.

[0105] Step S4300: The receiving device obtains an S-segment signal according to the baseband signal.

[0106] Step S4400: The receiving device performs compressed sensing decoding processing on the S segment signals respectively to obtain the codewords and channels corresponding to the S segment signals.

[0107] Step S4500: The receiving device performs clustering processing according to the codewords and channels corresponding to the S-segment signal to obtain a codeword clustering result.

[0108] Step S4600: The receiving device performs demapping processing according to the codeword clustering result and the public codebook to obtain a second bit sequence, and obtains a message list according to the second bit sequence.

[0109] Figure 5 Schematic diagram of the structure of a communication device provided by an embodiment of the present application. Figure 5 As shown, the communication device includes a transmitter 500. The transmitter 500 includes at least a bit sequence generating module 510, a bit sequence segmenting module 520, a bit sequence mapping module 530, a modulation module 540, and a transmission module 550.

[0110] The bit sequence generation module 510 is used to generate a first bit sequence. The bit sequence segmentation module 520 is used to segment the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1. The bit sequence mapping module 530 is used to map the S second bit sequences to codewords in the public codebook to obtain S codewords. The modulation module 540 is used to modulate the S codewords to obtain a carrier signal. The transmission module 550 is used to send the carrier signal.

[0111] Figure 6 Schematic diagram of the structure of a communication device provided by an embodiment of the present application. Figure 6 As shown, the communication device includes a receiver 600. The receiver 600 includes at least a receiving module 610, a demodulation module 620, a compressed sensing decoding module 630, a clustering decoding module 640, and a demapping module 650.

[0112] Among them, the receiving module 610 is used to receive the carrier signal. The demodulation module 620 is used to demodulate the carrier signal to obtain the baseband signal. The compressed sensing decoding module 630 is used to obtain the S segment signal according to the baseband signal, and perform compressed sensing decoding processing on the S segment signal respectively to obtain the codeword and channel corresponding to the S segment signal, where S is an integer greater than 1. The clustering decoding module 640 is used to perform clustering processing according to the codeword and channel corresponding to the S segment signal to obtain the codeword clustering result. The demapping module 650 is used to perform demapping processing according to the codeword clustering result and the public code book to obtain a second bit sequence, and obtain a message list according to the second bit sequence.

[0113] Figure 7 Schematic diagram of the structure of a communication system provided by an embodiment of the present application. Figure 7 As shown, the communication system 700 includes a transmitter 500 and a receiver 600 .

[0114] In order to further illustrate the random access method provided in the embodiment of the present application, the following example is used for detailed description.

[0115] like Figure 1 As shown, an embodiment of the present application includes a large-scale random access method without user identification for near-field users, which is implemented by several transmitters and an adapted receiver. Each device is configured with a transmitter, which includes a cascaded bit message generator, a bit message splitter, a bit message mapper, a radio frequency transmission module and a single transmitting antenna. The receiver includes a large-scale receiving antenna array, each antenna in the array is connected to a radio frequency receiving module, all radio frequency receiving modules are combined and connected to an inner layer compressed sensing decoder, and an outer layer clustering decoder is connected to the inner layer compressed sensing decoder.

[0116] The large-scale random access method without user identification for near-field users in this embodiment includes the following steps:

[0117] Transmission step: Each device is equipped with a transmitter, which maps the message that the device wants to send into a codeword, and transmits each symbol of the codeword through the transmitting antenna through the RF transmission module.

[0118] The message that each device wants to send is a binary bit sequence generated by a bit message generator. After receiving the binary bit sequence generated by the bit message generator, the bit message splitter evenly divides the sequence into several relatively short bit sequences, which are called short messages. After obtaining the short messages generated by the bit message splitter, the bit message mapper maps them one by one to a codeword in a public codebook, such as a column in a codebook matrix. The bit message mapper passes each codeword to the RF transmission module, and each codeword symbol is modulated onto a carrier signal. The transmitting antenna sends the signal generated by the RF transmission module into the wireless space.

[0119] Receiving step: The receiver receives the signals sent by all activated devices through multiple receiving antennas and decodes them to obtain a list of sent messages.

[0120] The receiver is equipped with a large-scale receiving antenna array. Each antenna in the receiving antenna array inputs the received carrier signal into a radio frequency receiving module. The radio frequency receiving module demodulates the carrier signal into a baseband signal. After the inner layer compressed sensing decoder obtains the received baseband signal from all the radio frequency receiving modules, it uses the compressed sensing algorithm to obtain the transmitted codeword and its corresponding channel vector. The outer layer clustering decoder uses the clustering algorithm to reorganize the codewords of the same device segment based on the codewords and their channels recovered by the inner layer compressed sensing decoder, and demaps them, and finally outputs a list of transmission messages.

[0121] In one example, the bit message generator generates a binary bit message sequence m according to device requirements. k , with a length of b.

[0122] The bit message splitter evenly divides the message sequence into s segments of short messages {m k (1),m k (2),…,m k (s)}.

[0123] The bit message mapper obtains the s segments of short messages divided by the bit message divider, and completes the mapping process between the binary sequence and the codeword segment by segment. Specifically, if the decimal number corresponding to the j-bit binary message is i k , then in the codebook matrix A=a1,a2,…,a 2j ] Select the i-th k List Transmitted as codewords.

[0124] The RF transmission module modulates each codeword of the user to the carrier frequency and transmits it using the transmitting antenna.

[0125] At the receiving end, the inner compressed sensing decoder uses a matching pursuit method to recover the codeword of each transmission segment and its corresponding channel segment by segment according to the received signal; the received signal of each segment can be expressed as:

[0126] Y=ASHB T +W=AXB T +W,

[0127] Where A is the public codebook; S is a binary selection matrix, where the coordinates are (k,i k ) if and only if the kth user selects the i-th k The codeword takes 1 when it is sent, otherwise it takes 0; H is the matrix composed of the angle-range domain channels of all activated user near fields, and each column has only n non-zero elements; B is the sampling matrix of the angle-range domain of the near-field channel, W is the additive white Gaussian noise matrix; X = SH.

[0128] The inner layer compressed sensing decoder recovers a certain transmitted codeword and its channel by executing the matching pursuit method, specifically the following steps:

[0129] S1: Input received signal Y, codebook matrix A, near-field channel angle-range domain sampling matrix B, number of active users k a , the number of non-zero elements n;

[0130] S2: Initialize the channel matrix estimate Row-backed collections Elements support collections Residual R(0) = Y, iteration round t = 1;

[0131] S3: Calculate P r (t) = A H R(t-1);

[0132] S4: Identification P r The 2k with the largest energy in (t) a The row index collection of rows;

[0133] S5: Merge

[0134] S6: Calculation in is a submatrix of A, containing the indices in A is a column vector of ;

[0135] S7: Identification The 2k with the largest energy in P(t) a A set of coordinates of n elements;

[0136] S8: Merge

[0137] S9: Calculate the coordinates of the Estimates of the elements within ;

[0138] S10: Reserved Medium k a The coordinates of the largest row, forming

[0139] S11: Reserved Medium k a The coordinates of the n largest elements whose row coordinates belong to constitute

[0140] S12: For Coordinates belong to The elements of retain the estimated value, and the rest of the elements are 0;

[0141] S13: Update

[0142] S14: t=t+1;

[0143] S15: Repeat S13 to S14 for T rounds;

[0144] S16: The k with the largest energy a The set of row indices corresponding to the rows is determined as the list of codewords sent in this segment, and the corresponding The row vectors in are the corresponding channels.

[0145] When the inner layer compressed sensing decoder is put into use, the matching pursuit method is executed once after each signal segment is received.

[0146] The outer cluster decoder integrates and splices the data of the original binary message scattered in all time slots across time slots, specifically in the following steps:

[0147] S1: Input the transmitted codewords and their channels detected by the inner compressed sensing decoder;

[0148] S2: Initialize k a Class center;

[0149] S3: Select any segment and find the k detected in the current segment. a The channels of the codewords are calculated by comparing them with k a The distance between the centers of each class constitutes a loss matrix;

[0150] S4: Use the loss matrix as the input of the Hungarian algorithm to obtain the allocation result;

[0151] S5: Update the center of each class to the centroid of the contained elements according to the allocation result;

[0152] S6: Repeat S3 to S5 until the cluster center does not change:

[0153] S7: According to the clustering result of the channels (codewords), the codewords in each category are demapped into binary bit sequences and arranged in order to obtain a final transmission message list.

[0154] The large-scale random access method without user identification for near-field users in this embodiment includes the following steps in a specific implementation process:

[0155] (1) Taking four activated devices as an example, the bit message generators of the four activated devices each generate a binary sequence, denoted as m1, m2, m3, and m4, respectively, and the length of each sequence is 96 bits.

[0156] (2) The bit message splitter divides the message sequence m k ,k∈{1,2,3,4} is evenly divided into 8 short messages {m k (1),m k (2),…,m k (8)}, each segment is 12 bits long.

[0157] (3) Assume that the dimension of the public codebook A is 20×2 12 , where each column is a codeword, then the public codebook A contains 2 12 The length of the codeword is 20. Public codebook A = [a1, a2, ..., a2 12 Each element in ] is independently generated by a complex Gaussian distribution with a mean of 0 and a variance of 1 / 20. The bit message mapper converts the 8-segment binary short message {m k (1),m k (2),…,m k (8)} is converted to the equivalent decimal number Determine the codeword to be transmitted

[0158] (4) The radio frequency transmission module obtains the codeword signal output by the bit message mapper and modulates it onto an orthogonal frequency division multiplexing symbol with a frequency of, for example, 2.6 GHz, with each codeword occupying 20 symbols.

[0159] (5) All symbols are sent to the wireless channel through the transmitting antenna.

[0160] (6) The receiver is configured with, for example, 64 antennas that are uniformly linearly arranged with half a wavelength, and each antenna acquires a carrier signal from the wireless space.

[0161] (7) The RF receiving module demodulates the carrier signal into a baseband signal and organizes the received signal into 8 segments according to time synchronization.

[0162] (6) The inner compressed sensing decoder obtains the received signals from all RF receiving modules and processes each received signal. The specific steps are as follows:

[0163] S1: input received signal Y, codebook matrix A, near-field channel angle-range domain sampling matrix B, number of active users 4, number of non-zero elements 2;

[0164] S2: Initialize the channel matrix estimate Row-backed collections Elements support collections Residual R(0) = Y, iteration round t = 1;

[0165] S3: Calculate P r (t) = A H R(t-1);

[0166] S4: Identification P r The row index set of the 4 rows with the largest energy in (t);

[0167] S5: Merge

[0168] S6: Calculation in is a submatrix of A, containing the indices in A is a column vector of ;

[0169] S7: Identification is the coordinate set of the 16 elements with the largest energy in P(t);

[0170] S8: Merge

[0171] S9: Calculate the coordinates of the Estimates of the elements within ;

[0172] S10: Reserved The coordinates of the 4 largest rows in

[0173] S11: Reserved The coordinates of the 8 largest elements in , and their row coordinates belong to constitute

[0174] S12: For Coordinates belong to The elements of retain the estimated value, and the rest of the elements are 0;

[0175] S13: Update

[0176] S14: t=t+1;

[0177] S15: Repeat S13 to S14 for T rounds;

[0178] S16: The k with the largest energy a The set of row indices corresponding to the rows is determined as the list of codewords sent in this segment, recorded as Corresponding The row vectors in are the corresponding channels, denoted as

[0179] After executing the above steps for each segment of the received signal, the set of transmitted codewords and the corresponding channel vector set are obtained, which are respectively recorded as

[0180] (7) The outer cluster decoder obtains the codewords and the corresponding channel vectors output by the inner compressed sensing decoder, and performs the following decoding steps:

[0181] S1: Input the transmitted codewords and their channels detected by the inner compressed sensing decoder;

[0182] S2: Initialize 4 class centers {c1, c2, c3, c4};

[0183] S3: Select any segment and the channel of the codeword detected in the current segment Calculate the Euclidean distance between them and each class center to form a loss matrix C, where the (i′, j′)th element is calculated as

[0184] S4: Use the loss matrix C as the input of the Hungarian algorithm to obtain the allocation result;

[0185] S5: Update the center of each class to the centroid of the contained elements according to the allocation result;

[0186] S6: Repeat S3 to S5 until the cluster center does not change;

[0187] S7: According to the clustering results of the channels (codewords), the codewords in each category are demapped into binary bit sequences and arranged in order to obtain the final list of sent messages.

[0188] Figure 8 Schematic diagram of a communication node structure provided by an embodiment of the present application. Figure 8As shown, the access node includes a memory 1100 and a processor 1200. The number of the memory 1100 and the processor 1200 may be one or more. Figure 8 In the embodiment, a memory 1100 and a processor 1200 are taken as an example; the memory 1100 and the processor 1200 in the device may be connected via a bus or other means. Figure 8 The example of connecting through bus is taken in the following.

[0189] The memory 1100 is a computer-readable storage medium that can be used to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the random access method provided in any embodiment of the present application. The processor 1200 implements the above random access method by running the software programs, instructions, and modules stored in the memory 1100.

[0190] The memory 1100 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 1100 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 1100 may further include a memory remotely arranged relative to the processor 1200, 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 combinations thereof.

[0191] 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 the random access method provided in any embodiment of the present application.

[0192] An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, wherein the computer program or computer instructions 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 the random access method provided in any embodiment of the present application.

[0193] 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.

[0194] 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.

[0195] 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.

[0196] 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).

Claims

1. A random access method, applied to a transmitting device, characterized in that: The method comprises: generating a first bit sequence; Performing segment processing on the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1; Mapping the S second bit sequences to codewords in a public codebook respectively to obtain S codewords; Modulating the S code words to obtain a carrier signal; The carrier signal is transmitted.

2. The random access method according to claim 1, characterized in that: The segmenting of the first bit sequence to obtain S second bit sequences includes: The first bit sequence is divided into S second bit sequences with a length of j, where j is an integer greater than or equal to 8 and less than or equal to 16.

3. The random access method according to claim 2, characterized in that: The j is equal to 8, 10, 12, 14 or 16.

4. The random access method according to claim 2, characterized in that: The public codebook includes 2 to the jth power codewords with a length of L, where L is an integer greater than or equal to 4.

5. The random access method according to any one of claims 1 to 4, characterized in that: The step of mapping the S second bit sequences to codewords in a common codebook to obtain S codewords comprises: According to the decimal value corresponding to each second bit sequence, a codeword mapped to each second bit sequence is obtained from the public codebook.

6. A random access method, applied to a receiving device, characterized in that: The method comprises: receiving a carrier signal; Demodulating the carrier signal to obtain a baseband signal; Arrange the baseband signal in time synchronization to obtain S segments of signal, where S is an integer greater than 1; Performing compressed sensing decoding processing on the S segment signals respectively to obtain codewords and channels corresponding to the S segment signals respectively; Clustering the codewords and channels corresponding to the S-segment signals to obtain a codeword clustering result; Demapping is performed according to the codeword clustering result and the public codebook to obtain a message list.

7. The random access method according to claim 6, characterized in that: The performing compressed sensing decoding processing on the S segment signals respectively to obtain code words and channels corresponding to the S segment signals includes: The codeword corresponding to each signal segment is identified through matching pursuit, and the corresponding channel is estimated to obtain the codeword and channel corresponding to each signal segment.

8. The random access method according to claim 6, characterized in that: The clustering of the codewords and channels corresponding to the S-segment signals to obtain codeword clustering results includes: The codewords corresponding to the S-segment signals are reorganized according to the similarity of the channels corresponding to the S-segment signals to obtain a codeword clustering result.

9. The random access method according to claim 6, characterized in that: The demapping process is performed according to the codeword clustering result and the public codebook to obtain a message list including: Obtaining a second bit sequence according to the index of the codeword in the codeword clustering result in the public codebook; The message list is obtained according to the second bit sequence.

10. The random access method according to claim 9, characterized in that: The obtaining the message list according to the second bit sequence includes: performing concatenation processing on the second bit sequence to obtain a first bit sequence; The message list is obtained according to the first bit sequence.

11. A random access method, characterized in that: The method comprises: The sending device generates a first bit sequence; The sending device performs segment processing on the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1; The sending device maps the S second bit sequences to codewords in a public codebook respectively to obtain S codewords; The transmitting device modulates the S code words to obtain a carrier signal; The transmitting device transmits the carrier signal; The receiving device receives the carrier signal; The receiving device demodulates the carrier signal to obtain a baseband signal; The receiving device obtains an S-segment signal according to the baseband signal; The receiving device performs compressed sensing decoding processing on the S segment signals respectively to obtain code words and channels corresponding to the S segment signals; The receiving device performs clustering processing according to the codewords and channels corresponding to the S segment signals to obtain a codeword clustering result; The receiving device performs demapping processing according to the codeword clustering result and the public code book to obtain a second bit sequence, and obtains a message list according to the second bit sequence.

12. A communication device for random access, characterized in that: The communication device comprises at least a transmitter; The transmitter at least includes: a bit sequence generation module, a bit sequence segmentation module, a bit sequence mapping module, a modulation module, and a transmission module; The bit sequence generating module is used to generate a first bit sequence; The bit sequence segmentation module is used to segment the first bit sequence to obtain S second bit sequences, where S is an integer greater than 1; The bit sequence mapping module is used to map the S second bit sequences into code words in a public code book respectively to obtain S code words; The modulation module is used to modulate the S code words to obtain a carrier signal; The transmitting module is used to send the carrier signal.

13. A communication device for random access, characterized in that: The communication device comprises at least a receiver; The receiver includes at least: a receiving module, a demodulation module, a compressed sensing decoding module, a clustering decoding module, and a demapping module; The receiving module is used to receive a carrier signal; The demodulation module is used to demodulate the carrier signal to obtain a baseband signal; The compressed sensing decoding module is used to obtain S segment signals according to the baseband signal, and perform compressed sensing decoding processing on the S segment signals respectively to obtain code words and channels corresponding to the S segment signals, wherein S is an integer greater than 1; The cluster decoding module is used to perform clustering processing according to the codewords and channels corresponding to the S segment signals to obtain codeword clustering results; The demapping module is used to perform demapping processing according to the codeword clustering result and the public code book to obtain a second bit sequence, and obtain a message list according to the second bit sequence.

14. A communication system, characterized in that: The communication system comprises the transmitter as claimed in claim 12 and the receiver as claimed in claim 13.

15. A computer-readable storage medium, characterized in that: A program executable by a processor is stored therein, and when the program executable by the processor is executed by the processor, it is used to implement the random access method according to any one of claims 1 to 11.

16. A computer program product comprising a computer program or computer instructions, characterized in that The computer program or the computer instruction is stored in a computer-readable storage medium, a processor of a computer device reads the computer program or the computer instruction from the computer-readable storage medium, and the processor executes the computer program or the computer instruction, so that the computer device performs the random access method according to any one of claims 1 to 11.

Images