Method and apparatus for wireless communication

Abstract

A method and apparatus for wireless communication are provided. The method comprises the following steps: a first terminal device sends a first message based on a first mode; wherein the first message is used for the first terminal device to request for identification-free random access from a network device, the first terminal device is one of a plurality of terminal devices, and the first mode is related to one or more of the following items: a first codebook shared by the plurality of terminal devices; the network device configures a plurality of signature sequences for the plurality of terminal devices; the first coding block is shared by the plurality of terminal devices.

Description

Technical Field

[0001] This application relates to the field of communication technology, and more specifically, to a method and apparatus for wireless communication. Background Technology

[0002] In some communication systems, there are scenarios where a large number of terminal devices simultaneously require access. In such scenarios, traditional random access procedures not only result in high signaling overhead and latency, but may also be unable to support ultra-large-scale data transmission. Therefore, how to enable simultaneous random access for a large number of terminal devices in these communication systems becomes a problem that needs to be solved. Summary of the Invention

[0003] This application provides a method and apparatus for wireless communication. The various aspects of this application will be described below.

[0004] In a first aspect, a method for wireless communication is provided, comprising: a first terminal device sending a first message based on a first mode; wherein the first message is used for the first terminal device to request unidentified random access from a network device, the first terminal device being one of a plurality of terminal devices, and the first mode being associated with one or more of the following: a first codebook shared by the plurality of terminal devices; a plurality of signature sequences configured by the network device for the plurality of terminal devices; and a first code block shared by the plurality of terminal devices.

[0005] In a second aspect, a method for wireless communication is provided, comprising: a network device receiving multiple messages from multiple terminal devices; the network device decoding the messages based on a first method to determine the multiple messages; wherein the multiple messages are used by the multiple terminal devices to request unidentified random access, the multiple terminal devices including a first terminal device, the multiple messages including a first message, and the first method being associated with one or more of the following: a first codebook shared by the multiple terminal devices; multiple signature sequences configured by the network device for the multiple terminal devices; and a first code block shared by the multiple terminal devices.

[0006] Thirdly, an apparatus for wireless communication is provided, the apparatus being a first terminal device, the apparatus comprising: a transmitting unit, configured to transmit a first message based on a first method; wherein the first message is used by the first terminal device to request unidentified random access from a network device, the first terminal device being one of a plurality of terminal devices, and the first method being related to one or more of the following: a first codebook shared by the plurality of terminal devices; a plurality of signature sequences configured by the network device for the plurality of terminal devices; and a first coding block shared by the plurality of terminal devices.

[0007] Fourthly, an apparatus for wireless communication is provided, the apparatus being a network device, the apparatus comprising: a receiving unit for receiving multiple messages from multiple terminal devices; and a processing unit for decoding based on a first method to determine the multiple messages; wherein the multiple messages are used by the multiple terminal devices to request unidentified random access, the multiple terminal devices including a first terminal device, the multiple messages including a first message, and the first method being associated with one or more of the following: a first codebook shared by the multiple terminal devices; multiple signature sequences configured by the network device for the multiple terminal devices; and a first code block shared by the multiple terminal devices.

[0008] Fifthly, a communication device is provided, including a memory and a processor, the memory for storing a program, and the processor for calling the program in the memory to perform the method as described in the first or second aspect.

[0009] A sixth aspect provides an apparatus including a processor for calling a program from memory to perform the method as described in the first or second aspect.

[0010] A seventh aspect provides a chip including a processor for calling a program from memory, causing a device on which the chip is mounted to perform the method as described in the first or second aspect.

[0011] Eighthly, a computer-readable storage medium is provided having a program stored thereon that causes a computer to perform the method as described in the first or second aspect.

[0012] Ninth aspect, a computer program product is provided, including a program that causes a computer to perform the method as described in the first or second aspect.

[0013] In a tenth aspect, a computer program is provided that causes a computer to perform the method as described in the first or second aspect.

[0014] In this embodiment, a terminal device sends a first message based on a first method to request unidentified random access from a network device. The first method is associated with a first codebook, a first code block, and / or multiple signature sequences configured by the network device, all shared by multiple terminal devices. Unidentified random access helps achieve low signaling, low latency, and high concurrency. When multiple terminal devices send messages corresponding to unidentified random access based on the same codebook, code block, or configured signature sequences, the system performance can be improved by enabling simultaneous access by a large number of terminal devices. Attached Figure Description

[0015] Figure 1 This is a system architecture example diagram of a wireless communication system to which embodiments of this application can be applied.

[0016] Figure 2 This is a schematic diagram of a network architecture applicable to embodiments of this application.

[0017] Figure 3A and Figure 3B This is a schematic diagram of a wireless protocol stack structure applicable to embodiments of this application.

[0018] Figure 4 This is a flowchart illustrating a method for wireless communication proposed in an embodiment of this application.

[0019] Figure 5 for Figure 4 A schematic diagram of one possible implementation of the method shown.

[0020] Figure 6 This is a schematic diagram of a device for wireless communication provided in an embodiment of this application.

[0021] Figure 7 This is a schematic diagram of another device for wireless communication provided in an embodiment of this application.

[0022] Figure 8 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0023] Communication system architecture

[0024] Figure 1 This is a system architecture example diagram of a wireless communication system 100 applicable to embodiments of this application. The wireless communication system 100 may include a network device 110 and a terminal device 120. The network device 110 may be a device that communicates with the terminal device 120. The network device 110 may provide communication coverage for a specific geographical area and may communicate with the terminal device 120 located within that coverage area.

[0025] Figure 1 An exemplary network device and multiple terminal devices are illustrated, such as terminal devices 120a to 120j in the figure. Optionally, the wireless communication system 100 may include multiple network devices, and each network device may include other numbers of terminal devices within its coverage area; this application embodiment does not limit this.

[0026] Optionally, the wireless communication system 100 may also include other network entities such as a network controller and a mobility management entity, which is not limited in this embodiment.

[0027] It should be understood that the technical solutions of the embodiments of this application can be applied to various communication systems, such as: 5th-generation (5G) systems or new radio (NR) systems, long-term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, advanced long-term evolution (LTE-A) systems, enhanced 5G (5G advanced) systems, etc. The technical solutions provided in this application can also be applied to future communication systems, such as 6th-generation (6G) mobile communication systems, satellite communication systems, etc.

[0028] The terminal device in this application embodiment can also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. The terminal device in this application embodiment can be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as a handheld device with wireless connectivity, vehicle-mounted device, etc. The terminal device in the embodiments of this application may be a mobile phone, tablet computer, laptop computer, handheld computer, camera equipment, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. Optionally, the terminal device may be used to act as a base station. For example, the terminal device may act as a scheduling entity, providing sidelink signals between UEs in vehicle-to-everything (V2X) or device-to-device (D2D) connections. For example, cellular phones and cars communicate with each other using sidelink signals. Cellular phones and smart home devices can communicate without relaying communication signals through base stations.

[0029] The network device in this application embodiment can be a device for communicating with terminal devices. This network device can also be called an access network device or a radio access network device, such as a base station (BS). In this application embodiment, the network device can refer to a radio access network (RAN) node or a next-generation RAN (NG-RAN) node (or device) that connects user equipment to a wireless network. A base station can broadly encompass, or be replaced by, various names including: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, transmitting and receiving point (TRP), transmitting point (TP), master station (MeNB), secondary station (SeNB), multi-mode radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or similar, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. Base stations can also be mobile switching centers, devices that perform base station functions in D2D, V2X, and machine-to-machine (M2M) communications, network-side devices in 6G networks, and devices that perform base station functions in future communication systems. Base stations can support networks using the same or different access technologies. The embodiments of this application do not limit the specific technologies or device forms used in the network equipment.

[0030] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0031] In some deployments, the network device in this application embodiment may refer to a CU or a DU, or the network device may include both a CU and a DU. The gNB may also include an AAU.

[0032] Network devices and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and satellites. This application does not limit the scenario in which the network devices and terminal devices are located.

[0033] In this embodiment, the network device can provide services to a cell. The terminal device communicates with the network device through the transmission resources (e.g., frequency domain resources, or spectrum resources) used by the cell. The cell can be the cell corresponding to the network device (e.g., a base station). The cell can belong to a macro base station or to a base station corresponding to a small cell. The small cell can include: metro cell, micro cell, pico cell, femto cell, etc. These small cells have the characteristics of small coverage area and low transmission power, and are suitable for providing high-speed data transmission services.

[0034] It should be understood that all or part of the functions of the communication device in this application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (e.g., a cloud platform).

[0035] Figure 2 A schematic diagram of a network architecture 200 according to an embodiment of this application is illustrated. This network architecture 200 describes the network architecture of a 5G NR / LTE / LTE-A system, which can also be referred to as a 5G system (5GS) / evolved packet system (EPS) network architecture. The network architecture 200 includes at least one of the following: network device 110, terminal device 120, 5G core network (5GC) / evolved packet core (EPC) 210, home subscriber server (HSS) / unified data management (UDM) 220, and Internet service 230. Figure 2 The network devices and terminal devices in the diagram are illustrated using RAN and UE as examples, respectively.

[0036] like Figure 2As shown, network device 110 provides user plane and control plane protocol termination to terminal device 120. Network device 110 is connected to 5GC / EPC 210 via an S1 / NG interface. 5GC / EPC 210 includes a mobility management entity (MME) / authentication management field (AMF) / session management function (SMF) 211, other MMEs / AMFs / SMFs 214, a service gateway (S-GW) / user plane function (UPF) 212, and a packet data network gateway (P-GW) / UPF 213. MME / AMF / SMF 211 is the control node that handles signaling between terminal device 120 and 5GC / EPC 210. Generally, MME / AMF / SMF 211 provides bearer and connection management. All user Internet Protocol (IP) packets are transmitted through the S-GW / UPF212, which is itself connected to the P-GW / UPF213. The P-GW provides UE IP address allocation and other functions. The P-GW / UPF213 is connected to Internet service 230. Internet service 230 includes operator-compliant Internet Protocol services, specifically including the Internet, intranet, IP multimedia subsystem (IMS), and packet-switched streaming services. It is evident that network architecture 200 provides packet-switched services; however, those skilled in the art will readily understand that the various concepts presented herein can be extended to networks providing circuit-switched services or other cellular networks.

[0037] Figure 3A and Figure 3B The following are schematic diagrams of the wireless protocol stack structure of one embodiment of this application. Figure 3A and Figure 3B This introduction uses the 5G wireless protocol stack as an example. The 5G wireless protocol stack is divided into two planes: the user plane (UP) protocol stack and the control plane (CP) protocol stack. The user plane protocol stack contains the protocol suite used for user data transmission, while the control plane protocol stack contains the protocol suite used for control signaling transmission in the 5G system. The specific names of each protocol stack layer are as follows:

[0038] like Figure 3AAs shown, the user plane protocol stack, from top to bottom, includes: the Service Data Adaptation Protocol (SDAP) layer, the Packet Data Convergence Protocol (PDCP) layer, the Radio Link Control (RLC) layer, the Medium Access Control (MAC) layer, and the Physical (PHY) layer.

[0039] like Figure 3B As shown, the control plane protocol stack, from top to bottom, includes: non-access stratum (NAS); radio resource control (RRC) layer, PDCP layer, RLC layer, MAC layer, and PHY layer.

[0040] It should be understood that the different layers in the above protocol stack have different functions, and they work together through inter-layer interaction to achieve communication between terminal devices and network devices. With the development of artificial intelligence technology, AI-assisted computing has permeated the processing implementation methods of the above protocol stack. For example, the scheduling algorithm of the MAC layer and the encoding / decoding algorithm of the PHY layer can apply artificial intelligence algorithms to improve the performance of communication algorithms.

