Communication method and device

Abstract

The present application relates to the technical field of communications, and provides a communication method and device. The method comprises: sending a first sequence to a first device, wherein the first sequence is used for identifying a second device, and the second device is the sender of the first sequence; receiving first information from the first device, wherein the first information comprises the first sequence, and the first information is used for confirming that the first device successfully receives the first sequence; scrambling, on the basis of the first sequence, a data sequence to be sent to generate a second sequence; and sending the second sequence to the first device. According to the embodiments, the first sequence can be used as the identifier of the sender in a random access scenario and can also be used for scrambling the data sequence to be sent, and the sender can implement data scrambling without needing an additional storage space. Thus, the method provided by the embodiments of the present application reduces the scrambling complexity, and can prevent the receiver from mistakenly identify data as being sent by another sender.

Description

Communication method and device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on November 16, 2023, with application number 202311531917.X and application name “Communication Method and Device”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communication technology, and more particularly, to a communication method and apparatus. Background Art

[0003] In passive Internet of Things (IoT) communication systems, the transmitter can scramble the data to be transmitted at the physical layer. Different transmitters use different scrambling sequences during the scrambling process. This allows the receiver to descramble the received data based on the scrambling sequences of each transmitter. The receiver can determine which transmitter the received data originated from, thus preventing data misinterpretation and mistaking data from one transmitter for data from another. For example, the transmitter can scramble the bits of the data channel using a pseudo-random gold sequence. However, gold sequences require a large amount of storage space and computing resources, making them unsuitable for systems with low power consumption and complexity requirements.

[0004] Therefore, how to reduce the complexity of scrambling is an urgent problem to be solved.

[0005] Summary of the Invention

[0006] The present application provides a communication method and apparatus that can reduce the complexity of scrambling.

[0007] In a first aspect, a method is provided. The method can be performed by a second device, or by a component (e.g., a processor, chip, or chip system) in the second device, or by a logic module or software capable of implementing all or part of the functionality of the second device. The method includes: sending a first sequence to a first device, the first sequence being used to identify the second device, the second device being the sender of the first sequence; receiving first information from the first device, the first information including the first sequence, the first information being used to confirm that the first device successfully received the first sequence; scrambling a data sequence to be transmitted based on the first sequence to generate a second sequence; and sending the second sequence to the first device.

[0008] Through the above embodiment, the first sequence can be used as an identifier of the transmitting end in a random access scenario and can also be used to scramble the data sequence to be transmitted. The transmitting end does not require additional storage space to achieve data scrambling. Therefore, the method provided by the embodiment of the application reduces the complexity of scrambling and can prevent the receiving end from misinterpreting data as being sent by another transmitting end.

[0009] In combination with the first aspect, in certain implementations of the first aspect, the data sequence to be sent includes an information sequence and a check sequence of the information sequence, the number of bits of the check sequence is N, and the second sequence includes the information sequence and a third sequence, where N is a positive integer; wherein the third sequence is obtained by scrambling the check sequence according to N bits corresponding to the first sequence.

[0010] Through the above embodiment, the transmitting end can scramble only the check sequence to be sent according to the first sequence. Therefore, the scrambling complexity of the method provided in the embodiment of the present application is low, and it can prevent the receiving end from misinterpreting the data as being sent by other transmitting ends.

[0011] In combination with the first aspect, in certain implementations of the first aspect, the number of bits of the data sequence to be sent is N, where N is a positive integer; wherein the second sequence is obtained by scrambling the data sequence to be sent according to N bits corresponding to the first sequence.

[0012] Through the above embodiment, the transmitting end can scramble all the data sequences to be transmitted according to the first sequence, which complies with the data channel scrambling mechanism specified in the current protocol, thereby improving the applicability of the method of the embodiment of the present application. In addition, the method provided by the embodiment of the present application has a good scrambling effect, which can further prevent the receiving end from misinterpreting the data as being sent by another transmitting end.

[0013] In combination with the first aspect, in certain implementations of the first aspect, the N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences.

[0014] Through the above embodiment, the transmitting end can scramble all data sequences or all check sequences to be sent according to the first sequence. Therefore, the method provided by the embodiment of the present application has a good scrambling effect and can further prevent the receiving end from misinterpreting the data as being sent by other transmitting ends.

[0015] In combination with the first aspect, in certain implementations of the first aspect, the data sequence to be sent includes an information sequence and a check sequence of the information sequence, the number of bits of the first sequence is M, the number of bits of the check sequence is greater than or equal to M, the second sequence includes the information sequence and a third sequence, M is a positive integer; wherein the third sequence is obtained by scrambling M bits in the check sequence based on the M bits of the first sequence.

[0016] Through the above embodiment, the transmitting end can scramble some bits of the check sequence according to the first sequence, further reducing the complexity of scrambling and preventing the receiving end from misinterpreting data as being sent by other transmitting ends.

[0017] In combination with the first aspect, in certain implementations of the first aspect, the number of bits of the first sequence is M, wherein the second sequence is obtained by scrambling M subsequences according to the M bits of the first sequence, and the data sequence to be sent is divided into the M subsequences, wherein when the mth bit in the M bits is 0, the bits of the mth subsequence in the M subsequences are inverted, and M is a positive integer, m=1,…,M.

[0018] Through the above-described embodiment, the transmitting end can perform all scrambling of the data sequence to be transmitted according to the first sequence, which complies with the data channel scrambling mechanism specified in the current protocol, thereby improving the applicability of the method of the embodiment of the present application. Furthermore, the method provided by the embodiment of the present application can quickly scramble the data sequence to be transmitted of various lengths, has a good scrambling effect, and can further prevent the receiving end from misinterpreting the data as being sent by another transmitting end.

[0019] In a second aspect, a communication method is provided. The method can be performed by a first device, or by a component (e.g., a processor, chip, or chip system) within the first device, or by a logic module or software capable of implementing all or part of the functionality of the first device. The method includes: receiving a first sequence from a second device, the first sequence being used to identify the second device; sending first information to the second device, the first information including the first sequence, the first information being used to confirm that the first device successfully received the first sequence; receiving a second sequence from the second device; and descrambling the second sequence based on the first sequence to obtain a target data sequence.

[0020] Through the above embodiments, the first sequence can be used as an identifier of the transmitting end in a random access scenario and can also be used to descramble the received data sequence. The receiving end does not require additional storage space to achieve data descrambling. Therefore, the method provided by the embodiment of the application reduces the complexity of descrambling and can prevent the receiving end from misinterpreting data as being sent by another transmitting end.

[0021] In combination with the second aspect, in certain implementations of the second aspect, the target data sequence includes an information sequence and a check sequence of the information sequence, the number of bits of the check sequence is N, the second sequence includes the information sequence and a third sequence, and N is a positive integer; wherein the check sequence is obtained by descrambling the third sequence based on N bits corresponding to the first sequence.

[0022] Through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the check sequence. Therefore, the descrambling method provided by the embodiment of the present application has low descrambling complexity and can prevent the receiving end from misinterpreting the data as being sent by other sending ends.

[0023] In combination with the second aspect, in certain implementations of the second aspect, the number of bits of the target data sequence is N, where N is a positive integer; wherein the target data sequence is obtained by descrambling the second sequence according to the N bits corresponding to the first sequence.

