WO2023185491A1 - 随机接入方法及装置 - Google Patents

随机接入方法及装置 Download PDF

Info

Publication number
WO2023185491A1
WO2023185491A1 PCT/CN2023/081884 CN2023081884W WO2023185491A1 WO 2023185491 A1 WO2023185491 A1 WO 2023185491A1 CN 2023081884 W CN2023081884 W CN 2023081884W WO 2023185491 A1 WO2023185491 A1 WO 2023185491A1
Authority
WO
WIPO (PCT)
Prior art keywords
constellation point
information bit
bit
identifier
information
Prior art date
Application number
PCT/CN2023/081884
Other languages
English (en)
French (fr)
Inventor
孙黎
刘鹏
王宇威
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2023185491A1 publication Critical patent/WO2023185491A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/12—Detection or prevention of fraud
    • H04W12/121—Wireless intrusion detection systems [WIDS]; Wireless intrusion prevention systems [WIPS]
    • H04W12/122—Counter-measures against attacks; Protection against rogue devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure

Definitions

  • the present application relates to the field of communication technology, and in particular, to a random access method and device.
  • the random access process may include four-step random access.
  • the four-step random access includes: In the first step, the terminal device sends message 1 to the network device on the preset time-frequency resources. (message1, Msg1), the Msg1 includes a pilot selected randomly from a limited set. In the second step, the network device calculates the timing advance (TA) amount based on the pilot and sends message 2 (Msg2) to the terminal device.
  • the Msg2 includes the pilot identification (ID), TA, message 3 ( message3, Msg3) time-frequency resources and other information.
  • the terminal device In the third step, the terminal device generates a 48-bit temporary random access control (multiple access control, MAC) address and sends it to the network device as Msg3.
  • the network device In the fourth step, the network device notifies the successfully accessed UE through broadcast message 4 (message4, Msg4).
  • Msg4 includes Msg3 sent by the successfully accessed UE.
  • a malicious transmitter can send any information to the network device through Msg3 that it wants to transmit to the malicious receiver. If no collision occurs at the network device, or if there is a collision, the malicious transmitter wins the competition, then when the network device broadcasts Msg4, it will cause the malicious receiver to receive Msg3 sent by the malicious transmitter, thereby achieving malicious transmission. covert communication between the host and a malicious receiver.
  • the above covert communication will consume air interface resources and cause the access success rate of legitimate users to decrease.
  • This application provides a random access method and device, which can effectively reduce the phenomenon of covert communication between malicious users, effectively save the cost of air interface resources, and ensure the access success rate of legitimate users.
  • embodiments of the present application provide a random access method.
  • the method is applied to a terminal device or a chip.
  • the chip can be installed in the terminal device.
  • the method includes: sending a first uplink message to a network device.
  • the first uplink message includes a first identifier; receiving a first downlink message from the network device, where the first downlink message includes a plurality of modulation symbols; and performing processing on the plurality of modulation symbols based on the first identifier. Process and obtain the processed identity.
  • the network device does not directly modulate the first identifier to obtain multiple modulation symbols, that is, the multiple modulation symbols are different from the modulation symbols obtained by directly modulating the first identifier.
  • the terminal device directly demodulates the multiple modulation symbols after acquiring the multiple modulation symbols, it will not be able to obtain the content transmitted in the first downlink message. Instead, it needs to combine the first identifier with the first identifier. Multiple modulation symbols must be processed to obtain the content transmitted in the first downlink message. Therefore, even if the malicious receiver obtains the first downlink message, it cannot successfully decode the first downlink message because it cannot know the first identifier and the processing method. Furthermore, the phenomenon of covert communication between malicious users is effectively avoided, and the access success rate of legitimate users is effectively guaranteed.
  • processing the plurality of modulation symbols based on the first identifier includes: determining a mapping rule between information bits and constellation points based on the first identifier; based on the mapping rule The plurality of modulation symbols are demodulated.
  • mapping rules between information bits and constellation points are not static, but need to change according to the first identifier. Even for the same information bits, the mapping rules are different, and the modulated results of the same information bits will be different.
  • the malicious receiver can be effectively improved to directly demodulate the modulation symbols to obtain the message content broadcast by the network device, avoiding covert communication between malicious users and ensuring the successful access rate of legitimate users.
  • determining the mapping rules between information bits and constellation points based on the first identifier includes: determining control bits based on the first identifier, and determining the mapping rules between different control bits and different mappings based on the first identifier. The correspondence between rules determines the mapping rules.
  • determining the control bit based on the first identifier can also be understood as: generating the control bit based on the first identifier, thereby determining the mapping rule through the control bit. Since the control bits are generated based on the first identifier, the method provided by the embodiment of the present application can comprehensively consider complexity and security, which can not only ensure the security of the first downlink message, but also reduce the modulation and reception of the sending end. The complexity of demodulation at the end.
  • determining the control bit based on the first identifier includes: determining the control bit based on the first identifier and a random number generation algorithm; or, determining the control bit based on the first identifier and a hash algorithm.
  • a Hash function determines the control bits.
  • determining the control bit based on the first identifier and a hash function includes: determining the control bit based on an XOR result of the first part identifier and the second part identifier and the hash function.
  • the first partial identifier and the second partial identifier are respectively partial identifiers of the first identifier.
  • the security of the first downlink message can be further improved.
  • the modulation mode of the plurality of modulation symbols includes binary phase shift keying (BPSK), the control bit is 0, and when the information bit is 0, the constellation point is (-1,0), when the information bit is 1, the constellation point is (1,0); when the control bit is 1, when the information bit is 0, the constellation point is (1,0), and the information bit When is 1, the constellation point is (-1,0);
  • the modulation mode of the multiple modulation symbols includes quadrature phase shift keying (QPSK), the control bit is 00, and the information bit is At 00:00, the constellation point is When the information bit is 01, the constellation point is When the information bit is 10, the constellation point is When the information bit is 11, the constellation point is The control bit is 01, and when the information bit is 00, the constellation point is When the information bit is 01, the constellation point is When the information bit is 10, the constellation point is When the information bit is 11, the constellation point is The control bit is 10.
  • BPSK binary phase shift keying
  • the constellation point is (1,1).
  • the constellation point is (-1,1).
  • the constellation point is 10
  • the constellation point is (1,-1)
  • the constellation point is (-1,-1)
  • the control bit is 11, when the information bit is 00
  • the constellation point is (-1,-1)
  • the modulation mode of the plurality of modulation symbols includes quadrature phase shift keying QPSK
  • the control bit is 00
  • the constellation point is (1,1) when the information bit is 00, and the information bit is 01.
  • the constellation point is (-1,1), when the information bit is 10, the constellation point is (1,-1), when the information bit is 11, the constellation point is (-1,-1); the control bit is 01, when the information bit is 00, the constellation point is (-1,1), when the information bit is 01, the constellation point is (-1,-1), when the information bit is 10, the constellation point is (1, 1), when the information bit is 11, the constellation point is (1,-1); when the control bit is 10, when the information bit is 00, the constellation point is (-1,-1), and the information bit is When the information bit is 10, the constellation point is (1,-1), when the information bit is 10, the constellation point is (-1,1), when the information bit is 11, the constellation point is (1,1); the control bit is 11. When the information bit is 00, the constellation point is (1,-1), when the information bit is 01, the constellation point is (1,1), when the information bit is 10, the constellation point is (-1,- 1), when the information bit is 11, the constellation point is (-1,1).
  • the control bits when the control bits are different, even for the same information bit, the information bit corresponds to The constellation points are also completely different. Therefore, even if a malicious receiver blindly guesses the control bits at random and blindly demodulates the first downlink message, it cannot demodulate multiple modulation symbols correctly. In other words, the correspondence between the control bits and the mapping rules shown in the embodiments of the present application can effectively confuse the malicious receiver, so that the malicious receiver cannot demodulate correctly even if it makes random guesses.
  • bit length of the first identifier is equal to the bit length of the control bit.
  • the process of controlling the mapping rule through the control bit can be effectively simplified while ensuring the security of the first downlink message.
  • processing the plurality of modulation symbols based on the first identification includes: demodulating the plurality of modulation symbols to obtain demodulated identifications; based on an encryption algorithm
  • the known information is encrypted with the first identifier to obtain the second identifier.
  • the known information is defined by a protocol or determined by the network device.
  • the network device does not directly modulate the first identifier, but first obtains the second identifier based on the first identifier and then modulates the second identifier.
  • the processing method shown in the embodiment of the present application it is possible to effectively avoid the situation where the malicious receiver directly obtains the first uplink message from the first downlink message after receiving the first downlink message, thereby preventing malicious users from communicating with each other.
  • the phenomenon of covert communication At the same time, since covert communication between malicious users is avoided and signaling issued by network equipment is invalid for legitimate users, signaling overhead is effectively saved.
  • the method further includes: when the second identifier is the same as the demodulated identifier, determining that random access of the terminal device is successful.
  • embodiments of the present application provide a random access method.
  • the method is applied to network equipment or chips.
  • the chip can be installed in the network equipment.
  • the method includes: receiving a first uplink message from a terminal device, The first uplink message includes a first identifier; a mapping rule between information bits and constellation points is determined based on the first identifier, and the first identifier is modulated based on the mapping rule to obtain a plurality of modulation symbols;
  • the terminal device sends a first downlink message, where the first downlink message includes the plurality of modulation symbols.
  • the network device when the network device modulates the first identifier, it does not directly modulate the first identifier, but determines the mapping rule between the information bits and the constellation points based on the first identifier. Based on the mapping rule Modulate the first identity. Therefore, even for the same information bits, the modulation results of the same information bits may be different if the mapping rules are different.
  • the malicious receiver can be effectively improved to directly demodulate the modulation symbols to obtain the message content broadcast by the network device, avoiding covert communication between malicious users and ensuring the successful access rate of legitimate users.
  • determining the mapping rules between information bits and constellation points based on the first identifier includes: determining control bits based on the first identifier, and determining the mapping rules between different control bits and different mappings based on the first identifier. Correspondence between rules determines the mapping rules.
  • determining the control bits based on the first identifier includes: determining the control bits based on the first identifier and a random number generation algorithm; or, determining the control bits based on the first identifier.
  • An identifier and a hash function determine the control bits.
  • determining the control bit based on the first identifier and a hash function includes: determining the control bit based on an XOR result of the first part identifier and the second part identifier and a hash function. bits, the first partial identifier and the second partial identifier are respectively partial identifiers of the first identifier.
  • the modulation mode of the plurality of modulation symbols includes binary phase shift keying BPSK, the control bit is 0, and the constellation point is (-1,0) when the information bit is 0, When the information bit is 1, the constellation point is (1,0); when the control bit is 1, when the information bit is 0, the constellation point is (1,0), when the information bit is 1, the constellation point is ( -1,0); the modulation mode of the plurality of modulation symbols includes quadrature phase shift keying QPSK, the control bit is 00, and the information bit When it is 00, the constellation point is When the information bit is 01, the constellation point is When the information bit is 10, the constellation point is When the information bit is 11, the constellation point is The control bit is 01, and when the information bit is 00, the constellation point is When the information bit is 01, the constellation point is When the information bit is 10, the constellation point is When the information bit is 11, the constellation point is The control bit is 10.
  • the constellation point is (1,1).
  • the constellation point is (-1,1).
  • the constellation point is 10
  • the constellation point is (1,-1)
  • the constellation point is (-1,-1)
  • the control bit is 11, when the information bit is 00
  • the constellation point is (-1,-1)
  • the modulation mode of the plurality of modulation symbols includes quadrature phase shift keying QPSK
  • the control bit is 00
  • the constellation point is (1,1) when the information bit is 00, and the information bit is 01.
  • the constellation point is (-1,1), when the information bit is 10, the constellation point is (1,-1), when the information bit is 11, the constellation point is (-1,-1); the control bit is 01, when the information bit is 00, the constellation point is (-1,1), when the information bit is 01, the constellation point is (-1,-1), when the information bit is 10, the constellation point is (1, 1), when the information bit is 11, the constellation point is (1,-1); when the control bit is 10, when the information bit is 00, the constellation point is (-1,-1), and the information bit is When the information bit is 10, the constellation point is (1,-1), when the information bit is 10, the constellation point is (-1,1), when the information bit is 11, the constellation point is (1,1); the control bit is 11. When the information bit is 00, the constellation point is (1,-1), when the information bit is 01, the constellation point is (1,1), when the information bit is 10, the constellation point is (-1,- 1), when the information bit is 11, the constellation point is (-1,1).
  • bit length of the first identifier is equal to the bit length of the control bit.
  • embodiments of the present application provide a random access method.
  • the method is applied to network equipment or chips.
  • the chip can be installed in the network equipment.
  • the method includes: receiving a first uplink message from a terminal device, The first uplink message includes a first identifier; the known information is encrypted based on the encryption algorithm and the first identifier to obtain a second identifier, and the second identifier is modulated to obtain a plurality of modulation symbols,
  • the known information is defined by a protocol, or the known information is determined by the network device; a first downlink message is sent to the terminal device, where the first downlink message includes the plurality of modulation symbols.
  • the network device when the network device modulates the first identifier, it does not directly modulate the first identifier, but modulates the known information (which may also be called a public sequence, etc.) based on the encryption algorithm and the first identifier. Encryption is performed to obtain a second identification, and the second identification is modulated. Therefore, without changing the signal processing process of the physical layer, the malicious receiver can be effectively improved to directly demodulate the modulation symbols to obtain the message content broadcast by the network device, avoiding covert communication between malicious users and ensuring Successful access rate of legitimate users.
  • the known information which may also be called a public sequence, etc.
  • the length of the second identifier is the same as the length of the first identifier.
  • embodiments of the present application provide a communication device for performing the method in the first aspect or any possible implementation of the first aspect.
  • the communication device includes a unit having a unit for performing the first aspect or any possible implementation of the first aspect.
  • embodiments of the present application provide a communication device for performing the method in the second aspect or any possible implementation of the second aspect.
  • the communication device includes a unit for performing the second aspect, the third aspect or any possible implementation manner.
  • inventions of the present application provide a communication device.
  • the communication device includes a processor, configured to execute the method shown in the above-mentioned first aspect or any possible implementation of the first aspect.
  • the processor is configured to execute a program stored in the memory. When the program is executed, the method shown in the above first aspect or any possible implementation of the first aspect is executed.
  • the memory is located outside the communication device.
  • the memory is located within the communication device.
  • the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together.
  • the communication device further includes a transceiver, which is used to receive signals or send signals.
  • an embodiment of the present application provides a communication device.
  • the communication device includes a processor for executing the method shown in the above second aspect, third aspect or any possible implementation manner.
  • the processor is configured to execute a program stored in the memory. When the program is executed, the method shown in the above second aspect or any possible implementation of the second aspect is executed.
  • the memory is located outside the communication device.
  • the memory is located within the communication device.
  • the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together.
  • the communication device further includes a transceiver, which is used to receive signals or send signals.
  • inventions of the present application provide a communication device.
  • the communication device includes a logic circuit and an interface.
  • the logic circuit is coupled to the interface.
  • the interface is used to output a first uplink message.
  • the first uplink message is The message includes a first identifier, and a first downlink message is input, the first downlink message includes a plurality of modulation symbols; the logic circuit is used to process the plurality of modulation symbols based on the first identifier, Get the processed identity.
  • inventions of the present application provide a communication device.
  • the communication device includes a logic circuit and an interface.
  • the logic circuit is coupled to the interface; the interface is used to input a first uplink message; the logic circuit, is used to determine the mapping rule between the information bits and the constellation points based on the first identifier, modulate the first identifier based on the mapping rule, and obtain a plurality of modulation symbols; the interface is also used to output the first downlink message, The first downlink message includes the plurality of modulation symbols.
  • the interface is used to input a first uplink message; the logic circuit is used to encrypt known information based on an encryption algorithm and a first identification to obtain a second identification; and The second identifier is modulated to obtain a plurality of modulation symbols; the interface is also used to output a first downlink message, where the first downlink message includes the plurality of modulation symbols.
  • embodiments of the present application provide a computer-readable storage medium.
  • the computer-readable storage medium is used to store a computer program. When it is run on a computer, it enables any possible implementation of the first aspect or the first aspect. The method shown in the implementation is executed.
  • embodiments of the present application provide a computer-readable storage medium.
  • the computer-readable storage medium is used to store a computer program. When it is run on a computer, it enables the above-mentioned second aspect, third aspect or any possibility. The implementation shown in the method is executed.
  • inventions of the present application provide a computer program product.
  • the computer program product includes a computer program or computer code. When run on a computer, the computer program product enables the above-mentioned first aspect or any possible implementation of the first aspect. The method shown is executed.
  • inventions of the present application provide a computer program product.
  • the computer program product includes a computer program or computer code. When run on a computer, the computer program product enables the above-mentioned second aspect, third aspect or any possible implementation manner. The method shown is executed.
  • embodiments of the present application provide a computer program.
  • the computer program When the computer program is run on a computer, The method shown in the first aspect or any possible implementation of the first aspect is executed.
  • embodiments of the present application provide a computer program.
  • the computer program When the computer program is run on a computer, the method shown in the above second aspect, the third aspect or any possible implementation manner is executed.
  • inventions of the present application provide a wireless communication system.
  • the wireless communication system includes a terminal device and a network device.
  • the terminal device is configured to perform the above first aspect or any possible implementation of the first aspect.
  • the method, the network device is configured to perform the above second aspect or the method shown in any possible implementation of the second aspect, or the network device is configured to perform the above third aspect or any possible implementation of the third aspect Implement the method shown.
  • Figure 1 is a schematic flow chart of a four-step random access
  • Figure 2 is an architectural schematic diagram of a communication system provided by an embodiment of the present application.
  • Figure 3 is a schematic diagram of a network device generating Msg4 based on Msg3;
  • Figure 4 is a schematic flow chart of a random access method provided by an embodiment of the present application.
  • Figure 5a is a mapping rule provided by an embodiment of the present application.
  • Figure 5b is another mapping rule provided by the embodiment of the present application.
  • Figure 5c is another mapping rule provided by the embodiment of the present application.
  • Figure 5d is another mapping rule provided by the embodiment of the present application.
  • Figure 5e is another mapping rule provided by the embodiment of the present application.
  • Figure 5f is a schematic diagram of a method for determining control bits provided by an embodiment of the present application.
  • Figure 5g is a schematic diagram of another method for determining control bits provided by an embodiment of the present application.
  • Figure 6 is a schematic flowchart of a four-step random access method provided by an embodiment of the present application.
  • Figure 7 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • Figure 8 is a schematic structural diagram of another communication device provided by an embodiment of the present application.
  • Figure 9 is a schematic structural diagram of yet another communication device provided by an embodiment of the present application.
  • an embodiment means that a particular feature, structure or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application.
  • the appearances of this phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those skilled in the art will understand, both explicitly and implicitly, that the embodiments described herein may be combined with other embodiments.
  • At least one (item) means one or more
  • plural means two or more
  • at least two (items) means two or three and three
  • “and/or” is used to describe the relationship between associated objects, indicating that there can be three relationships.
  • a and/or B can mean: only A exists, only B exists, and A and B exist simultaneously. In this case, A and B can be singular or plural.
  • the character “/” generally indicates that the related objects are in an “or” relationship.
  • At least one of a, b or c can mean: a, b, c, "a and b", “a and c", “b and c", or "a and b and c".
  • the method provided by this application can be applied to various communication systems, for example, it can be an Internet of things (IoT) system, a narrowband Internet of things (NB-IoT) system, a long term evolution (long term evolution) , LTE) system, it can also be the fifth generation (5th-generation, 5G) communication system, and new communication systems emerging in future communication development, such as the sixth generation (6th-generation, 6G) communication system.
  • IoT Internet of things
  • NB-IoT narrowband Internet of things
  • LTE long term evolution
  • 5th-generation, 5G fifth generation
  • new communication systems emerging in future communication development such as the sixth generation (6th-generation, 6G) communication system.
  • the technical solution provided by this application can also be applied to machine type communication (MTC), long term evolution-machine (LTE-M), and device-to-device (D2D) networks.
  • M2M machine to machine
  • IoT Internet of things
  • the IoT network may include, for example, the Internet of Vehicles.
  • the communication methods in the Internet of Vehicles system are collectively called vehicle-to-everything (V2X, X can represent anything).
  • the V2X can include: vehicle-to-vehicle (V2V) communication, Vehicle to infrastructure (V2I) communication, vehicle to pedestrian (V2P) communication, or vehicle to network (V2N) communication, etc.
  • V2V vehicle-to-vehicle
  • V2I Vehicle to infrastructure
  • V2P vehicle to pedestrian
  • V2N vehicle to network
  • FIG. 2 is a schematic architectural diagram of a communication system provided by an embodiment of the present application.
  • the communication system may include at least one network device and at least one terminal device, such as terminal device 1 to terminal device 4 in Figure 2.
  • the terminal device 3 and the terminal device 4 shown in Figure 2 can directly communicate with each other.
  • direct communication between terminal devices can be achieved through D2D technology.
  • the terminal device 1 to the terminal device 4 can communicate with the network device respectively.
  • the terminal device 3 and the terminal device 4 can communicate with the network device directly or indirectly, such as communicating with the network device via other terminal devices (not shown in Figure 2).
  • FIG. 2 exemplarily shows one network device and multiple terminal devices, as well as communication links between the communication devices.
  • the communication system may include multiple network devices, and other numbers of terminal devices may be included within the coverage of each network device, such as more or fewer terminal devices. This application does not limit this.
  • Terminal equipment is a device with wireless transceiver functions.
  • the terminal device can communicate with the access network device (or can also be called the access device) in the radio access network (radio access network, RAN).
  • Terminal equipment can also be called user equipment (UE), access terminal, terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, user Agent or user device, etc.
  • the terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on water (such as a ship, etc.).
  • the terminal device can be a handheld device with wireless communication function, a vehicle-mounted device, a wearable device, a sensor, a terminal in the Internet of Things, a terminal in the Internet of Vehicles, a drone, a 5G network or in the future Any form of terminal equipment in the network, etc., is not limited in this application.
  • the terminal equipment shown in this application can not only include vehicles (such as cars) in the Internet of Vehicles, but also include vehicle-mounted equipment or vehicle-mounted terminals in the Internet of Vehicles.
  • This application is concerned with the use of the terminal equipment in the Internet of Vehicles when it is used in the Internet of Vehicles.
  • the specific form is not limited.
  • the terminal devices shown in this application can also communicate through technologies such as D2D, V2X or M2M. This application does not limit the communication method between the terminal devices.
  • the network device may be a device deployed in a wireless access network to provide wireless communication services for terminal devices.
  • the network equipment may also be called access network equipment, access equipment or RAN equipment.
  • network equipment may be next generation Node B (next generation node B, gNB), next generation evolved base station (next generation evolved nodeB, ng-eNB), or network equipment in 6G communications, etc.
  • the network device may be any device with wireless transceiver functions, including but not limited to the base stations shown above (including base stations deployed on satellites).
  • the network equipment may also be a device with base station functions in 6G.
  • the network device can be an access node, a wireless relay node, a wireless backhaul node, etc.
  • the network device may be a wireless controller in a cloud radio access network (cloud radio access network, CRAN) scenario.
  • the network device can be a wearable device or a vehicle-mounted device.
  • the network device may also be a small station, a transmission reception point (TRP) (or may also be called a transmission point), etc.
  • TRP transmission reception point
  • the network device may also be a base station, satellite, etc. in a public land mobile network (public land mobile network, PLMN) that will evolve in the future.
  • the network equipment can also be a non-terrestrial communication system, a device carrying base station functions in D2D, V2X or M2M, etc. This application does not limit the specific type of network equipment. In systems with different wireless access technologies, the names of devices with network device functions may be different.
  • the network equipment may include a centralized unit (centralized unit, CU), a distributed unit (distributed unit, DU), etc.
  • CU can also be divided into CU-control plane (CP) and CU-user plane (user plan, UP).
  • CP CU-control plane
  • UP user plan
  • the network equipment may also be an open radio access network (openradioaccess network, ORAN) architecture, etc. This application does not limit the specific deployment method of the network equipment.
  • terminal equipment can access the network from the radio resource control (RRC) idle state or inactive state through random access, establish various bearers with network equipment, and obtain related resources. and parameter configuration, etc., to achieve communication with network devices.
  • RRC radio resource control
  • malicious users can use the random access method to conduct covert communications. Therefore, it not only consumes air interface resources, but also affects the access success rate of legitimate users.
  • the network device after receiving Msg3, the network device can perform operations such as salting, hashing, and K-erasure on Msg3, thereby causing malicious reception.
  • the machine cannot infer Msg3 through Msg4, which improves the phenomenon of covert communication between malicious users.
  • the MAC address in Msg3 is represented by
  • the input i.e. X
  • the input is salted using the sequence s generated by the random number generator, and then input to the hash function to obtain L bits.
  • a randomly generated sequence e K of length L and Hamming weight K is used as an erasure mask to perform an erasure operation on the output of the hash function (ie, L bits) to obtain sequence B(X).
  • B(X) is spliced together with eK and s to obtain Y, and Y is sent to the terminal device through Msg4.
  • the legitimate user can use the local Msg3 and e K and s in Msg4 to perform the same operation to obtain B(X)', and compare B(X)' with B(X in Msg4 ) to determine whether your access is successful.
  • the malicious receiver cannot recover Msg3 through Msg4, making covert communication impossible.
  • the random access method shown in Figure 3 can effectively prevent covert communication, the network device needs to broadcast the salt sequence s and the erasure sequence e K in Msg4, which brings additional air interface resource overhead.
  • embodiments of the present application provide a random access method and device, which can not only effectively prevent malicious users from The phenomenon of concealed communication can also effectively save the cost of air interface resources, thereby ensuring the access success rate of legitimate users.
  • Figure 4 is a schematic flowchart of a random access method provided by an embodiment of the present application. As shown in Figure 4, the method includes:
  • the terminal device sends a first uplink message to the network device, where the first uplink message includes a first identifier.
  • the network device receives the first uplink message.
  • the first identifier may be used to distinguish different terminal devices.
  • the first identifier may be an identifier related to the terminal device, or the first identifier may be a unique user identifier.
  • the first identification may include the MAC address or identity of the terminal device (such as device fingerprint information, etc.).
  • the bit length of the first identifier may be 48 bits. It can be understood that the embodiment of the present application does not limit the bit length of the first identifier. It can be understood that since the first uplink message may only include the first identifier, the first identifier and the first uplink message shown below may be replaced with each other.
  • the specific type of the first uplink message can be determined according to the random access process. For example, when the random access procedure performed by the terminal device is four-step random access, the first uplink message may include Msg3. For another example, when the random access procedure performed by the terminal device is two-step random access, the first uplink message may include message A (messageA, MsgA).
  • the terminal device can send pilot and data in the first step (such as represented by MsgA), and then in the second step (such as represented by message B (message, MsgB)) the network device sends a message to the terminal The device sends a random access response.
  • the terminal device can initiate a two-step random access, which can effectively reduce Access delay and save signaling overhead.
  • URLLC ultra-reliable and low latency communications
  • the terminal device can initiate a two-step random access, which can effectively reduce Access delay and save signaling overhead.
  • the preamble part in MsgA may be equivalent to the Msg1 part in four-step random access
  • the data part in MsgA may be equivalent to the Msg3 part in four-step random access, that is, MsgA may include the first identifier.
  • the network device processes the first identifier based on the first identifier to obtain multiple modulation symbols.
  • modulation symbol in the embodiment of the present application can be modulated by any one of BPSK, QPSK or 16QAM modulation methods.
  • modulation symbols can be understood as data carried on resource units (resource, element, RE).
  • resource units resource units (resource, element, RE).
  • BPSK one modulation symbol can correspond to one information bit
  • QPSK one modulation symbol can correspond to two information bits
  • 16QAM one modulation symbol can correspond to four information bits.
  • the method for the network device to obtain multiple modulation symbols please refer to the implementation manner one to three shown below, which will not be described in detail here.
  • the modulation methods in the embodiments of this application are all illustrated using low-order modulation methods as examples.
  • the modulation methods shown in the embodiments of the present application should not be understood as limiting the embodiments of the present application.
  • the method shown in the embodiment of the present application Still applies.
  • the network device after obtaining the first identifier, the network device directly modulates the first identifier through a certain modulation method, thereby obtaining multiple modulation symbols. At the same time, during the process of modulating the first identifier, the network device always uses only one constellation diagram.
  • the network device after obtaining the first identity, the network device also needs to modulate the first identity based on the first identity.
  • the network device processing the first identifier based on the first identifier may include: the network device determines a mapping rule between information bits and constellation points based on the first identifier, and then modulates the first identifier based on the mapping rule, Get multiple modulation symbols.
  • the mapping rules between information bits and constellation points are not static; But it needs to be changed according to the first identification. Even for the same information bits, the mapping rules are different, and the modulated results of the same information bits will be different.
  • the network device also needs to use multiple constellation diagrams for one modulation method during the modulation process.
  • the mapping rules shown in the embodiments of this application can also be understood as: the mapping rules do not refer to the mapping rules between information bits and constellation points in one constellation diagram, but the mapping rules between information bits and one of multiple constellation diagrams. Mapping rules between constellation points in a constellation diagram. As for which constellation diagram corresponds to each information bit, it can be determined based on the first identifier.
  • the network device processing the first identity based on the first identity may include: encrypting the known information based on the encryption algorithm and the first identity, obtaining the second identity, and then modulating the second identity to obtain multiple modulation symbol. That is to say, the network device does not directly modulate the first identity, but first obtains the second identity based on the first identity and then modulates the second identity.
  • the processing method shown in the embodiment of the present application it can effectively avoid the situation where a malicious receiver directly obtains Msg3 from Msg4 after receiving Msg4, and prevents the phenomenon of covert communication between malicious users.
  • covert communication between malicious users is avoided and signaling issued by network equipment is invalid for legitimate users, signaling overhead is effectively saved.
  • the method for the network device to obtain multiple modulation symbols shown above is only an example. For specific description of step 402, please refer to the implementation manner one to three shown below, which will not be described in detail here.
  • the network device after obtaining the first identifier, the network device will also perform salting operations, erasing operations, etc. based on the first identifier, and then perform modulation.
  • the network device when the network device sends Msg4, it not only includes the modulation symbols, but also includes the sequence s used in the salting operation and the sequence e K used in the erasing operation. Therefore, Increased signaling overhead.
  • the first downlink message when the network device sends the first downlink message, does not need to include additional sequences or parameters involved in the process of the network device processing the first identifier.
  • the random access method shown in Figure 4 effectively avoids the phenomenon of covert communication between malicious users without increasing signaling overhead, thereby ensuring the access success rate of legitimate users.
  • the network device sends a first downlink message to the terminal device, where the first downlink message includes multiple modulation symbols.
  • the terminal device receives the first downlink message.
  • the specific type of the first downlink message can be determined according to the random access process. For example, when the random access procedure performed by the terminal device is four-step random access, the first downlink message may include Msg4. For another example, when the random access procedure performed by the terminal device is two-step random access, the first downlink message may include MsgB.
  • the first downlink message For description of the first downlink message, reference may be made to the description of the first uplink message in the above step 401, which will not be described in detail here.
  • the terminal device processes the multiple modulation symbols based on the first identifier, obtains the processed identifier, and determines whether the random access is successful based on the processed identifier.
  • the network device may receive the first uplink message from multiple terminal devices, thereby decoding the first uplink message. Then, the network device may perform processing based on the first identifier in the successfully decoded first uplink message to obtain a plurality of modulation symbols. Therefore, after the terminal device receives the plurality of modulation symbols, it processes the plurality of modulation symbols to obtain the processed identification, and then determines whether the random access of the terminal device is successful based on the processed identification.
  • the terminal device may use a method corresponding to the network device for processing (that is, corresponding to the processing method shown in step 402).
  • the terminal device processing the multiple modulation symbols based on the first identifier includes: the terminal device determines the mapping rule between the information bits and the constellation points based on the first identifier; and then demodulates the multiple modulation symbols based on the mapping rule. , obtain the processed identity. If the processed identifier is the same as the first identifier, the terminal device can determine that its random access is successful; if the processed identifier is different from the first identifier, the terminal device determines that its random access has failed. Then, the terminal device can re-initiate random access. It is understandable that the terminal equipment needs to use multiple constellation diagrams during the demodulation process. That is, when the terminal device is demodulating, it needs to determine the constellation diagram corresponding to each modulation symbol when demodulating according to the mapping rules.
  • the terminal device processing the multiple modulation symbols based on the first identifier includes: demodulating the multiple modulation symbols and obtaining the demodulated identifiers. After the terminal device obtains the demodulated identifier, the terminal device can use the following two methods to determine whether the random access of the terminal device is successful. In the first method, the terminal device encrypts the known information based on the encryption algorithm and the first identification to obtain the second identification. If the second identification is the same as the demodulated identification, it means that the random access of the terminal device is successful; if the second identification If the identifier is different from the demodulated identifier, it means that the terminal device fails to access randomly.
  • the terminal device decrypts the demodulated identity based on the encryption algorithm and the first identity, and obtains the decrypted identity. If the decrypted identity is the same as the known information, it means that the random access of the terminal device is successful; if The decrypted identification is different from the known information, which means that the terminal device failed to access randomly.
  • step 404 the method for the terminal device to process multiple modulation symbols shown above is only an example.
  • step 404 reference can also be made to the first to third implementation methods shown below, which will not be described in detail here.
  • the network device does not directly modulate the first identifier, but processes the first identifier according to the first identifier to obtain multiple modulation symbols, that is, the multiple modulation symbols are directly related to the first identifier.
  • the modulation symbols obtained by modulation are different.
  • the terminal device directly demodulates the multiple modulation symbols after acquiring the multiple modulation symbols, it will not be able to obtain the content transmitted in the first downlink message. Instead, it needs to combine the first identifier with the first identifier. Multiple modulation symbols must be processed to obtain the content transmitted in the first downlink message.
  • the malicious receiver obtains the first downlink message, it cannot successfully decode the first downlink message because it cannot know the first identifier and the processing method. Furthermore, the phenomenon of covert communication between malicious users is effectively avoided, and the access success rate of legitimate users is effectively guaranteed.
  • the network device determines a mapping rule between the information bits and the constellation points based on the first identifier, and modulates the first identifier based on the mapping rule to obtain a plurality of modulation symbols.
  • the terminal device determines the mapping rule between the information bits and the constellation points based on the first identifier, and demodulates the plurality of modulation symbols based on the mapping rule.
  • the mapping rule between information bits and constellation points is not determined by one constellation diagram, but requires multiple constellation diagrams. For example, for the same information bits, if the mapping rules determined according to the first identifier are different, the modulated symbols of the same information bits will also be different.
  • the mapping rule f 1 (f 2 ( im , im+1 ,..., in ),s), where, f 2 ( im , im+1 ,..., i n ) represents the function related to the i m to i n information bits in the first identifier, the values of m and n are determined by the modulation method, s represents the i m to i n information bits in the first identifier, f 1 represents a function related to f 2 ( im , im+1 ,..., in ) and s.
  • determining the mapping rule between the information bits and the constellation points based on the first identifier may include: determining the control bits based on the first identifier, and determining based on the correspondence between different control bits and different mapping rules.
  • mapping rules that is, when the control bits change, the mapping rules also change. Even for the same information bits, if the control bits determined based on the first identifier are different, the mapping rules between the information bits and the constellation points will be different.
  • control bits represented by k
  • mapping rules mapping rules
  • each modulation symbol may correspond to one information bit, and the mapping rules of the information bits (represented by s) in the first identifier may be as shown in Figure 5a or Table 1. If the control bit is 0, the constellation point when the information bit is 0 is (-1,0); if the information bit is 1, the constellation point is (1,0); if the control bit is 1, the information bit is 0 The constellation point when is (1,0), and the constellation point when the information bit is 1 is (-1,0). Correspondingly, refer to Table 1 for the method when terminal equipment uses BPSK demodulation.
  • control bits determined based on the first identifier are 0100... (the contents omitted by the ellipses are the remaining control bits), and the first identifier is 1101... (the contents omitted by the ellipsis are the remaining information bits).
  • the first control bit controls the first information bit
  • the first control bit since the first control bit is 0 and the first information bit is 1, then the first information bit
  • the symbol after bit modulation is (1,0); since the second control bit is 1 and the second information bit is 1, the symbol after modulation of the second information bit is (-1,0); since the third The first control bit is 0 and the third information bit is 0, then the modulated symbol of the third information bit is (-1,0); since the fourth control bit is 0 and the fourth information bit is 1, then The modulated symbol of the fourth information bit is (1,0). It can be seen from this that even if the first information bit and the second information bit are both 1, the modulated symbols are different because the control bits are different.
  • the mapping rules of the information bits in the first identifier can be as shown in Table 2. As shown in Table 2, if the control bit is 0, the constellation point when the information bit is 0 is (1,0), if the information bit is 1, the constellation point is (-1,0); if the control bit is 1 , then the constellation point when the information bit is 0 is (-1,0), and when the information bit is 1, the constellation point is (1,0). Correspondingly, refer to Table 2 for the method when the terminal equipment uses BPSK demodulation. For the description of Table 2, please refer to the description of Table 1, and will not be described in detail here.
  • the mapping rule of the information bits in the first identifier may be as shown in Figure 5b or Figure 5c. It can be understood that Figure 5b and Figure 5c are only examples. When QPSK modulation is used, each modulation symbol can correspond to 2 information bits.
  • the constellation point when the information bit is 00 is The constellation point when the information bit is 01 is The constellation point when the information bit is 10 is The constellation point when the information bit is 11 is If the control bit is 01, then the constellation point when the information bit is 00 is The constellation point when the information bit is 01 is The constellation point when the information bit is 10 is The constellation point when the information bit is 11 is If the control bit is 10, then the constellation point when the information bit is 00 is (1,1), when the information bit is 01, the constellation point is (-1,1), and when the information bit is 10, the constellation point is (1, -1), the constellation point when the information bit is 11 is (-1,-1).
  • the constellation point when the information bit is 00 is (-1,-1), when the information bit is 01, the constellation point is (1,-1), and when the information bit is 10, the constellation point is ( -1,1), the constellation point when the information bit is 11 is (1,1).
  • the control bits determined based on the first identifier are 01 00 10 11... (the contents omitted by the ellipses are the remaining control bits), and the first identifier is 11 01 11 01... (the contents omitted by the ellipsis are the remaining information bits).
  • the modulated symbol of information bit 11 is (For example, it can be called the first modulation symbol).
  • the symbol after modulation of information bit 01 is (For example, it can be called the second modulation symbol).
  • the modulated symbol of information bit 11 is (-1,-1) (for example, it can be called the third modulation symbol).
  • the modulated symbol of information bit 01 is (1, -1) (if it can be called the fourth modulation symbol).
  • the corresponding relationships between different control bits and different mapping rules shown above are only examples.
  • the relationship between the information bits shown in the first row and the constellation point can be determined by the control bit being 01; the relationship between the information bits shown in the second row and the constellation point can be determined by the control bit 10; the third row The relationship between the information bits and the constellation points shown can be determined by the control bit 11; the relationship between the information bits and the constellation points shown in the fourth row can be determined by the control bit 00.
  • the correspondence between different control bits and different mapping rules will not be listed one by one here. Whenever the control bits change, the relationship between the information bits and the constellation points also changes (for example, the relationship between any information bit and the constellation point changes, or the relationship between two information bits and the constellation point changes, etc.) , all fall within the protection scope of this application.
  • the constellation point when the information bit is 00 is (1,1)
  • the constellation point when the information bit is 01 is (-1,1)
  • the constellation point when the information bit is 10 is (1,-1)
  • the constellation point when the information bit is 11 is (-1,-1).
  • the constellation point when the information bit is 00 is (-1,-1), when the information bit is 01, the constellation point is (1,-1), and when the information bit is 10, the constellation point is ( -1,1), the constellation point when the information bit is 11 is (1,1).
  • the control bit is 11, then the constellation point when the information bit is 00 is (1,-1), when the information bit is 01, the constellation point is (1,1), and when the information bit is 10, the constellation point is (-1 ,-1), the constellation point when the information bit is 11 is (-1,1).
  • the constellation point when the information bit is 00 is The constellation point when the information bit is 01 is The constellation point when the information bit is 10 is The constellation point when the information bit is 11 is If the control bit is 01, then the constellation point when the information bit is 00 is The constellation point when the information bit is 01 is The constellation point when the information bit is 10 is The constellation point when the information bit is 11 is If the control bit is 10, then the constellation point when the information bit is 00 is The constellation point when the information bit is 01 is The constellation point when the information bit is 10 is The constellation point when the information bit is 11 is If the control bit is 11, then the constellation point when the information bit is 00 is The constellation point when the information bit is 01 is The constellation point when the information bit is 10 is The constellation point when the information bit is 11 is
  • control bits shown in the embodiment of the present application include 00, 01, 10 and 11.
  • the mapping rules corresponding to different control bits are different.
  • the constellation diagrams may be different (such as Table 3); or even if they are different
  • the control bits correspond to the same constellation diagram, but the control bits are different, and the information bits in the constellation diagram correspond to different constellation points (such as Table 4 or Table 5). Therefore, the mapping rules shown in Table 3 to Table 5 above are only examples. There can be more mapping rules, and the embodiments of this application will not list them one by one.
  • mapping rules of the information bits in the first identifier may be as shown in Table 6. It can be understood that Figure 5e is only an example. When 16QAM modulation is used, each modulation symbol can correspond to 4 information bits.
  • Table 6 is an example of dividing the control bits into the first two bits and the last two bits, and the mapping rules shown in Table 6 should not be understood as limiting the embodiments of the present application.
  • control bit is 0000
  • the constellation point of information bit 0000 is (-3,3)
  • the constellation point of information bit 0101 is (-1,1)
  • the constellation point of information bit 1111 is (1,-1)
  • the constellation point of information bit 1010 is (3,-3)
  • the constellation point of information bit 0001 is (-3,1). It can be understood that when the control bit is 0000, for the information bits and constellation points The mapping rules between them will not be listed one by one here.
  • control bit is 0001
  • the constellation point of the information bit 0011 is (-3,3)
  • the constellation point of the information bit 0110 is (-1,1)
  • the constellation point of the information bit 1100 is (1,-1 )
  • the constellation point of information bit 1001 is (3,-3), which will not be listed one by one here.
  • mapping rules shown in Table 6 are only examples. There can be more mapping rules in actual application, and they will not be listed here one by one.
  • the mapping rules can meet the following conditions: First, the mapping of information bits to constellation points can obey Gray mapping (that is, there is a 1-bit gap between two adjacent points on the constellation diagram), thus not affecting the decoding of legitimate UEs. performance; secondly, under the condition of unknown control bit combinations, random guessing of the constellation diagram results in an average bit error rate of 1/2, thus maximizing the deterioration of the decoding performance of the malicious receiver.
  • Gray mapping shown in the embodiment of this application is only an example, and the mapping rules may not obey Gray mapping. When the mapping rule does not obey Gray's rule, the mapping rule has a higher degree of freedom and the mapping rule is more flexible.
  • the constellation diagram does not need to follow the regular mapping method shown in Figures 5a to 5e, and only needs to be stipulated in the protocol or agreed upon by both sending and receiving ends. I won’t go into details here.
  • the bit length of the control bits shown in the embodiment of the present application may be the same as the bit length of the first identifier, so that there is a one-to-one correspondence between the control bits and the information bits.
  • the mapping rule for information bit i can be determined by control bit i.
  • the mapping rules of information bits i and i+1 can be determined by control bits i and i+1.
  • the length of the control bits may also be smaller than the bit length of the first identifier.
  • the bit length of the first identifier is 48 bits, and the length of the control bits may be 24 bits.
  • control bits can sequentially control the first 24 bits in the first identifier, and control the last 24 bits in the first identifier; or, each bit in the control bits can continuously control two bits in the first identifier.
  • the embodiments of this application do not limit the specific control method.
  • the length of the control bits may be 12 bits or 20 bits, etc., which will not be listed here. It can be understood that the length of the control bits may also be greater than the bit length of the first identifier.
  • the network device may also use control bits to control the mapping rules of other information included in the first downlink message.
  • the first downlink message may also include information indicating the time-frequency resources of hybrid automatic repeat request (HARQ), and the network device may also use a control bit pair to indicate the time-frequency resources of HARQ.
  • information is modulated.
  • the method for the network device to modulate the information indicating the HARQ time-frequency resources, and the method for the terminal device to demodulate the information for indicating the HARQ time-frequency resources please refer to the first identifier in the embodiments of the present application. The description will not be described in detail here.
  • control bits can be determined in the following two ways:
  • Method 1 Determine the control bit based on the first identifier and a random number generation algorithm.
  • the first identifier can be used as a random seed
  • the random number generation algorithm can include linear congruence method, Mersenne rotation algorithm, etc.
  • Method 2 Determine the control bit based on the first identifier and the hash function.
  • the network device may input the first identifier included in the first uplink message obtained by decoding it into the hash function, and output it as a control bit.
  • the network device may use all the bits output by the hash function as control bits, or the network device may intercept the output of the hash function and retain the same bit length as the first identifier to use as the control bits.
  • the hash function can be the third generation secure hash algorithm (SHA-3), and the first identifier is 48 bits (Figure 5g takes Msg3 as an example) , then the network device can intercept the first 48 bits of the SHA-3 output (example only) and use the intercepted 48 bits as control bits.
  • SHA-3 third generation secure hash algorithm
  • the mapping rules are determined, as shown in Table 1 to Table 6, which will not be described in detail here.
  • the terminal device uses the above method to generate the same 48-bit control bits based on the first identifier sent by itself in the first uplink message. Then, determine the mapping based on the control bits Rule, the first downlink message is demodulated according to the mapping rule, and the 48 bits obtained by demodulation are compared with the first identifier sent by itself in the first uplink message. If they are consistent, it means that the random access is successful, otherwise it means that the random access is not successful. Random access successful.
  • control bits can be obtained by inputting the first identifier into the hash function, so that the implementation is simple and the security is high.
  • control bits are determined based on a first partial identifier, which is a partial identifier of the first identifier, and a hash function. That is, the partial identifier of the first identifier can be input to the hash function to obtain the control bits.
  • the embodiment of the present application does not limit the specific bit length of the first part of the identifier.
  • the first part of the identifier may be half the length of the first identifier, or the length of the first part of the identifier may be determined based on undisclosed information in the first identifier, etc., which will not be listed here.
  • the first identifier is 48 bits, and the first part of the identifier may be the first 40 bits of the first identifier.
  • the control bits are determined through the first part of the identifier.
  • the control bit is determined based on the XOR result of the first part identifier and the second part identifier and the hash function, and the first part identifier and the second part identifier are respectively the partial identifiers of the first identifier.
  • the first identifier may be divided into two parts of the identifier of equal length, namely the first part of the identifier and the second part of the identifier. By dividing the first identifier in this way, the control bits are determined, which effectively improves security based on comprehensive consideration of security and complexity.
  • the bit length of the first part of the identifier and the bit length of the second part of the identifier may also be unequal, and this is not limited in the embodiment of the present application.
  • the network device can divide the 48 bits of the first identifier into two parts of equal length, recorded as s1 and s2; then XOR s1 and s2 bitwise to obtain a length of 24 s12 of bits; then, s12 is input into the hash function (SHA-3 shown in Figure 5f), and the output of the hash function is intercepted, leaving 24 bits as control bits.
  • the 24 bits shown here are only examples and should not be understood as limiting the embodiments of the present application.
  • the network device determines the mapping rules based on the correspondence between different control bits and different mapping rules, as shown in Table 1 to Table 6, which will not be described in detail here. Then, the first downlink message is broadcast. Correspondingly, after receiving the first downlink message, the terminal device uses the above method to generate the same 24-bit control bits based on the first identifier sent by itself in the first uplink message. Then, determine the mapping rule based on the control bits, demodulate the first downlink message according to the mapping rule, compare the 48 bits obtained by demodulation with the first identifier sent by itself in the first uplink message, and explain if they are consistent. The random access is successful, otherwise it means that the random access is not successful.
  • the network device After the network device decodes the first identifier, it can use the first identifier to generate control bits, and determine the distance between each information bit in the first identifier and the constellation point based on the control bits. Mapping rules to obtain multiple modulation symbols.
  • the network device broadcasts the controlled multiple modulation symbols in the first downlink message. Even if a malicious receiver receives the first downlink message, it cannot demodulate the first identifier, thus avoiding covert communication between malicious users. , ensuring the access success rate of legitimate users.
  • the method shown in the embodiment of this application does not add additional air interface overhead.
  • the known information is encrypted based on the encryption algorithm and the first identifier to obtain the second identifier, and modulation is performed based on the second identifier to obtain multiple modulation symbols.
  • This known information can be defined by the protocol, or determined by the network device.
  • the known information may be a public sequence, such as a sequence of all ones.
  • the bit length of the known information may be the same as the bit length of the first identification, thereby simplifying the processing complexity while ensuring the security of the first identification.
  • the bit length of the known information may be greater or less than the bit length of the first identification.
  • the encryption algorithm may include a symmetric encryption algorithm, such as Advanced Encryption Standard (AES) with a key length of 128 bits (for example, it can be called AES-128) or Zu Chong's algorithm set (for example, it can be represented by ZUC). It can be understood that when the bit length of the known information is less than the bit length of the first identifier, the The known information is completed so that the bit length of the completed information is greater than or equal to the bit length of the first identifier.
  • AES Advanced Encryption Standard
  • ZUC Zu Chong's algorithm set
  • the network device decodes the message, and then uses the first identifier as a secret key to encrypt the public sequence (for example, a sequence of all ones) using an encryption algorithm.
  • the encryption sequence can be truncated, leaving 48 bits (when the bit length of the first identifier is 48 bits). Therefore, the reserved 48 bits are modulated to obtain multiple modulation symbols.
  • the mapping rule between the information bits and the constellation points can be determined based on a constellation diagram, that is, the 48 bits can be directly modulated. Since the first identifier has been used as a secret key to encrypt the plain text, security has been guaranteed, so direct modulation is more efficient and has low complexity.
  • the sequence length used in AES-128 is 128 bits. If the bit length of the first identifier is 48 bits, 80 bits of pseudo-random number can be added after the first identifier to form a 128-bit sequence. Secret key to encrypt the public sequence. The length of the encrypted sequence obtained at this time is also 128 bits, so it can be truncated and the first 48 bits retained. It can be understood that the pseudo-random numbers shown in the embodiments of this application may be random number sequences calculated using a deterministic algorithm.
  • Pseudo-random numbers are not truly random numbers, but have statistical characteristics similar to random numbers, such as uniformity, independence, etc.
  • the initial value (also called a seed) used remains unchanged, then the sequence of the pseudo-random numbers will also remain unchanged.
  • the introduction of the pseudo-random numbers shown here is only an example, and the embodiments of the present application do not limit this.
  • the terminal device after receiving the first downlink message, the terminal device first generates a local key (key) using the first identifier sent by itself in the first uplink message and an 80-bit pseudo-random number. Then use the secret key and encryption algorithm (such as AES-128) to encrypt the public sequence, truncate it to 48 bits after encryption, and compare the truncated bit sequence with the demodulated identification in the first downlink message , if they are consistent, it means that the random access is successful, otherwise it means that the access is not successful.
  • a local key such as AES-128
  • the method shown in the embodiment of the present application uses the first uplink message as the key.
  • the public sequence shown in the embodiment of the present application uses the first uplink message as the key.
  • the network device decodes the first identifier, it does not directly broadcast the first identifier, but uses the first identifier as a key to encrypt the public sequence, thereby sending the encrypted
  • the essence of the sequence is to use the first uplink message itself as the key.
  • the method shown in Implementation Mode 2 effectively avoids covert communication by malicious users without changing the signal processing process of the physical layer.
  • the third identifier is determined based on the first identifier and the hash function, and modulation is performed based on the third identifier to obtain multiple modulation symbols.
  • the network device can input the first identifier into SHA-3, truncate the output sequence, and retain the first 48 bits as the third identifier. Then the third identifier is modulated to obtain multiple modulation symbols.
  • the mapping rule between the information bits and the constellation points can be determined based on a constellation diagram, that is, the 48 bits can be directly modulated. Since the first identifier has been processed by the hash function, the security has been guaranteed, so the direct modulation method is more efficient and has low complexity.
  • the terminal device can demodulate the third identifier to obtain the demodulated identifier; and input the first identifier sent by itself in the first uplink message into the hash function. , truncate the output sequence and retain the first 48 bits. Then, the reserved first 48 bits are compared with the demodulated identifier. If they are consistent, it means that the random access is successful, otherwise it means that the access is not successful.
  • the processing of the first identifier is further simplified, the complexity is low, and the air interface overhead is not increased.
  • FIG. 6 is a schematic flowchart of a four-step random access method provided by an embodiment of the present application. As shown in Figure 6, the method includes:
  • the UE sends Msg1 to the base station on the preset time-frequency resource.
  • the Msg1 includes a pilot (which can also be called a preamble or a random access preamble (random access preamble)).
  • the base station receives Msg1.
  • the function of the Msg1 may be to notify the base station of a random access request and enable the base station to estimate the transmission delay between the base station and the UE based on the Msg1.
  • the transmission delay may be used to calibrate uplink timing.
  • the base station sends Msg2 (which can also be called a random access response) to the UE.
  • the Msg2 includes the pilot ID (which can also be called the sequence number of the preamble, etc.), the TA command, the time-frequency resource of Msg3, and other configuration information (such as wireless network temporary identification, etc.).
  • the UE receives Msg2.
  • the TA command includes calibration information obtained by the base station based on the transmission delay.
  • the embodiment of the present application does not limit the specific information included in Msg2.
  • the UE sends Msg3 to the base station, where the Msg3 includes the first identifier (such as a 48-bit MAC address).
  • the base station receives the Msg3.
  • the UE when the UE receives Msg2, if the pilot indicated by the pilot ID included in Msg2 is the same as the pilot sent by the UE in Msg1, the UE may consider Msg2 to be a response to the UE. Therefore, the UE sends Msg3 according to the uplink resource indicated in Msg2 (ie, the time-frequency resource of Msg3).
  • the base station broadcasts Msg4, which includes multiple modulation symbols.
  • the UE receives the Msg4.
  • step 402 As shown in Figure 4, as well as the first to third implementation methods shown above, which will not be described again here. .
  • the Msg3 sent by the UE is the Msg3 successfully decoded by the base station. Then, the UE can know the way the base station determines the control bits and the mapping rules, so the Msg4 decoded by the UE is consistent with the Msg3 previously generated by it (referring to the fact that the UE can demodulate the part of the bits in Msg4 corresponding to Msg3 (such as Say, Msg4 includes a total of 100 bits, the first 48 bits are the 48 bits of Msg3 successfully decoded by the base station, and the following 52 bits may be other information.
  • the UE can determine that the first 48 bits of the Msg4 it demodulates are If it is not consistent with the Msg3 generated by itself)), the UE knows that it is allowed to access. Alternatively, the UE can know the encryption key used by the base station, so the UE encrypts and truncates the public sequence and the sequence obtained is completely consistent with Msg4, then the UE knows that it is allowed to access. Alternatively, if the UE passes the Msg3 previously generated by itself through a hash function and truncates the sequence obtained by it, which is completely consistent with Msg4, then the UE knows that it is allowed to access.
  • the Msg3 sent by the user is not the Msg3 successfully resolved by the base station. Then, the control bits and mapping rules obtained by the UE based on the Msg3 it generated previously are inconsistent with those adopted by the base station. Therefore, the Msg4 decoded is inconsistent with the Msg3 it generated previously. According to the decoding result, the UE knows that it is not allowed to access. . Or, the UE cannot know the secret key used by the base station, so the UE encrypts and truncates the public sequence and the sequence obtained is inconsistent with Msg4, and the UE knows that it is not allowed to access. Or, the UE passes the Msg3 previously generated by itself through a hash function and truncates the sequence obtained by it, which is inconsistent with Msg4, and the UE knows that it is not allowed to access.
  • Msg3 is unknown to the malicious receiver, so the malicious receiver cannot know the way the base station determines the control bits and the mapping rules, and thus cannot decode Msg4. Or, the malicious receiver cannot know the secret key used by the base station. According to the principle of the symmetric encryption algorithm, the malicious receiver cannot infer the secret key through the ciphertext (Msg4) and plaintext (the aforementioned public sequence), making it impossible to achieve covert communication. Or, based on the hash function and the irreversibility of the truncation operation, the malicious receiver cannot infer Msg3 from Msg4, making covert communication impossible.
  • the malicious receiver cannot obtain the Msg3 sent by the malicious transmitter no matter how it decodes.
  • the method provided by the embodiment of the present application effectively ensures that the access success rate of legitimate users is not affected, and implements a secure access mechanism and avoids the phenomenon of covert communication.
  • the bit length corresponding to the multiple modulation symbols in Msg4 broadcast by the base station is still 48 bits, which is consistent with the 48-bit MAC address, and no additional air interface overhead is added.
  • the random access method provided by this application can provide a more secure random access mechanism, prevent random access air interface resources from being used by malicious users to achieve covert communication, and ensure legal compliance. User random access performance.
  • the random access method provided by this application does not require increased air interface resource overhead, has no impact on performance such as the access success rate of legitimate users, is relatively simple to implement, and can remain compatible with the random access protocol in 4G or 5G systems.
  • This application divides the communication device into functional modules according to the above method embodiments.
  • each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or software function modules. It should be noted that the division of modules in this application is schematic and is only a logical function division. In actual implementation, there may be other division methods.
  • the communication device according to the embodiment of the present application will be described in detail below with reference to FIGS. 7 to 9 .
  • FIG 7 is a schematic structural diagram of a communication device provided by an embodiment of the present application. As shown in Figure 7, the communication device includes a processing unit 701 and a transceiver unit 702.
  • the communication device may be used for steps or functions performed by the terminal device shown above.
  • the communication device may be a terminal device or a chip, and the chip may be disposed in the terminal device.
  • the transceiver unit 702 is configured to output a first uplink message, where the first uplink message includes a first identifier
  • the transceiver unit 702 is also used to input a first downlink message, where the first downlink message includes a plurality of modulation symbols;
  • the processing unit 701 is configured to process multiple modulation symbols based on the first identifier to obtain processed identifiers.
  • the transceiver unit 702 for outputting the first uplink message may include: the transceiver unit 702 for sending the first uplink message to the network device; or, after the processing unit 701 obtains the first uplink message, the transceiver unit 701 The unit 702 outputs to a transceiver, etc.
  • the embodiment of the present application does not limit the specific implementation of the transceiver unit.
  • the transceiver unit 702 for inputting the first downlink message may include; the transceiver unit 702 for receiving the first downlink message from the network device; or, after acquiring the first downlink message through the antenna, the The first downlink message is input to the processing unit 701 through the transceiver unit 702.
  • the embodiment of the present application does not limit the specific implementation of the transceiver unit.
  • the processing unit 701 is specifically configured to determine mapping rules between information bits and constellation points based on the first identifier; and demodulate multiple modulation symbols based on the mapping rules.
  • the processing unit 701 is specifically configured to determine the control bit based on the first identifier, and determine the mapping rule based on the correspondence between different control bits and different mapping rules.
  • the processing unit 701 is specifically configured to generate a random number based on the first identifier and a random number algorithm. Determine the control bit; or determine the control bit based on the first identifier and the hash function.
  • the processing unit 701 is specifically configured to determine the control bit based on the XOR result of the first part identification and the second part identification and the hash function, where the first part identification and the second part identification are respectively the first identification part identification.
  • the processing unit 701 is also configured to determine that the random access of the communication device is successful when the demodulated identifier is the same as the first identifier.
  • the processing unit 701 is specifically configured to demodulate multiple modulation symbols to obtain a demodulated identification; and to encrypt known information based on the encryption algorithm and the first identification to obtain a second identification.
  • Identification, known information is defined by the protocol or determined by the network device.
  • the processing unit 701 is also configured to determine that the random access of the communication device is successful when the second identifier is the same as the demodulated identifier.
  • transceiver unit and the processing unit shown in the embodiments of the present application are only examples.
  • specific functions or steps performed by the transceiver unit and the processing unit reference can be made to the above method embodiments (including Figure 4 and Figure 5a to Figure 5g and Figure 6, etc.), which will not be described in detail here.
  • the communication device can be used to perform steps or functions performed by the network device in the above method embodiments.
  • the communication device may be a network device or a chip, and the chip may be disposed in the network device.
  • Transceiver unit 702 configured to input a first uplink message, where the first uplink message includes a first identifier
  • the processing unit 701 is configured to determine the mapping rule between the information bits and the constellation points based on the first identifier, and modulate the first identifier based on the mapping rule to obtain multiple modulation symbols;
  • the transceiver unit 702 is also configured to output a first downlink message, where the first downlink message includes a plurality of modulation symbols.
  • the transceiver unit 702 for inputting the first uplink message may include: the transceiver unit 702 for receiving the first uplink message from the terminal device; or, after acquiring the first uplink message through the antenna, the first uplink message is The uplink message is input to the processing unit 701 and so on through the transceiver unit 702.
  • the embodiment of the present application does not limit the specific implementation of the transceiver unit.
  • the transceiver unit 702 for outputting the first downlink message may include; the transceiver unit 702 for sending the first downlink message to the terminal device; or, after the processing unit 701 obtains the first downlink message, the The first downlink message is output to the transceiver and the like through the transceiver unit 702.
  • the embodiment of the present application does not limit the specific implementation of the transceiver unit.
  • the processing unit 701 is specifically configured to determine the control bit based on the first identifier, and determine the mapping rule based on the correspondence between different control bits and different mapping rules.
  • the processing unit 701 is specifically configured to determine the control bit based on the first identifier and the random number generation algorithm; or, determine the control bit based on the first identifier and the hash function.
  • the processing unit 701 is specifically configured to determine the control bit based on the XOR result of the first part identification and the second part identification and the hash function, where the first part identification and the second part identification are respectively the first identification part identification.
  • the transceiver unit 702 is configured to input a first uplink message, where the first uplink message includes a first identifier
  • the processing unit 701 is configured to encrypt the known information based on the encryption algorithm and the first identifier, obtain the second identifier, and modulate the second identifier to obtain multiple modulation symbols.
  • the known information is defined by the protocol, or is known The information is determined by the network device;
  • the transceiver unit 702 is also configured to output a first downlink message, where the first downlink message includes a plurality of modulation symbols.
  • transceiver unit and the processing unit shown in the embodiments of the present application are only examples.
  • specific functions or steps performed by the transceiver unit and the processing unit reference can be made to the above method embodiments (including Figure 4 and Figure 5a to Figure 5g and Figure 6, etc.), which will not be described in detail here.
  • the description of the first uplink message, the first downlink message, the first identifier, the mapping rule, the control bits, the second identifier, the plurality of modulation symbols, etc. can be referred to the above, and will not be discussed here. Elaborate again.
  • the communication device according to the embodiment of the present application has been introduced above. Possible product forms of the communication device are introduced below. It should be understood that any form of product that has the functions of the communication device described in FIG. 7 falls within the protection scope of the embodiments of the present application. It should also be understood that the following description is only an example, and does not limit the product form of the communication device in the embodiment of the present application to this.
  • the processing unit 701 may be one or more processors, the transceiving unit 702 may be a transceiver, or the transceiving unit 702 may also be a sending unit and a receiving unit.
  • the sending unit may be a transmitter
  • the receiving unit may be a receiver
  • the sending unit and the receiving unit are integrated into one device, such as a transceiver.
  • the processor and the transceiver may be coupled, etc., and the embodiment of the present application does not limit the connection method between the processor and the transceiver.
  • the communication device 80 includes one or more processors 820 and a transceiver 810 .
  • the transceiver 810 is used to send the first uplink message to the network device and receive the first downlink message from the network device.
  • Processor 820 configured to process multiple modulation symbols based on the first identification and obtain a processed identification.
  • the transceiver 810 when the communication device is used to perform the steps or methods or functions performed by the above-mentioned network device, the transceiver 810 is used to receive the first uplink message from the terminal device; the processor 820 is used to determine based on the first identification The mapping rule between the information bits and the constellation points modulates the first identifier based on the mapping rule to obtain multiple modulation symbols; the transceiver 810 is also used to send the first downlink message to the terminal device.
  • the description of the first uplink message, the first downlink message, the first identifier, mapping rules, control bits, the second identifier, multiple modulation symbols, etc. can be referred to the above and will not be repeated here. Detailed one by one.
  • the transceiver may include a receiver and a transmitter, the receiver is used to perform the function (or operation) of receiving, and the transmitter is used to perform the function (or operation) of transmitting. ). and transceivers for communication over transmission media and other equipment/devices.
  • the communication device 80 may also include one or more memories 830 for storing program instructions and/or data (such as the configuration list shown in the embodiment of the present application, etc.).
  • Memory 830 and processor 820 are coupled.
  • the coupling in the embodiment of this application is an indirect coupling or communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information interaction between devices, units or modules.
  • Processor 820 may cooperate with memory 830.
  • Processor 820 may execute program instructions stored in memory 830.
  • at least one of the above one or more memories may be integrated into the processor.
  • connection medium between the above-mentioned transceiver 810, processor 820 and memory 830 is not limited in the embodiment of the present application.
  • the memory 830, the processor 820 and the transceiver 810 are connected through a bus 840 in Figure 8.
  • the bus is represented by a thick line in Figure 8.
  • the connection methods between other components are only schematically explained. , is not limited.
  • the bus can be divided into address bus, data bus, control bus, etc. For ease of presentation, only one thick line is used in Figure 8, but it does not mean that there is only one bus or one type of bus.
  • the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, or a field processor.
  • Programmable gate arrays or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. can implement or execute the disclosed methods, steps and logical block diagrams in the embodiments of this application.
  • a general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in conjunction with the embodiments of the present application can be directly implemented by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.
  • the memory may include but is not limited to non-volatile memories such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (Random Access Memory, RAM), Erasable Programmable ROM (EPROM), Read-Only Memory (ROM) or Portable Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM), etc.
  • Memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures, and that can be read and/or written by a computer (such as the communication device shown in this application), but is not limited thereto.
  • the memory in the embodiment of the present application can also be a circuit or any other device capable of realizing a storage function, used to store program instructions and/or data.
  • the processor 820 may be mainly used to process the communication protocol and communication data, and control the entire communication device, execute software programs, and process software programs.
  • Memory 830 is mainly used to store software programs and data.
  • the transceiver 810 may include a control circuit and an antenna.
  • the control circuit is mainly used for conversion of baseband signals and radio frequency signals and processing of radio frequency signals.
  • Antennas are mainly used to send and receive radio frequency signals in the form of electromagnetic waves.
  • Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used to receive data input by users and output data to users.
  • the processor 820 can read the software program in the memory 830, interpret and execute the instructions of the software program, and process the data of the software program.
  • the processor 820 performs baseband processing on the data to be sent, and then outputs the baseband signal to the radio frequency circuit.
  • the radio frequency circuit performs radio frequency processing on the baseband signal and then sends the radio frequency signal out in the form of electromagnetic waves through the antenna.
  • the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 820.
  • the processor 820 converts the baseband signal into data and performs processing on the data. deal with.
  • the radio frequency circuit and antenna can be arranged independently of the processor that performs baseband processing.
  • the radio frequency circuit and antenna can be arranged remotely and independently of the communication device. .
  • the communication device shown in the embodiment of the present application may also have more components than shown in FIG. 8 , and the embodiment of the present application does not limit this.
  • the methods performed by the processor and transceiver shown above are only examples. For specific steps performed by the processor and transceiver, please refer to the method introduced above.
  • the processing unit 701 may be one or more logic circuits, and the transceiver unit 702 may be an input-output interface, also known as a communication interface, or an interface circuit. , or interface, etc.
  • the transceiver unit 702 may also be a sending unit and a receiving unit.
  • the sending unit may be an output interface
  • the receiving unit may be an input interface.
  • the sending unit and the receiving unit may be integrated into one unit, such as an input-output interface.
  • the communication device shown in FIG. 9 includes a logic circuit 901 and an interface 902 .
  • the above-mentioned processing unit 701 can be implemented by the logic circuit 901, and the transceiver unit 702 can be implemented by the interface 902.
  • the logic circuit 901 can be a chip, a processing circuit, an integrated circuit or a system on chip (SoC) chip, etc.
  • the interface 902 can be a communication interface, an input/output interface, a pin, etc.
  • FIG. 9 takes the above communication device as a chip.
  • the chip includes a logic circuit 901 and an interface 902 .
  • the logic circuit and the interface may also be coupled to each other.
  • the embodiments of this application do not limit the specific connection methods of the logic circuits and interfaces.
  • the interface 902 when the communication device is used to perform the method or function or step performed by the terminal device, the interface 902 is used to output the first uplink message, the first uplink message includes the first identifier; the interface 902 is also used to input A first downlink message, the first downlink message includes a plurality of modulation symbols; the logic circuit 901 is configured to modify the plurality of modulation symbols based on the first identifier. Process and obtain the processed identity.
  • the logic circuit 901 is specifically configured to determine a mapping rule between information bits and constellation points based on the first identifier; and to demodulate multiple modulation symbols based on the mapping rule.
  • the logic circuit 901 is specifically configured to determine the control bit based on the first identifier, and determine the mapping rule based on the correspondence between different control bits and different mapping rules.
  • the logic circuit 901 is specifically configured to determine the control bit based on the first identifier and the random number generation algorithm; or, determine the control bit based on the first identifier and the hash function.
  • the logic circuit 901 is specifically configured to determine the control bit based on the XOR result of the first part identification and the second part identification and the hash function, where the first part identification and the second part identification are respectively the first identification part identification.
  • the logic circuit 901 is also used to determine that the random access of the communication device is successful when the demodulated identifier is the same as the first identifier.
  • the logic circuit 901 is specifically used to demodulate multiple modulation symbols to obtain a demodulated identification; and to encrypt known information based on the encryption algorithm and the first identification to obtain a second identification.
  • Identification known information is defined by the protocol or determined by the network device.
  • the logic circuit 901 is also configured to determine that the random access of the communication device is successful when the second identifier is the same as the demodulated identifier.
  • the interface 902 is used to input the first uplink message, the first uplink message includes the first identifier; the logic circuit 901 is used to based on The first identifier determines the mapping rule between information bits and constellation points, modulates the first identifier based on the mapping rule, and obtains multiple modulation symbols; the interface 902 is also used to output the first downlink message, the first downlink message Contains multiple modulation symbols.
  • the logic circuit 901 is specifically configured to determine the control bit based on the first identifier, and determine the mapping rule based on the correspondence between different control bits and different mapping rules.
  • the logic circuit 901 is specifically configured to determine the control bit based on the first identifier and the random number generation algorithm; or, determine the control bit based on the first identifier and the hash function.
  • the logic circuit 901 is specifically configured to determine the control bit based on the XOR result of the first part identification and the second part identification and the hash function, where the first part identification and the second part identification are respectively the first identification part identification.
  • the interface 902 is used to input a first uplink message, and the first uplink message includes a first identifier; the logic circuit 901 is used to encrypt known information based on the encryption algorithm and the first identifier. , obtain the second identifier, and modulate the second identifier to obtain multiple modulation symbols.
  • the known information is defined by the protocol, or the known information is determined by the network device; the interface 902 is also used to output the first downlink message, The first downlink message includes multiple modulation symbols.
  • the communication device shown in the embodiments of the present application can be implemented in the form of hardware to implement the methods provided in the embodiments of the present application, or can be implemented in the form of software to implement the methods provided in the embodiments of the present application. This is not limited by the embodiments of the present application.
  • Embodiments of the present application also provide a wireless communication system.
  • the wireless communication system includes a network device and a terminal device.
  • the network device and the terminal device can be used to perform the method in any of the foregoing embodiments (as shown in Figure 4 and Figure 5a to Figure 5g, Figure 6, etc.).
  • this application also provides a computer program, which is used to implement the method provided by this application. The operations and/or processing performed by the end device.
  • This application also provides a computer program, which is used to implement the operations and/or processing performed by the network device in the method provided by this application.
  • This application also provides a computer-readable storage medium, which stores computer code.
  • the computer code When the computer code is run on a computer, it causes the computer to perform the operations performed by the terminal device in the method provided by this application and/or or processing.
  • This application also provides a computer-readable storage medium, which stores computer code.
  • the computer code When the computer code is run on a computer, it causes the computer to perform the operations performed by the network device in the method provided by this application and/or or processing.
  • the computer program product includes computer code or computer program.
  • the computer code or computer program When the computer code or computer program is run on a computer, it causes the operations performed by the terminal device in the method provided by this application and/or Processing is performed.
  • the computer program product includes computer code or computer program.
  • the computer code or computer program When the computer code or computer program is run on a computer, it causes the operations performed by the network device in the method provided by this application and/or Processing is performed.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or can be integrated into another system, or some features can be ignored, or not implemented.
  • the coupling or direct coupling or communication connection between each other shown or discussed may be an indirect coupling or communication connection through some interfaces, devices or units, or may be electrical, mechanical or other forms of connection.
  • the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the technical effects of the solutions provided by the embodiments of the present application.
  • each functional unit in various embodiments of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above integrated units can be implemented in the form of hardware or software functional units.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium.
  • the technical solution of the present application is essentially or contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a readable
  • the storage medium includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application.
  • the aforementioned readable storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc. that can store program code medium.