[0041] As an example, Figure 3A and Figure 3B The wireless protocol architecture described herein is applicable to the terminal device described in this application.

[0042] As an example, Figure 3A and Figure 3B The wireless protocol architecture described herein is applicable to the network devices described in this application.

[0043] It should be understood that the interpretation of the terminology in the embodiments of this application may refer to the TS36, TS37 and TS38 series of specifications of the 3rd generation partnership project (3GPP), but may also refer to the specifications of the Institute of Electrical and Electronics Engineers (IEEE).

[0044] Multiple access technology

[0045] In cellular communication systems, mainstream multiple access methods include orthogonal multiple access (OMA), such as time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal frequency division multiple access (OFDMA), and single carrier FDMA (SC-FDMA). While OMA technology effectively avoids co-channel interference, its spectral efficiency is limited by resource granularity in high-load scenarios, failing to fully meet the demands of ultra-high connection density and high throughput. For next-generation wireless communication systems, such as 6G wireless networks, the challenges of providing ultra-high capacity, ultra-low latency, and massive connectivity necessitate the corresponding evolution of multiple access technologies.

[0046] As an example, how to design an efficient multiple access method or scheme has become an urgent problem to be solved in 6G networks.

[0047] To address challenges such as ultra-high capacity, ultra-low latency, and massive connectivity, several novel multiple access methods have been introduced. These new methods, through power domain superposition, signaling / message splitting, or code domain multiplexing, can support multiple terminal devices on the same time-frequency resources, thereby improving spectrum utilization.

[0048] The following section introduces several novel multiple access methods.

[0049] Non-orthogonal multiple access (NOMA) allows multiple terminal devices to transmit on the same frequency resources at the same time, achieving multiple access through the distinction between power domain and code domain. NOMA includes power domain NOMA (PD-NOMA) and code domain NOMA. PD-NOMA uses signal superposition and power allocation, superimposing terminal device signals of different power levels at the transmitting end, and decoding interference one by one at the receiving end using serial interference cancellation (SIC). In scenarios of network overload (the number of terminal devices far exceeds the number of resources), PD-NOMA significantly improves spectral efficiency through power domain multiplexing, allowing terminal devices in weak channels to obtain more power, thus contributing to improved fairness. Code domain NOMA achieves non-orthogonal multiplexing by assigning different codewords / sequences to terminal devices, such as sparse codes and shared sequences among multiple terminal devices.

[0050] In theory, NOMA can achieve capacity coverage in both uplink and downlink with a single antenna and outperforms orthogonal schemes under certain conditions. However, NOMA has limited gain in multi-antenna scenarios. When network devices (e.g., base stations) have multiple antennas, traditional space division multiple access (SDMA) often has higher multiplexing gain than NOMA. Furthermore, NOMA requires complex terminal device packetization, power allocation, and decoding sequence control, involving multiple layers of SiC at the receiver, resulting in high algorithm and signaling overhead. NOMA has high requirements for channel state information (CSI), and system performance degrades significantly when CSI is inaccurate. Therefore, NOMA is more suitable for downlink coverage and overload scenarios, while its benefits are not significant when there are many antennas and the network is not overloaded.

[0051] Rate-splitting multiple access (RSMA) flexibly handles interference by splitting messages from terminal devices. In downlink RSMA, each terminal device's message is split into a public part and a private part. All public parts are combined into a common signal (common message), which is broadcast to multiple terminal devices; each private part is a stream exclusively for that terminal device. Terminal devices can decode the common signal first, and then decode their own private stream, requiring only one layer of SIC (Separate Injection Channel). This strategy of partially decoding interference and partially treating interference as noise provides more flexible interference management than complete decoding or treating it entirely as noise. Uplink RSMA similarly allows the receiver to alternately decode sub-messages from terminal devices.

[0052] RSMA is considered a generalized multiple access framework that can softly integrate strategies such as OMA, PD-NOMA, SDMA, and multicast, and is also known as a superset of these schemes. When the split ratio is adjusted, RSMA can degenerate into special cases such as pure multicast, pure OMA, pure SDMA, or pure NOMA. Therefore, under any network load and channel conditions, RSMA performance is always no worse than any of the above schemes. RSMA's flexibility makes it suitable for various scenarios from underload to overload, and it achieves efficient interference utilization through partial interference decoding. In multi-antenna systems, RSMA can still achieve a large throughput gain when CSI is inaccurate, and it is more robust to imperfect CSI. Therefore, RSMA can approach capacity under perfect CSI (approaching "dirty paper coding" performance), and is significantly better than traditional schemes when CSI is imperfect. In addition, RSMA does not require complex user grouping and sequencing, and each terminal device only needs one SIC, resulting in relatively low design complexity.

[0053] RSMA is essentially an improvement and unification of the multi-input multiple-output (MIMO) transmission strategy. In 6G, RSMA will be combined with massive MIMO and very large-scale antenna arrays to achieve dual reuse in the spatial domain and power / message domain. For example, a network device with RSMA capability can serve multiple terminal devices through beamforming and optimize interference management within the beam using message splitting technology. This architecture is equivalent to enhanced multi-user MIMO (MU-MIMO). Specifically, a common signal is introduced on top of traditional SDMA, allowing each terminal device to decode the common information first and then decode its own proprietary signal. RSMA can soft-switch to extreme cases of SDMA or NOMA; for example, it is equivalent to SDMA when interference is very weak and close to NOMA when interference is very strong. This adaptive interference management avoids hard handover between SDMA and NOMA, providing a highly flexible convergence paradigm for 6G multiple access.

[0054] Sparse code multiple access (SCMA) is a non-orthogonal code domain approach proposed in 5G. Each terminal device is assigned a sparse codebook, and its bits are mapped to multidimensional complex signals, performing sparse pattern mapping across multiple resource blocks. Codewords from different terminal devices overlap on some resources, but each resource is simultaneously occupied by a small number of terminal devices (sparse interference), resulting in overall overload transmission (e.g., 6 terminal devices mapped to 4 resources). The receiver can construct a factor graph and efficiently detect multiple terminal devices using a message passing algorithm (MPA). SCMA can leverage multidimensional constellation design codebooks based on low-density signature (LDS) to achieve constellation shaping gain and higher overload capacity.

[0055] Compared to traditional code division multiple access (CDMA), SCMA allows for overloaded transmission when the number of terminal devices exceeds the number of resources, while using a sparse structure to keep the complexity of detecting multiple terminal devices within a feasible range. Therefore, SCMA is suitable for uplink IoT scenarios or high-concurrency access with small amounts of data, and can support random access by a large number of devices through offline codebook optimization.

[0056] Pattern division multiple access (PDMA) achieves non-orthogonal access by designing resource occupancy patterns specific to each terminal device. Each terminal device's data symbols are mapped to a resource group (which can consist of time, frequency, and spatial resources) and distributed according to a specific sparse pattern. Different terminal devices can share some or all of the resources but use different pattern patterns, forming separable multiple access signatures. These patterns aim to provide different diversity gains and sparsity characteristics, enabling the receiver to efficiently detect signals from multiple terminal devices using low-density graph algorithms. Low-density graph algorithms include belief propagation (BP). The receiver can also combine iterative reception (e.g., a Turbo receiver) to iteratively improve detection performance between demodulation and decoding.

[0057] Thanks to the diversity and sparsity of its pattern design, PDMA excels in uplink high-connectivity scenarios. Compared to OFDMA uplink, PDMA can support up to five times the number of terminal devices under a 1% packet loss rate. In PDMA, by assigning appropriate diversity order and power differences to different terminal device patterns, the receiver's SiC combined with a BP detector can effectively suppress interference propagation and significantly improve overload access performance. In summary, PDMA can fully utilize the combined resources of time, frequency, and spatial dimensions, allowing a large number of terminal devices to share the channel. Therefore, PDMA is more suitable for scenarios such as uplink massive machine-type communications (mMTC), and when extremely high connection density is required, performance and complexity can be balanced through pattern design and iterative testing.

[0058] Orthogonal Time-Frequency Space (OTFS) in Orthogonal Time-Frequency Space Multiple Access (OTFS-MA) is a novel modulation scheme for high-speed mobile communication. OTFS maps data symbols to the delay-Doppler plane, rather than the time-frequency plane of traditional Orthogonal Frequency Division Multiplexing (OFDM). Each symbol undergoes a two-dimensional transformation across the entire time-frequency resource to obtain modulation of the complete delay and Doppler characteristics of the time-varying channel. In OTFS-MA, different terminal devices can occupy different regions of the delay-Doppler plane, thus achieving differentiation within this domain. Orthogonal Delay-Doppler Division Multiplexing (ODDM), a variant proposed as a variation, achieves strictly orthogonal multiplexing on the delay-Doppler subdivision grid.

[0059] Because OTFS can concentrate energy in the delay-Doppler domain, it is highly robust to high-speed mobile and frequency-selective channels. Each symbol experiences the entire time-frequency channel, effectively achieving diversity across all multipath paths, thus avoiding the severe fading of OFDM under high-speed mobile conditions. ODDM can achieve orthogonal separation of terminal devices in the delay-Doppler domain, thus serving as a new orthogonal multiple access scheme. Furthermore, OTFS / ODDM can be combined with other multiple access technologies, such as incorporating SDMA or RSMA into OTFS modulation, achieving both high spectral efficiency and resistance to high-speed losses in high-speed scenarios. Therefore, OTFS-MA is more suitable for specific applications such as high-speed, high-reliability mobile communications.

[0060] Index modulation multiple access (IM-MA) is considered an enhancement to traditional NOMA, further improving the system's spectrum and energy efficiency with the same resources. Index modulation (IM) utilizes the index of resource elements to carry bit information. In IM-MA, in addition to transmitting data via traditional modulation symbols, terminal devices selectively activate certain resources to send additional "index bits." These resource indices can be on / off modes of time slots, subcarriers, antennas, spreading sequences, or even power levels. For example, a terminal device may selectively activate several possible subcarriers for transmission, and the activation mode itself carries additional bit information. Multiple terminal devices can share resources using different index modes.

[0061] Instant messaging (IM) technology can leverage resource indexing to deliver information, achieving an "exponential" increase in additional bit load, thus improving spectral efficiency without increasing bandwidth. Simultaneously, some IM solutions also improve energy efficiency because inactive resources can save power.

[0062] Non-orthogonal code multiple access (NOCA) enables terminal devices to share subcarriers non-orthogonally through coded sequences. Unlike OFDM, which requires orthogonal subcarriers, NOCA allows multiple terminal devices to reuse the same subcarrier, with data from each terminal device being transmitted superimposed. To achieve differentiation, each terminal device is assigned a carefully designed unique signature sequence (i.e., a coded sequence) to encode and expand its data. These sequences possess good autocorrelation and cross-correlation properties, enabling the receiver to distinguish between terminal devices even amidst interference from multiple devices. The receiver can employ joint detection / decoding techniques to simultaneously estimate the data from multiple terminal devices within the overlapping signal, effectively treating the interference as an additional source of information.

[0063] NOCA significantly improves spectrum utilization by allowing terminal devices to share the spectrum, and the number of terminal devices it can accommodate is several times greater than that of orthogonal schemes. NOCA transforms interference between multiple terminal devices from harmful to beneficial, extracting useful information through joint decoding. Simultaneously, the carefully designed coding sequence makes the system robust to random noise and external interference, effectively mitigating the impact of adjacent / co-channel interference. NOCA also supports flexible resource scheduling and dynamic terminal device management. The system can dynamically adjust the set of subcarriers shared by terminal devices based on their needs and channel requirements, achieving efficient spectrum utilization and fair access for terminal devices. Based on these characteristics, NOCA is particularly suitable for scenarios with high-density terminal devices, such as supporting more terminal devices in cellular networks or the concurrent access of massive numbers of IoT terminals.