[0024] Through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the target data sequence. Therefore, the method provided by the embodiment of the present application has a good descrambling effect and can further prevent the receiving end from misinterpreting the data as being sent by other sending ends.

[0025] In combination with the second aspect, in certain implementations of the second aspect, the N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences.

[0026] Through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the target data sequence or the check sequence. Therefore, the method provided by the embodiment of the present application has a good descrambling effect and can further prevent the receiving end from misinterpreting the data as being sent by other sending ends.

[0027] In combination with the second aspect, in certain implementations of the second aspect, the target data sequence includes an information sequence and a check sequence of the information sequence, the number of bits of the first sequence is M, the number of bits of the check sequence is greater than or equal to M, the second sequence includes the information sequence and a third sequence, and M is a positive integer; wherein the check sequence is obtained by descrambling M bits in the third sequence based on the M bits of the first sequence.

[0028] Through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the check sequence. The method provided by the embodiment of the present application has low descrambling complexity and can prevent the receiving end from misinterpreting data as being sent by other sending ends.

[0029] In combination with the second aspect, in certain implementations of the second aspect, the number of bits of the first sequence is M, wherein the target data sequence is obtained by descrambling M subsequences according to the M bits of the first sequence, and the second sequence is divided into the M subsequences, wherein when the mth bit in the M bits is 0, the bits of the mth subsequence in the M subsequences are inverted, and M is a positive integer, m=1,…,M.

[0030] Through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the target data sequence. The method provided by the embodiment of the present application has a good descrambling effect and can further prevent the receiving end from misinterpreting the data as being sent by other sending ends.

[0031] In a third aspect, a communication device is provided, comprising a processor, wherein the processor is configured to enable the communication device to execute the first aspect and any possible method of the first aspect, or enable the communication device to execute the first aspect and any possible method of the second aspect, by executing a computer program or instruction, or by processing a circuit.

[0032] In one possible implementation, the communication device further includes a memory for storing the computer program or instruction. Further, the processor is specifically configured to call and execute the computer program or computer instruction stored in the memory, so that the processor implements any one of the implementations of the first aspect or the second aspect.

[0033] In one possible implementation, the communication device further includes a transceiver (also referred to as a communication interface), the transceiver being configured to input and / or output signals via the communication interface, and the processor being configured to control the transceiver to transmit and receive signals.

[0034] In a fourth aspect, a communication device is provided, comprising a processing circuit (also referred to as a processor) and an input / output interface (also referred to as an interface circuit), the input / output interface being used to input and / or output signals, the processing circuit being used to execute the first aspect and any possible method of the first aspect; or the processing circuit being used to execute the second aspect and any possible method of the second aspect.

[0035] In one possible implementation, the processor is configured to communicate with other devices via an interface circuit and execute any one of the implementations in the first aspect or any one of the implementations in the second aspect.

[0036] In a fifth aspect, a communication device is provided. The communication device may be a first device, or a device or module for performing the function of the first device; the communication device may be a second device, or a device or module for performing the function of the second device.

[0037] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the first aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

[0038] In another possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the second aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

[0039] In the sixth aspect, a computer-readable storage medium is provided, on which a computer program or instruction is stored. When the computer program or the instruction is run on a computer, the first aspect and any possible method of the first aspect are executed; or, the second aspect and any possible method of the second aspect are executed.

[0040] In the seventh aspect, a computer program product is provided, comprising a computer program or instructions, which, when run on a computer, causes the first aspect and any possible method of the first aspect to be executed; or causes the second aspect and any possible method of the second aspect to be executed.

[0041] In an eighth aspect, a communication device is provided, comprising a processor connected to a memory and configured to call a program stored in the memory to execute any possible method of the first aspect or any possible method of the second aspect. The memory may be located within or outside the communication device. The processor may include one or more processors.

[0042] In one implementation, the communication device of the third, fourth, and fifth aspects may be a chip or a chip system.

[0043] In a ninth aspect, a chip device is provided, comprising a processor for calling a computer program or computer instruction in a memory so that the processor executes any one of the implementations in the first aspect or any one of the implementations in the second aspect.

[0044] Optionally, the processor is coupled to the memory via an interface.

[0045] In a tenth aspect, a communication system is provided, which includes a first device and a second device; the first device is used to execute the method shown in the second aspect, and the second device is used to execute the method shown in the first aspect.

[0046] In the eleventh aspect, a communication method is provided, which is applied to a first device and a second device, wherein the method includes: the first device executes the method shown in the second aspect; the second device executes the method shown in the first aspect.

[0047] The description of the advantageous effects of any of the third to eleventh aspects etc. may refer to the description of the advantageous effects of the first or second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] FIG1 is a schematic diagram of the architecture of a communication system used in an embodiment of the present application.

[0049] FIG2 is a schematic flowchart of a communication method provided in an embodiment of the present application.

[0050] FIG3 is a schematic flowchart of another communication method provided in an embodiment of the present application.

[0051] FIG4 is a schematic diagram of data scrambling provided in an embodiment of the present application.

[0052] FIG5 is a schematic block diagram of a communication device according to an embodiment of the present application.

[0053] FIG6 is a schematic block diagram of another communication device according to an embodiment of the present application.

[0054] FIG7 is a schematic block diagram of a communication system according to an embodiment of the present application. DETAILED DESCRIPTION

[0055] The technical solution in this application will be described below with reference to the accompanying drawings.

[0056] The technical solutions provided in this application can be applied to various communication systems, such as: fifth generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, etc. The technical solutions provided in this application can also be applied to future communication systems, such as the sixth generation (6G) mobile communication system. The technical solutions provided in this application can also be applied to device to device (D2D) communication, machine to machine (M2M) communication, machine type communication (MTC), as well as IoT communication systems, artificial intelligence & internet of things (A-IoT) or other communication systems. This application is not limited to this.

[0057] With the development of communication technology, communication systems will not only support traditional communications, but also support vehicle-to-everything (V2X) communication (also known as vehicle-to-network communication), vehicle-to-vehicle (V2V) communication (also known as vehicle-to-vehicle communication), vehicle-to-infrastructure (V2I) communication (also known as vehicle-to-infrastructure communication), vehicle-to-pedestrian (V2P) communication (also known as vehicle-to-pedestrian communication), and vehicle-to-network (V2N) communication (also known as vehicle-to-network communication). For example, communication systems may also support next-generation wireless local area network systems.

[0058] The terminal device in the embodiment of the present application can be referred to as a terminal. The terminal device can be a device with wireless transceiver function. The terminal device can be mobile or fixed. The terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on the water surface (such as a ship, etc.); it can also be deployed in the air (for example, on an airplane, a balloon, and a satellite, etc.). The terminal device may include a mobile phone, a tablet computer, a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal device in industrial control, a wireless terminal device in self-driving, a wireless terminal device in remote medical, a wireless terminal device in a smart grid, a wireless terminal device in transportation safety, a wireless terminal device in a smart city, and / or a wireless terminal device in a smart home. The terminal device may also be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device or computing device with wireless communication capabilities, a vehicle-mounted device, a wearable device, a terminal device in a 5G network, or a terminal device in a future-evolved public land mobile network (PLMN), etc. The terminal device may also sometimes be referred to as user equipment (UE), a mobile station (MS), a mobile terminal (MT), etc. Optionally, the terminal device may communicate with multiple access network devices of different technologies. For example, the terminal device may communicate with an access network device that supports LTE, or with an access network device that supports 5G, or may be dual-connected with an access network device that supports LTE and an access network device that supports 5G. This application is not limited thereto.