Abstract

一种随机接入方法及装置，该方法包括：终端设备向网络设备发送第一上行消息，该第一上行消息包括第一标识，对应的，网络设备接收该第一上行消息。然后，网络设备对第一标识进行处理，获得多个调制符号，然后发送第一下行消息，该第一下行消息包括多个调制符号。对应的，终端设备在接收到第一下行消息之后，可以基于第一标识对多个调制符号进行处理，获得处理后的标识。从而，终端设备可以基于该处理后的标识确认其随机接入是否成功。通过上述方法，可以有效减少恶意用户之间的隐蔽通信现象，节省空口资源的开销，保证合法用户的接入成功率。

Description

随机接入方法及装置
本申请要求于2022年03月30日提交中国专利局、申请号为202210326062.6、申请名称为“随机接入方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种随机接入方法及装置。
背景技术
在无线通信系统中，终端设备可以通过随机接入流程进行随机接入。示例性的，如图1所示，随机接入流程可以包括四步随机接入，该四步随机接入包括：第一步，终端设备在预设的时频资源上给网络设备发送消息1(message1，Msg1)，该Msg1包括从一个有限集合中随机选取的一段导频。第二步，网络设备根据导频计算定时提前(time advancement，TA)量，并且向终端设备发送消息2(message2，Msg2)，该Msg2包括导频标识(identification，ID)、TA、消息3(message3，Msg3)的时频资源等信息。第三步，终端设备生成一个48比特(bit)的临时随机接入控制(multiple access control，MAC)地址，并且作为Msg3发送给网络设备。第四步，网络设备通过广播消息4(message4，Msg4)通知成功接入的UE，Msg4包括接入成功的UE发送的Msg3。
然而，上述随机接入流程会存在安全隐患。示例性的，恶意发射机可以通过Msg3向网络设备发送任何它想要传输给恶意接收机的信息。如果在网络设备处无碰撞发生，或者有碰撞的情况下该恶意发射机在竞争中胜出，那么网络设备广播Msg4时，就会导致恶意接收机接收到恶意发射机发送的Msg3，从而实现恶意发射机与恶意接收机之间的隐蔽通信。
上述隐蔽通信将会消耗空口资源，并且导致合法用户的接入成功率下降。
发明内容
本申请提供一种随机接入方法及装置，可以有效减少恶意用户之间的隐蔽通信现象，有效节省空口资源的开销，保证合法用户的接入成功率。
第一方面，本申请实施例提供一种随机接入方法，所述方法应用于终端设备或芯片，该芯片可以设置于终端设备中，所述方法包括：向网络设备发送第一上行消息，所述第一上行消息包括第一标识；接收来自所述网络设备的第一下行消息，所述第一下行消息包括多个调制符号；基于所述第一标识对所述多个调制符号进行处理，获得处理后的标识。
本申请实施例中，网络设备不是直接对第一标识进行调制而得到多个调制符号的，即该多个调制符号与直接对第一标识进行调制得到的调制符号不同。对应的，终端设备在获取到该多个调制符号之后，如果直接对该多个调制符号进行解调，则无法获得第一下行消息中所传输的内容，而是需要结合第一标识对该多个调制符号进行处理才能获得第一下行消息中所传输的内容。从而，恶意接收机即使是获取到了第一下行消息，但是由于无法获知第一标识以及处理方式，因此该恶意接收机无法成功解码该第一下行消息。进而，有效避免了恶意用户之间的隐蔽通信的现象，有效保证了合法用户的接入成功率。
在一种可能的实现方式中，所述基于第一标识对所述多个调制符号进行处理，包括：基于所述第一标识确定信息比特与星座点之间的映射规则；基于所述映射规则对所述多个调制符号进行解调。
也就是说，信息比特与星座点之间的映射规则不是一成不变的，而是需要根据第一标识变化的。即使是对于相同的信息比特，映射规则不同，相同的信息比特调制后的结果会不同。通过上述解调方式，可有效改善恶意接收机直接对调制符号进行解调，就获得网络设备所广播的消息内容，避免了恶意用户之间的隐蔽通信，保证了合法用户的成功接入率。
在一种可能的实现方式中，所述基于所述第一标识确定信息比特与星座点之间的映射规则，包括：基于所述第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系确定所述映射规则。
本申请实施例中，基于第一标识确定控制比特，也可以理解为：基于第一标识生成控制比特，从而通过控制比特来确定映射规则。由于控制比特是基于第一标识生成的，因此本申请实施例提供的方法，可以综合考虑复杂度和安全性，既能够保证第一下行消息的安全性，又能够减少发送端进行调制和接收端进行解调的复杂度。
在一种可能的实现方式中，所述基于所述第一标识确定控制比特，包括：基于所述第一标识以及随机数生成算法确定所述控制比特；或者，基于所述第一标识以及哈希函数确定所述控制比特。
在一种可能的实现方式中，所述基于所述第一标识以及哈希函数确定所述控制比特，包括：基于第一部分标识和第二部分标识异或的结果以及所述哈希函数确定所述控制比特，所述第一部分标识和所述第二部分标识分别为所述第一标识的部分标识。
本申请实施例中，通过将第一标识全部参与到控制比特的运算中，可以进一步提高第一下行消息的安全性。
在一种可能的实现方式中，所述多个调制符号的调制方式包括二进制相移键控(binary phase shift keying，BPSK)，所述控制比特为0，所述信息比特为0时星座点为(-1,0)，所述信息比特为1时星座点为(1,0)；所述控制比特为1，所述信息比特为0时星座点为(1,0)，所述信息比特为1时星座点为(-1,0)；所述多个调制符号的调制方式包括正交相移键控(quadrature phase shift keying，QPSK)，所述控制比特为00，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为01，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为10，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为11，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；或者，所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为01，所述信息比特为00时星座点为(-1,1)，所述信息比特为01时星座点为(-1,-1)，所述信息比特为10时星座点为(1,1)，所述信息比特为11时星座点为(1,-1)；所述控制比特为10，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；所述控制比特为11，所述信息比特为00时星座点为(1,-1)，所述信息比特为01时星座点为(1,1)，所述信息比特为10时星座点为(-1,-1)，所述信息比特为11时星座点为(-1,1)。
本申请实施例中，当控制比特不同时，即使是对于同一种信息比特，该信息比特所对应 的星座点也完全不同。从而，即使是恶意接收机随机盲猜控制比特，盲解调第一下行消息，也无法解调正确多个调制符号。也就是说，本申请实施例所示的控制比特与映射规则之间的对应关系，能够有效地对恶意接收机进行混淆，使得该恶意接收机在随机猜测的情况下，也无法解调正确。
在一种可能的实现方式中，所述第一标识的比特长度等于所述控制比特的比特长度。
本申请实施例中，当控制比特的长度等于第一标识的长度时，在保证第一下行消息的安全性的基础上，能够有效简化通过控制比特控制映射规则的过程。
在一种可能的实现方式中，所述基于所述第一标识对所述多个调制符号进行处理，包括：对所述多个调制符号进行解调，获得解调后的标识；基于加密算法和所述第一标识对已知信息进行加密，获得第二标识，所述已知信息由协议定义，或者由所述网络设备确定。
本申请实施例中，网络设备并不是直接对第一标识进行调制，而是先根据第一标识获得第二标识之后，对第二标识进行调制。通过本申请实施例所示的处理方法，可以有效避免恶意接收机在接收到第一下行消息之后，直接从该第一下行消息中获得第一上行消息的情况，防止了恶意用户之间的隐蔽通信现象。同时，由于避免了恶意用户之间的隐蔽通信，避免了网络设备下发的信令对合法用户来说是无效的情况，因此有效节省了信令开销。
在一种可能的实现方式中，所述方法还包括：在所述第二标识与所述解调后的标识相同的情况下，确定所述终端设备随机接入成功。
第二方面，本申请实施例提供一种随机接入方法，所述方法应用于网络设备或芯片，该芯片可以设置于网络设备中，所述方法包括：接收来自终端设备的第一上行消息，所述第一上行消息包括第一标识；基于所述第一标识确定信息比特与星座点之间的映射规则，基于所述映射规则对所述第一标识进行调制，获得多个调制符号；向所述终端设备发送第一下行消息，所述第一下行消息包括所述多个调制符号。
本申请实施例中，网络设备在对第一标识进行调制时，并不是直接对该第一标识进行调制，而是基于第一标识确定信息比特与星座点之间的映射规则，基于该映射规则对第一标识进行调制。从而，即使是对于相同的信息比特，映射规则不同，相同的信息比特调制后的结果可能会不同。通过上述调制方式，可有效改善恶意接收机直接对调制符号进行解调，就获得网络设备所广播的消息内容，避免了恶意用户之间的隐蔽通信，保证了合法用户的成功接入率。
在一种可能的实现方式中，所述基于所述第一标识确定信息比特与星座点之间的映射规则，包括：基于所述第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系，确定所述映射规则。
在一种可能的实现方式中，所述基于所述第一标识确定控制比特，包括：所述基于所述第一标识以及随机数生成算法确定所述控制比特；或者，所述基于所述第一标识以及哈希函数确定所述控制比特。
在一种可能的实现方式中，所述基于所述第一标识以及哈希函数确定所述控制比特，包括：基于第一部分标识和第二部分标识异或的结果以及哈希函数确定所述控制比特，所述第一部分标识和所述第二部分标识分别为所述第一标识的部分标识。
在一种可能的实现方式中，所述多个调制符号的调制方式包括二进制相移键控BPSK，所述控制比特为0，所述信息比特为0时星座点为(-1,0)，所述信息比特为1时星座点为(1,0)；所述控制比特为1，所述信息比特为0时星座点为(1,0)，所述信息比特为1时星座点为(-1,0)；所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特 为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为01，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为10，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为11，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；或者，所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为01，所述信息比特为00时星座点为(-1,1)，所述信息比特为01时星座点为(-1,-1)，所述信息比特为10时星座点为(1,1)，所述信息比特为11时星座点为(1,-1)；所述控制比特为10，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；所述控制比特为11，所述信息比特为00时星座点为(1,-1)，所述信息比特为01时星座点为(1,1)，所述信息比特为10时星座点为(-1,-1)，所述信息比特为11时星座点为(-1,1)。
在一种可能的实现方式中，所述第一标识的比特长度等于所述控制比特的比特长度。
第三方面，本申请实施例提供一种随机接入方法，所述方法应用于网络设备或芯片，该芯片可以设置于网络设备中，所述方法包括：接收来自终端设备的第一上行消息，所述第一上行消息包括第一标识；基于加密算法以及所述第一标识对已知信息进行加密，获得第二标识，并对所述第二标识进行调制，获得多个调制符号，所述已知信息由协议定义，或者，所述已知信息由所述网络设备确定；向所述终端设备发送第一下行消息，所述第一下行消息包括所述多个调制符号。
本申请实施例中，网络设备在对第一标识进行调制时，并不是直接对该第一标识进行调制，而是基于加密算法和第一标识对已知信息(也可以称为公开序列等)进行加密获得第二标识，对该第二标识进行调制。从而，在不改变物理层的信号处理过程的基础上，有效改善恶意接收机直接对调制符号进行解调，就获得网络设备所广播的消息内容，避免了恶意用户之间的隐蔽通信，保证了合法用户的成功接入率。
在一种可能的实现方式中，所述第二标识的长度与所述第一标识的长度。
第四方面，本申请实施例提供一种通信装置，用于执行第一方面或第一方面的任意可能的实现方式中的方法。所述通信装置包括具有执行第一方面或第一方面的任意可能的实现方式的单元。
第五方面，本申请实施例提供一种通信装置，用于执行第二方面或第二方面的任意可能的实现方式中的方法。该所述通信装置包括具有执行第二方面、第三方面或任意可能的实现方式的单元。
第六方面，本申请实施例提供一种通信装置，所述通信装置包括处理器，用于执行上述第一方面或第一方面的任意可能的实现方式所示的方法。或者，所述处理器用于执行存储器中存储的程序，当所述程序被执行时，上述第一方面或第一方面的任意可能的实现方式所示的方法被执行。
在一种可能的实现方式中，所述存储器位于所述通信装置之外。
在一种可能的实现方式中，所述存储器位于所述通信装置之内。
本申请实施例中，处理器和存储器还可以集成于一个器件中，即处理器和存储器还可以被集成在一起。
在一种可能的实现方式中，通信装置还包括收发器，该收发器，用于接收信号或发送信号。
第七方面，本申请实施例提供一种通信装置，所述通信装置包括处理器，用于执行上述第二方面、第三方面或任意可能的实现方式所示的方法。或者，所述处理器用于执行存储器中存储的程序，当所述程序被执行时，上述第二方面或第二方面的任意可能的实现方式所示的方法被执行。
在一种可能的实现方式中，所述存储器位于所述通信装置之外。
在一种可能的实现方式中，所述存储器位于所述通信装置之内。
在本申请实施例中，处理器和存储器还可以集成于一个器件中，即处理器和存储器还可以被集成在一起。
在一种可能的实现方式中，通信装置还包括收发器，该收发器，用于接收信号或发送信号。
第八方面，本申请实施例提供一种通信装置，该通信装置包括逻辑电路和接口，所述逻辑电路和所述接口耦合；所述接口，用于输出第一上行消息，所述第一上行消息包括第一标识，以及输入第一下行消息，所述第一下行消息包括多个调制符号；所述逻辑电路，用于基于所述第一标识对所述多个调制符号进行处理，获得处理后的标识。
第九方面，本申请实施例提供一种通信装置，该通信装置包括逻辑电路和接口，所述逻辑电路和所述接口耦合；所述接口，用于输入第一上行消息；所述逻辑电路，用于基于第一标识确定信息比特与星座点之间的映射规则，基于所述映射规则对第一标识进行调制，获得多个调制符号；所述接口，还用于输出第一下行消息，所述第一下行消息包括所述多个调制符号。
在另一种可能的实现方式中，所述接口，用于输入第一上行消息；所述逻辑电路，用于基于加密算法和第一标识对已知信息进行加密，获得第二标识；并对第二标识进行调制，获得多个调制符号；所述接口，还用于输出第一下行消息，所述第一下行消息包括所述多个调制符号。
第十方面，本申请实施例提供一种计算机可读存储介质，该计算机可读存储介质用于存储计算机程序，当其在计算机上运行时，使得上述第一方面或第一方面的任意可能的实现方式所示的方法被执行。
第十一方面，本申请实施例提供一种计算机可读存储介质，该计算机可读存储介质用于存储计算机程序，当其在计算机上运行时，使得上述第二方面、第三方面或任意可能的实现方式所示的方法被执行。
第十二方面，本申请实施例提供一种计算机程序产品，该计算机程序产品包括计算机程序或计算机代码，当其在计算机上运行时，使得上述第一方面或第一方面的任意可能的实现方式所示的方法被执行。
第十三方面，本申请实施例提供一种计算机程序产品，该计算机程序产品包括计算机程序或计算机代码，当其在计算机上运行时，使得上述第二方面、第三方面或任意可能的实现方式所示的方法被执行。
第十四方面，本申请实施例提供一种计算机程序，该计算机程序在计算机上运行时，上 述第一方面或第一方面的任意可能的实现方式所示的方法被执行。
第十五方面，本申请实施例提供一种计算机程序，该计算机程序在计算机上运行时，上述第二方面、第三方面或任意可能的实现方式所示的方法被执行。
第十六方面，本申请实施例提供一种无线通信系统，该无线通信系统包括终端设备和网络设备，所述终端设备用于执行上述第一方面或第一方面的任意可能的实现方式所示的方法，所述网络设备用于执行上述第二方面或第二方面的任意可能的实现方式所示的方法，或者，所述网络设备用于执行上述第三方面或第三方面的任意可能的实现方式所示的方法。
附图说明
图1是一种四步随机接入的流程示意图；
图2是本申请实施例提供的一种通信系统的架构示意图；
图3是网络设备根据Msg3产生Msg4的示意图；
图4是本申请实施例提供的一种随机接入方法的流程示意图；
图5a是本申请实施例提供的一种映射规则；
图5b是本申请实施例提供的另一种映射规则；
图5c是本申请实施例提供的又一种映射规则；
图5d是本申请实施例提供的又一种映射规则；
图5e是本申请实施例提供的又一种映射规则；
图5f是本申请实施例提供的一种确定控制比特的方法示意图；
图5g是本申请实施例提供的另一种确定控制比特的方法示意图；
图6是本申请实施例提供的一种四步随机接入方法的流程示意图；
图7是本申请实施例提供的一种通信装置的结构示意图；
图8是本申请实施例提供的另一种通信装置的结构示意图；
图9是本申请实施例提供的又一种通信装置的结构示意图。
具体实施方式
为了使本申请的目的、技术方案和优点更加清楚，下面将结合附图对本申请作进一步地描述。
本申请的说明书、权利要求书及附图中的术语“第一”和“第二”等仅用于区别不同对象，而不是用于描述特定顺序。此外，术语“包括”和“具有”以及它们的任何变形，意图在于覆盖不排他的包含。例如包含了一系列步骤或单元的过程、方法、系统、产品或设备等，没有限定于已列出的步骤或单元，而是可选地还包括没有列出的步骤或单元等，或可选地还包括对于这些过程、方法、产品或设备等固有的其它步骤或单元。
在本文中提及的“实施例”意味着，结合实施例描述的特定特征、结构或特性可以包含在本申请的至少一个实施例中。在说明书中的各个位置出现该短语并不一定均是指相同的实施例，也不是与其它实施例互斥的独立的或备选的实施例。本领域技术人员可以显式地和隐式地理解的是，本文所描述的实施例可以与其它实施例相结合。
在本申请中，“至少一个(项)”是指一个或者多个，“多个”是指两个或两个以上，“至少两个(项)”是指两个或三个及三个以上，“和/或”，用于描述关联对象的关联关系，表示可以存在三种关系，例如，“A和/或B”可以表示：只存在A，只存在B以及同时存在A和B三种情况，其中A，B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以 下至少一项(个)”或其类似表达，是指这些项中的任意组合。例如，a，b或c中的至少一项(个)，可以表示：a，b，c，“a和b”，“a和c”，“b和c”，或“a和b和c”。
本申请提供的方法可以应用于各类通信系统，例如，可以是物联网(internet of things，IoT)系统、窄带物联网(narrow band internet of things，NB-IoT)系统、长期演进(long term evolution，LTE)系统，也可以是第五代(5th-generation，5G)通信系统，以及未来通信发展中出现的新的通信系统，如第六代(6th-generation，6G)通信系统等。
本申请提供的技术方案还可以应用于机器类通信(machine type communication，MTC)、机器间通信长期演进技术(long term evolution-machine，LTE-M)、设备到设备(device-todevice，D2D)网络、机器到机器(machine to machine，M2M)网络、物联网(internet of things，IoT)网络、工业互联网或者其他网络。其中，IoT网络例如可以包括车联网。其中，车联网系统中的通信方式统称为车与任何事物(vehicle-to-everything，V2X，X可以代表任何事物)，例如，该V2X可以包括：车辆到车辆(vehicle to vehicle，V2V)通信，车辆与基础设施(vehicle to infrastructure，V2I)通信、车辆与行人之间的通信(vehicle to pedestrian，V2P)或车辆与网络(vehicle to network，V2N)通信等。示例性的，下文示出的图2中，终端设备与终端设备之间便可以通过D2D技术、M2M技术或V2X技术通信等。
图2是本申请实施例提供的一种通信系统的架构示意图。如图2所示，该通信系统可以包括至少一个网络设备，以及至少一个终端设备，如图2中的终端设备1至终端设备4。示例性的，如图2所示的终端设备3与终端设备4之间可以直接通信。例如可以通过D2D技术实现终端设备之间的直接通信。又例如，终端设备1至终端设备4可以分别与网络设备通信。可理解，终端设备3和终端设备4可以直接与网络设备通信，也可以间接地与网络设备通信，如经由其他终端设备(图2未示出)与网络设备通信。应理解，图2示例性地示出了一个网络设备和多个终端设备，以及各通信设备之间的通信链路。可选地，该通信系统可以包括多个网络设备，并且每个网络设备的覆盖范围内可以包括其它数量的终端设备，例如更多或更少的终端设备。本申请对此不做限定。
以下对终端设备和网络设备进行详细说明。
终端设备是一种具有无线收发功能的装置。终端设备可以与无线接入网(radio access network，RAN)中的接入网设备(或者也可以称为接入设备)进行通信。终端设备也可以称为用户设备(user equipment，UE)、接入终端、终端(terminal)、用户单元(subscriber unit)、用户站、移动站、远方站、远程终端、移动设备、用户终端、用户代理或用户装置等。在一种可能的实现方式中，终端设备可以部署在陆地上，包括室内或室外、手持或车载；也可以部署在水面上(如轮船等)。在一种可能的实现方式中，终端设备可以是具有无线通信功能的手持设备、车载设备、可穿戴设备、传感器、物联网中的终端、车联网中的终端、无人机、5G网络或未来网络中的任意形态的终端设备等，本申请对此不作限定。
可理解，本申请示出的终端设备不仅可以包括车联网中的车辆(如汽车)、而且还可以包括车联网中的车载设备或车载终端等，本申请对于该终端设备应用于车联网时的具体形态不作限定。可理解，本申请示出的终端设备与终端设备之间还可以通过D2D、V2X或M2M等技术进行通信，本申请对于终端设备与终端设备之间的通信方法不作限定。
网络设备可以是一种部署在无线接入网中，为终端设备提供无线通信服务的装置。该网络设备也可以称为接入网设备、接入设备或RAN设备等。示例性的，网络设备可以是下一代 节点B(next generation node B，gNB)、下一代演进型基站(next generation evolved nodeB，ng-eNB)、或者6G通信中的网络设备等。网络设备可以是任意一种具有无线收发功能的设备，包括但不限于以上所示的基站(包括部署于卫星上的基站)。该网络设备还可以是6G中具有基站功能的装置。可选的，该网络设备可以为无线局域网(wireless-fidelity，Wi-Fi)系统中的接入节点、无线中继节点、无线回传节点等。可选的，该网络设备可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器。可选的，该网络设备可以是可穿戴设备或车载设备等。可选的，该网络设备还可以是小站，传输接收节点(transmission reception point，TRP)(或也可以称为传输点)等。可理解，该网络设备还可以是未来演进的公共陆地移动网络(public land mobile network，PLMN)中的基站、卫星等等。该网络设备还可以为非地面通信系统、D2D、V2X或M2M中承载基站功能的装置等，本申请对网络设备的具体类型不作限定。在不同的无线接入技术的系统中，具备网络设备功能的装置的名称可能会有所不同。
可选的，在网络设备的一些部署中，网络设备可以包括集中式单元(centralized unit，CU)和分布式单元(distributed unit，DU)等。在网络设备的另一些部署中，CU还可以划分为CU-控制面(control plane，CP)和CU-用户面(user plan，UP)等。在网络设备的又一些部署中，网络设备还可以是开放的无线接入网(openradioaccessnetwork，ORAN)架构等，本申请对于网络设备的具体部署方式不作限定。
本申请实施例描述的网络架构以及业务场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域普通技术人员可知，随着网络架构的演变和新业务场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
在无线通信系统中，终端设备可以通过随机接入从无线资源控制(radio resource control，RRC)空闲态或非激活(inactive)态接入网络，与网络设备建立起各种承载，以及获取相关资源和参数配置等，从而实现与网络设备的通信。然而，在如图1所示的随机接入方法中，恶意用户可以利用随机接入方法进行隐蔽通信。从而，不仅消耗空口资源，而且还会影响合法用户的接入成功率。
在另一种随机接入方法中，网络设备在接收到Msg3之后，可以对Msg3进行撒盐(salting)、哈希(hash)、K-擦除(K-erasure)等操作，从而使得恶意接收机无法通过Msg4推测出Msg3，改善了恶意用户之间隐蔽通信的现象。如图3所示，Msg3中的MAC地址用X表示，该X包括N个比特，则网络设备根据其接收到的Msg3产生Msg4的步骤为：
首先，使用随机数生成器生成的序列s对输入(即X)进行撒盐操作，然后再输入到哈希函数，得到L比特。然后，使用一个随机生成的长度为L汉明重量为K的序列eK作为擦除掩码，对哈希函数的输出(即L个比特)进行擦除操作，得到序列B(X)。接着，将B(X)与eK、s拼接在一起，得到Y，从而通过Msg4向终端设备发送Y。最后，在终端设备接收到Msg4之后，合法用户可以使用本地的Msg3以及Msg4中的eK和s进行同样的操作得到B(X)’，以及对比B(X)’与Msg4中的B(X)，从而确定自己是否接入成功。
由于哈希函数和擦除操作的不可逆性，恶意接收机无法通过Msg4恢复Msg3，从而无法进行隐蔽通信。图3所示的随机接入方法虽然可以有效防止隐蔽通信，但是网络设备需要在Msg4中广播撒盐序列s和擦除序列eK，由此带来了额外的空口资源开销。
鉴于此，本申请实施例提供一种随机接入方法及装置，不仅能够有效防止恶意用户之间 隐蔽通信的现象，而且还可以有效节省空口资源的开销，从而保证合法用户的接入成功率。
可理解，本申请实施例提供的方法可以应用于如图1所示的系统，下文所示的方法实施例中关于终端设备和网络设备的描述可以参考如图1所示的系统，或者参考下文如图7至图9所示的通信装置。
图4是本申请实施例提供的一种随机接入方法的流程示意图。如图4所示，该方法包括：
401、终端设备向网络设备发送第一上行消息，该第一上行消息包括第一标识。对应的，网络设备接收该第一上行消息。
第一标识可以用于区分不同的终端设备，如第一标识可以是与终端设备相关的标识，或者第一标识可以是唯一的用户标识。示例性的，第一标识可以包括终端设备的MAC地址或身份标识(如设备指纹信息等)。例如，第一标识的比特长度可以为48个比特。可理解，本申请实施例对于第一标识的比特长度不作限定。可理解，由于第一上行消息中可以只包括第一标识，因此下文所示的第一标识与第一上行消息可以相互替换。
第一上行消息的具体类型可以根据随机接入流程确定。举例来说，当终端设备执行的随机接入流程是四步随机接入时，该第一上行消息可以包括Msg3。又举例来说，当终端设备执行的随机接入流程是两步随机接入时，第一上行消息可以包括消息A(messageA，MsgA)。在发起两步随机接入时，终端设备可以在第一步(如用MsgA表示)中发送导频和数据，然后在第二步(如用消息B(message，MsgB)表示)网络设备向终端设备发送随机接入响应。示例性的，当终端设备所要传输的数据的业务为高可靠低时延通信(ultra-reliable and low latency communications，URLLC)业务时，该终端设备可以发起两步随机接入，由此可以有效降低接入延时以及节省信令开销。可理解，在MsgA中的前导部分可以相当于四步随机接入中的Msg1部分，MsgA中的数据部分可以相当于四步随机接入中的Msg3部分，即MsgA中可以包括第一标识。
402、网络设备基于第一标识对第一标识进行处理，获得多个调制符号。
本申请实施例中的调制符号(modulation symbol)可以通过BPSK、QPSK或16QAM中的任一项调制方式调制得到。如调制符号可以理解为资源单元(resource，element，RE)上承载的数据。示例性的，对于BPSK来说，一个调制符号可以对应1个信息比特；对于QPSK来说，一个调制符号可以对应两个信息比特；对于16QAM来说，一个调制符号可以对应四个信息比特。关于网络设备获得多个调制符号的方法可以参考下文所示的实现方式一至实现方式三，这里先不详述。
可理解，由于随机接入过程中传输的信令大部分是控制信令，需要较高的可靠性，因此本申请实施例中的调制方式均是以低阶调制方式为例示出的。但是，不应将本申请实施例所示的调制方式理解为对本申请实施例的限定。例如，随着标准技术的发展，终端设备发起随机接入流程时，有其他因素(如可靠性之外的因素)需要考虑，从而需要使用高阶调制方式时，本申请实施例所示的方法仍然适用。
一般的，在如图1所示的随机接入方法中，网络设备在获得第一标识之后，是直接通过一定的调制方式对该第一标识进行调制，从而获得多个调制符号。同时，在对第一标识进行调制的过程中，网络设备使用的星座图始终只有一张星座图。
然而，本申请实施例中，网络设备在获得第一标识之后，还需要基于第一标识对该第一标识进行调制。示例性的，网络设备基于第一标识对该第一标识进行处理可以包括：网络设备基于第一标识确定信息比特与星座点之间的映射规则，然后基于该映射规则对第一标识进行调制，获得多个调制符号。也就是说，信息比特与星座点之间的映射规则不是一成不变的， 而是需要根据第一标识变化的。即使是对于相同的信息比特，映射规则不同，相同的信息比特调制后的结果会不同。即本申请实施例所示的方法中，网络设备在调制过程中，对于一种调制方式也需要用到多张星座图。或者，本申请实施例所示的映射规则还可以理解为：该映射规则指的不是一张星座图中信息比特与星座点之间的映射规则，而是信息比特与多张星座图中的一种星座图中的星座点之间的映射规则。至于每个信息比特所对应的星座图是哪张星座图，则可以基于第一标识确定。
示例性的，网络设备基于第一标识对该第一标识进行处理可以包括：基于加密算法及第一标识对已知信息进行加密，获得第二标识，然后对第二标识进行调制，获得多个调制符号。也就是说，网络设备并不是直接对第一标识进行调制，而是先根据第一标识获得第二标识之后，对第二标识进行调制。通过本申请实施例所示的处理方法，可以有效避免恶意接收机在接收到Msg4之后，直接从该Msg4中获得Msg3的情况，防止了恶意用户之间的隐蔽通信现象。同时，由于避免了恶意用户之间的隐蔽通信，避免了网络设备下发的信令对合法用户来说是无效的情况，因此有效节省了信令开销。可理解，以上所示的网络设备获得多个调制符号的方法仅为示例，关于步骤402的具体说明可以参考下文所示的实现方式一至实现方式三，这里先不一一详述。
一般的，在如图3所示的随机接入方法中，网络设备在获得第一标识之后，还会根据该第一标识进行撒盐操作、擦除操作等，然后再进行调制。但是，在如图3所示的方法中，网络设备发送Msg4时，不仅仅包括调制符号，还会包括撒盐操作所用到的序列s，以及擦除操作所用到的序列eK，由此，增加了信令开销。
然而，本申请实施例中，网络设备发送第一下行消息时，该第一下行消息中不需要额外包括网络设备对第一标识进行处理的过程中所涉及到的序列或参数等。
由此，图4所示的随机接入方法，在不增加信令开销的基础上，有效避免了恶意用户之间的隐蔽通信现象，从而保证了合法用户的接入成功率。
403、网络设备向终端设备发送第一下行消息，该第一下行消息包括多个调制符号。对应的，终端设备接收该第一下行消息。
第一下行消息的具体类型可以根据随机接入流程确定。举例来说，当终端设备执行的随机接入流程是四步随机接入时，该第一下行消息可以包括Msg4。又举例来说，当终端设备执行的随机接入流程是两步随机接入时，第一下行消息可以包括MsgB。关于第一下行消息的说明可以参考上述步骤401中关于第一上行消息的描述，这里不再详述。
404、终端设备基于第一标识对多个调制符号进行处理，获得处理后的标识，根据处理后的标识确定是否随机接入成功。
网络设备可以接收到来自多个终端设备的第一上行消息，从而对第一上行消息进行解码。接着，网络设备可以基于成功解码的第一上行消息中的第一标识进行处理，获得多个调制符号。因此，在终端设备接收到该多个调制符号之后，对该多个调制符号进行处理，获得处理后的标识，然后基于处理后的标识确定该终端设备是否随机接入成功。
终端设备可以使用与网络设备对应的方法进行处理(即对应步骤402所示的处理方法)。示例性的，终端设备基于第一标识对多个调制符号进行处理包括：终端设备基于第一标识确定信息比特与星座点之间的映射规则；然后基于该映射规则对多个调制符号进行解调，获得处理后的标识。如果处理后的标识与第一标识相同，则该终端设备可以确定自己随机接入成功；如果处理后的标识与第一标识不同，则该终端设备确定自己随机接入失败。然后，该终端设备可以重新发起随机接入。可理解，终端设备在解调的过程中，需要用到多张星座图。 即终端设备在解调时，需要根据映射规则决定每个调制符号解调时所对应的星座图。
示例性的，终端设备基于第一标识对多个调制符号进行处理包括：对多个调制符号进行解调，获得解调后的标识。终端设备在获取解调后的标识之后，可以有如下两种方法来确定该终端设备是否随机接入成功。第一种，终端设备基于加密算法和第一标识对已知信息进行加密，获得第二标识，如果第二标识与解调后的标识相同，则说明该终端设备随机接入成功；如果第二标识与解调后的标识不同，则说明该终端设备随机接入失败。第二种，终端设备基于加密算法和第一标识对解调后的标识进行解密，获得解密后的标识，如果解密后的标识与已知信息相同，则说明该终端设备随机接入成功；如果解密后的标识与已知信息不同，则说明该终端设备随机接入失败。
可理解，以上所示的终端设备对多个调制符号进行处理的方法仅为示例，关于步骤404的具体说明还可以参考下文所示的实现方式一至实现方式三，这里先不一一详述。
本申请实施例中，网络设备不是直接对第一标识进行调制的，而是根据第一标识对第一标识进行处理，得到多个调制符号，即该多个调制符号与直接对第一标识进行调制得到的调制符号不同。对应的，终端设备在获取到该多个调制符号之后，如果直接对该多个调制符号进行解调，则无法获得第一下行消息中所传输的内容，而是需要结合第一标识对该多个调制符号进行处理才能获得第一下行消息中所传输的内容。从而，恶意接收机即使是获取到了第一下行消息，但是由于无法获知第一标识以及处理方式，因此该恶意接收机无法成功解码该第一下行消息。进而，有效避免了恶意用户之间的隐蔽通信的现象，有效保证了合法用户的接入成功率。
以下详细说明图4所示的方法中网络设备获得多个调制符号的方式，以及终端设备解调该多个调制符号的方式。
实现方式一、
网络设备基于第一标识确定信息比特与星座点之间的映射规则，以及基于该映射规则对第一标识进行调制，获得多个调制符号。对应的，终端设备在获得该多个调制符号之后，基于第一标识确定信息比特与星座点之间的映射规则，以及基于该映射规则对多个调制符号进行解调。本申请实施例中，即使是对于同一种调制方式，信息比特与星座点之间的映射规则不是由一张星座图确定的，而是需要多张星座图确定的。示例性的，对于相同的信息比特，根据第一标识确定的映射规则不同，相同的信息比特调制后的符号也会有所不同。
在一种可能的实现方式中，映射规则＝f1(f2(im,im+1,…，in),s)，其中，f2(im,im+1,…，in)表示第一标识中与第im到in个信息比特有关的函数，m与n的取值由调制方式确定，s表示第一标识中第im到in个信息比特，f1表示与f2(im,im+1,…，in)和s有关的函数。例如，调制方式为BPSK，则n＝m+0，即f2(im,im+1,…，in)表示第一标识中与第im个信息比特有关的函数。又例如，调制方式为QPSK，则n＝m+1，即f2(im,im+1,…，in)表示第一标识中与第im个和第im+1个信息比特有关的函数。又例如，调制方式为16QAM，则n＝m+3，即f2(im,im+1,…，in)表示第一标识中与第im个至第im+3个信息比特有关的函数。
在另一种可能的实现方式中，基于第一标识确定信息比特与星座点之间的映射规则可以包括：基于第一标识确定控制比特，基于不同控制比特与不同映射规则之间的对应关系确定上述映射规则。也就是说，当控制比特发生改变时，映射规则也会发生改变。即使是对于相同的信息比特，如果基于第一标识确定的控制比特不同，则信息比特与星座点之间的映射规则也会不同。又或者，可以理解为：如果基于第一标识确定的控制比特不同，则星座图格式 不同，即信息比特与星座点之间的映射规则随着星座图格式的不同而不同。
以下举例说明控制比特(用k表示)与映射规则之间的关系。关于控制比特的确定方法可以参考下文所示的方式一至方式三。
作为一个示例，假设网络设备采用BPSK调制，则每个调制符号可以对应1个信息比特，第一标识中信息比特(用s表示)的映射规则可以如图5a或表1所示。若控制比特为0，则信息比特为0时的星座点为(-1,0)，若信息比特为1时的星座点为(1,0)；若控制比特为1，则信息比特为0时的星座点为(1,0)，信息比特为1时的星座点为(-1,0)。对应的，终端设备采用BPSK解调时的方式参考表1。
表1
举例来说，基于第一标识确定的控制比特为0100……(省略号省略的内容为其余控制比特)，第一标识为1101……(省略号省略的是其余信息比特)。示例性的，一个控制比特依次控制一个信息比特时，如第一个控制比特控制第一个信息比特时，由于第一个控制比特为0，第一个信息比特为1，则第一个信息比特调制后的符号为(1,0)；由于第二个控制比特为1，第二个信息比特为1，则第二个信息比特调制后的符号为(-1,0)；由于第三个控制比特为0，第三个信息比特为0，则第三个信息比特调制后的符号为(-1,0)；由于第四个控制比特为0，第四个信息比特为1，则第四个信息比特调制后的符号为(1,0)。从中可以看出，即使第一个信息比特与第二个信息比特均为1，但是，由于控制比特不同，因此调制后的符号不同。
假设网络设备采用BPSK调制，则第一标识中信息比特的映射规则可以如表2所示。如表2所示，若控制比特为0，则信息比特为0时的星座点为(1,0)，若信息比特为1时的星座点为(-1,0)；若控制比特为1，则信息比特为0时的星座点为(-1,0)，信息比特为1时的星座点为(1,0)。对应的，终端设备采用BPSK解调时的方式参考表2。关于表2的说明可以参考关于表1的描述，这里不再一一详述。
表2
作为另一个示例，假设网络设备采用QPSK调制，则第一标识中信息比特的映射规则可以如图5b或图5c所示。可理解，图5b和图5c仅为一种示例。当采用QPSK调制时，每个调制符号可以对应2个信息比特。
可选的，如图5b或表3所示，若控制比特为00，则信息比特为00时的星座点为信息比特为01时的星座点为信息比特为10时的星座点为信息比特为11时的星座点为若控制比特为01，则信息比特为00时的星座点为信息比特为01时的星座点为信息比特为10时的星座点为信息比特为11时的星座点为若控制比特为10，则信息比特为00时的星座点为(1,1)，信息比特为01时的星座点为(-1,1)，信息比特为10时的星座点为(1,-1)，信息比特为11时的星座点为(-1,-1)。若控制比特为11，则信息比特为00时的星座点为(-1,-1)，信息比特为01时的星座点为(1,-1)，信息比特为10时的星座点为(-1,1)，信息比特为11时的星座点为(1,1)。
表3
举例来说，基于第一标识确定的控制比特为01 00 10 11……(省略号省略的内容为其余控制比特)，第一标识为11 01 11 01……(省略号省略的是其余信息比特)。示例性的，在两个控制比特依次控制两个信息比特的情况下，如控制比特01控制信息比特11时，该信息比特11调制后的符号为(如可以称为第一个调制符号)，以此类推，信息比特01调制后的符号为(如可以称为第二个调制符号)，信息比特11调制后的符号为(-1,-1)(如可以称为第三个调制符号)，信息比特01调制后的符号为(1,-1)(如可以称为第四个调制符号)。
可理解，以上所示的不同控制比特与不同映射规则之间的对应关系仅为示例。例如，第一行所示的信息比特与星座点之间的关系可以由控制比特为01确定；第二行所示的信息比特与星座点之间的关系可以由控制比特10确定；第三行所示的信息比特与星座点之间的关系可以由控制比特11确定；第四行所示的信息比特与星座点之间的关系可以由控制比特00确定。这里不再一一列举不同控制比特与不同映射规则之间的对应关系。但凡控制比特改变时，信息比特与星座点之间的关系也随着改变(如任一个信息比特与星座点之间的关系改变，或者，两个信息比特与星座点之间的关系改变等)，均属于本申请的保护范围之内。
可选的，如图5c或表4所示，若控制比特为00，则信息比特为00时的星座点为(1,1)，信息比特为01时的星座点为(-1,1)，信息比特为10时的星座点为(1,-1)，信息比特为11时的星座点为(-1,-1)。若控制比特为01，则信息比特为00时的星座点为(-1,1)，信息比特为01时的星座点为(-1,-1)，信息比特为10时的星座点为(1,1)，信息比特为11时的星座点为(1,-1)。若控制比特为10，则信息比特为00时的星座点为(-1,-1)，信息比特为01时的星座点为(1,-1)，信息比特为10时的星座点为(-1,1)，信息比特为11时的星座点为(1,1)。若控制比特为11，则信息比特为00时的星座点为(1,-1)，信息比特为01时的星座点为(1,1)，信息比特为10时的星座点为(-1,-1)，信息比特为11时的星座点为(-1,1)。
表4
基于表1至表4所示的映射规则，当控制比特不同时，即使是对于同一种信息比特，该信息比特所对应的星座点也完全不同。从而，即使是恶意接收机随机盲猜控制比特，盲解调第一下行消息，也无法解调正确多个调制符号(即通过表1至表4所述的映射规则可以增加恶意接收机盲解的复杂度)。也就是说，本申请实施例所示的控制比特与映射规则之间的对应关系，能够有效地对恶意接收机进行混淆，使得该恶意接收机在随机猜测的情况下，也无法 解调正确。
可选的，如图5d或表5所示，若控制比特为00，则信息比特为00时的星座点为信息比特为01时的星座点为信息比特为10时的星座点为信息比特为11时的星座点为若控制比特为01，则信息比特为00时的星座点为信息比特为01时的星座点为信息比特为10时的星座点为信息比特为11时的星座点为若控制比特为10，则信息比特为00时的星座点为信息比特为01时的星座点为信息比特为10时的星座点为信息比特为11时的星座点为若控制比特为11，则信息比特为00时的星座点为信息比特为01时的星座点为信息比特为10时的星座点为信息比特为11时的星座点为
表5
需要说明的是，本申请实施例所示的控制比特包括00、01、10和11，不同控制比特所对应的映射规则不同，例如，可以是星座图不同(如表3)；或者，即使不同控制比特对应同一星座图，但是控制比特不同，星座图中的信息比特所对应的星座点不同(如表4或表5)。因此以上表3至表5所示的映射规则仅为示例，映射规则还可以有更多的方式，本申请实施例不作一一列举。
作为又一个示例，假设网络设备采用16QAM调制，则第一标识中信息比特的映射规则可以如表6所示。可理解，图5e仅为示例一种。当采用16QAM调制时，每个调制符号可以对应4个信息比特。
表6
可理解，表6是将控制比特划分为前两个比特和后两个比特为例示出的，不应将表6所示的映射规则理解为对本申请实施例的限定。
为了更好地说明上表所给出的规则的含义，下面给出一个例子。考虑控制比特k～k+3为0000的情况，根据表6，信息比特k～k+3到星座图上的点的映射规则如图5e所示。示例性的，图5e中从左到右的星座点的横坐标为-3、-1、1、3；图5e中从上到下的星座点的纵坐标为3、1、-1、-3。举例来说，控制比特为0000，信息比特0000的星座点为(-3,3)，信息比特0101的星座点为(-1,1)，信息比特1111的星座点为(1,-1)，信息比特1010的星座点为(3,-3)，信息比特0001的星座点为(-3,1)。可理解，当控制比特为0000时，对于信息比特与星座点 之间的映射规则，这里不再一一列举。又举例来说，控制比特为0001，信息比特0011的星座点为(-3,3)，信息比特0110的星座点为(-1,1)，信息比特1100的星座点为(1,-1)，信息比特1001的星座点为(3,-3)，这里不再一一列举。
可理解，表6所示的映射规则只是一种举例，实际应用时的映射规则可以有更多的方式，这里不再一一列举。
示例性的，映射规则可以满足如下条件：第一，信息比特到星座点的映射可以服从格雷映射(即星座图上相邻两点之间有1比特的差距)，从而不影响合法UE的解码性能；第二，在未知控制比特组合条件下，随机猜测星座图，导致的平均误码率为1/2，从而最大限度地恶化恶意接收机的解码性能。当然，本申请实施例所示的格雷映射仅为示例，映射规则还可以不服从格雷映射。当映射规则不服从格雷规则时，映射规则的自由度更高，且映射规则更灵活。且星座图也可以不按照图5a～图5e中所示的规则的映射方式，只需协议规定或者收发两端约定即可。在此不再赘述。
本申请实施例所示的控制比特的比特长度可以与第一标识的比特长度相同，从而使得控制比特与信息比特之间一一对应。例如，对于BPSK来说，信息比特i映射规则，可以由控制比特i确定。对于QPSK来说，信息比特i和i+1的映射规则可以由控制比特i和i+1确定。可选的，控制比特的长度还可以小于第一标识的比特长度。例如，第一标识的比特长度为48个比特，控制比特的长度可以是24比特。由此，控制比特可以依次控制第一标识中的前24个比特，以及控制第一标识中的后24个比特；或者，控制比特中的每一位可以连续控制第一标识中的两个比特，本申请实施例对于具体的控制方式不作限定。可选的，控制比特的长度可以是12比特或20个比特等，这里不再一一列举。可理解，控制比特的长度还可以大于第一标识的比特长度。示例性的，网络设备也可以利用控制比特控制第一下行消息中所包括的其他信息的映射规则。例如，第一下行消息中还可以包括用于指示混合自动重传(hybrid automatic repeat request，HARQ)的时频资源的信息，该网络设备还可以利用控制比特对用于指示HARQ的时频资源的信息进行调制。网络设备对用于指示HARQ的时频资源的信息进行调制的方法，以及终端设备对该用于指示HARQ的时频资源的信息进行解调的方法可以参考本申请实施例中关于第一标识的描述，这里不再一一详述。
本申请实施例中，对于控制比特的确定方法可以有如下两种方式：
可理解，下文所示的控制比特的确定方式对于网络设备和终端设备均适用。
方式1、基于第一标识以及随机数生成算法确定控制比特。
示例性的，第一标识可以作为随机种子，随机数生成算法可以包括线性同余法、梅森旋转算法等。
方式2、基于第一标识以及哈希函数确定控制比特。
作为一种示例，网络设备可以将其解码获得的第一上行消息中所包括的第一标识输入到哈希函数，并将输出作为控制比特。网络设备可以将哈希函数所输出的全部比特作为控制比特，或者，网络设备可以对哈希函数的输出进行截取，保留与第一标识相同的比特长度，从而作为控制比特。举例来说，如图5g所示，哈希函数可以是第三代安全哈希算法(secure hash algorithm 3，SHA-3)，第一标识为48比特(图5g是以Msg3为例示出的)，则网络设备可以截取SHA-3输出的前48比特(仅为示例)，将截取出的48比特作为控制比特。从而，基于不同的控制比特与不同的映射规则之间的对应关系，确定映射规则，如表1至表6，这里不再一一详述。对应的，终端设备在接收到第一下行消息之后，基于自身在第一上行消息发送的第一标识，使用上述方法生成同样的48比特的控制比特。然后，根据控制比特来确定映射 规则，根据该映射规则对第一下行消息进行解调，将解调得到的48比特与自身在第一上行消息发送的第一标识进行比较，如果一致则说明随机接入成功，否则说明未随机接入成功。
本申请实施例中，通过将第一标识输入到哈希函数就可以得到控制比特，从而实现简单，且安全性较高。
作为另一种示例，基于第一部分标识以及哈希函数确定控制比特，该第一部分标识为第一标识的部分标识。也就是说，可以将第一标识的部分标识输入到哈希函数，从而获得控制比特。可理解，本申请实施例对于该第一部分标识的具体比特长度不作限定。示例性的，该第一部分标识可以为第一标识的长度的一半，或者，该第一部分标识的长度可以基于第一标识中未公开的信息确定等，这里不再一一列举。示例性的，第一标识为48比特，第一部分标识可以是该第一标识的前40个比特。举例来说，当第一标识中的后8个比特是公开的信息时，通过第一部分标识确定控制比特。
作为又一种示例，基于第一部分标识和第二部分标识异或的结果以及哈希函数确定控制比特，第一部分标识和第二部分标识分别为第一标识的部分标识。示例性的，第一标识可以分为等长的两部分标识，即第一部分标识和第二部分标识。通过这种方式划分第一标识，从而确定控制比特，综合考虑安全性和复杂性的基础上，有效提高了安全性高。当然，第一部分标识的比特长度和第二部分标识的比特长度也可以不等长，本申请实施例对此不作限定。
举例来说，如图5f所示，网络设备可以把第一标识的48比特分为等长的两个部分，记为s1和s2；然后将s1和s2按位进行异或，得到长度为24比特的s12；接着，将s12输入哈希函数(如图5f所示的SHA-3)，并且对哈希函数的输出进行截取，保留24比特，作为控制比特。可理解，这里所示的24比特仅为示例，不应将其理解为对本申请实施例的限定。
从而，网络设备基于不同的控制比特与不同的映射规则之间的对应关系，确定映射规则，如表1至表6，这里不再一一详述。然后，广播第一下行消息。对应的，终端设备在接收到第一下行消息之后，基于自身在第一上行消息发送的第一标识，使用上述方法生成同样的24比特的控制比特。然后，根据控制比特来确定映射规则，根据该映射规则对第一下行消息进行解调，将解调得到的48比特与自身在第一上行消息发送的第一标识进行比较，如果一致则说明随机接入成功，否则说明未随机接入成功。
对于本申请实施例所示的实现方式一来说，网络设备解码出第一标识后，可以利用该第一标识生成控制比特，根据控制比特确定第一标识中各个信息比特与星座点之间的映射规则，从而获得多个调制符号。网络设备将受控的多个调制符号在第一下行消息中广播，即使是恶意接收机接收到该第一下行消息也无法解调出第一标识，避免了恶意用户之间的隐蔽通信，保证了合法用户的接入成功率。同时，本申请实施例所示的方法，没有增加额外的空口开销。
实现方式二、
基于加密算法和第一标识对已知信息进行加密，获得第二标识，基于该第二标识进行调制，获得多个调制符号。
该已知信息可以由协议定义，或者由网络设备确定。示例性的，该已知信息可以是公开序列，例如全1的序列。该已知信息的比特长度可以与第一标识的比特长度相同，从而在保证第一标识安全性的基础上，还能够简化处理的复杂度。当然，已知信息的比特长度可以大于或小于第一标识的比特长度。加密算法可以包括对称加密算法，如密钥长度为128位的高级加密标准(advanced encryption standard，AES)(如可以称为AES-128)或祖冲之算法集(如可以用ZUC表示)等。可理解，在已知信息的比特长度小于第一标识的比特长度时，可以通 过对已知信息补齐，以使得补齐后的信息的比特长度大于或等于第一标识的比特长度。
举例来说，网络设备在接收到第一上行消息之后对其进行解码，然后将第一标识作为秘钥，利用加密算法加密公开序列(例如全1序列)。加密完成后可以对加密序列进行截断，保留48个比特(当第一标识的比特长度为48比特时)。从而，对保留的48个比特进行调制，获得多个调制符号。可选的，在对保留的48个比特进行调制时，信息比特与星座点之间的映射规则可以基于一张星座图确定，即可以直接对该48个比特进行调制。由于第一标识已经作为秘钥，对明文进行加密，安全性已经得到保障，因此通过直接调制的方式更加高效，且复杂度低。可理解，当将第一标识作为秘钥时，为满足特定加密算法的要求，可以在第一标识之后补若干比特。例如，AES-128所用到的序列长度为128个比特，如果第一标识的比特长度为48个比特，则可以在该第一标识后补80个比特的伪随机数，从而构成128个比特的秘钥，对公开序列进行加密。此时得到的加密序列的长度也是128个比特，因此可以将其截断，保留前48个比特。可理解，本申请实施例所示的伪随机数可以是用确定性的算法计算出来的随机数序列。伪随机数并不真正意义上的随机数，但是具有类似于随机数的统计特征，如均匀性、独立性等。在计算伪随机数时，若使用的初值(也可以称为种子)不变，那么伪随机数的数序也不变。这里所示的伪随机数的介绍仅为示例，本申请实施例对此不作限定。
对应的，终端设备接收到第一下行消息后，首先利用自身在第一上行消息中发送的第一标识和80个比特的伪随机数生成本地秘钥(key)。然后利用该秘钥和加密算法(如AES-128)对公开序列进行加密，加密后截断至48个比特，并将截断后得到的比特序列与第一下行消息中解调后的标识进行对比，若一致则说明随机成功接入，否则说明未成功接入。
需要说明的是，本申请实施例所示的公开序列即使对所有用户(包括恶意接收机)都是已知的，但是本申请实施例所示的方法，由于是用第一上行消息作为密钥来加密公开序列得到密文，因此对于恶意接收机说，即使该恶意接收机拿到了密文，同时知道明文(也就是公开序列)，但是该恶意接收机也无法根据密文和明文是无法反推密钥。
对于本申请实施例所示的实现方式二来说，网络设备解码出第一标识后，不直接广播该第一标识，而是将第一标识作为密钥来加密公开序列，从而发送加密后的序列，实质是将第一上行消息本身作为密钥。实现方式二所示的方法，在不改变物理层的信号处理过程的基础上，有效避免了恶意用户的隐蔽通信。
实现方式三、
基于第一标识以及哈希函数确定第三标识，基于第三标识进行调制，获得多个调制符号。
示例性的，网络设备可以将第一标识输入SHA-3，并对输出的序列进行截断，保留前48比特作为第三标识。然后对该第三标识进行调制，获得多个调制符号。可选的，在对第三标识进行调制时，信息比特与星座点之间的映射规则可以基于一张星座图确定，即可以直接对该48个比特进行调制。由于第一标识已经经过哈希函数处理，安全性已经得到保障，因此通过直接调制的方式更加高效，且复杂度低。
对应的，终端设备在接收到第一下行消息之后，可以对第三标识进行解调，获得解调后的标识；以及将其自身在第一上行消息中发送的第一标识输入哈希函数，对输出的序列截断，保留前48个比特。然后，将保留的前48个比特与解调后的标识比较，若一致则说明随机接入成功，否则说明未接入成功。
对于本申请实施例所示的实现方式三来说，在避免恶意用户之间的隐蔽通信的基础上，进一步简化对第一标识的处理，复杂度低，且未增加空口开销。
以上所示的三种实现方式详细说明了本申请实施例中网络设备获得多个调制符号的方式，以及终端设备解调该多个调制方式。下文将以四步随机接入为例，说明本申请实施例提供的随机接入方法。图6是本申请实施例提供的一种四步随机接入方法的流程示意图，如图6所示，该方法包括：
601、UE通过在预设的时频资源上向基站发送Msg1，该Msg1包括导频(也可以称为前导码或随机接入前导码(random access preamble))。对应的，基站接收Msg1。
该Msg1的作用可以是通知基站有一个随机接入请求，并使得基站能够基于该Msg1估算该基站与UE之间的传输时延，该传输时延可以用于校准上行定时(uplink timing)。
602、基站向UE发送Msg2(也可以称为随机接入响应)，该Msg2包括导频ID(也可以称为前导码的序列编号等)、TA指令、Msg3的时频资源以及其他配置信息(如无线网络临时标识等)。对应的，UE接收Msg2。
可理解，TA指令包括基站根据传输时延得到的校准信息，本申请实施例对于Msg2中所包括的具体信息不作限定。
603、UE向基站发送Msg3，该Msg3中包括第一标识(如48比特的MAC地址)。对应的，基站接收该Msg3。
可理解，当UE接收到Msg2时，如果Msg2中所包括的导频ID指示的导频与该UE在Msg1中发送的导频相同，则该UE可以认为Msg2是针对该UE的响应。从而，该UE根据Msg2中所指示的上行资源(即Msg3的时频资源)上发送Msg3。
604、基站广播Msg4，该Msg4包括多个调制符号。对应的，UE接收该Msg4。
关于多个调制符号的调制过程，以及该多个调制符号的解调过程，可以参考如图4所示的步骤402，以及如上文所示的实现方式一至实现方式三，这里不再一一赘述。
以下根据UE的身份以及冲突分解的结果进行说明：
1)若UE为合法用户，且未与其他UE产生冲突，或者在冲突分解中胜出，则该UE发送的Msg3即为基站成功解出的Msg3。那么，该UE能够知道基站确定控制比特的方式以及映射规则，因此该UE解出的Msg4和自身此前产生的Msg3一致(指的是UE可以解调出Msg4中与Msg3对应的那一部分比特(比如说，Msg4共包括100比特，前48比特是基站成功解出的Msg3的48比特，后面的52比特可能是其他的信息。由此，UE可以判断其解调出来的Msg4中的前48比特是不是与自身此前产生的Msg3一致))，则该UE知道自己被允许接入。或者，该UE能够知道基站采用的加密秘钥，因此该UE对公开序列进行加密并截断之后得到的序列与Msg4完全一致，则该UE知道自己被允许接入。或者，该UE将自身此前生成的Msg3通过哈希函数并截断之后得到的序列与Msg4完全一致，则该UE知道自己被允许接入。
2)若UE为合法用户，但是未在冲突分解中胜出，则该用户发送的Msg3不是基站成功解出的Msg3。那么，该UE根据自身此前产生的Msg3得到的控制比特以及映射规则与基站所采用的不一致，因此解码得到的Msg4与自身此前产生的Msg3不一致，根据解码结果，该UE知道自己未被允许接入。或者，该UE无法得知基站所使用的秘钥，因此该UE对公开序列进行加密并截断之后得到的序列与Msg4不一致，该UE知道自己未被允许接入。或者，该UE将自身此前生成的Msg3通过哈希函数并截断之后得到的序列与Msg4不一致，该UE知道自己未被允许接入。
3)若UE为恶意接收机，且恶意发射机未与其他UE冲突，或者在冲突分解中胜出，由 于恶意接收机未知Msg3，因此恶意接收机无法得知基站确定控制比特的方式以及映射规则式，从而无法解码Msg4。或者，恶意接收机无法得知基站所使用的秘钥，根据对称加密算法的原理，恶意接收机无法通过密文(Msg4)和明文(前述公开序列)推断出秘钥，从而无法实现隐蔽通信。或者，根据哈希函数以及截断操作的不可逆性，恶意接收机无法通过Msg4推断出Msg3，从而无法实现隐蔽通信。
4)若UE为恶意接收机，且恶意发射机在冲突分解中未胜出，则恶意接收机无论如何解码都无法获得恶意发射机发送的Msg3。
综合以上四种情况可知，本申请实施例提供的方法有效保证了合法用户接入成功率无影响，并且实现了安全接入机制，避免了隐蔽通信的现象。此外，在申请实施例中，基站广播的Msg4中的多个调制符号对应的比特长度仍为48比特，与48比特的MAC地址一致，没有增加额外的空口开销。
本申请提供的随机接入方法，相比于图1所示的随机接入方法，能够提供更安全的随机接入机制，避免随机接入空口资源被恶意用户利用来实现隐蔽通信，保障了合法用户的随机接入性能。同时，本申请提供的随机接入方法无须增加空口资源开销，对合法用户的接入成功率等性能无影响，且实现较简单，能够与4G或5G系统中的随机接入协议保持兼容。
以下将介绍本申请实施例提供的通信装置。
本申请根据上述方法实施例对通信装置进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。下面将结合图7至图9详细描述本申请实施例的通信装置。
图7是本申请实施例提供的一种通信装置的结构示意图，如图7所示，该通信装置包括处理单元701和收发单元702。
在本申请的一些实施例中，该通信装置可以用于上文示出的终端设备执行的步骤或功能等。示例性的，该通信装置可以是终端设备或芯片，该芯片可以设置于终端设备中。
收发单元702，用于输出第一上行消息，该第一上行消息包括第一标识；
收发单元702，还用于输入第一下行消息，该第一下行消息包括多个调制符号；
处理单元701，用于基于第一标识对多个调制符号进行处理，获得处理后的标识。
示例性的，收发单元702，用于输出第一上行消息可以包括：收发单元702，用于向网络设备发送该第一上行消息；或者，处理单元701在获得第一上行消息之后，通过该收发单元702输出至收发器等，本申请实施例对于收发单元的具体实现方式不作限定。
示例性的，收发单元702，用于输入第一下行消息可以包括；收发单元702，用于接收来自网络设备的第一下行消息；或者，通过天线获取到第一下行消息之后，该第一下行消息通过收发单元702输入至处理单元701等，本申请实施例对于收发单元的具体实现方式不作限定。
在一种可能的实现方式中，处理单元701，具体用于基于第一标识确定信息比特与星座点之间的映射规则；以及基于映射规则对多个调制符号进行解调。
在一种可能的实现方式中，处理单元701，具体用于基于第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系确定映射规则。
在一种可能的实现方式中，处理单元701，具体用于基于第一标识以及随机数生成算法 确定控制比特；或者，基于第一标识以及哈希函数确定控制比特。
在一种可能的实现方式中，处理单元701，具体用于基于第一部分标识和第二部分标识异或的结果以及哈希函数确定控制比特，第一部分标识和第二部分标识分别为第一标识的部分标识。
在一种可能的实现方式中，处理单元701，还用于在解调后的标识与第一标识相同的情况下，确定通信装置随机接入成功。
在一种可能的实现方式中，处理单元701，具体用于对多个调制符号进行解调，获得解调后的标识；以及基于加密算法和第一标识对已知信息进行加密，获得第二标识，已知信息由协议定义，或者由网络设备确定。
在一种可能的实现方式中，处理单元701，还用于在第二标识与解调后的标识相同的情况下，确定通信装置随机接入成功。
可理解，本申请实施例示出的收发单元和处理单元的具体说明仅为示例，对于收发单元和处理单元的具体功能或执行的步骤等，可以参考上述方法实施例(如包括图4、图5a至图5g以及图6等)，这里不再详述。
复用图7，在本申请的另一些实施例中，该通信装置可以用于执行上文方法实施例中由网络设备执行的步骤或功能等。示例性的，该通信装置可以是网络设备或芯片，该芯片可以设置于网络设备中。
收发单元702，用于输入第一上行消息，该第一上行消息包括第一标识；
处理单元701，用于基于第一标识确定信息比特与星座点之间的映射规则，基于映射规则对第一标识进行调制，获得多个调制符号；
收发单元702，还用于输出第一下行消息，该第一下行消息包括多个调制符号。
示例性的，收发单元702，用于输入第一上行消息可以包括：收发单元702，用于接收来自终端设备的该第一上行消息；或者，通过天线获取到第一上行消息之后，该第一上行消息通过收发单元702输入至处理单元701等，本申请实施例对于收发单元的具体实现方式不作限定。
示例性的，收发单元702，用于输出第一下行消息可以包括；收发单元702，用于向终端设备发送第一下行消息；或者，处理单元701在获得第一下行消息之后，该第一下行消息通过收发单元702输出至收发器等，本申请实施例对于收发单元的具体实现方式不作限定。
在一种可能的实现方式中，处理单元701，具体用于基于第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系，确定映射规则。
在一种可能的实现方式中，处理单元701，具体用于基于第一标识以及随机数生成算法确定控制比特；或者，基于第一标识以及哈希函数确定控制比特。
在一种可能的实现方式中，处理单元701，具体用于基于第一部分标识和第二部分标识异或的结果以及哈希函数确定控制比特，第一部分标识和第二部分标识分别为第一标识的部分标识。
在本申请的又一些实施例中，收发单元702，用于输入第一上行消息，该第一上行消息包括第一标识；
处理单元701，用于基于加密算法以及第一标识对已知信息进行加密，获得第二标识，并对第二标识进行调制，获得多个调制符号，已知信息由协议定义，或者，已知信息由网络设备确定；
收发单元702，还用于输出第一下行消息，第一下行消息包括多个调制符号。
可理解，本申请实施例示出的收发单元和处理单元的具体说明仅为示例，对于收发单元和处理单元的具体功能或执行的步骤等，可以参考上述方法实施例(如包括图4、图5a至图5g以及图6等)，这里不再详述。
可理解，对于上述实施例来说，关于第一上行消息、第一下行消息、第一标识、映射规则、控制比特、第二标识、多个调制符号等的说明可以参考上文，这里不再一一详述。
以上介绍了本申请实施例的通信装置，以下介绍所述通信装置可能的产品形态。应理解，但凡具备上述图7所述的通信装置的功能的任何形态的产品，都落入本申请实施例的保护范围。还应理解，以下介绍仅为举例，不限制本申请实施例的通信装置的产品形态仅限于此。
在一种可能的实现方式中，图7所示的通信装置中，处理单元701可以是一个或多个处理器，收发单元702可以是收发器，或者收发单元702还可以是发送单元和接收单元，发送单元可以是发送器，接收单元可以是接收器，该发送单元和接收单元集成于一个器件，例如收发器。本申请实施例中，处理器和收发器可以被耦合等，对于处理器和收发器的连接方式，本申请实施例不作限定。
如图8所示，该通信装置80包括一个或多个处理器820和收发器810。
示例性的，当该通信装置用于执行上述终端设备执行的步骤或方法或功能时，收发器810，用于向网络设备发送第一上行消息，以及接收来自该网络设备的第一下行消息；处理器820，用于基于第一标识对多个调制符号进行处理，获得处理后的标识。
示例性的，当该通信装置用于执行上述网络设备执行的步骤或方法或功能时，收发器810，用于接收来自终端设备的第一上行消息；处理器820，用于基于第一标识确定信息比特与星座点之间的映射规则，基于映射规则对第一标识进行调制，获得多个调制符号；收发器810，还用于向终端设备发送第一下行消息。
可理解，本申请实施例中，关于第一上行消息、第一下行消息、第一标识、映射规则、控制比特、第二标识、多个调制符号等的说明可以参考上文，这里不再一一详述。
可理解，对于处理器和收发器的具体说明还可以参考图7所示的处理单元和收发单元的介绍，这里不再赘述。
在图8所示的通信装置的各个实现方式中，收发器可以包括接收机和发射机，该接收机用于执行接收的功能(或操作)，该发射机用于执行发射的功能(或操作)。以及收发器用于通过传输介质和其他设备/装置进行通信。
可选的，通信装置80还可以包括一个或多个存储器830，用于存储程序指令和/或数据(如本申请实施例所示的配置列表等)。存储器830和处理器820耦合。本申请实施例中的耦合是装置、单元或模块之间的间接耦合或通信连接，可以是电性，机械或其它的形式，用于装置、单元或模块之间的信息交互。处理器820可能和存储器830协同操作。处理器820可可以执行存储器830中存储的程序指令。可选的，上述一个或多个存储器中的至少一个可以集成于处理器中。
本申请实施例中不限定上述收发器810、处理器820以及存储器830之间的具体连接介质。本申请实施例在图8中以存储器830、处理器820以及收发器810之间通过总线840连接，总线在图8中以粗线表示，其它部件之间的连接方式，仅是进行示意性说明，并不引以为限。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图8中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
在本申请实施例中，处理器可以是通用处理器、数字信号处理器、专用集成电路、现场 可编程门阵列或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等，可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成等。
本申请实施例中，存储器可包括但不限于硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)等非易失性存储器，随机存储记忆体(Random Access Memory，RAM)、可擦除可编程只读存储器(Erasable Programmable ROM，EPROM)、只读存储器(Read-Only Memory，ROM)或便携式只读存储器(Compact Disc Read-Only Memory，CD-ROM)等等。存储器是能够用于携带或存储具有指令或数据结构形式的程序代码，并能够由计算机(如本申请示出的通信装置等)读和/或写的任何存储介质，但不限于此。本申请实施例中的存储器还可以是电路或者其它任意能够实现存储功能的装置，用于存储程序指令和/或数据。
示例性的，当通信装置用于实现终端设备执行的步骤或功能时，处理器820可以主要用于对通信协议以及通信数据进行处理，以及对整个通信装置进行控制，执行软件程序，处理软件程序的数据。存储器830主要用于存储软件程序和数据。收发器810可以包括控制电路和天线，控制电路主要用于基带信号与射频信号的转换以及对射频信号的处理。天线主要用于收发电磁波形式的射频信号。输入输出装置，例如触摸屏、显示屏，键盘等主要用于接收用户输入的数据以及对用户输出数据。当通信装置开机后，处理器820可以读取存储器830中的软件程序，解释并执行软件程序的指令，处理软件程序的数据。当需要通过无线发送数据时，处理器820对待发送的数据进行基带处理后，输出基带信号至射频电路，射频电路将基带信号进行射频处理后将射频信号通过天线以电磁波的形式向外发送。当有数据发送到通信装置时，射频电路通过天线接收到射频信号，将射频信号转换为基带信号，并将基带信号输出至处理器820，处理器820将基带信号转换为数据并对该数据进行处理。
在另一种实现中，所述的射频电路和天线可以独立于进行基带处理的处理器而设置，例如在分布式场景中，射频电路和天线可以与独立于通信装置，呈拉远式的布置。
可理解，本申请实施例示出的通信装置还可以具有比图8更多的元器件等，本申请实施例对此不作限定。以上所示的处理器和收发器所执行的方法仅为示例，对于该处理器和收发器具体所执行的步骤可参照上文介绍的方法。
在另一种可能的实现方式中，图7所示的通信装置中，处理单元701可以是一个或多个逻辑电路，收发单元702可以是输入输出接口，又或者称为通信接口，或者接口电路，或接口等等。或者收发单元702还可以是发送单元和接收单元，发送单元可以是输出接口，接收单元可以是输入接口，该发送单元和接收单元集成于一个单元，例如输入输出接口。如图9所示，图9所示的通信装置包括逻辑电路901和接口902。即上述处理单元701可以用逻辑电路901实现，收发单元702可以用接口902实现。其中，该逻辑电路901可以为芯片、处理电路、集成电路或片上系统(system on chip，SoC)芯片等，接口902可以为通信接口、输入输出接口、管脚等。示例性的，图9是以上述通信装置为芯片为例出的，该芯片包括逻辑电路901和接口902。
本申请实施例中，逻辑电路和接口还可以相互耦合。对于逻辑电路和接口的具体连接方式，本申请实施例不作限定。
示例性的，当通信装置用于执行上述终端设备执行的方法或功能或步骤时，接口902，用于输出第一上行消息，该第一上行消息包括第一标识；接口902，还用于输入第一下行消息，该第一下行消息包括多个调制符号；逻辑电路901，用于基于第一标识对多个调制符号 进行处理，获得处理后的标识。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一标识确定信息比特与星座点之间的映射规则；以及基于映射规则对多个调制符号进行解调。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系确定映射规则。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一标识以及随机数生成算法确定控制比特；或者，基于第一标识以及哈希函数确定控制比特。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一部分标识和第二部分标识异或的结果以及哈希函数确定控制比特，第一部分标识和第二部分标识分别为第一标识的部分标识。
在一种可能的实现方式中，逻辑电路901，还用于在解调后的标识与第一标识相同的情况下，确定通信装置随机接入成功。
在一种可能的实现方式中，逻辑电路901，具体用于对多个调制符号进行解调，获得解调后的标识；以及基于加密算法和第一标识对已知信息进行加密，获得第二标识，已知信息由协议定义，或者由网络设备确定。
在一种可能的实现方式中，逻辑电路901，还用于在第二标识与解调后的标识相同的情况下，确定通信装置随机接入成功。
示例性的，当通信装置用于执行上述网络设备执行的方法或功能或步骤时，接口902，用于输入第一上行消息，该第一上行消息包括第一标识；逻辑电路901，用于基于第一标识确定信息比特与星座点之间的映射规则，基于映射规则对第一标识进行调制，获得多个调制符号；接口902，还用于输出第一下行消息，该第一下行消息包括多个调制符号。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系，确定映射规则。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一标识以及随机数生成算法确定控制比特；或者，基于第一标识以及哈希函数确定控制比特。
在一种可能的实现方式中，逻辑电路901，具体用于基于第一部分标识和第二部分标识异或的结果以及哈希函数确定控制比特，第一部分标识和第二部分标识分别为第一标识的部分标识。
在本申请的又一些实施例中，接口902，用于输入第一上行消息，该第一上行消息包括第一标识；逻辑电路901，用于基于加密算法以及第一标识对已知信息进行加密，获得第二标识，并对第二标识进行调制，获得多个调制符号，已知信息由协议定义，或者，已知信息由网络设备确定；接口902，还用于输出第一下行消息，第一下行消息包括多个调制符号。
可理解，本申请实施例示出的通信装置可以采用硬件的形式实现本申请实施例提供的方法，也可以采用软件的形式实现本申请实施例提供的方法等，本申请实施例对此不作限定。
可理解，对于上述实施例来说，关于第一上行消息、第一下行消息、第一标识、映射规则、控制比特、第二标识、多个调制符号等的说明可以参考上文，这里不再一一详述。对于图9所示的各个实施例的具体实现方式，还可以参考上述各个实施例，这里不再详述。
本申请实施例还提供了一种无线通信系统，该无线通信系统包括网络设备和终端设备，该网络设备和该终端设备可以用于执行前述任一实施例中的方法(如图4、图5a至图5g、图6等)。
此外，本申请还提供一种计算机程序，该计算机程序用于实现本申请提供的方法中由终 端设备执行的操作和/或处理。
本申请还提供一种计算机程序，该计算机程序用于实现本申请提供的方法中由网络设备执行的操作和/或处理。
本申请还提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机代码，当计算机代码在计算机上运行时，使得计算机执行本申请提供的方法中由终端设备执行的操作和/或处理。
本申请还提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机代码，当计算机代码在计算机上运行时，使得计算机执行本申请提供的方法中由网络设备执行的操作和/或处理。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机代码或计算机程序，当该计算机代码或计算机程序在计算机上运行时，使得本申请提供的方法中由终端设备执行的操作和/或处理被执行。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机代码或计算机程序，当该计算机代码或计算机程序在计算机上运行时，使得本申请提供的方法中由网络设备执行的操作和/或处理被执行。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口、装置或单元的间接耦合或通信连接，也可以是电的，机械的或其它的形式连接。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本申请实施例提供的方案的技术效果。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以是两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分，或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个可读存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的可读存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (38)

  1. 一种随机接入方法，所述方法应用于终端设备，其特征在于，所述方法包括：
    向网络设备发送第一上行消息，所述第一上行消息包括第一标识；
    接收来自所述网络设备的第一下行消息，所述第一下行消息包括多个调制符号；
    基于所述第一标识对所述多个调制符号进行处理，获得处理后的标识。
  2. 根据权利要求1所述的方法，其特征在于，所述基于第一标识对所述多个调制符号进行处理，包括：
    基于所述第一标识确定信息比特与星座点之间的映射规则；
    基于所述映射规则对所述多个调制符号进行解调。
  3. 根据权利要求2所述的方法，其特征在于，所述基于所述第一标识确定信息比特与星座点之间的映射规则，包括：
    基于所述第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系确定所述映射规则。
  4. 根据权利要求3所述的方法，其特征在于，所述基于所述第一标识确定控制比特，包括：
    基于所述第一标识以及随机数生成算法确定所述控制比特；或者，
    基于所述第一标识以及哈希函数确定所述控制比特。
  5. 根据权利要求4所述的方法，其特征在于，所述基于所述第一标识以及哈希函数确定所述控制比特，包括：
    基于第一部分标识和第二部分标识异或的结果以及所述哈希函数确定所述控制比特，所述第一部分标识和所述第二部分标识分别为所述第一标识的部分标识。
  6. 根据权利要求3-5任一项所述的方法，其特征在于，
    所述多个调制符号的调制方式包括二进制相移键控BPSK，所述控制比特为0，所述信息比特为0时星座点为(-1,0)，所述信息比特为1时星座点为(1,0)；所述控制比特为1，所述信息比特为0时星座点为(1,0)，所述信息比特为1时星座点为(-1,0)；
    所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为01，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为10，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为11，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；
    或者，所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所 述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为01，所述信息比特为00时星座点为(-1,1)，所述信息比特为01时星座点为(-1,-1)，所述信息比特为10时星座点为(1,1)，所述信息比特为11时星座点为(1,-1)；所述控制比特为10，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；所述控制比特为11，所述信息比特为00时星座点为(1,-1)，所述信息比特为01时星座点为(1,1)，所述信息比特为10时星座点为(-1,-1)，所述信息比特为11时星座点为(-1,1)。
  7. 根据权利要求3-6任一项所述的方法，其特征在于，所述第一标识的比特长度等于所述控制比特的比特长度。
  8. 根据权利要求1所述的方法，其特征在于，所述基于所述第一标识对所述多个调制符号进行处理，包括：
    对所述多个调制符号进行解调，获得解调后的标识；
    基于加密算法和所述第一标识对已知信息进行加密，获得第二标识，所述已知信息由协议定义，或者由所述网络设备确定。
  9. 根据权利要求8所述的方法，其特征在于，所述方法还包括：
    在所述第二标识与所述解调后的标识相同的情况下，确定所述终端设备随机接入成功。
  10. 一种随机接入方法，所述方法应用于网络设备，其特征在于，所述方法包括：
    接收来自终端设备的第一上行消息，所述第一上行消息包括第一标识；
    基于所述第一标识确定信息比特与星座点之间的映射规则，基于所述映射规则对所述第一标识进行调制，获得多个调制符号；
    向所述终端设备发送第一下行消息，所述第一下行消息包括所述多个调制符号。
  11. 根据权利要求10所述的方法，其特征在于，所述基于所述第一标识确定信息比特与星座点之间的映射规则，包括：
    基于所述第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系，确定所述映射规则。
  12. 根据权利要求11所述的方法，其特征在于，所述基于所述第一标识确定控制比特，包括：
    基于所述第一标识以及随机数生成算法确定所述控制比特；或者，
    基于所述第一标识以及哈希函数确定所述控制比特。
  13. 根据权利要求12所述的方法，其特征在于，所述基于所述第一标识以及哈希函数确定所述控制比特，包括：
    基于第一部分标识和第二部分标识异或的结果以及哈希函数确定所述控制比特，所述第一部分标识和所述第二部分标识分别为所述第一标识的部分标识。
  14. 根据权利要求11-13任一项所述的方法，其特征在于，
    所述多个调制符号的调制方式包括二进制相移键控BPSK，所述控制比特为0，所述信息比特为0时星座点为(-1,0)，所述信息比特为1时星座点为(1,0)；所述控制比特为1，所述信息比特为0时星座点为(1,0)，所述信息比特为1时星座点为(-1,0)；
    所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为01，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为10，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为11，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；
    或者，所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为01，所述信息比特为00时星座点为(-1,1)，所述信息比特为01时星座点为(-1,-1)，所述信息比特为10时星座点为(1,1)，所述信息比特为11时星座点为(1,-1)；所述控制比特为10，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；所述控制比特为11，所述信息比特为00时星座点为(1,-1)，所述信息比特为01时星座点为(1,1)，所述信息比特为10时星座点为(-1,-1)，所述信息比特为11时星座点为(-1,1)。
  15. 根据权利要求10-14任一项所述的方法，其特征在于，所述第一标识的比特长度等于所述控制比特的比特长度。
  16. 一种随机接入方法，所述方法应用于网络设备，其特征在于，所述方法包括：
    接收来自终端设备的第一上行消息，所述第一上行消息包括第一标识；
    基于加密算法以及所述第一标识对已知信息进行加密，获得第二标识，并对所述第二标识进行调制，获得多个调制符号，所述已知信息由协议定义，或者，所述已知信息由所述网络设备确定；
    向所述终端设备发送第一下行消息，所述第一下行消息包括所述多个调制符号。
  17. 一种通信装置，其特征在于，所述装置包括：
    收发单元，用于向网络设备发送第一上行消息，所述第一上行消息包括第一标识；
    所述收发单元，还用于接收来自所述网络设备的第一下行消息，所述第一下行消息包括多个调制符号；
    处理单元，用于基于所述第一标识对所述多个调制符号进行处理，获得处理后的标识。
  18. 根据权利要求17所述的装置，其特征在于，所述处理单元，具体用于基于所述第一 标识确定信息比特与星座点之间的映射规则；以及基于所述映射规则对所述多个调制符号进行解调。
  19. 根据权利要求18所述的装置，其特征在于，所述处理单元，具体用于基于所述第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系确定所述映射规则。
  20. 根据权利要求19所述的装置，其特征在于，所述处理单元，具体用于基于所述第一标识以及随机数生成算法确定所述控制比特；或者，基于所述第一标识以及哈希函数确定所述控制比特。
  21. 根据权利要求20所述的装置，其特征在于，所述处理单元，具体用于基于第一部分标识和第二部分标识异或的结果以及所述哈希函数确定所述控制比特，所述第一部分标识和所述第二部分标识分别为所述第一标识的部分标识。
  22. 根据权利要求19-21任一项所述的装置，其特征在于，
    所述多个调制符号的调制方式包括二进制相移键控BPSK，所述控制比特为0，所述信息比特为0时星座点为(-1,0)，所述信息比特为1时星座点为(1,0)；所述控制比特为1，所述信息比特为0时星座点为(1,0)，所述信息比特为1时星座点为(-1,0)；
    所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为01，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为10，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为11，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；
    或者，所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为01，所述信息比特为00时星座点为(-1,1)，所述信息比特为01时星座点为(-1,-1)，所述信息比特为10时星座点为(1,1)，所述信息比特为11时星座点为(1,-1)；所述控制比特为10，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；所述控制比特为11，所述信息比特为00时星座点为(1,-1)，所述信息比特为01时星座点为(1,1)，所述信息比特为10时星座点为(-1,-1)，所述信息比特为11时星座点为(-1,1)。
  23. 根据权利要求19-22任一项所述的装置，其特征在于，所述第一标识的比特长度等于所述控制比特的比特长度。
  24. 根据权利要求17所述的装置，其特征在于，所述处理单元，具体用于对所述多个调制符号进行解调，获得解调后的标识；以及基于加密算法和所述第一标识对已知信息进行加密，获得第二标识，所述已知信息由协议定义，或者由所述网络设备确定。
  25. 根据权利要求24所述的装置，其特征在于，所述处理单元，还用于在所述第二标识与所述解调后的标识相同的情况下，确定所述通信装置随机接入成功。
  26. 一种随机接入装置，其特征在于，所述装置包括：
    收发单元，用于接收来自终端设备的第一上行消息，所述第一上行消息包括第一标识；
    处理单元，用于基于所述第一标识确定信息比特与星座点之间的映射规则，基于所述映射规则对所述第一标识进行调制，获得多个调制符号；
    所述收发单元，还用于向所述终端设备发送第一下行消息，所述第一下行消息包括所述多个调制符号。
  27. 根据权利要求26所述的装置，其特征在于，处理单元，具体用于基于所述第一标识确定控制比特，基于不同的控制比特与不同的映射规则之间的对应关系，确定所述映射规则。
  28. 根据权利要求27所述的装置，其特征在于，处理单元，具体用于基于所述第一标识以及随机数生成算法确定所述控制比特；或者，基于所述第一标识以及哈希函数确定所述控制比特。
  29. 根据权利要求28所述的装置，其特征在于，处理单元，具体用于基于第一部分标识和第二部分标识异或的结果以及哈希函数确定所述控制比特，所述第一部分标识和所述第二部分标识分别为所述第一标识的部分标识。
  30. 根据权利要求27-29任一项所述的装置，其特征在于，所述多个调制符号的调制方式包括二进制相移键控BPSK，所述控制比特为0，所述信息比特为0时星座点为(-1,0)，所述信息比特为1时星座点为(1,0)；所述控制比特为1，所述信息比特为0时星座点为(1,0)，所述信息比特为1时星座点为(-1,0)；
    所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为01，所述信息比特为00时星座点为所述信息比特为01时星座点为所述信息比特为10时星座点为所述信息比特为11时星座点为所述控制比特为10，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为11，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；
    或者，所述多个调制符号的调制方式包括正交相移键控QPSK，所述控制比特为00，所述信息比特为00时星座点为(1,1)，所述信息比特为01时星座点为(-1,1)，所述信息比特为10时星座点为(1,-1)，所述信息比特为11时星座点为(-1,-1)；所述控制比特为01，所述信 息比特为00时星座点为(-1,1)，所述信息比特为01时星座点为(-1,-1)，所述信息比特为10时星座点为(1,1)，所述信息比特为11时星座点为(1,-1)；所述控制比特为10，所述信息比特为00时星座点为(-1,-1)，所述信息比特为01时星座点为(1,-1)，所述信息比特为10时星座点为(-1,1)，所述信息比特为11时星座点为(1,1)；所述控制比特为11，所述信息比特为00时星座点为(1,-1)，所述信息比特为01时星座点为(1,1)，所述信息比特为10时星座点为(-1,-1)，所述信息比特为11时星座点为(-1,1)。
  31. 根据权利要求26-30任一项所述的装置，其特征在于，所述第一标识的比特长度等于所述控制比特的比特长度。
  32. 一种随机接入装置，其特征在于，所述装置包括：
    收发单元，用于接收来自终端设备的第一上行消息，所述第一上行消息包括第一标识；
    处理单元，用于基于加密算法以及所述第一标识对已知信息进行加密，获得第二标识，并对所述第二标识进行调制，获得多个调制符号，所述已知信息由协议定义，或者，所述已知信息由所述网络设备确定；
    所述收发单元，还用于向所述终端设备发送第一下行消息，所述第一下行消息包括所述多个调制符号。
  33. 一种通信装置，其特征在于，包括处理器和存储器；
    所述存储器用于存储指令；
    所述处理器用于执行所述指令，以使权利要求1-9任一项所述的方法被执行；或者，以使权利要求10-16任一项所述的方法被执行。
  34. 根据权利要求33所述的装置，其特征在于，所述通信装置为芯片。
  35. 一种通信装置，其特征在于，包括逻辑电路和接口，所述逻辑电路和所述接口耦合；
    所述接口用于输入待处理的数据，所述逻辑电路按照如权利要求1-16任一项所述的方法对所述待处理的数据进行处理，获得处理后的数据，所述接口用于输出所述处理后的数据。
  36. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质用于存储计算机程序，当所述计算机程序被执行时，权利要求1-16任一项所述的方法被执行。
  37. 一种计算机程序，其特征在于，当所述计算机程序被执行时，权利要求1-9任一项所述的方法被执行，或者，权利要求10-16任一项所述的方法被执行。
  38. 一种通信系统，其特征在于，包括终端设备和网络设备，所述终端设备用于执行如权利要求1-9任一项所述的方法，所述网络设备用于执行如权利要求10-16任一项所述的方法。