[0064] The above provides an example of partial multiple access methods that can be used in next-generation communication systems. In actual communication, communication systems can also employ other multiple access technologies, such as multi-user shared access (MUSA) technology.

[0065] In communication systems, random access methods are associated with multiple access methods. Traditional scheduled orthogonal multiple access technologies (such as OFDMA and SC-FDMA) require the terminal device to first send an access request, and then the network device allocates resources. For example, in an NR system, the network device sends the root sequence of the random access code. The terminal device selects the preamble code using the root sequence and determines the RO by combining the association index between the synchronization signal block (SSB) and the random access channel occasion (RACH occasion, RO), thereby sending a random access request.

[0066] However, in some communication systems, there are scenarios where a large number of terminal devices simultaneously require access. In such scenarios, traditional access procedures not only lead to high signaling overhead and latency, but may also be unable to support ultra-large-scale data transmission. For example, in the 6G era, vehicle-to-everything (V2X), the Internet of Things (IoT), and large-scale sensor networks will bring about the simultaneous access demand of millions to tens of millions of terminal devices per square kilometer. If the process of terminal devices sending access requests and network devices allocating resources is still used, it will not only lead to high signaling overhead and latency, but also make it difficult to support ultra-large-scale short packet uplink. How to enable a large number of terminal devices in these communication systems to access simultaneously becomes a problem that needs to be solved.

[0067] Furthermore, in the subsequent development of communication technologies, multiple multiple access technologies will be integrated, or newer multiple access technologies will emerge. Therefore, random access technology will need to be compatible with multiple different multiple access technologies.

[0068] To address this issue, a novel random access scheme, unsourced random access (URA), has been proposed. In this scheme, terminal devices do not need to explicitly identify data when sending it; network devices only need to recover the "message set" without concern for the message's origin. This type of scheme offers advantages such as low signaling, low latency, and high concurrency, making it a key technology for scenarios like 6G.

[0069] However, the specific implementation of unidentified random access and how to support multiple multiple access methods are technical issues that require further consideration.

[0070] To address the aforementioned issues, this application proposes a method for wireless communication. Using this method, a terminal device can request unidentified random access from a network device via a first message. The first message can be sent based on a first method, and this first method is related to a first codebook, a first code block, and / or multiple signature sequences configured by the network device, all shared by multiple terminal devices. Therefore, multiple terminal devices can send messages for unidentified random access based on the same shared codebook, code block, or configured signature sequences, thereby improving system performance when a large number of terminal devices simultaneously perform random access.

[0071] It should be understood that in unidentified random access, network devices do not need to identify which terminal device the message comes from, and terminal devices can directly transmit data without sending an access request. Therefore, unidentified random access is also called an admission-free path.

[0072] To facilitate understanding, the following will be combined with... Figure 4 The present application provides an exemplary description of the method for wireless communication proposed in its embodiments. Figure 4 The method shown is explained from the perspective of the interaction between the first terminal device and the network device.

[0073] The first terminal device can be any of the terminal devices described above, such as a UE. In some embodiments, the first terminal device can support any of the multiple access methods described above. For example, the first terminal device can transmit and receive signals based on any of the multiple access methods. In other embodiments, the first terminal device can support any of the multiple access methods described above.

[0074] The first terminal device can be any one of multiple terminal devices. Multiple terminal devices can be terminal devices that simultaneously require access. In some embodiments, multiple terminal devices can simultaneously, and / or, send access requests or messages using the same resources.

[0075] As one implementation, the multiple terminal devices can be some or all of the active terminal devices in the first cell, such as K active terminal devices, where K is a positive integer. The first terminal device can be terminal device k among the K terminal devices.

[0076] A network device can be a network-side device that provides services to multiple terminal devices. In some embodiments, a network device can be a base station. In other embodiments, a network device includes a base station and a core network. For example, a network device is an integrated base station and core network device.

[0077] One implementation approach is for a network device to provide service to a first cell containing multiple terminal devices. While the network device provides service to the first cell, these terminal devices within the first cell are unknown and lack identification (ID) information.

[0078] As an implementation method, network devices can support any of the multiple access methods mentioned above for signal transmission and reception.

[0079] As an implementation method, network devices can perform multi-user detection in response to access requests or messages sent by multiple terminal devices.

[0080] In some embodiments, the first cell may support multiple multiple access modes. For example, provided that the OFDMA physical layer remains compatible, the first cell may support one or more multiple access modes such as OMA, NOMA, RSMA, SCMA, NOCA, OTFS, and MUSA coexisting with the admission-free path, and may perform adaptive handover and hybridization based on congestion conditions or scene changes.

[0081] Figure 4 The method shown includes steps S410 and S420, which are described below. It should be noted that the wireless communication method proposed in this application includes, but is not limited to, these steps.

[0082] See Figure 4 In step S410, the first terminal device sends a first message to the network device. The first message is used by the first terminal device to request unidentified random access from the network device; therefore, the first message does not include the ID of the first terminal device. In other words, the first message is a message that does not carry the ID of the first terminal device, and the first message can fulfill the access request of the first terminal device.

[0083] In one implementation, the first message includes an access request from the first terminal device. This request does not carry the ID of the first terminal device.

[0084] As one implementation, the first message includes the data to be sent by the first terminal device. In some scenarios, the first message may only include the data to be sent, excluding the access request, thereby enabling data transmission without an access request.

[0085] As one implementation, the first message includes the access request from the first terminal device and the data to be sent.

[0086] In some embodiments, the first message can be sent in a single transmission or repeatedly. It should be noted that repeatedly sending the first message refers to sending multiple copies in a single transmission, rather than retransmitting the first message.

[0087] The first terminal device sends a first message based on the first method. Since the first message is an access request without an ID, the first method differs from the method of sending a random access request in a traditional random access procedure. For example, with the first method, the first terminal device does not need to determine the RO based on the received synchronization signal, nor does it need to independently send a random access channel or preamble through the RO.

[0088] In some embodiments, the first method may refer to the method of sending access requests without carrying a terminal device ID. Because it does not carry a terminal device ID, multiple terminal devices, including the first terminal device, can send access requests in parallel. For example, multiple terminal devices can send multiple messages based on the first method. These multiple messages include the first message. The multiple messages are used by multiple terminal devices to request random access.

[0089] As mentioned above, the first terminal device is one of multiple terminal devices. The first method is related to one or more of the following: a first codebook shared by multiple terminal devices; multiple signature sequences configured by the network device for multiple terminal devices; and a first code block shared by multiple terminal devices. Therefore, the first method considers the scenario where multiple terminal devices simultaneously request access, enabling simultaneous access for a massive number of devices.

[0090] The first codebook is the same codebook shared by multiple terminal devices. The first method is related to the first codebook and can be understood as multiple terminal devices sending multiple messages based on the first codebook. In this case, the multiple terminal devices can be all terminal devices within the first cell, or all terminal devices in the terminal device group corresponding to the first codebook. In either case, all terminal devices send messages based on the first codebook that do not include the terminal device ID, to achieve unidentified random access. The network device does not need to identify which terminal device each message comes from; it only needs to reconstruct the message set.

[0091] As one implementation, the codebook size of the first codebook can be represented by the number of optional codebook indices for each level. For example, when the size of the first codebook is L (L is a positive integer), the number of optional indices for each level is L.

[0092] In some embodiments, when a first message is transmitted based on a first codebook, the length of the first message can be determined based on the length of the payload and the length of the check sequence. The length of the first message may include one or more sub-blocks for transmission using different uplink resources. A sub-block may correspond to a payload and a check sequence, which can be used for hierarchical verification.

[0093] As an implementation, each sub-block has two parts of information: one part is the "prefix check bits" used for cross-layer verification, i.e., the check sequence; the other part is the "payload bits" that the sub-block actually carries.

[0094] In one implementation, the first message corresponds to one or more sub-blocks. The number of bits in any one or more sub-blocks is the sum of the payload bits and the parity bits. For example, each message length is divided into B sub-blocks (B is a positive integer), and each sub-block carries r bits of payload plus p bits of parity.

[0095] In some embodiments, one or more sub-blocks corresponding to the first message are transmitted over one or more time units. That is, the first message can span one or more time units. This time unit can be a frame, subframe, time slot, sub-time slot, or symbol; this application does not limit this. Taking a sub-time slot as an example, the uplink frame is divided into T sub-time slots, where T is a positive integer. Each sub-time slot can contain M measurement symbols, where M is a positive integer. M measurement symbols can be equivalent to M-dimensional observations.

[0096] As one implementation, when the first message is sent based on tree coding and sparse mapping, each sub-slot can carry one sparse measurement. Within each sub-slot, the sub-blocks sent based on that sub-slot can generate a measurement matrix. This measurement matrix can be a known deterministic matrix for each layer. For example, the measurement matrix could be a structured sensing matrix generated from a common seed.

[0097] For example, for sub-slot b out of T sub-slots, the measurement matrix can be represented as A b ∈C M×L .

[0098] As one implementation, the number of sub-blocks corresponding to the first message is equal to the number of time units in which the first message is sent. For example, T = B. The B sub-blocks of the first message are sent through T sub-time slots.

[0099] In some embodiments, the first time unit is any one of one or more time units for sending the first message. The first codebook is used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index is used to generate a first vector. The codebook index is related to the codebook size of the first codebook. For example, the codebook index l is any value from 0 to L-1.

[0100] As one implementation, the first codebook index is the codebook index selected by terminal device k in sub-time slot b.

[0101] As one implementation, the first vector can be a sparse spreading vector.

[0102] As one implementation, the first vector is generated based on at least one of the following: the power control result of the first terminal device, the measurement matrix corresponding to the first time unit, and the sparse basis vector determined based on the first codebook index.

[0103] For example, the first vector X (k,b) satisfy:

[0104]

[0105] in, A represents the power of terminal device k (the first terminal device). b The measurement matrix for sub-slot b. Indicates the first codebook index. This represents a sparse basis vector where the first codebook index position is 1 and the rest are 0.

[0106] In some embodiments, the first codebook can be determined based on tree coding and / or sparse mapping. Multiple terminal devices can send multiple messages based on the codebook index, and the network device receives a composite observation vector. The network device does not need to distinguish the signal source; instead, after detecting which index positions are activated, it performs message concatenation using "tree constraints" in tree coding. Through message concatenation, the network device can recover the complete message set. "Tree constraints" can specify the correlation between bits in different time units. For example, the later the sub-slot, the more its prefix check bit must match the previously selected payload bits. The network device can then concatenate the candidate sub-blocks of each sub-slot layer by layer like building blocks, retaining only those paths with "check matching". When the last layer is processed, each remaining path corresponds to a complete message candidate.

[0107] In one implementation, one or more time units for sending the first message include a first time unit and a second time unit. The second time unit is located after the first time unit in the time domain. The parity bits in the sub-block sent by the second time unit are associated with the payload bits in the sub-block sent by the first time unit. That is, the parity bits of the later time unit in the time domain match the previously selected payload bits, thereby satisfying the "tree constraint" requirement.

[0108] In some embodiments, when multiple terminal devices send multiple messages through a wireless channel, the messages will be subject to fading and noise. The multiple signals arriving at the network device will be directly superimposed, as will be explained later in conjunction with Embodiment 1.