[0059] In addition, the terminal device can be an IoT device or an A-IoT device, such as a passive terminal device, a semi-passive terminal device, a passive A-IoT terminal device, a semi-passive A-IoT terminal device, etc. The terminal device can be a sensor, an electricity meter, a water meter, etc. The terminal device can also be an unmanned aerial vehicle (UAV) with communication function. When the terminal device is passive or semi-passive, the terminal device can obtain energy to receive or send data. The energy can be obtained by radio, solar energy, light energy, wind energy, water energy, thermal energy, kinetic energy, etc. This application does not limit the way in which passive or semi-passive terminal devices obtain energy. The terminal device can have the ability to backscatter, and the terminal device with backscattering capability can backscatter the carrier received by the terminal device. The terminal device may include an envelope detection receiver.

[0060] In this application, the device for implementing the function of the terminal device may be the terminal device; it may also be a device that can support the terminal device to implement the function, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module. The device can be installed in the terminal device or can be used in combination with the terminal device. In the technical solution provided in this application, the device for implementing the function of the terminal device is the terminal device. The following may take the terminal device as an example to describe the technical solution provided in this application.

[0061] A network device may be a node or device that connects a terminal device to a wireless network, or a network device is an entity on the network side for transmitting or receiving signals. Examples of network devices include, but are not limited to, base stations, radio access network (RAN) equipment, next-generation node B (gNB) in 5G, evolved node B (eNB), radio network controller (RNC), node B (NB), base station controller (BSC), base transceiver station (BTS), home base station (e.g., home evolved node B, or home node B, HNB), base band unit (BBU), transmitting and receiving point (TRP), transmitting point (TP), and / or mobile switching center. Alternatively, the access network device may also be at least one of a centralized unit (CU), a distributed unit (DU), a centralized unit control plane (CU-CP) node, a centralized unit user plane (CU-UP) node, an integrated access and backhaul (IAB), or a wireless controller in a cloud radio access network (CRAN) scenario. Alternatively, the network device may be a relay station, an access point, an on-vehicle device, a terminal device, a wearable device, a network device in a 5G network, or a network device in a future evolved public land mobile network (PLMN). Below, the network device may be referred to as a base station.

[0062] In this application, the device for implementing the functions of a network device may be a network device; it may also be a device capable of supporting the network device in implementing the functions, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module, which may be installed in the network device or used in conjunction with the network device. In the technical solutions provided in this application, the device for implementing the functions of the network device may be an access network device. The following description of the technical solutions provided in this application may take the network device as an example, namely, a base station.

[0063] The reader can interact with the terminal device through radio frequency signals or wireless signals. It should be understood that this application does not limit the name of the reader. The reader can continue to use the name of the reader. The reader can also have other names, for example, the reader can also be called a reader / writer, or a helper. The reader has the function of performing some operations on the terminal device (such as a passive terminal device) (such as obtaining information of the passive terminal device, inventory operation, read operation, write operation, invalidation operation, or other message interaction operations with the passive terminal device, etc.).

[0064] As some examples of reader operations, the reader can send instructions from a server or application function to a passive terminal device, or the reader can send messages from a passive terminal device to a server or application function. The reader can obtain information stored in a specified passive terminal device based on the instructions issued by the server. For example, if it is an inventory operation (or it can be called an inventory operation), the reader can obtain the identification information of the passive terminal device; this identification information can be the unique identifier of the passive terminal device or a temporary identifier of the passive terminal device. For example, if it is a read operation, the reader can read data from the storage area of ​​the passive terminal device. In some scenarios where it is necessary to rewrite the information stored in the passive terminal device, the reader can also have a write function. For example, if it is a write operation, the reader can write data to the storage area of ​​the passive terminal device. In addition, the reader can also perform an invalidation operation on the passive terminal device. After the invalidation operation is performed, the passive terminal device becomes invalid and cannot perform operations such as obtaining passive terminal device information, inventory operations, read operations, message interaction operations with the passive terminal device, or write operations. In this application, the reader can be a terminal device, or an access network device, a pole station, a micro station, a small station, an eNodeB, a gNodeB, an integrated access and backhaul (IAB) node, etc. This application does not limit the form of the reader.

[0065] 1 is a schematic diagram of the architecture of a communication system 100 used in an embodiment of the present application. The communication system 100 may be a radio frequency identification (RFID) system.

[0066] The system 100 may include a first device 110 and a second device 120 , wherein the first device 110 and the second device 120 may communicate with each other via radio frequency (RF) signals.

[0067] The present application does not limit the specific form of the first device 110. The first device 110 can be any entity that can transmit or receive signals. For example, the first device 110 can include a network device, a reader, an assistant or an NR terminal, etc. The present application does not limit the specific form of the second device 120. For example, the second device 120 can include a passive terminal device, a passive A-IoT terminal device, a semi-passive terminal device or a semi-passive A-IoT terminal device, etc. The second device 120 can also be a tag. Further, the second device 120 can be an active tag or a passive tag. If the second device 120 is a passive tag, that is, the second device 120 does not have a power supply itself, then the second device 120 can obtain energy from the RF signal transmitted by the first device.

[0068] Figure 2 is a schematic flow chart of a communication method 200 provided in an embodiment of the present application. Figure 2 relates to communication between a first device 110 and a second device 120. Second device 120 can be passive. Thus, first device 110 can continuously transmit a signal containing a high-level waveform to second device 120. After receiving the signal, second device 120 reflects the information back to first device 110 via a reverse link based on the energy in the signal. Method 200 is described below in conjunction with Figure 2.

[0069] S210 : The first device 110 sends a select signaling to the second device 120 . Correspondingly, the second device 120 receives the select signaling from the first device 110 .

[0070] The selection signaling can carry a mask identification (ID) or a tag ID of the second device. Through the selection signaling, the first device 110 can access the second device 120 or the group to which the second device 120 belongs.

[0071] The above S210 can be regarded as a selection process, through which the first device 110 can access a specific tag or tag group.

[0072] S220 : The first device 110 sends a query signaling to the second device 120 . Correspondingly, the second device 120 receives the query signaling from the first device 110 .

[0073] S230: The second device 120 determines parameters of the time slot counter according to the query signaling.

[0074] The query signaling may include a query parameter, and the second device may determine the parameters of the time slot counter according to the query parameter.

[0075] In some embodiments, the query parameter is Q, and the second device can be from 0 to 2 Q-1The second device may randomly draw a number from the range of 0 to 4 as the parameter of the time slot counter. For example, if the query parameter is 3, the second device may randomly draw a number from the range of 0 to 4, such as 2, and the parameter of the time slot counter is 2. For another example, if the query parameter is 4, the second device may randomly draw a number from the range of 0 to 8, such as 5, and the parameter of the time slot counter is 5.

[0076] S240 : The first device 110 sends a query repetition (queryrep) signaling to the second device 120 . The second device 120 receives the query repetition signaling from the first device 110 .

[0077] The query repetition signaling may repeat the query signaling operation without changing the query signaling parameters. The query repetition signaling may omit some parameters to save signaling overhead. The second device 120 may determine the parameters omitted in the query repetition signaling based on the query signaling received in S230.