PCT/CN2023/081884 2022-03-30 2023-03-16 随机接入方法及装置 WO2023185491A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210326062.6A CN116939612A (zh) 2022-03-30 2022-03-30 随机接入方法及装置
CN202210326062.6 2022-03-30

Publications (1)

Publication Number Publication Date
WO2023185491A1 true WO2023185491A1 (zh) 2023-10-05

Family

ID=88199076

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/081884 WO2023185491A1 (zh) 2022-03-30 2023-03-16 随机接入方法及装置

Country Status (2)

Country Link
CN (1) CN116939612A (zh)
WO (1) WO2023185491A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180035470A1 (en) * 2016-07-28 2018-02-01 Asustek Computer Inc. Method and apparatus for improving msg3 transmission of random access procedure in a wireless communication system
US20190141741A1 (en) * 2016-11-11 2019-05-09 Telefonaktiebolaget Lm Ericsson (Publ) Random-Access Procedure
CN112889339A (zh) * 2018-10-24 2021-06-01 高通股份有限公司 两步随机接入规程的消息2以及与四步随机接入规程的共存
CN114175841A (zh) * 2019-08-23 2022-03-11 华为技术有限公司 一种数据传输方法及装置
CN114245471A (zh) * 2022-02-28 2022-03-25 成都爱瑞无线科技有限公司 随机接入信号处理方法、随机接入方法、装置及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180035470A1 (en) * 2016-07-28 2018-02-01 Asustek Computer Inc. Method and apparatus for improving msg3 transmission of random access procedure in a wireless communication system
US20190141741A1 (en) * 2016-11-11 2019-05-09 Telefonaktiebolaget Lm Ericsson (Publ) Random-Access Procedure
CN112889339A (zh) * 2018-10-24 2021-06-01 高通股份有限公司 两步随机接入规程的消息2以及与四步随机接入规程的共存
CN114175841A (zh) * 2019-08-23 2022-03-11 华为技术有限公司 一种数据传输方法及装置
CN114245471A (zh) * 2022-02-28 2022-03-25 成都爱瑞无线科技有限公司 随机接入信号处理方法、随机接入方法、装置及存储介质