[0109] The network device configures multiple signature sequences for multiple terminal devices to send uplink signals, thereby achieving access control based on compressed sensing. The first method, related to the multiple signature sequences, can be understood as each terminal device selecting one signature sequence from these multiple sequences to send a first message. In this case, the multiple terminal devices can be all terminal devices within the first cell, or all terminal devices in the terminal device group corresponding to the multiple signature sequences.

[0110] It should be noted that signature / code domain permission-free access can be used for code domain non-orthogonal multiple access methods, such as SCMA, MUSA, and PDMA. Terminal devices achieve access through sparse signatures or low-correlation spread spectrum. Even if the number of terminal devices exceeds the number of orthogonal resources, simultaneous transmission is still possible.

[0111] As one implementation, the multiple signature sequences configured for a network device can be some or all of the signature sequences in a signature set.

[0112] As one implementation, the first terminal device selects one signature sequence from multiple signature sequences to send directly; this is the first signature sequence. Therefore, the first message includes the first signature sequence. The first signature sequence can also be jointly designed with the data to be sent.

[0113] As one implementation, multiple signature sequences can be a pre-configured set of signatures / codebooks for the network device, such as C = {c1, c2, ..., c...} L}, where L is a positive integer. The first signature sequence selected by the first terminal device can be represented as c l Let l be any value from 1 to L. For example, the value of L is 256. Therefore, each of multiple terminal devices can be bound to a set of sparse codebooks or associated signatures. Based on the bound codebooks or signature sequences, the terminal devices can directly transmit data without requiring an access request.

[0114] As an implementation approach, multiple signature sequences can be multiple low-correlation sequences or sparse codewords. That is, the design of multiple signature sequences should ideally satisfy low cross-correlation and good orthogonality, so that different terminal devices can be separated even when superimposed on the same resource element (RE). As an example, multiple sequences can be pseudo-random sequences or designed as sparse codewords to ensure low cross-correlation. Examples of pseudo-random sequences include m-sequences, Gold sequences, and ZC sequences. Examples of sparse codewords include SCMA codebooks.

[0115] The first signature sequence can be determined in several ways. In some embodiments, the first signature sequence is determined based on a set of signature IDs corresponding to a first terminal device. This set of signature IDs is determined according to pre-configuration information of the network device. In other embodiments, the first signature sequence is determined based on a first message or a random seed.

[0116] As one implementation, the first signature sequence is determined based on a set of signature IDs, which is a signature binding allocation method. That is, each terminal device can be pre-assigned a set of signature IDs, and one of them is randomly selected during access control to reduce the probability of continuous collisions. The number of IDs in a set of signature IDs can be specified by the protocol or determined by higher-level configuration. For example, a set of signature IDs may include four candidate IDs.

[0117] As one implementation method, based on the bits / random seed corresponding to the first message, the first terminal device can determine the first signature sequence through a hash function, thereby achieving the effect of signature randomization.

[0118] In some embodiments, multiple signature sequences are determined based on network device configuration information. The network device configuration information also indicates the mapping relationship between the multiple signature sequences and multiple REs, facilitating the transmission of data and pilot signals by the terminal devices on the relevant REs. Pilot signals can be used by the network device to monitor active signatures, thereby determining the signature sequences selected by the multiple terminal devices.

[0119] As one implementation, multiple REs are determined based on a first sparse pattern or a first sparse grid. The first sparse pattern is determined based on the sparse graph structure, thereby determining the sparsity in SCMA / PDMA scenarios. The first sparse grid can be grids partitioned in high mobility / Doppler scenarios. For example, in an OTFS-grant-free scenario, OTFS can fill the time-frequency domain with symbols and perform permissionless signature / sparse mapping in the delay-Doppler domain. After the terminal device selects a sparse grid / signature sequence, it maps it to an OTFS frame. The network device establishes a sparse detection model to jointly estimate activity and data; if this fails, the terminal device retransmits using a different sparse grid / signature.

[0120] In one implementation, any one of the multiple REs is used to carry at least one terminal device; that is, one RE can carry multiple terminal devices. For example, each RE can carry only N terminal devices, where N is a positive integer. N is, for example, 6.

[0121] As one implementation, each terminal device can select a signature sequence that occupies a limited number of REs to facilitate network device detection. This number can also be referred to as sparsity. That is, the first signature sequence occupying one or more REs can mean that the first signature sequence corresponds to one or more REs. For example, the first signature sequence can occupy only 2 REs, i.e., the sparsity is 2.

[0122] As one implementation, one or more REs that transmit the signature sequence are also used to carry the pilot sequence. That is, each signature sequence has a short pilot symbol superimposed on its sparse REs. This short pilot symbol can be multiplexed with the data symbols at the time-frequency position.

[0123] As an implementation approach, the length of the pilot sequence needs to meet the requirements of correlation detection. For example, the pilot length can be 2-4 symbols. That is, the number of symbols occupied by the pilot sequence is one of 2, 3, or 4.

[0124] The first coded block can be a shared coded block within the same coded structure. The first approach, related to the first coded block, can be understood as embedding multiple messages from multiple terminal devices into the same coded structure, allowing the recovery of these messages from multiple terminal devices through a single decoding operation. This same coded structure can be determined based on the encoding method to achieve permission-free access for that encoding method. For example, the same coded structure can be a leaf node in a polar code tree. Another example is the signature position within a low-density parity check (LDPC) layer. The signature position within an LDPC layer refers to the cyclic shift value corresponding to the non-zero sub-block in each layer after LDPC expansion. This cyclic shift value describes the connection pattern between that layer and the bit nodes, i.e., the characteristic signature of that layer.

[0125] It should be noted that multiple terminal devices can share the first coding block without authorization. These multiple terminal devices have not yet completed access and need to send multiple messages without authorization, that is, share a coding block within the same forward error correction code structure.

[0126] As one implementation, multiple terminal devices can write multiple messages at different index positions in a shared code tree, and the network device uses the corresponding decoder to jointly recover the message. If a conflict occurs between multiple terminal devices, the message can be retransmitted according to the index.

[0127] As one implementation method, the encoding method can be based on forward error correction coding technology, such as Polar codes, LDPC codes, linear block codes, convolutional codes, Turbo codes, Polar-LDPC codes, etc., and the embodiments of this application do not limit this.

[0128] In one implementation, the first coding block is a coding block of a forward error correction code structure. This forward error correction code structure can be determined by one of the different coding methods mentioned above. The first coding block can be one of multiple coding blocks. For example, the first coding block can be a frame's polar code or LDPC code. Multiple coding blocks can correspond to multiple frames respectively.

[0129] As one implementation, the transmission resources of the first coded block can be contiguous or discontinuous. For example, the first coded block can be mapped to a set of contiguous or semi-contiguous uplink resources.

[0130] In one implementation, the terminal device modulates and transmits the padded first coded block segment along with the pilot signal. The first coded block can be aligned with the pilot and demodulation reference signal (DMRS) template to facilitate unified channel estimation.

[0131] In some embodiments, the parameters of the first coding block include at least one of the following: the coding type corresponding to the first coding block; the coding parameters corresponding to the first coding block; the modulation and pilot template; the maximum number of write slots for the first coding block; and an index space for multiple terminal devices to select write slots. The coding type is, for example, a polar code or an LDPC code. The coding parameters are, for example, code length and rate. The maximum number of write slots for the first coding block may refer to the upper limit of the number of concurrent embeddings allowed in the first coding block.

[0132] It should be noted that the write slot in the first coding block refers to a pre-defined "position / share" within the shared forward error correction code block, which can be used by a terminal device to write its own short message. Therefore, the write slot is not a "time slot" of time-frequency resources, but rather a placeholder or small area in the coding structure, used to isolate the message bits of multiple terminal devices within the same code block, facilitating the separation of the content from different terminal devices after a single joint decoding.

[0133] In some embodiments, the first encoding block may include multiple write slots, allowing multiple terminal devices to embed their own short messages and necessary tags at different "write indices" of the first encoding block. When multiple terminal devices experience write conflicts, the index can be changed or a randomized placeholder can be used for retransmission according to rules, without having to perform the traditional four-step access process.

[0134] As one implementation, the index space can divide the bit positions (or writable positions in the check / freeze structure) of the first encoded block into several "resource pool sub-blocks". Each resource pool sub-block can carry the header and payload of a short message. In other words, the index space is used to divide the first encoded block into multiple write slots. The multiple write slots are independent or weakly correlated with each other, which facilitates separation during decoding.

[0135] In some embodiments, the multiple resource pools determined by the index space include a first resource pool corresponding to the first write slot. The first resource pool is determined based on one of the following methods: random allocation; deterministic allocation based on a random seed; or priority allocation based on service category. That is, multiple terminal devices can select resource pools according to the three methods of "random allocation", "deterministic allocation based on a seed", or "priority allocation based on service category" to reduce the probability of continuous collisions.

[0136] As an implementation method, random placeholder refers to the placeholder randomization rule. Network devices can issue hash rules or placeholder tables. The first terminal device can select one or a few time slots or symbols from the write index space according to the hash rules or random numbers.

[0137] As another implementation, the first terminal device needs to select resources based on rules. For example, when in a high-load window, the first terminal device can select a spare time slot, symbol, or time unit according to rules. Alternatively, these rules can be related to a seed or service category. The first terminal device can be assigned or determine a random seed based on rules, and then deterministically reserve a resource based on the resource pool corresponding to the seed. Or, if the first terminal device's service is urgent or has a high priority, it can preferentially select a suitable first resource pool.

[0138] In some embodiments, the plurality of write slots includes a first write slot selected by the first terminal device. The first write slot is used to carry the header and payload of the first message. The header of the first message is the header of the small packet to be sent by the first terminal device. This header and payload are concatenated to form a short message unit. The terminal device and the network device can agree on how the minimum header of each message is constructed. For example, the minimum header of the first message can consist of a session token, length hint, category label, and integrity check code, used for user separation and false detection suppression after decoding.

[0139] As one implementation, the header of the first message may include at least one of the following: a short random identifier, a length indicator, a category label, and an integrity checksum. The short random identifier can be used to associate the permissionless "write → decode → ACK" process within a single session with the network device and / or core network, avoiding the use of the terminal device's ID. This short random identifier can be implemented using tokens. The terminal device or network device can receive several tokens generated by an artificial intelligence (AI) model and determine priority information related to the semantic importance of each token.

[0140] As an implementation method, length indicators and category labels can facilitate network devices to perform block splitting and differentiated retransmission for different services.

[0141] As one implementation, the integrity checksum of the first message can be used to distinguish between single-user acknowledgment and multi-user acknowledgment. For example, the integrity checksum can employ a short cyclic redundancy check (CRC) or a lightweight integrity code.

[0142] In some embodiments, the first write slot can be one or more write slots. When the first write slot includes multiple write slots, the first message is repeatedly transmitted through these multiple write slots. That is, the first message can be written into multiple write slots of the first coding block. These multiple write slots are used to send multiple copies of the first message in a single transmission. Thus, the first coding block can support "multi-slot redundancy". If "multi-slot redundancy" is supported, different write slots can be repeated once or multiple times within the same time window to improve the success rate.

[0143] In some embodiments, the first approach can also be other approaches not mentioned above. For example, the first approach can be implemented based on ALOHA (Alternate Oscillator). In this approach, multiple terminal devices can send multiple messages based on degree distribution. Degree distribution can be used by the terminal devices to select the number of message replications and the time slot position. For example, the first terminal device groups the messages based on degree distribution and replicates them to multiple time slots; the network device performs iterative joint detection on the distribution graph to resolve conflicts. Specifically, after the first terminal selects the number of replications and the time slot position based on degree distribution, it can transmit multiple copies; the network device first parses the time slot of a single terminal device to subtract the unpacked packets from other conflicting time slots through joint detection, and iterates until convergence.