[0078] It should be noted that the above-mentioned selection signaling, query signaling or query repetition signaling may also be referred to as paging signaling, or may be referred to as group paging signaling.

[0079] S250 , the second device 120 determines to send RN16 signaling according to the parameters of the timeslot counter. Correspondingly, the first device 110 receives the signaling from the second device 120 .

[0080] The RN16 signaling may include a sequence for identifying the second device 120, which may also be referred to as a preamble sequence for identifying the second device 120, or a message (MSG) 1 sequence for identifying the second device 120 during random access.

[0081] After receiving the query repetition signaling, the second device 120 may determine whether to execute S250. If the slot counter parameter is not 0, the second device 120 does not send RN16 signaling to the first device 110 and decrements the slot counter parameter by 1. If the slot counter parameter is 0, the second device 120 sends RN16 signaling to the first device 110. In other words, a tag whose slot counter parameter is a non-zero value enters a waiting state after receiving the query repetition signaling, and a tag whose slot counter parameter is 0 enters a responding state after receiving the query repetition signaling.

[0082] For example, if the parameter of the time slot counter set by the second device 120 in S230 is 1, then after receiving the query repetition signaling for the first time, since the parameter of the time slot counter is not 0, no RN16 signaling is sent to the first device 110, and the parameter of the time slot counter is subtracted by 1 to obtain 0. After the second device 120 receives the query repetition signaling for the second time, since the parameter of the time slot counter is 0, RN16 signaling is sent to the first device 110.

[0083] The RN16 signaling may include a first sequence, which may be a random or pseudo-random sequence. It should be noted that RN16 may also have other names. The first sequence may be generated by the second device 120 itself, rather than being configured or indicated to the second device 120 by the first device 110. However, this application is not limited to this, and the first sequence may also be configured or indicated to the second device 120 by the first device 110.

[0084] S260 : The first device 110 sends an acknowledgement (ACK) signaling to the second device 120 . Correspondingly, the second device 120 receives the acknowledgement signaling from the first device 110 .

[0085] The confirmation signaling may include the first information, and the first information may include the first sequence. When the first sequence in the first information in the confirmation signaling is the same as the first sequence in the RN16 signaling, the second device 120 is in a confirmation state. In the confirmation state, the second device 120 may send data to the first device 110. For example, the second device 120 may send an electronic product code (EPC) or uplink data in response to a read signaling or a write signaling to the first device 110. The information bits of the above data may be transmitted via a physical uplink shared channel (PUSCH). In addition, while sending the uplink information bits, check bits of the uplink information bits may be sent. For example, the check bits may be a cyclic redundancy check (CRC).

[0086] The above steps S220 to S260 may be considered as an inventory process (or an inventory checking process). After the inventory process is completed, the first device 110 may send a read signaling or a write signaling to the second device 120, or perform further uplink and downlink information exchange with the second device 120.

[0087] In addition, the method 200 may further include: the first device 110 sending a query adjustment signaling to the second device 120. Correspondingly, the second device 120 receives the query adjustment signaling from the first device 110.

[0088] The query adjustment signaling may also be referred to as paging signaling, or group paging signaling. The query adjustment signaling may include a query parameter, which may cause the second device 120 to re-execute S230, i.e., re-determine the slot counter parameters. Specifically, after the second device 120 determines the slot counter parameters based on the query signaling, if the second device 120 receives the query adjustment signaling, the second device 120 may determine new slot counter parameters based on the query adjustment signaling. For example, if the query parameter in the query signaling is 10, the second device 120 may draw a random number within the range of 0 to 512 as the slot counter parameter. Because the range of 0 to 512 is large, the slot counter parameter determined by the second device 120 is also large. This requires the first device 110 to send a large number of query repetition signaling to the second device 120 in order to reduce the slot counter parameter to 0, thereby enabling the second device 120 to execute S250, i.e., initiate random access. The first device 110 may include a smaller query parameter, such as 3, in the query adjustment signaling. In this way, the second device 120 can draw a random number in the range of 0 to 4 as the parameter of the new time slot counter. The parameter of the new time slot counter is smaller, which enables the first device 110 to send a small amount of query repetition signaling to the second device 120 to reduce the parameter of the time slot counter to 0, thereby enabling the second device 120 to execute S250, that is, initiate random access.

[0089] As mentioned above, how to reduce the complexity of scrambling is an urgent problem to be solved.

[0090] Figure 3 is a schematic flow chart of another communication method 300 provided by an embodiment of the present application. Method 300 involves the interaction between the first device 110 and the second device 120. Method 300 can reduce the complexity of scrambling and can avoid data misunderstanding at the data receiving end. It should be noted that method 300 can be combined with method 200, and method 300 is described with uplink transmission as an example. Method 300 can also be similarly applied to downlink transmission. During uplink transmission, the embodiment of the present application can avoid the base station from misunderstanding that the data it receives (actually from the target tag) comes from other tags; during downlink transmission, the embodiment of the present application can avoid the target tag from misunderstanding that the data it receives (actually to be sent to other tags) is sent to the target tag. The following is a detailed introduction to method 300 in conjunction with Figure 3.

[0091] S310 : The second device 120 sends a first sequence to the first device 110 . Correspondingly, the first device 110 receives the first sequence from the second device 120 .

[0092] The first sequence may be used to identify the second device 120. The first sequence is used to identify the second device 120. It can be understood that the first sequence is an identifier of the second device 120, or the first sequence corresponds to or is associated with the second device 120.

[0093] The first sequence may also be referred to as a preamble sequence for identifying the second device 120, or a message 1 sequence for identifying the second device 120 during random access. This application does not limit the specific name of the first sequence, and the first sequence may be called a scrambling sequence, a feedback sequence, a response sequence, or other names.

[0094] The first sequence may be a random number sequence or a pseudo-random number sequence. The first sequence may be generated by the second device 120 itself, rather than being configured or indicated to the second device 120 by the first device 110. However, this application is not limited to this, and the first sequence may also be configured or indicated to the second device 120 by the first device 110.

[0095] The above S310 may be performed after the second device 120 receives query signaling, query repetition signaling, or paging signaling. That is, after the second device 120 receives query signaling, query repetition signaling, or paging signaling, the second device 120 may send the first sequence to the first device 110.

[0096] As an example, the first sequence can be carried in RN16 signaling. For details, see the embodiment of S250 above. However, this application does not limit the specific message carried by the first sequence, and the first sequence can be carried in other signaling. Furthermore, this application does not limit the name of the message carried by the first sequence, and other names such as scrambled message, feedback message, or response message can be used.

[0097] The first sequence may have 16 bits, in which case the first sequence may be referred to as an RN16 sequence. For another example, the first sequence may have 8 bits, in which case the first sequence may be referred to as an RN8 bit sequence. In other words, the first sequence may be represented by RNx, where x is the number of bits or length of the first sequence. This application does not limit the length of the first sequence; for example, the first sequence may include bits of other numbers.

[0098] S320: The second device 120 receives the first information from the first device 110. Accordingly, the first device 110 sends the first information to the second device 120.

[0099] The first information may include the first sequence, and the first information may be used to confirm that the first device 110 successfully receives the first sequence.

[0100] The above S320 may be performed after the first device 110 receives the first sequence. That is, after receiving the first sequence, the first device 110 may send the first information including the first sequence to the second device 120.