Also Published As

Publication number Publication date
CN116939612A (zh) 2023-10-24

Similar Documents

Publication Publication Date Title
TWI716945B (zh) 6ghz中的eht傳輸保護機制
RU2019124694A (ru) Пользовательское оборудование и базовая станция, участвующие в процедуре обновления сети с радиодоступом
US10608999B2 (en) Establishing a secure uplink channel by transmitting a secret word over a secure downlink channel
WO2017000291A1 (zh) 传输上行数据的方法和设备
TW202019228A (zh) 確定先聽後說及通道存取優先順序類別的方法及使用者設備
US10645735B2 (en) Enhanced data rate low energy wireless communications
US11197164B2 (en) Protocols for flexible channel utilization
CN113228761A (zh) 在uwb网络中对测距发起器和响应器的控制
WO2018230191A1 (ja) 送信装置、受信装置、送信方法、受信方法及び記録媒体
US20190223257A1 (en) Relay indication method and access point ap
WO2017000145A1 (zh) 数据传输方法和装置
WO2017000900A1 (zh) 传输信息的方法和设备
US11277739B2 (en) Enhanced physical layer security
WO2021062811A1 (zh) 数据传输方法及相关设备
US20230389068A1 (en) Multi-user (mu) enhanced distributed channel access (edca) termination signaling
US10278206B2 (en) Method for scheduling radio resource in unlicensed spectrum and base station using thereof
CN113630774A (zh) 在无线网络中的多链路设备（mld）地址发现的方法与装置
WO2023185491A1 (zh) 随机接入方法及装置
WO2021088069A1 (zh) 信息传输方法及相关产品
US10848265B2 (en) Range extension of wireless communication device
KR20210073449A (ko) 무선 통신 시스템에서의 보안 통신 방법 및 장치
WO2017167001A1 (zh) 资源调度方法、终端设备及系统
TWI836730B (zh) 完整性保護方法和相關無線通信裝置
WO2023142120A1 (zh) 通信方法、装置、设备、芯片、存储介质、产品及程序
WO2024000591A1 (zh) 无线通信方法和通信设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23777866

Country of ref document: EP

Kind code of ref document: A1