[0144] The preceding text introduced various implementation methods of the first method based on its related parameters. The configuration parameters for the first method can be configured using one or more of the following methods: broadcast configuration, semi-static configuration, and dynamic configuration. In other words, all parameters related to the first method can be indicated through broadcast / semi-static / dynamic configuration.

[0145] As one implementation, when the first method is associated with the first codebook, the network device can indicate parameters such as the transmission resources of multiple messages, the first codebook, the size of the first codebook, and the length of multiple messages through broadcast / semi-static / dynamic configuration.

[0146] As one implementation, when the first approach involves multiple signature sequences, the network device can indicate the set of signature sequences and the sparse mapping of each signature sequence to a fixed RE via broadcast / semi-static / dynamic configuration.

[0147] As one implementation, when the first approach relates to the first coding block, the network device can indicate the parameters of the first coding block through broadcast / semi-static / dynamic configuration. For example, the network device can publish a set of parameters for one or more "shared coding blocks" in broadcast signaling, including coding type, code length, rate, modulation and pilot templates, maximum allowed concurrent embedding limit, and description written to the index space.

[0148] See also Figure 4 In step S420, the network device decodes the messages based on the first method. The network device receives multiple messages sent by multiple terminal devices based on the first method and decodes them based on the first method to determine the multiple messages.

[0149] Decoding based on the first method can be understood as the network device determining how to perform detection and decoding according to the first method. As mentioned above, the first method can be associated with one or more of the first codebook, multiple signature sequences, and the first coded block.

[0150] When the first method is associated with the first codebook, multiple terminal devices send multiple messages based on the shared first codebook. The data packets from all terminal devices are physically superimposed in the air, and the receiving end of the network device obtains a composite observation vector. The network device does not need to distinguish the source of each signal (because of unidentified access), but only needs to detect which index positions are activated from this superimposed observation vector, and then reconstruct the complete message set by splicing it together using the corresponding constraint rules (e.g., tree constraints) of the first codebook.

[0151] As one implementation, when the first method relates to the first codebook, the network device performs detection based on each time unit. Taking a sub-time slot as an example, the network device can independently perform joint detection on each sub-time slot, thus obtaining a set of "candidate sub-blocks." Each candidate sub-block carries two parts of information: payload bits and check bits. Taking a tree constraint as an example, the network device concatenates the "payload bits" of each sub-block corresponding to different paths in chronological order (sub-time slots) to obtain a complete message bit string. Then, a final error check (e.g., CRC) is performed on each complete message. Messages that pass the final check are included in a "message set," ultimately resulting in multiple complete messages.

[0152] When the first method is associated with multiple signature sequences, multiple terminal devices select different signature sequences to send multiple messages. Network devices can construct observation windows, perform detection and channel estimation, and demodulate data from detected terminal devices.

[0153] As one implementation, when multiple signature sequences are associated, the network device performs detection based on an activity detection mechanism. The network device can detect all active terminal devices and data through correlation algorithms or sequence correlation elimination. The correlation algorithm can be any detection algorithm, and there is no limitation on it. For example, compressed sensing detection is used, which will be explained later in conjunction with Embodiment 2.

[0154] For example, an activity detection mechanism can be associated with a first parameter, which is determined based on the inner product of the network device's received signal and multiple signature sequences. The first parameter p l It can be represented as:

[0155] p l = <y n ,c l >, if |p l | 2 If the threshold is exceeded, the signature is considered activated.

[0156] Among them, y n This indicates the signal received by the network device, c l This represents the signature sequence of each candidate.

[0157] When the first method is associated with the first coded block, the network device performs a single decoding of the first coded block. A single decoding can refer to performing a single serial or parallel polarization decoding operation (e.g., step-by-step decision or list decoding). For example, the network device can determine bits layer by layer on the code tree and produce mixed soft and hard decision internal information, or perform sparse graph iterative decoding, or perform dedicated decoding or factor graph message passing that matches its structure, to obtain joint posterior information of variable nodes and the check satisfaction status. The network device can converge the contents of small packets that pass integrity checks into a message set and output it to the upper layer.

[0158] As one implementation, network devices can jointly recover multiple messages written by different terminal devices within the coded block by running the corresponding decoder (such as polarization decoding or LDPC decoding) only once at the receiving end.

[0159] As an implementation approach, a single decoding process is used to distinguish between multiple terminal devices. Network devices can utilize the structural constraints of the write index space to segment bit fields belonging to different write slots. For each identified write slot segment, the network device can read the token, length, and integrity checksum in the header to determine if it constitutes a signaling segment. If multiple inappropriate or unsuitable bit fields appear in the same write slot, they are marked as "collision candidates" and submitted to the collision resolution step.

[0160] As an implementation, network devices also perform unified channel estimation and frequency offset / timing correction on the resources of the first coding block.

[0161] In some embodiments, when multiple messages are successfully decoded, the network device sends data acknowledgments to multiple terminal devices. The network device can send data acknowledgments to multiple terminal devices, for example, by sending data acknowledgments in groups / batch / beams / broadcast via downlink information. When multiple messages fail to decode, the network device does not send data acknowledgments, or implicitly indicates decoding failure via downlink information.

[0162] As an implementation approach, when the network device successfully decodes the code, it may not need to send a separate acknowledgment (ACK).

[0163] As one implementation, when the first method is related to the first coded block, the network device can issue a short ACK list based on the received token; terminal devices not in the ACK list are considered to have failed decoding and execute a retransmission policy. This retransmission is sending a second message.

[0164] To facilitate understanding, the following will be combined with... Figure 5 Please provide an explanation. Figure 5 This is presented from the perspective of the interaction between multiple terminal devices and network devices. As mentioned earlier, multiple terminal devices include the first terminal device. Figure 5 The steps are as follows Figure 4 The subsequent process of the intermediate steps.

[0165] See Figure 5 In step S510, the network device sends data acknowledgments to multiple terminal devices. After the multiple terminal devices, including the first terminal device, send multiple messages to the network device, the network device decodes them using the first method. If decoding is successful, the network device sends data acknowledgments to the multiple terminal devices. If decoding fails, the network device can wait for the multiple terminal devices to send multiple new messages until decoding is successful, and then send data acknowledgments.

[0166] If the first terminal device does not receive a data acknowledgment for the first message within a certain time, or if it determines through implicit indication in the downlink information that the decoding of the first message has failed, the first terminal device can send a second message based on the first method. In other words, if the network device cannot decode the first message, the first terminal device does not need to resend the first message, but instead sends a new second message. It should be noted that the payload in the second message can be the same as the payload in the first message, only the parameters related to the first method or the transmission parameters are different.

[0167] As one implementation, if the first terminal device does not receive data confirmation, it sends a second message without needing to make an access request.

[0168] In some embodiments, the second message may satisfy at least one of the following: the random seed corresponding to the second message is different from the random seed corresponding to the first message; the power level corresponding to the second message is different from the power level corresponding to the first message; the second message includes a second signature sequence; the RE occupied by the second message is determined according to the second sparse pattern or the second sparse grid; the second message corresponds to a second write slot.

[0169] As one implementation, when the first method is associated with the first codebook, if the decoding of the first message fails, the first terminal device directly changes the random seed or power level in the next frame and sends the second message. The second message still retains the permissionless characteristic.

[0170] As one implementation, when the first method involves multiple signature sequences, if the decoding of the first message fails, the network device does not send an ACK; the first terminal device randomly changes the signature sequence, increases power, or shifts the time slot to send the second message. Therefore, the signature sequence corresponding to the second message is different from the first signature sequence. The power level corresponding to the second message is higher than that corresponding to the first message. Based on the time slot shift, the RE occupied by the second message is determined according to the second sparse grid point not used for the first sparse grid point.

[0171] As one implementation, if the network device fails to correctly recover the first message, the first terminal device can randomly change the signature / sparse pattern or increase the power level in the next window to send the second message until successful. Therefore, the REs occupied by the second message are determined based on a second sparse pattern that differs from the first sparse pattern.

[0172] As one implementation, when the first method is related to the first coded block, if the decoding of the first message fails, the first terminal device can slightly increase the transmission power or randomly change the write slot in the next window; no authorization signaling is required. Therefore, the first terminal device will select a second write slot different from the first write slot for the second message.

[0173] The above text combined Figure 4 and Figure 5 This document introduces various information related to the first approach. The following three embodiments illustrate three exemplary implementations of the first approach.

[0174] Example 1

[0175] In Embodiment 1, the first method involves sending messages based on the same first codebook. When the first codebook is determined based on tree coding and sparse mapping, an identifierless random access method based on tree coding and sparse mapping is implemented. Multiple terminal devices send multiple messages based on the first codebook, and the network device uses multi-user detection and tree constraint concatenation technology to recover the message set at the receiving end. Based on Embodiment 1, simultaneous access by a massive number of terminal devices can be achieved without requiring terminal device IDs and specific access requests.

[0176] As mentioned earlier, in sub-time slot b, terminal device k among multiple terminal devices will select a codebook index (the first codebook index). And generate a sparse spreading vector (first vector) X. (k,b) The sparse spreading vector X (k,b) as follows:

[0177]

[0178] In wireless channel propagation, the signals of each terminal device will experience fading due to the wireless channel and be affected by noise during air interface propagation. The fading coefficient is... Noise is n b Therefore, in sub-time slot b, the signal r from terminal device k arrives at network device r. (k,b) yes:

[0179]

[0180] After the signals from multiple terminal devices are superimposed to form a composite signal, the signals from all K active terminal devices within the same sub-time slot will be directly superimposed at the receiving end of the network device. Given the linear superposition characteristic of the wireless channel, the composite signal y... (b) for:

[0181]

[0182] Substituting the transmitted signal of each terminal device into the composite signal, the composite signal can be represented as:

[0183]

[0184] After receiving a composite signal, the network device does not need to distinguish the source of each signal; it only needs to observe the superimposed signal from the data. (b) The system detects which codebook indexes are active and then uses tree constraints to reconstruct the complete message set.

[0185] For the method in Embodiment 1, the terminal device does not need to send a terminal device ID and feature access request, resulting in extremely low signaling overhead; the network device can support multiple terminal devices to access concurrently within the same resource unit, achieving "overload transmission"; and the tree-constrained splicing mechanism significantly reduces the complexity of combinatorial search. This method can support large-scale MIMO and OTFS extensions, and maintains robustness in high-mobility scenarios; therefore, it is particularly suitable for 6G scenarios with massive short packets, low latency, and large-scale connections.

[0186] Example 2

[0187] In Example 2, all terminal devices send multiple messages based on a signature sequence set configured by the system. This method is simple to implement, particularly suitable for large-scale IoT terminal devices, and can significantly reduce the false detection rate when combined with beamforming under large-scale MIMO.

[0188] As mentioned earlier, each terminal device can be bound to a set of sparse codebooks or related signatures and transmit data directly without requiring an access request; network devices detect all active terminal devices and data through relevant algorithms; when decoding fails, the terminal device can randomly change the signature or sparse pattern and retransmit the message, thereby achieving efficient and robust high-volume concurrent access.

[0189] The signature sequence selected by the terminal device can be mapped to the sparse REs of the resource block of the corresponding multiple access technology. When transmitting a signal, the terminal device randomly selects a signature sequence c from the codebook set. l The encoded and modulated symbol s is sparsely mapped to generate the emission vector:

[0190]