[0101] The first information may be confirmation signaling, for example, see the embodiment of S260 above. However, this application does not limit the specific form of the first information, and the first information may also include other information. Furthermore, the first information may also have other names, such as indication information, confirmation information, or response information. This application does not limit the specific name of the first information.

[0102] In some other optional implementations, the first information may be used to indicate the first sequence, or the first information may carry the first sequence, or the first information may include the first sequence.

[0103] S330: The second device 120 scrambles the data sequence to be transmitted according to the first sequence to generate a second sequence.

[0104] The data sequence to be transmitted is data that the second device 120 is about to transmit to the first device 110. The data sequence to be transmitted may also be referred to as data to be transmitted, bits to be transmitted, information to be transmitted, or a sequence to be transmitted. This application does not limit the specific name of the data sequence to be transmitted; the term "data sequence to be transmitted" is used only for ease of understanding. The data sequence to be transmitted may also be described using terms such as sequence, data, information, or bits.

[0105] By scrambling the first sequence, the data sequence to be transmitted can be transformed into a second sequence. In other words, the second sequence is the sequence of the data sequence to be transmitted after being scrambled by the first sequence. In other words, the data sequence to be transmitted is the sequence of the second sequence before being scrambled by the first sequence. The second sequence can also be called the output sequence or output bit sequence.

[0106] Exemplarily, when the number of bits of the first sequence is equal to that of the data sequence to be transmitted, a modulo two sum operation or an exclusive or (XOR) operation can be performed on the bits of the first sequence and the bits of the data sequence to be transmitted. It should be noted that this application does not limit the first sequence to being equal to the number of bits of the data sequence to be transmitted, nor does it limit scrambling to being performed only through modulo two addition or XOR operations. Other implementation scenarios will be described later and will not be elaborated here.

[0107] S340 : The second device 120 sends the second sequence to the first device 110 . Correspondingly, the first device 110 receives the second sequence from the second device 120 .

[0108] The second sequence may be sent via a data channel. For example, the second sequence may be sent to the first device 110 via a PUSCH channel.

[0109] S350: The first device 110 descrambles the second sequence according to the first sequence to obtain a target data sequence.

[0110] For example, when the number of bits in the first sequence is equal to that in the second sequence, a modulo-2 addition operation or an XOR operation can be performed on the bits of the first sequence and the bits of the second sequence. It should be noted that this application does not limit the first sequence to having the same number of bits as the second sequence, nor does it limit scrambling to being performed only through modulo-2 addition or XOR operations. Other implementation scenarios will be discussed later and will not be elaborated upon here.

[0111] The descrambling in S350 is similar to the scrambling in S330. The first sequence can be used as a scrambling sequence or a descrambling sequence. The target data sequence obtained by descrambling can be the data sequence to be transmitted in S330.

[0112] In other optional embodiments, S330 may be replaced by: the first device 110 scrambles the data sequence to be transmitted according to the first sequence to generate a second sequence; S340 may be replaced by: the first device 110 sends the second sequence to the second device 120; S350 may be replaced by: the second device 120 descrambles the second sequence according to the first sequence to obtain a target data sequence. This embodiment is an example of uplink transmission. The second sequence may be sent via a data channel, for example, the second sequence may be sent to the second device 120 via a physical downlink shared channel (PDSCH).

[0113] Through the above embodiment, the first sequence can be used as an identifier of the transmitting end in a random access scenario, and can also be used to scramble the data sequence to be sent. The transmitting end does not need additional storage space to achieve data scrambling. Therefore, the method provided by the embodiment of the present application reduces the complexity of scrambling and can prevent the receiving end from misinterpreting the data as being sent by other transmitting ends. On the other hand, through the above embodiment, the first sequence can be used as an identifier of the transmitting end in a random access scenario, and can also be used to descramble the received data sequence. The receiving end does not need additional storage space to achieve data descrambling. Therefore, the method provided by the embodiment of the present application reduces the complexity of descrambling and can prevent the receiving end from misinterpreting the data as being sent by other transmitting ends.

[0114] Optionally, in another implementation scenario of the above embodiment, the data sequence to be transmitted includes an information sequence and a check sequence of the information sequence, the number of bits of the check sequence is N, the second sequence includes the information sequence and a third sequence, N is a positive integer; wherein the third sequence is obtained by scrambling the check sequence according to N bits corresponding to the first sequence. Correspondingly, the target data sequence includes an information sequence and a check sequence of the information sequence, the number of bits of the check sequence is N, the second sequence includes the information sequence and a third sequence, N is a positive integer; wherein the check sequence is obtained by descrambling the third sequence according to N bits corresponding to the first sequence.

[0115] The information sequence may be the payload bit or payload bit sequence of the data channel, and the information sequence may also be referred to as the information bit or information bit sequence. The check sequence may be the check bit of the data channel, or the parity check bit of the data channel, or the check bit of the payload bit, or the parity check bit of the payload bit. For example, the check sequence may include CRC bits. The check sequence may also be referred to as a CRC bit sequence, a check bit sequence, or a parity check bit sequence. It should be noted that this application does not limit the specific names of the information sequence and the check sequence, and the information sequence and the check sequence may also have other names.

[0116] The above scheme can be understood as follows: the first sequence scrambles all bits of the check sequence, but does not scramble the bits of the information sequence. The sequence obtained after scrambling the check sequence can be referred to as the third sequence. Alternatively, the above scheme can be understood as follows: the first sequence scrambles all bits of the CRC, but does not scramble the information bits. It should be noted that the third sequence can also have other names, such as a scrambled information sequence, and this application does not limit the name of the third sequence.

[0117] Specific examples of N bits corresponding to the first sequence can be found in the following text and will not be repeated here.

[0118] Through the above embodiment, the transmitting end can scramble only the check sequence to be transmitted based on the first sequence. Therefore, the scrambling complexity of the method provided by the embodiment of the present application is low, and it can prevent the receiving end from misinterpreting the data as being sent by another transmitting end. On the other hand, through the above embodiment, the receiving end can descramble the received sequence based on the first sequence to obtain the check sequence. Therefore, the descrambling complexity of the method provided by the embodiment of the present application is low, and it can prevent the receiving end from misinterpreting the data as being sent by another transmitting end.

[0119] Optionally, in another implementation scenario of the above embodiment, the number of bits of the data sequence to be transmitted is N, where N is a positive integer; wherein the second sequence is obtained by scrambling the data sequence to be transmitted according to the N bits corresponding to the first sequence. Correspondingly, the number of bits of the target data sequence is N, where N is a positive integer; wherein the target data sequence is obtained by descrambling the second sequence according to the N bits corresponding to the first sequence.

[0120] The above scheme can be understood as the first sequence scrambling all bits of the data sequence to be transmitted, that is, scrambling both the information sequence and the check sequence, or in other words, scrambling both the payload sequence and the CRC sequence. A specific example of the N bits corresponding to the first sequence can be found below and is not detailed here.

[0121] Through the above embodiment, the transmitting end can perform all scrambling of the data sequence to be transmitted according to the first sequence, which complies with the data channel scrambling mechanism specified in the current protocol, thereby improving the applicability of the method of the embodiment of the present application. In addition, the method provided by the embodiment of the present application has a good scrambling effect, which can further prevent the receiving end from misinterpreting the data as being sent by other transmitting ends. On the other hand, through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the target data sequence. Therefore, the method provided by the embodiment of the present application has a good descrambling effect, and can further prevent the receiving end from misinterpreting the data as being sent by other transmitting ends.