[0191] Based on signature sequence c l The terminal device can simultaneously insert pilot symbols on the selected RE for channel estimation. The terminal device does not need to request permission and transmits directly to the network device.

[0192] Network devices can perform corresponding activity detection based on compressed sensing detection. Specifically, network devices can construct an overall observation model: y = Φa + n, where a is a sparse activation vector, 1 represents signature activation, and 0 represents inactivation; Φ is a measurement matrix composed of the pilots of all signature sequences.

[0193] As an example, network devices can use sparse recovery algorithms such as orthogonal matching pursuit (OMP) and approximate message passing (AMP) to detect the active signature set.

[0194] For a detected signature sequence, the network device can use the corresponding pilot symbols to estimate the channel gain using correlation methods. The channel estimation result is then input into joint detection. Correlation methods include, for example, least squares (LS) method / least squares estimation / minimum mean-square error (MMSE) channel estimation methods.

[0195] After completing the detection and decoding, the network device does not send an ACK separately, but instead sends a unified data confirmation to multiple terminal devices.

[0196] Compared to traditional orthogonal access, the method in Embodiment 2 enables permissionless access based on compressed sensing. Terminal devices do not need to execute the physical random access channel (PRACH) procedure and obtain access permission, significantly reducing signaling overhead and latency. The high concurrency of this method allows multiple terminal devices to access the same resource block simultaneously, with an overload factor exceeding 100%. For adaptive retransmission of the second message, if the decoding of the first message fails, only a random change of the signature sequence is needed, without complex scheduling. Furthermore, the method in Embodiment 2 is backward compatible, still based on OFDMA waveforms, thus supporting coexistence with traditional terminal devices.

[0197] Example 3

[0198] In Embodiment 3, multiple terminal devices can share a single coding block within the same forward error correction code structure without authorization. Each terminal device embeds its own short message and necessary markers at different "write indices" within this coding block. The network device only needs to run the corresponding decoder once at the receiving end to jointly recover multiple messages written by different terminal devices within the coding block. When a write conflict occurs, the terminal device can change the write index or randomize the placeholder according to rules and send a new message without performing the traditional four-step access procedure.

[0199] Compared to traditional orthogonal access, the method in Embodiment 3 can achieve permissionless access for polarization / LDPC encoding. Terminal devices do not need to execute PRACH procedures and access licenses, significantly reducing signaling overhead and latency. High concurrency features allow multiple terminal devices to access simultaneously within the same resource block, with an overload factor exceeding 100%. In case of message decoding failure, the adaptive retransmission feature allows terminal devices to simply randomly change write slots, eliminating the need for complex scheduling. Similarly, Embodiment 3 is backward compatible, supporting coexistence with traditional terminal devices.

[0200] The above text combined Figures 1 to 5 The method embodiments of this application are described in detail below. Figures 6 to 8The present application provides a detailed description of the apparatus embodiments. It should be understood that the descriptions of the apparatus embodiments correspond to the descriptions of the method embodiments; therefore, any parts not described in detail can be found in the foregoing method embodiments.

[0201] Figure 6 This is a schematic block diagram of a device for wireless communication according to an embodiment of this application. The device 600 can be any of the first terminal devices described above. Figure 6 The apparatus 600 shown includes a transmitting unit 610.

[0202] The sending unit 610 can be used to send a first message based on a first method; wherein the first message is used for the first terminal device to request unidentified random access from the network device, the first terminal device is one of a plurality of terminal devices, and the first method is related to one or more of the following: a first codebook shared by the plurality of terminal devices; a plurality of signature sequences configured by the network device for the plurality of terminal devices; and a first code block shared by the plurality of terminal devices.

[0203] Optionally, the first message corresponds to one or more sub-blocks, and the number of bits in any of the one or more sub-blocks is the sum of the number of payload bits and the number of parity bits.

[0204] Optionally, the one or more sub-blocks are transmitted through one or more time units, the one or more time units including a first time unit and a second time unit, the time domain position of the second time unit being after the time domain position of the first time unit, and the parity bits in the sub-blocks transmitted by the second time unit being associated with the payload bits in the sub-blocks transmitted by the first time unit.

[0205] Optionally, the first message is sent through one or more time units, the one or more time units including a first time unit, the first codebook being used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index being used to generate a first vector.

[0206] Optionally, the first terminal device is terminal device k among K terminal devices, where K is a positive integer, the first time unit is sub-time slot b, and the first vector satisfies:

[0207]

[0208] in, A represents the power of the terminal device k. b The measurement matrix for sub-slot b. This represents the index of the first codebook. This represents a sparse basis vector where the index position in the first codebook is 1 and the rest are 0.

[0209] Optionally, the first code is determined based on tree coding and / or sparse mapping.

[0210] Optionally, the plurality of signature sequences are determined based on the configuration information of the network device, and the configuration information is also used to indicate the mapping relationship between the plurality of signature sequences and the plurality of REs, wherein any one of the plurality of REs is used to carry at least one terminal device.

[0211] Optionally, the multiple signature sequences include a first signature sequence selected by the first terminal device, and the first message includes the first signature sequence.

[0212] Optionally, the first signature sequence is determined based on a set of signature identifiers corresponding to the first terminal device, wherein the set of signature identifiers is determined according to the pre-configuration information of the network device; or, the first signature sequence is determined based on the first message or a random seed.

[0213] Optionally, the first signature sequence corresponds to one or more REs, and the one or more REs are also used to carry pilot sequences, wherein the number of symbols occupied by the pilot sequences is one of 2, 3, or 4.

[0214] Optionally, the plurality of REs are determined based on a first sparse pattern or a first sparse grid.

[0215] Optionally, the first encoding block includes a plurality of write slots, the plurality of write slots including a first write slot selected by the first terminal device, the first write slot being used to carry the header and payload of the first message.

[0216] Optionally, the header of the first message includes at least one of the following: a short random identifier, a length indicator, a category label, and an integrity check code.

[0217] Optionally, the parameters of the first coding block include at least one of the following: the coding type corresponding to the first coding block; the coding parameters corresponding to the first coding block; the modulation and pilot template; the maximum number of write slots for the first coding block; and the index space for the plurality of terminal devices to select write slots.

[0218] Optionally, the index space is used to determine multiple resource pools, including a first resource pool corresponding to the first write slot. The first resource pool is determined based on one of the following methods: random placeholder; deterministic placeholder based on a random seed; or priority placeholder based on business category.

[0219] Optionally, when the first write slot includes multiple write slots, the first message is repeatedly transmitted through the multiple write slots.

[0220] Optionally, the first coding block is a coding block in a forward error correction code structure.

[0221] Optionally, the sending unit 610 is further configured to send a second message based on the first method when the first message decoding fails, wherein the second message satisfies at least one of the following: the random seed corresponding to the second message is different from the random seed corresponding to the first message; the power level corresponding to the second message is different from the power level corresponding to the first message; the second message includes a second signature sequence; the RE occupied by the second message is determined according to the second sparse pattern or the second sparse grid; and the second message corresponds to a second write slot.

[0222] Optionally, the configuration parameters corresponding to the first method can be configured in one or more of the following ways: broadcast configuration, semi-static configuration, and dynamic configuration.

[0223] Optionally, the transmitting unit 610 in device 600 can be a transceiver 830, and device 600 may also include a processor 810 and a memory 820, specifically as follows: Figure 8 As shown.

[0224] Figure 7 This is a schematic block diagram of another device for wireless communication according to an embodiment of this application. The device 700 can be any of the network devices described above. Figure 7 The apparatus 700 shown includes a receiving unit 710 and a processing unit 720.

[0225] The receiving unit 710 can be used to receive multiple messages from multiple terminal devices.

[0226] Processing unit 720 can be used to decode based on a first method to determine the plurality of messages; wherein the plurality of messages are used for the plurality of terminal devices to request unidentified random access, the plurality of terminal devices including a first terminal device, the plurality of messages including a first message, and the first method is related to one or more of the following: a first codebook shared by the plurality of terminal devices; a plurality of signature sequences configured by the network device for the plurality of terminal devices; and a first code block shared by the plurality of terminal devices.

[0227] Optionally, the first message corresponds to one or more sub-blocks, and the number of bits in any of the one or more sub-blocks is the sum of the number of payload bits and the number of parity bits.

[0228] Optionally, the one or more sub-blocks are transmitted through one or more time units, the one or more time units including a first time unit and a second time unit, the time domain position of the second time unit being after the time domain position of the first time unit, and the parity bits in the sub-blocks transmitted by the second time unit being associated with the payload bits in the sub-blocks transmitted by the first time unit.

[0229] Optionally, the first message is sent through one or more time units, the one or more time units including a first time unit, the first codebook being used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index being used to generate a first vector.

[0230] Optionally, the first terminal device is terminal device k among K terminal devices, where K is a positive integer, the first time unit is sub-time slot b, and the first vector satisfies:

[0231]

[0232] in, A represents the power of the terminal device k. b The measurement matrix for sub-slot b. This represents the index of the first codebook. This represents a sparse basis vector where the index position in the first codebook is 1 and the rest are 0.

[0233] Optionally, the first code is determined based on tree coding and / or sparse mapping.

[0234] Optionally, the plurality of signature sequences are determined based on the configuration information of the network device. The configuration information is also used to indicate the mapping relationship between the plurality of signature sequences and the plurality of resource units (REs). Any one of the plurality of REs is used to carry at least one terminal device.

[0235] Optionally, the multiple signature sequences include a first signature sequence selected by the first terminal device, and the first message includes the first signature sequence.

[0236] Optionally, the first signature sequence is determined based on a set of signature identifiers corresponding to the first terminal device, wherein the set of signature identifiers is determined according to the pre-configuration information of the network device; or, the first signature sequence is determined based on the first message or a random seed.

[0237] Optionally, the first signature sequence corresponds to one or more REs, and the one or more REs are also used to carry pilot sequences, wherein the number of symbols occupied by the pilot sequences is one of 6, 3, or 4.

[0238] Optionally, the plurality of REs are determined based on a first sparse pattern or a first sparse grid.

[0239] Optionally, the first encoding block includes a plurality of write slots, the plurality of write slots including a first write slot selected by the first terminal device, the first write slot being used to carry the header and payload of the first message.

[0240] Optionally, the header of the first message includes at least one of the following: a short random identifier, a length indicator, a category label, and an integrity check code.

[0241] Optionally, the parameters of the first coding block include at least one of the following: the coding type corresponding to the first coding block; the coding parameters corresponding to the first coding block; the modulation and pilot template; the maximum number of write slots for the first coding block; and the index space for the plurality of terminal devices to select write slots.

[0242] Optionally, the index space is used to determine multiple resource pools, including a first resource pool corresponding to the first write slot. The first resource pool is determined based on one of the following methods: random placeholder; deterministic placeholder based on a random seed; or priority placeholder based on a business category.

[0243] Optionally, when the first write slot includes multiple write slots, the first message is repeatedly transmitted through the multiple write slots.

[0244] Optionally, the first coding block is a coding block in a forward error correction code structure.

[0245] Optionally, the processing unit 720 is configured to perform one or more of the following: when the first mode is associated with the first codebook, perform detection based on each time unit; when the first mode is associated with the plurality of signature sequences, perform detection based on an active detection mechanism; when the first mode is associated with the first code block, perform single decoding on the first code block.

[0246] Optionally, the activity detection mechanism is related to a first parameter, which is determined based on the inner product of the received signal of the network device and the plurality of signature sequences.

[0247] Optionally, the device 700 also includes a sending unit, which can be used to send data confirmation to multiple terminal devices after multiple messages have been successfully decoded.