[0122] Optionally, in another implementation scenario of the above embodiment, the N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences. Accordingly, the N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences.

[0123] For ease of description, it is assumed that the first sequence has M bits, and the first sequence can be represented by r, such as r0, r1, r2, ..., r M-1 Assume that the check sequence has Y bits, and the check sequence can be represented by p, for example, p0, p1, p2, ..., p Y-1 Assume that the information sequence has Z bits, and the information sequence can be represented by a, such as a0, a1, a2, ..., a z-1 Assume that the data sequence to be sent or the target data sequence can be represented by b, for example:

[0124] b k =a k ,k=0,1,2,…,Z-1;

[0125] b k =p k-Z ,k=Z,Z+1,Z+2,…,Z+Y-1.

[0126] FIG4 is a schematic diagram of data scrambling provided in an embodiment of the present application.

[0127] As some examples, the first sequence only scrambles the check sequence to generate the third sequence, but does not scramble the information sequence.

[0128] When M is greater than or equal to Y, the first Y bits, the last Y bits (for example, see (a) in FIG4 ), or the middle Y bits of the first sequence may be used as the N bits corresponding to the first sequence. For example, if M is 8 and Y is 6, the N bits corresponding to the first sequence may be the first 6 bits, the last 6 bits, or the middle 6 bits of the first sequence.

[0129] For example, assuming that the second sequence can be represented by c and the scrambling method is modulo-2 addition, if the N bits corresponding to the first sequence are the first Y bits of the first sequence, then the second sequence can be:

[0130] c k =b k ,k=0,1,2,…,Z-1;

[0131] c k =(b k +r k-Z )mod 2, k=Z, Z+1, Z+2,..., Z+Y-1.

[0132] If the N bits corresponding to the first sequence are the last Y bits of the first sequence, the second sequence can be:

[0133] c k =b k ,k=0,1,2,…,Z-1;

[0134] c k =(b k +r k-Z+M-Y )mod 2, k=Z, Z+1, Z+2,..., Z+Y-1.

[0135] When M is less than or equal to Y, the first sequence can be cascaded multiple times, and the first Y bits (for example, see (b) in FIG4 ), the last Y bits, or the middle Y bits of the cascaded sequence can be used as the N bits corresponding to the first sequence. For example, if M is 8 and Y is 16, the N bits corresponding to the first sequence can be the 16 bits of the sequence after the first sequence is cascaded twice. For another example, if M is 8 and Y is 20, the N bits corresponding to the first sequence can be the first 20 bits, the last 20 bits, or the middle 20 bits of the sequence after the first sequence is cascaded three times.

[0136] The first sequence is cascaded multiple times, which can also be understood as repeating the first sequence multiple times and then concatenating it. The number of times the first sequence is cascaded can be times, or greater than An integer number of times. Among them, represents the value of Y divided by M and rounded up (or called ceiling). The sequence obtained by concatenating multiple first sequences may also be called a scrambling sequence. However, it should be noted that this application does not limit the name of the concatenated sequence, and the sequence may also have other names, such as concatenated sequence, repeated sequence, spliced ​​sequence, etc.

[0137] For example, assuming the second sequence can be represented by c, the scrambling method is modulo-2 addition, and the N bits corresponding to the first sequence are the first Y bits of the sequence after the concatenation of the first sequence. Where the concatenated first sequence is represented by r', then the second sequence can be:

[0138] c k =b k ,k=0,1,2,…,Z-1;