[0248] Optionally, the configuration parameters corresponding to the first method can be configured in one or more of the following ways: broadcast configuration, semi-static configuration, and dynamic configuration.

[0249] Optionally, the receiving unit 710 in the device 700 can be a transceiver 830, the processing unit 720 can be a processor 810, and the device 700 may also include a memory 820, specifically as follows: Figure 8 As shown.

[0250] Figure 8 The diagram shown is a structural schematic of a communication device according to an embodiment of this application. Figure 8 The dashed lines indicate that the unit or module is optional. The device 800 can be used to implement the methods described in the above method embodiments. The device 800 can be a chip, a terminal device, or a network device.

[0251] The apparatus 800 may include one or more processors 810. The processor 810 may support the apparatus 800 in implementing the methods described in the preceding method embodiments. The processor 810 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0252] The apparatus 800 may further include one or more memories 820. The memories 820 store a program that can be executed by the processor 810, causing the processor 810 to perform the methods described in the preceding method embodiments. The memories 820 may be independent of the processor 810 or integrated within the processor 810.

[0253] The device 800 may also include a transceiver 830. The processor 810 can communicate with other devices or chips via the transceiver 830. For example, the processor 810 can send and receive data with other devices or chips via the transceiver 830.

[0254] This application also provides a computer-readable storage medium for storing a program. This computer-readable storage medium can be applied to a terminal device or network device provided in this application embodiment, and the program causes a computer to execute the methods performed by the terminal device or network device in the various embodiments of this application.

[0255] The computer-readable storage medium can be any available medium that a computer can read, or a data storage device such as a server or data center that integrates one or more available media. The available medium can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs, DVDs), or semiconductor media (e.g., solid-state disks, SSDs), etc.

[0256] This application also provides a computer program product. The computer program product includes a program. This computer program product can be applied to a terminal device or network device provided in the embodiments of this application, and the program causes a computer to execute the methods performed by the terminal device or network device in the various embodiments of this application.

[0257] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means.

[0258] This application also provides a computer program. This computer program can be applied to a terminal device or network device provided in this application, and the computer program causes the computer to execute the methods performed by the terminal or network device in various embodiments of this application.

[0259] In this application, the terms "system" and "network" are used interchangeably. Furthermore, the terminology used in this application is only for explaining specific embodiments of the application and is not intended to limit the application. The terms "first," "second," "third," and "fourth," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, not to describe a specific order. In addition, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion.

[0260] In the embodiments of this application, the term "instruction" can be a direct instruction, an indirect instruction, or an indication of a relationship. For example, A instructing B can mean that A directly instructs B, such as B being able to obtain information through A; it can also mean that A indirectly instructs B, such as A instructing C, so B can obtain information through C; or it can mean that there is a relationship between A and B.

[0261] In the embodiments of this application, the term "correspondence" may indicate a direct or indirect correspondence between two things, or an association between two things, or a relationship such as instruction and being instructed, configuration and being configured.

[0262] In the embodiments of this application, "predefined" or "preconfigured" can be implemented by pre-storing corresponding codes, tables, or other means that can be used to indicate relevant information in the device (e.g., including terminal devices and network devices). This application does not limit the specific implementation method. For example, predefined can refer to what is defined in the protocol.

[0263] In the embodiments of this application, the term "protocol" may refer to standard protocols in the field of communications, such as LTE protocols, NR protocols, and related protocols applied in future communication systems. This application does not limit the scope of these protocols.

[0264] In the embodiments of this application, determining B based on A does not mean determining B solely based on A; B can also be determined based on A and / or other information.

[0265] In the embodiments of this application, the term "and / or" is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following related objects have an "or" relationship.

[0266] In the embodiments of this application, the order of the above-mentioned process numbers does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0267] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0268] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0269] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0270] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for wireless communication, characterized in that, include: The first terminal device sends the first message based on the first method; Wherein, the first message is used by the first terminal device to request unidentified random access from the network device, the first terminal device is one of a plurality of terminal devices, and the first method is related to one or more of the following: The first encoding book shared by the multiple terminal devices; The network device is configured with multiple signature sequences for the multiple terminal devices; The first coding block shared by the multiple terminal devices.

2. The method according to claim 1, characterized in that, The first message corresponds to one or more sub-blocks, and the number of bits in any of the one or more sub-blocks is the sum of the number of payload bits and the number of parity bits.

3. The method according to claim 2, characterized in that, The one or more sub-blocks are transmitted through one or more time units, the one or more time units including a first time unit and a second time unit, the time domain position of the second time unit is after the time domain position of the first time unit, and the parity bits in the sub-blocks transmitted by the second time unit are associated with the payload bits in the sub-blocks transmitted by the first time unit.

4. The method according to any one of claims 1-3, characterized in that, The first message is sent through one or more time units, the one or more time units including a first time unit, the first codebook is used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index is used to generate a first vector.

5. The method according to claim 4, characterized in that, The first terminal device is terminal device k among K terminal devices, where K is a positive integer, the first time unit is sub-time slot b, and the first vector satisfies: in, A represents the power of the terminal device k. b The measurement matrix for sub-slot b. This represents the index of the first codebook. This represents a sparse basis vector where the index position in the first codebook is 1 and the rest are 0.

6. The method according to any one of claims 1-5, characterized in that, The first encoding is determined based on tree encoding and / or sparse mapping.

7. The method according to claim 1, characterized in that, The plurality of signature sequences are determined based on the configuration information of the network device. The configuration information is also used to indicate the mapping relationship between the plurality of signature sequences and the plurality of resource units (REs). Any one of the plurality of REs is used to carry at least one terminal device.

8. The method according to claim 1 or 7, characterized in that, The plurality of signature sequences includes a first signature sequence selected by the first terminal device, and the first message includes the first signature sequence.

9. The method according to claim 8, characterized in that, The first signature sequence is determined based on a set of signature identifiers corresponding to the first terminal device, and the set of signature identifiers is determined according to the pre-configuration information of the network device; or, the first signature sequence is determined based on the first message or a random seed.

10. The method according to claim 8 or 9, characterized in that, The first signature sequence corresponds to one or more REs, and the one or more REs are also used to carry pilot sequences, the number of symbols occupied by the pilot sequences being one of 2, 3, or 4.

11. The method according to any one of claims 7-10, characterized in that, The plurality of REs are determined based on a first sparse pattern or a first sparse grid.

12. The method according to claim 1, characterized in that, The first encoding block includes multiple write slots, including a first write slot selected by the first terminal device, which is used to carry the header and payload of the first message.

13. The method according to claim 12, characterized in that, The header of the first message includes at least one of the following: a short random identifier, a length indicator, a category label, and an integrity check code.

14. The method according to claim 12 or 13, characterized in that, The parameters of the first coded block include at least one of the following: The encoding type corresponding to the first encoding block; The encoding parameters corresponding to the first encoding block; Modulation and pilot template; The maximum number of write slots for the first encoding block; The index space used by the plurality of terminal devices to select the write slot.

15. The method according to claim 14, characterized in that, The index space is used to determine multiple resource pools, including a first resource pool corresponding to the first write slot, wherein the first resource pool is determined based on one of the following methods: Random placeholder; Deterministic placeholders based on random seeds; Prioritization based on business category.

16. The method according to any one of claims 12-15, characterized in that, When the first write slot includes multiple write slots, the first message is repeatedly transmitted through the multiple write slots.

17. The method according to any one of claims 12-16, characterized in that, The first coding block is a coding block in the forward error correction code structure.

18. The method according to any one of claims 1-17, characterized in that, The method further includes: When the decoding of the first message fails, the first terminal device sends a second message based on the first method, wherein the second message satisfies at least one of the following: The random seed corresponding to the second message is different from the random seed corresponding to the first message; The power level corresponding to the second message is different from the power level corresponding to the first message; The second message includes a second signature sequence; The RE occupied by the second message is determined based on the second sparse pattern or the second sparse grid. The second message corresponds to the second write slot.

19. The method according to any one of claims 1-18, characterized in that, The configuration parameters corresponding to the first method can be configured in one or more of the following ways: broadcast configuration, semi-static configuration, and dynamic configuration.

20. A method for wireless communication, characterized in that, include: The network device receives multiple messages from multiple terminal devices; The network device decodes the messages based on a first method to determine the plurality of messages; The plurality of messages are used by the plurality of terminal devices to request unidentified random access, the plurality of terminal devices including a first terminal device, the plurality of messages including a first message, and the first method being related to one or more of the following: The first encoding book shared by the multiple terminal devices; The network device is configured with multiple signature sequences for the multiple terminal devices; The first coding block shared by the multiple terminal devices.

21. The method according to claim 20, characterized in that, The first message corresponds to one or more sub-blocks, and the number of bits in any of the one or more sub-blocks is the sum of the number of payload bits and the number of parity bits.

22. The method according to claim 21, characterized in that, The one or more sub-blocks are transmitted through one or more time units, the one or more time units including a first time unit and a second time unit, the time domain position of the second time unit is after the time domain position of the first time unit, and the parity bits in the sub-blocks transmitted by the second time unit are associated with the payload bits in the sub-blocks transmitted by the first time unit.

23. The method according to any one of claims 20-22, characterized in that, The first message is sent through one or more time units, the one or more time units including a first time unit, the first codebook is used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index is used to generate a first vector.

24. The method according to claim 23, characterized in that, The first terminal device is terminal device k among K terminal devices, where K is a positive integer, the first time unit is sub-time slot b, and the first vector satisfies: in, A represents the power of the terminal device k. b The measurement matrix for sub-slot b. This represents the index of the first codebook. This represents a sparse basis vector where the index position in the first codebook is 1 and the rest are 0.

25. The method according to any one of claims 20-24, characterized in that, The first encoding is determined based on tree encoding and / or sparse mapping.

26. The method according to claim 20, characterized in that, The plurality of signature sequences are determined based on the configuration information of the network device. The configuration information is also used to indicate the mapping relationship between the plurality of signature sequences and the plurality of resource units (REs). Any one of the plurality of REs is used to carry at least one terminal device.

27. The method according to claim 20 or 26, characterized in that, The plurality of signature sequences includes a first signature sequence selected by the first terminal device, and the first message includes the first signature sequence.

28. The method according to claim 27, characterized in that, The first signature sequence is determined based on a set of signature identifiers corresponding to the first terminal device, and the set of signature identifiers is determined according to the pre-configuration information of the network device; or, the first signature sequence is determined based on the first message or a random seed.

29. The method according to claim 27 or 28, characterized in that, The first signature sequence corresponds to one or more REs, and the one or more REs are also used to carry pilot sequences, the number of symbols occupied by the pilot sequences being one of 2, 3, or 4.

30. The method according to any one of claims 26-29, characterized in that, The plurality of REs are determined based on a first sparse pattern or a first sparse grid.

31. The method according to claim 20, characterized in that, The first encoding block includes multiple write slots, including a first write slot selected by the first terminal device, which is used to carry the header and payload of the first message.

32. The method according to claim 31, characterized in that, The header of the first message includes at least one of the following: a short random identifier, a length indicator, a category label, and an integrity check code.

33. The method according to claim 31 or 32, characterized in that, The parameters of the first coded block include at least one of the following: The encoding type corresponding to the first encoding block; The encoding parameters corresponding to the first encoding block; Modulation and pilot template; The maximum number of write slots for the first encoding block; The index space used by the plurality of terminal devices to select the write slot.

34. The method according to claim 33, characterized in that, The index space is used to determine multiple resource pools, including a first resource pool corresponding to the first write slot, wherein the first resource pool is determined based on one of the following methods: Random placeholder; Deterministic placeholders based on random seeds; Prioritization based on business category.