[0139] c k =(b k +r' k-Z )mod 2, k=Z, Z+1, Z+2,..., Z+Y-1.

[0140] As some other examples, the first sequence scrambles the check sequence and the information sequence to generate the second sequence.

[0141] When M is greater than or equal to Y+Z, the first Y+Z bits, the last Y+Z bits (for example, see (c) in FIG. 4 ), or the middle Y+Z bits of the first sequence can be used as the N bits corresponding to the first sequence. For example, if M is 32, Y is 6, and Z is 16, then Y+Z is 22, and the N bits corresponding to the first sequence can be the first 22 bits, the last 22 bits, or the middle 22 bits of the first sequence.

[0142] For example, assuming that the second sequence can be represented by c, the scrambling method is modulo-2 addition, and the N bits corresponding to the first sequence are the first Y+Z bits of the first sequence, then the second sequence can be:

[0143] c k =(b k +r k )mod 2, k=0, 1, 2,..., Z+Y-1.

[0144] When M is less than or equal to Y+Z, the first sequence can be concatenated multiple times, and the first Y+Z bits (for example, see (d) in Figure 4 ), the last Y bits, or the middle Y bits of the concatenated sequence can be used as the N bits corresponding to the first sequence. For example, if M is 8, Y is 24, and Z is 128, then Y+Z is 152, and the N bits corresponding to the first sequence can be the 152 bits of the sequence after the first sequence is concatenated 19 times. For example, if M is 8, Y is 24, and Z is 132, then Y+Z is 156, and the N bits corresponding to the first sequence can be the first 156 bits, the last 156 bits, or the middle 156 bits of the sequence after the first sequence is concatenated 20 times.

[0145] The number of times the first sequence is cascaded can be times, or greater than An integer number of times. Among them, represents the value of Y+Z divided by M and rounded up (or rounded up). A sequence formed by concatenating multiple first sequences may also be called a scrambling sequence. However, it should be noted that this application does not limit the name of the concatenated sequence, and the sequence may also have other names, such as a concatenated sequence, a repeated sequence, or a spliced ​​sequence.

[0146] For example, assuming the second sequence can be represented by c, the scrambling method is modulo-2 addition, and the N bits corresponding to the first sequence are the first Y+Z bits of the sequence after the concatenation of the first sequence. Where the concatenated first sequence is represented by r', then the second sequence can be:

[0147] c k =(b k +r' k )mod 2, k=0, 1, 2,..., Z+Y-1.

[0148] Through the above embodiment, the transmitting end can scramble all data sequences or all check sequences to be transmitted based on the first sequence. Therefore, the method provided by the embodiment of the present application has a good scrambling effect, which can further prevent the receiving end from misinterpreting data as being sent by another transmitting end. On the other hand, through the above embodiment, the receiving end can descramble the received sequence based on the first sequence to obtain the target data sequence or check sequence. Therefore, the method provided by the embodiment of the present application has a good descrambling effect, which can further prevent the receiving end from misinterpreting data as being sent by another transmitting end.

[0149] In some optional implementations, the method 300 further includes: the second device 120 sending second information to the first device 110, where the second information is used to indicate that the N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences. Accordingly, the first device 110 receives the second information from the second device 120. It is understandable that the second information can indicate the scrambling method of the first sequence. Furthermore, the second information can also be used to instruct the first sequence to scramble all data sequences to be transmitted or all check sequences. The above-mentioned second information can also be used to indicate the descrambling method, for example, the second information can also be used to instruct the first sequence to descramble all data sequences to be transmitted or all check sequences.

[0150] Optionally, in another implementation scenario of the above embodiment, the data sequence to be transmitted includes an information sequence and a check sequence of the information sequence, the number of bits of the first sequence is M, the number of bits of the check sequence is greater than or equal to M, the second sequence includes the information sequence and a third sequence, and M is a positive integer; wherein the third sequence is obtained by scrambling the M bits in the check sequence based on the M bits of the first sequence. Correspondingly, the target data sequence includes an information sequence and a check sequence of the information sequence, the number of bits of the first sequence is M, the number of bits of the check sequence is greater than or equal to M, the second sequence includes the information sequence and a third sequence, and M is a positive integer; wherein the check sequence is obtained by descrambling the M bits in the third sequence based on the M bits of the first sequence.

[0151] The above scheme can be understood as the first sequence scrambling some bits of the check sequence. The first sequence can scramble the first M bits, the last M bits (for example, see (e) in Figure 4), or the middle M bits of the check sequence. For example, if M is 8 and Y is 16, the first sequence can scramble the first 8 bits, the last 8 bits, or the middle 8 bits of the check sequence.

[0152] For example, assuming that the second sequence can be represented by c, the scrambling method is modulo-2 addition, and the last M bits of the check sequence are scrambled according to the first sequence, the second sequence can be:

[0153] c k =b k ,k=0,1,2,…,Z+YM-1;

[0154] c k =(b k +r k-Z-Y+M )mod 2, k=Z+YM,…,Z+Y-1.

[0155] Through the above embodiment, the transmitting end can scramble some bits of the check sequence according to the first sequence, further reducing the complexity of scrambling and preventing the receiving end from misinterpreting data as being sent by another transmitting end. On the other hand, through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the check sequence. The method provided by the embodiment of the present application has low descrambling complexity and can prevent the receiving end from misinterpreting data as being sent by another transmitting end.

[0156] Optionally, in another implementation scenario of the above embodiment, the first sequence has M bits, wherein the second sequence is obtained by scrambling M subsequences based on the M bits of the first sequence, respectively. The data sequence to be transmitted is divided into the M subsequences, wherein, when the m-th bit of the M bits is 0, the bits of the m-th subsequence in the M subsequences are inverted, and M is a positive integer, m=1,…,M. Correspondingly, the first sequence has M bits, wherein the target data sequence is obtained by descrambling M subsequences based on the M bits of the first sequence, respectively. The second sequence is divided into the M subsequences, wherein, when the m-th bit of the M bits is 0, the bits of the m-th subsequence in the M subsequences are inverted, and M is a positive integer, m=1,…,M.

[0157] The above scheme can be understood as dividing the Y+Z bits into M sub-blocks (or M sub-sequences), and masking each sub-block with one of the M bits, or in other words, using that bit as the sub-block index. If the mask is 1, the bits in the sub-block remain unchanged; if the mask is 0, the bits in the sub-block are inverted. "Inverting" means that bits that were originally 0 are set to 1, and bits that were originally 1 are set to 0.

[0158] The data sequence to be transmitted is divided into M subsequences. This can also be understood as meaning that the data sequence to be transmitted includes M subsequences, or that M subsequences constitute the data sequence to be transmitted, or that the data sequence to be transmitted is composed of M subsequences. Accordingly, the second sequence can also be divided into M subsequences. It should be understood that the M subsequences in the second sequence correspond to the M subsequences in the data sequence to be transmitted. This "correspondence" is manifested in that the bit values ​​of the mth subsequence in the second sequence are opposite to those of the mth subsequence in the data sequence to be transmitted. For example, the third subsequence in the second sequence is "1100," and the third subsequence in the data sequence to be transmitted is "0011."

[0159] For example, if M is 8, Y is 24, and Z is 128, then Y + Z is 152. The data sequence to be transmitted can be divided into 8 subsequences, each with 19 bits. For ease of description, these 8 subsequences are numbered #0, #1, ..., #7. Assuming the first sequence is "11001010", the bits in subsequences #2, #3, #5, and #7 can be inverted, while the bits in the other subsequences remain unchanged.

[0160] In some other optional implementations, when the mth bit in the M bits is 1, the bits of the mth subsequence in the M subsequences are inverted. When the mth bit in the M bits is 0, the bits of the mth subsequence in the M subsequences remain unchanged.

[0161] It should be noted that the data sequence to be transmitted can be evenly divided into M subsequences or unevenly divided into M subsequences. In other words, the M subsequences can have the same bit positions or different bit positions.

[0162] Through the above embodiment, the transmitting end can perform all scrambling of the data sequence to be transmitted according to the first sequence, which complies with the data channel scrambling mechanism specified in the current protocol, thereby improving the applicability of the method of the embodiment of the present application. In addition, the method provided by the embodiment of the present application can quickly scramble the data sequences to be transmitted of various lengths, has a good scrambling effect, and can further prevent the receiving end from misinterpreting the data as being sent by other transmitting ends. On the other hand, through the above embodiment, the receiving end can descramble the received sequence according to the first sequence to obtain the target data sequence. The method provided by the embodiment of the present application has a good descrambling effect, and can further prevent the receiving end from misinterpreting the data as being sent by other transmitting ends.

[0163] 5 is a schematic block diagram of a communication device 500 according to an embodiment of the present application. The communication device 500 includes a processor 510 and a transceiver 520, which may be interconnected via a bus 530. The communication device 500 may be a first device or a second device.

[0164] Optionally, the communication device 500 may further include a memory 540. The memory 540 includes, but is not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or portable read-only memory (CD-ROM), and is used for related instructions and data.

[0165] The processor 510 may be one or more central processing units (CPUs). In the case where the processor 510 is a CPU, the CPU may be a single-core CPU or a multi-core CPU. The processor 510 may be a signal processor, a chip, or other integrated circuit that can implement the method of the present application, or a portion of the circuitry used for processing functions in the aforementioned processor, chip, or integrated circuit. In addition, the transceiver 520 may also be referred to as an input / output interface or a communication interface. The transceiver 520 is used for input or output of signals or data, and may also be an input / output circuit.

[0166] When the communication device 500 is a second device, the communication device 500 illustratively includes a processor 510 and a transceiver 520. The transceiver 520 is configured to send a first sequence to the first device, where the first sequence is used to identify the second device, which is the sender of the first sequence; and to receive first information from the first device, where the first information includes the first sequence and is used to confirm that the first device has successfully received the first sequence. The processor 510 is configured to scramble a data sequence to be transmitted based on the first sequence to generate a second sequence. The transceiver 520 is further configured to send the second sequence to the first device.

[0167] When the communication device 500 is a first device, the communication device 500 illustratively includes a processor 510 and a transceiver 520. The transceiver 520 is configured to receive a first sequence from a second device, where the first sequence is used to identify the second device; send first information to the second device, where the first information includes the first sequence and is used to confirm that the first device has successfully received the first sequence; and receive a second sequence from the second device. The processor 510 is configured to descramble the second sequence based on the first sequence to obtain a target data sequence.

[0168] The above description is merely exemplary. For details, please refer to the contents of the above method embodiments. The implementation of each operation in FIG5 may also correspond to the corresponding description of the method embodiments shown in FIG2 to FIG4.

[0169] Figure 6 is a schematic block diagram of another communication device 600 according to an embodiment of the present application. Communication device 600 can be the first device or the second device, or a chip or module within the first device or the second device, configured to implement the methods described in the above embodiments. Communication device 600 includes a transceiver unit 610. The following provides an exemplary description of transceiver unit 610.

[0170] The transceiver unit 610 may include a transmitting unit and a receiving unit. The transmitting unit is configured to execute a transmitting operation of the communication device, and the receiving unit is configured to execute a receiving operation of the communication device. For ease of description, this embodiment of the application combines the transmitting unit and the receiving unit into a single transceiver unit. This is described here as a unified description and will not be repeated later.

[0171] When the communication device 600 is the second device, illustratively, the transceiver unit 610 is configured to send the first sequence to the first device.

[0172] Optionally, the communication device 600 may further include a processing unit 620, which is used to execute the content of the first device involving processing, coordination and other steps.

[0173] When the communication device 600 is a first device, illustratively, the transceiver unit 610 is configured to receive a first sequence from the first device.

[0174] Optionally, the communication device 600 may further include a processing unit 620, which is used to execute the content of the second device involving processing, coordination and other steps.

[0175] The above contents are merely exemplary descriptions. When the communication device 600 is the first device or the second device, it will be responsible for executing the methods or steps related to the first device or the second device in the above method embodiments.

[0176] Optionally, the communication device 600 further includes a storage unit 630, which is used to store a program or code for executing the aforementioned method.

[0177] The device embodiments shown in Figures 5 and 6 are used to implement the embodiments shown in Figures 2 to 4. The specific execution steps and methods of the devices shown in Figures 5 and 6 can refer to the contents of the aforementioned method embodiments.

[0178] Figure 7 is a schematic block diagram of a communication system 700 according to an embodiment of the present application. The communication system 700 includes a first device and a second device, and the first device and the second device are used to implement the embodiments of Figures 2 to 4 above.

[0179] The present application also provides a chip, including a processor, for calling and executing instructions stored in a memory, so that a communication device equipped with the chip executes the methods in the above examples.

[0180] The present application also provides another chip, comprising: an input interface, an output interface, and a processor, wherein the input interface, the output interface, and the processor are connected via an internal connection path, and the processor is configured to execute code in a memory. When the code is executed, the processor is configured to execute the methods in the above examples. Optionally, the chip also includes a memory, which is configured to store computer programs or code.

[0181] The present application also provides a processor, which is coupled to a memory and is used to execute the methods and functions involving the first device or the second device in any of the above embodiments.

[0182] In another embodiment of the present application, a computer program product including instructions is provided. When the computer program product is run on a computer, the method of the above embodiment is implemented.

[0183] The present application also provides a computer program. When the computer program is executed in a computer, the method of the aforementioned embodiment is implemented.

[0184] In another embodiment of the present application, a computer-readable storage medium is provided, which stores a computer program. When the computer program is executed by a computer, the method described in the above embodiment is implemented.

[0185] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0186] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0187] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

[0189] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0190] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0191] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A communication method, characterized in that: include: Sending a first sequence to a first device, where the first sequence is used to identify a second device, and the second device is a sender of the first sequence; receiving first information from the first device, the first information including the first sequence, the first information being used to confirm that the first device successfully receives the first sequence; scramble a data sequence to be sent according to the first sequence to generate a second sequence; The second sequence is sent to the first device.

2. The method according to claim 1, characterized in that: The data sequence to be sent includes an information sequence and a check sequence of the information sequence, the number of bits of the check sequence is N, the second sequence includes the information sequence and a third sequence, and N is a positive integer; wherein, The third sequence is obtained by scrambling the check sequence according to N bits corresponding to the first sequence.

3. The method according to claim 1, characterized in that The number of bits of the data sequence to be sent is N, where N is a positive integer; The second sequence is obtained by scrambling the to-be-sent data sequence according to N bits corresponding to the first sequence.

4. The method according to claim 2 or 3, characterized in that: The N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences.

5. The method according to claim 1, characterized in that The data sequence to be sent includes an information sequence and a check sequence of the information sequence, the number of bits of the first sequence is M, the number of bits of the check sequence is greater than or equal to M, the second sequence includes the information sequence and a third sequence, and M is a positive integer; wherein, The third sequence is obtained by scrambling M bits in the check sequence according to M bits in the first sequence.

6. The method according to claim 1, characterized in that The number of bits of the first sequence is M, where The second sequence is obtained by scrambling M subsequences according to the M bits of the first sequence, respectively. The data sequence to be sent is divided into the M subsequences, wherein, when the mth bit among the M bits is 0, the bit of the mth subsequence among the M subsequences is inverted, M is a positive integer, m=1,...,M.

7. A communication method, characterized in that: include: receiving a first sequence from a second device, the first sequence being used to identify the second device; Sending first information to the second device, where the first information includes the first sequence, and the first information is used to confirm that the first device successfully receives the first sequence; receiving a second sequence from the second device; The second sequence is descrambled according to the first sequence to obtain a target data sequence.

8. The method according to claim 7, characterized in that The target data sequence includes an information sequence and a check sequence of the information sequence, the number of bits of the check sequence is N, the second sequence includes the information sequence and a third sequence, and N is a positive integer; wherein, The check sequence is obtained by descrambling the third sequence according to N bits corresponding to the first sequence.

9. The method according to claim 7, characterized in that: The number of bits of the target data sequence is N, where N is a positive integer; The target data sequence is obtained by descrambling the second sequence according to N bits corresponding to the first sequence.

10. The method according to claim 8 or 9, characterized in that: The N bits corresponding to the first sequence include the first N bits of the first sequence, the last N bits of the first sequence, the first N bits of a sequence obtained by concatenating multiple first sequences, or the last N bits of a sequence obtained by concatenating multiple first sequences.

11. The method according to claim 7, characterized in that The target data sequence includes an information sequence and a check sequence of the information sequence, the number of bits of the first sequence is M, the number of bits of the check sequence is greater than or equal to M, the second sequence includes the information sequence and a third sequence, and M is a positive integer; wherein, The check sequence is obtained by descrambling M bits in the third sequence according to M bits in the first sequence.

12. The method according to claim 7, characterized in that The number of bits of the first sequence is M, where The target data sequence is obtained by descrambling M subsequences according to the M bits of the first sequence, and the second sequence is divided into is divided into the M subsequences, wherein when the m-th bit in the M bits is 0, the bit of the m-th subsequence in the M subsequences is inverted, M is a positive integer, m=1,...,M.

13. A communication device, characterized in that: The method comprises at least one module, wherein the at least one module is used to execute the method according to any one of claims 1 to 6, or the at least one module is used to execute the method according to any one of claims 7 to 12.

14. A communication system, characterized in that: The method comprises a first device and a second device, wherein the first device is used to execute the method according to any one of claims 7 to 12, and the second device is used to execute the method according to any one of claims 1 to 6.

15. A communication device, characterized in that: It comprises a processing circuit and an input / output interface, wherein the input / output interface is used to input and / or output signals, and the processing circuit is used to execute the method according to any one of claims 1 to 6, or the processing circuit is used to execute the method according to any one of claims 7 to 12.

16. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program or instructions, and when the computer program or the instructions are run on a computer, the method of any one of claims 1 to 6 is executed, or the method of any one of claims 7 to 12 is executed.

17. A communication method, characterized in that: include: The second device performs the method according to any one of claims 1 to 6; The first device performs the method as claimed in any one of claims 7 to 12.

Images