35. The method according to any one of claims 31-34, characterized in that, When the first write slot includes multiple write slots, the first message is repeatedly transmitted through the multiple write slots.

36. The method according to any one of claims 31-35, characterized in that, The first coding block is a coding block in the forward error correction code structure.

37. The method according to any one of claims 20-36, characterized in that, The network device performs decoding based on the first method, including one or more of the following: When the first method is related to the first codebook, the network device performs detection based on each time unit; When the first method is associated with the plurality of signature sequences, the network device performs detection based on an active detection mechanism; When the first method is associated with the first coded block, the network device performs a single decoding of the first coded block.

38. The method according to claim 37, characterized in that, The activity detection mechanism is related to a first parameter, which is determined based on the inner product of the received signal of the network device and the plurality of signature sequences.

39. The method according to any one of claims 20-38, characterized in that, The method further includes: After the multiple messages are successfully decoded, the network device sends a data confirmation to the multiple terminal devices.

40. The method according to any one of claims 20-39, characterized in that, The configuration parameters corresponding to the first method can be configured in one or more of the following ways: broadcast configuration, semi-static configuration, and dynamic configuration.

41. A device for wireless communication, characterized in that, The device is a first terminal device, and the device includes: The sending unit is used to send a first message based on a first method; Wherein, the first message is used by the first terminal device to request unidentified random access from the network device, the first terminal device is one of a plurality of terminal devices, and the first method is related to one or more of the following: The first encoding book shared by the multiple terminal devices; The network device is configured with multiple signature sequences for the multiple terminal devices; The first coding block shared by the multiple terminal devices.

42. The apparatus according to claim 41, characterized in that, The first message corresponds to one or more sub-blocks, and the number of bits in any of the one or more sub-blocks is the sum of the number of payload bits and the number of parity bits.

43. The apparatus according to claim 42, characterized in that, The one or more sub-blocks are transmitted through one or more time units, the one or more time units including a first time unit and a second time unit, the time domain position of the second time unit is after the time domain position of the first time unit, and the parity bits in the sub-blocks transmitted by the second time unit are associated with the payload bits in the sub-blocks transmitted by the first time unit.

44. The apparatus according to any one of claims 41-43, characterized in that, The first message is sent through one or more time units, the one or more time units including a first time unit, the first codebook is used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index is used to generate a first vector.

45. The apparatus according to claim 44, characterized in that, The first terminal device is terminal device k among K terminal devices, where K is a positive integer, the first time unit is sub-time slot b, and the first vector satisfies: in, A represents the power of the terminal device k. b The measurement matrix for sub-slot b. This represents the index of the first codebook. This represents a sparse basis vector where the index position in the first codebook is 1 and the rest are 0.

46. ​​The apparatus according to any one of claims 41-45, characterized in that, The first encoding is determined based on tree encoding and / or sparse mapping.

47. The apparatus according to claim 41, characterized in that, The plurality of signature sequences are determined based on the configuration information of the network device. The configuration information is also used to indicate the mapping relationship between the plurality of signature sequences and the plurality of resource units (REs). Any one of the plurality of REs is used to carry at least one terminal device.

48. The apparatus according to claim 41 or 47, characterized in that, The plurality of signature sequences includes a first signature sequence selected by the first terminal device, and the first message includes the first signature sequence.

49. The apparatus according to claim 48, characterized in that, The first signature sequence is determined based on a set of signature identifiers corresponding to the first terminal device, and the set of signature identifiers is determined according to the pre-configuration information of the network device; or, the first signature sequence is determined based on the first message or a random seed.

50. The apparatus according to claim 48 or 49, characterized in that, The first signature sequence corresponds to one or more REs, and the one or more REs are also used to carry pilot sequences, the number of symbols occupied by the pilot sequences being one of 2, 3, or 4.

51. The apparatus according to any one of claims 47-50, characterized in that, The plurality of REs are determined based on a first sparse pattern or a first sparse grid.

52. The apparatus according to claim 41, characterized in that, The first encoding block includes multiple write slots, including a first write slot selected by the first terminal device, which is used to carry the header and payload of the first message.

53. The apparatus according to claim 52, characterized in that, The header of the first message includes at least one of the following: a short random identifier, a length indicator, a category label, and an integrity check code.

54. The apparatus according to claim 52 or 53, characterized in that, The parameters of the first coded block include at least one of the following: The encoding type corresponding to the first encoding block; The encoding parameters corresponding to the first encoding block; Modulation and pilot template; The maximum number of write slots for the first encoding block; The index space used by the plurality of terminal devices to select the write slot.

55. The apparatus according to claim 54, characterized in that, The index space is used to determine multiple resource pools, including a first resource pool corresponding to the first write slot, wherein the first resource pool is determined based on one of the following methods: Random placeholder; Deterministic placeholders based on random seeds; Prioritization based on business category.

56. The apparatus according to any one of claims 52-55, characterized in that, When the first write slot includes multiple write slots, the first message is repeatedly transmitted through the multiple write slots.

57. The apparatus according to any one of claims 52-56, characterized in that, The first coding block is a coding block in the forward error correction code structure.

58. The apparatus according to any one of claims 41-57, characterized in that, The transmitting unit is further configured to: When the decoding of the first message fails, a second message is sent based on the first method, wherein the second message satisfies at least one of the following: The random seed corresponding to the second message is different from the random seed corresponding to the first message; The power level corresponding to the second message is different from the power level corresponding to the first message; The second message includes a second signature sequence; The RE occupied by the second message is determined based on the second sparse pattern or the second sparse grid. The second message corresponds to the second write slot.

59. The apparatus according to any one of claims 41-58, characterized in that, The configuration parameters corresponding to the first method can be configured in one or more of the following ways: broadcast configuration, semi-static configuration, and dynamic configuration.

60. An apparatus for wireless communication, characterized in that, The device is a network device, and the device includes: The receiving unit is used to receive multiple messages from multiple terminal devices; A processing unit is configured to decode based on a first method to determine the plurality of messages; The plurality of messages are used by the plurality of terminal devices to request unidentified random access, the plurality of terminal devices including a first terminal device, the plurality of messages including a first message, and the first method being related to one or more of the following: The first encoding book shared by the multiple terminal devices; The network device is configured with multiple signature sequences for the multiple terminal devices; The first coding block shared by the multiple terminal devices.

61. The apparatus according to claim 60, characterized in that, The first message corresponds to one or more sub-blocks, and the number of bits in any of the one or more sub-blocks is the sum of the number of payload bits and the number of parity bits.

62. The apparatus according to claim 61, characterized in that, The one or more sub-blocks are transmitted through one or more time units, the one or more time units including a first time unit and a second time unit, the time domain position of the second time unit is after the time domain position of the first time unit, and the parity bits in the sub-blocks transmitted by the second time unit are associated with the payload bits in the sub-blocks transmitted by the first time unit.

63. The apparatus according to any one of claims 60-62, characterized in that, The first message is sent through one or more time units, the one or more time units including a first time unit, the first codebook is used by the first terminal device to select a first codebook index corresponding to the first time unit, and the first codebook index is used to generate a first vector.

64. The apparatus according to claim 63, characterized in that, The first terminal device is terminal device k among K terminal devices, where K is a positive integer, the first time unit is sub-time slot b, and the first vector satisfies: in, A represents the power of the terminal device k. b The measurement matrix for sub-slot b. This represents the index of the first codebook. This represents a sparse basis vector where the index position in the first codebook is 1 and the rest are 0.

65. The apparatus according to any one of claims 60-64, characterized in that, The first encoding is determined based on tree encoding and / or sparse mapping.

66. The apparatus according to claim 60, characterized in that, The plurality of signature sequences are determined based on the configuration information of the network device. The configuration information is also used to indicate the mapping relationship between the plurality of signature sequences and the plurality of resource units (REs). Any one of the plurality of REs is used to carry at least one terminal device.

67. The apparatus according to claim 60 or 66, characterized in that, The plurality of signature sequences includes a first signature sequence selected by the first terminal device, and the first message includes the first signature sequence.

68. The apparatus according to claim 67, characterized in that, The first signature sequence is determined based on a set of signature identifiers corresponding to the first terminal device, and the set of signature identifiers is determined according to the pre-configuration information of the network device; or, the first signature sequence is determined based on the first message or a random seed.

69. The apparatus according to claim 67 or 68, characterized in that, The first signature sequence corresponds to one or more REs, and the one or more REs are also used to carry pilot sequences, the number of symbols occupied by the pilot sequences being one of 6, 3, or 4.

70. The apparatus according to any one of claims 66-69, characterized in that, The plurality of REs are determined based on a first sparse pattern or a first sparse grid.

71. The apparatus according to claim 60, characterized in that, The first encoding block includes multiple write slots, including a first write slot selected by the first terminal device, which is used to carry the header and payload of the first message.

72. The apparatus according to claim 71, characterized in that, The header of the first message includes at least one of the following: a short random identifier, a length indicator, a category label, and an integrity check code.

73. The apparatus according to claim 71 or 72, characterized in that, The parameters of the first coded block include at least one of the following: The encoding type corresponding to the first encoding block; The encoding parameters corresponding to the first encoding block; Modulation and pilot template; The maximum number of write slots for the first encoding block; The index space used by the plurality of terminal devices to select the write slot.

74. The apparatus according to claim 73, characterized in that, The index space is used to determine multiple resource pools, including a first resource pool corresponding to the first write slot, wherein the first resource pool is determined based on one of the following methods: Random placeholder; Deterministic placeholders based on random seeds; Prioritization based on business category.

75. The apparatus according to any one of claims 71-74, characterized in that, When the first write slot includes multiple write slots, the first message is repeatedly transmitted through the multiple write slots.

76. The apparatus according to any one of claims 71-75, characterized in that, The first coding block is a coding block in the forward error correction code structure.

77. The apparatus according to any one of claims 60-76, characterized in that, The processing unit is used to perform one or more of the following: When the first method is related to the first codebook, detection is performed based on each time unit; When the first method is related to the multiple signature sequences, detection is performed based on the active detection mechanism; When the first method is related to the first coded block, the first coded block is decoded in a single pass.

78. The apparatus according to claim 77, characterized in that, The activity detection mechanism is related to a first parameter, which is determined based on the inner product of the received signal of the network device and the plurality of signature sequences.

79. The apparatus according to any one of claims 60-78, characterized in that, The device further includes: The sending unit is used to send data confirmation to the multiple terminal devices after the multiple messages are successfully decoded.

80. The apparatus according to any one of claims 60-79, characterized in that, The configuration parameters corresponding to the first method can be configured in one or more of the following ways: broadcast configuration, semi-static configuration, and dynamic configuration.

81. A communication device, characterized in that, It includes a memory and a processor, the memory being used to store a program, and the processor being used to invoke the program in the memory to perform the method as described in any one of claims 1-19 or 20-40.

82. An apparatus, characterized in that, Includes a processor for calling a program from memory to perform the method as described in any one of claims 1-19 or 20-40.

83. A chip, characterized in that, Includes a processor for calling a program from memory, causing a device on which the chip is mounted to perform the method as described in any one of claims 1-19 or 20-40.

84. A computer-readable storage medium, characterized in that, It contains a program that causes a computer to perform the method as described in any one of claims 1-19 or 20-40.

85. A computer program product, characterized in that, Includes a program that causes a computer to perform the method as described in any one of claims 1-19 or 20-40.

86. A computer program, characterized in that, The computer program causes the computer to perform the method as described in any one of claims 1-19 or 20-40.

Images