Communication method and apparatus

Abstract

The present application provides a communication method and apparatus, capable of reducing the computational complexity in detecting carried first bit information, improving the detection efficiency, and improving the communication performance. The method comprises: determining a first signal on the basis of a first sequence corresponding to first bit information, wherein the first sequence is constructed on the basis of a Kronecker product of a second sequence and a third sequence, the second sequence carries a first bit in the first bit information, and the third sequence carries a second bit in the first bit information; and sending the first signal.

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202411951452.8, filed on December 25, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more specifically, to a communication method and apparatus. Background Technology

[0003] When transmitting bit information between communication devices, there are two transmission methods. One is a DMRS (Demodulation Reference Signal) based transmission scheme, where the receiving side first performs channel estimation based on DMRS, and then performs equalization, demodulation, and decoding operations on the data based on the channel estimation results to obtain the bit information. The other is a DMRS-free sequence transmission scheme, where the sending side determines the sequence to be transmitted from a sequence pool based on the bit information to be transmitted and sends it. The receiving side performs correlation detection based on its local sequence pool and the received signal, and the bit information corresponding to the maximum correlation value is the actual transmitted bit information. Studies have shown that in coverage scenarios, the DMRS-free sequence transmission scheme can achieve better detection performance than the DMRS-based transmission scheme.

[0004] When transmitting bit information between communication devices, the more bits there are and the longer the encoded codeword, the higher the computational complexity for the receiving device to determine the bit information. For sequence transmission schemes without DMRS, a linear increase in the number of bits leads to an exponential increase in the number of sequences carrying the bit information, resulting in an exponential increase in detection complexity. Similarly, a linear increase in the length of the encoded codeword also leads to a linear increase in detection complexity. Therefore, when the number of bits is large or the length of the encoded codeword is long, the computational complexity for detecting the sequence carrying the bit information becomes excessively high, increasing detection latency and power consumption, and impacting communication performance. Summary of the Invention

[0005] This application provides a communication method and apparatus that can reduce the computational complexity of detecting information carrying the first bit, reduce detection latency and power consumption, thereby improving communication performance.

[0006] In a first aspect, a communication method is provided, which can be applied to a first communication device, such as being executed by the first communication device. The first communication device can be a terminal device or a module (e.g., a circuit, chip, chip system, or processor) in the terminal device, or it can be a logic node, logic module, or software that can realize all or part of the functions of the terminal device.

[0007] The method includes: determining a first signal based on a first sequence corresponding to the first bit information, wherein the first sequence is constructed based on the Kronecker product of a second sequence and a third sequence, the second sequence carrying the first bit of the first bit information and the third sequence carrying the second bit of the first bit information; and sending the first signal.

[0008] Based on the above technical solution, since the second sequence and the third sequence each carry a portion of the first bit information, the lengths of the second sequence and the third sequence can be less than the length of a sequence directly carrying the first bit information. The first sequence is constructed by the Kronecker product of the second and third sequences, and the first bit information carried by the first sequence includes the first bit carried by the second sequence and the second bit carried by the third sequence. In this way, the computational complexity of sequentially detecting the second sequence and / or the third sequence can be significantly reduced compared to the computational complexity of directly detecting the first sequence carrying the first bit information.

[0009] Optionally, the method may further include: determining the sequence corresponding to the first bit information from the first sequence set, as the first sequence.

[0010] Based on the above technical solution, the sequences in the first sequence set are all pre-constructed based on the Kronecker product of two sequences. The first sequence can be directly determined from the first sequence set, and the first sequence constructed based on the Kronecker product of the second and third sequences can be obtained. There is no need to generate the first sequence based on the second and third sequences in real time, which can improve the efficiency of determining the first sequence and thus improve communication efficiency.

[0011] Optionally, the first bit information is obtained by concatenating the first bit and the second bit. In this way, the first communication device can conveniently and quickly determine the first bit and the second bit, improving the efficiency of constructing the first sequence.

[0012] Optionally, the first function of the first bit information is the first bit, and the second function of the first bit information is the second bit. This increases the flexibility in constructing the first sequence.

[0013] Optionally, the second bit is determined by the first bit and a preset processing method. The first bit is processed using the preset processing method to obtain the second bit.

[0014] Based on the above technical solution, since there is a correlation between the first bit and the second bit, detecting the second sequence carrying the first bit allows us to determine the second bit, and thus determine the information of the first bit. In this way, the second sequence can be detected directly without detecting the third sequence, thereby reducing the computational complexity of the detection.

[0015] Optionally, the second sequence is an orthogonal sequence, and the third sequence is a sequence in the third sequence set, wherein the correlation value between any two sequences in the third sequence set is less than the correlation threshold.

[0016] Based on the above scheme, the correlation values ​​between each row vector or column vector of the orthogonal sequence are all 0, which can improve the detection performance of the second sequence by correlation detection. Furthermore, the third sequence does not use orthogonal sequences, which can increase the size of the third sequence set and thus carry more bit information.

[0017] In conjunction with the first aspect, in some implementations of the first aspect, any one of the sequences in the second sequence set is a row vector or column vector in the Hadamard matrix, and any one of the sequences in the third sequence set is obtained by performing at least one of the following processing on the gold sequence: repetition, truncation, or modulation.

[0018] Based on the above technical solution, the Hadamard matrix, being a type of orthogonal matrix, can guarantee superior detection performance for the second sequence. The gold sequence has low correlation, lower than that of the m sequence. Detecting the gold sequence using correlation techniques can expand the size of the third sequence set while maintaining detection performance, thereby carrying more bit information.

[0019] In conjunction with the first aspect, in some implementations of the first aspect, at least one of the second and third sequences is a column vector or row vector in a Hadamard matrix.

[0020] Based on the above technical solution, having either the second or third sequence as a row or column vector in a Hadamard matrix can improve detection performance. Furthermore, considering detection based on the Fast Hadamard Transform can reduce computational complexity. Having both the second and third sequences as row or column vectors in a Hadamard matrix can further improve detection performance while reducing computational complexity.

[0021] In conjunction with the first aspect, in some implementations of the first aspect, the second sequence is a row vector or column vector in the Hadamard matrix; the third sequence is obtained by performing at least one of the following processes on any one of the gold sequence, m sequence or RM code: repetition, truncation or modulation.

[0022] Based on the above scheme, the second sequence, being one of the orthogonal matrices in the Hadamard matrix, ensures superior detection performance. The third sequence does not use an orthogonal sequence, but rather any one of the following: a gold sequence, an m-sequence, or an RM code. Since these three sequences have low cross-correlation, the size of the third sequence set can be increased, thus carrying more bit information. Furthermore, for the third sequence carrying an arbitrary number of second bits, its length can be obtained from these three sequences, improving the flexibility of obtaining the third sequence.

[0023] In conjunction with the first aspect, in some implementations of the first aspect, the first sequence is obtained by multiplying the fourth sequence and the modulation sequence, the fourth sequence is the Kronecker product of the second and third sequences, and the odd-numbered bits of the modulation sequence are 1 and the even-numbered bits are j.

[0024] Based on the above scheme, the first sequence is essentially a modification of the fourth sequence. Modulation directly yields the modulated sequence, which improves the coverage of the first signal while reducing the operational complexity of determining the first signal based on the first sequence.

[0025] Secondly, a communication method is provided, which can be applied to a second communication device, such as being executed by the second communication device, which can be a network device or a module (e.g., a circuit, chip, chip system or processor) in the network device, or a logical node, logical module or software that can realize all or part of the functions of the network device.

[0026] The method includes: receiving a first signal, the first signal being obtained based on a first sequence corresponding to first bit information, the first sequence being a Kronecker product of a second sequence and a third sequence, the second sequence carrying a first bit in the first bit information, and the third sequence carrying a second bit in the first bit information; and determining the first bit information based on the first signal.

[0027] Secondly, the beneficial effects of the method provided on the second communication device side, which corresponds to the first aspect, can be referenced in the first aspect.

[0028] In conjunction with the second aspect, in some implementations of the second aspect, the first signal is correlated and detected based on all sequences in the first sequence set to obtain the first sequence, and different sequences in the first sequence set are associated with different bit information; based on the first sequence, the first bit information is determined.

[0029] Based on the above technical solution, since the first signal can be directly determined by correlation detection based on the first sequence set, and since there is no need to store the information of the second sequence and the information of the third sequence, the storage complexity can be reduced.

[0030] In conjunction with the second aspect, in some implementations of the second aspect, the first signal is correlated and detected based on all sequences in the first sequence set to obtain a second sequence and a third sequence; based on the second sequence and the third sequence, the first sequence is determined. The first bit information is determined based on the first sequence.

[0031] Based on the above technical solution, by detecting the second and third sequences to determine the first sequence, the long sequence to be detected can be split into two related short sequences, thus reducing the computational complexity of sequence detection.

[0032] In conjunction with the second aspect, in some implementations of the second aspect, the second sequence is a sequence in a set of second sequences, and the third sequence is a sequence in a set of third sequences. The method includes: correlating each sequence in the set of second sequences with the first signal to obtain a set of correlated sequences; determining the second sequence from the set of second sequences based on the set of correlated sequences; and determining the third sequence based on the set of correlated sequences and the set of third sequences.

[0033] Based on the above technical solution, since the second sequence can be detected from the second sequence set through the relevant sequence set first, and the third sequence can be detected from the third sequence set through the relevant sequence set, the serial detection of the second and third sequences can be achieved, reducing the computational complexity during detection.

[0034] In conjunction with the second aspect, in some implementations of the second aspect, the second sequence is determined from the second sequence set based on the first correlation value of each sequence in the relevant sequence set; the first correlation value is the sum of the absolute values ​​or powers of all elements of a corresponding sequence in the relevant sequence set.

[0035] Based on the above technical solution, by directly selecting the sequence with the largest correlation value from the relevant sequence set, a unique sequence can be determined, which can improve detection efficiency.

[0036] In conjunction with the second aspect, in some implementations of the second aspect, each sequence in the third sequence set is correlated with the target first related sequence to obtain a related element set; based on the related element set, the third sequence is determined from the third sequence set.

[0037] Based on the above scheme, the target first correlation sequence and the third sequence set in the relevant element set are correlated. Since the second sequence has been determined at this time, the amount of information carried by the target first correlation sequence is much smaller than the amount of information of the first signal, which can reduce the computational complexity of the correlation detection of the third sequence.

[0038] In conjunction with the second aspect, in some implementations of the second aspect, the third sequence is determined from the third sequence set based on the second correlation value of each element in the relevant element set; the second correlation value is the absolute value or power of a corresponding element in the relevant element set.

[0039] Based on the above technical solution, by directly selecting the element with the largest correlation value from the set of relevant elements, a unique sequence can be determined, which can improve detection efficiency.

[0040] Optionally, the second bit is determined by the first bit and a preset processing method. The first bit is processed using the preset processing method to obtain the second bit.

[0041] Optionally, the second sequence is an orthogonal sequence, and the third sequence is a sequence with a correlation value less than a correlation threshold.

[0042] In conjunction with the second aspect, in some implementations of the second aspect, the second sequence is a sequence in the second sequence set, the third sequence is a sequence in the third sequence set, all sequences in the second sequence set form a Hadamard matrix, and all sequences in the third sequence set are gold sequences.

[0043] In conjunction with the second aspect, in some implementations of the second aspect, at least one of the second sequence and the third sequence is a column vector or row vector in a Hadamard matrix.

[0044] In conjunction with the second aspect, in some implementations of the second aspect, the second sequence is a row vector or column vector in the Hadamard matrix; the third sequence is obtained by performing at least one of the following processes on any one of the gold sequence, m sequence or RM code: repetition, truncation or modulation.

[0045] In conjunction with the second aspect, in some implementations of the second aspect, the first sequence is obtained by multiplying the fourth sequence and the modulation sequence, the fourth sequence is the Kronecker product of the second and third sequences, and the odd-numbered bits of the modulation sequence are 1 and the even-numbered bits are j.

[0046] Thirdly, a communication device is provided, which can be the first communication device described in the first aspect. The communication device includes: a determining module, configured to determine a first signal based on a first sequence corresponding to first bit information, wherein the first sequence is a Kronecker product of a second sequence and a third sequence, the second sequence carrying a first bit in the first bit information, and the third sequence carrying a second bit in the first bit information; and a transmitting module, configured to transmit the first signal.

[0047] Fourthly, a communication device is provided, which can be the second communication device described in the second aspect. The communication device includes: a receiving module for receiving a first signal, the first signal being obtained based on a first sequence corresponding to first bit information, the first sequence being a Kronecker product of a second sequence and a third sequence, the second sequence carrying a first bit in the first bit information, and the third sequence carrying a second bit in the first bit information; and a determining module for determining the first bit information based on the first signal.

[0048] Fifthly, a communication device is provided, comprising: a processor configured to implement the methods of the first and second aspects and any possible implementation thereof. Optionally, the communication device further comprises an interface circuit configured to receive signals from other communication devices and transmit them to the processor, or to send signals from the processor to other communication devices.

[0049] A sixth aspect provides a communication system including a first communication device for performing the method as described in the first aspect and a second communication device for performing the method as described in the second aspect.

[0050] In a seventh aspect, a computer-readable storage medium is provided, the computer-readable medium storing a computer program; when the computer program is run on a computer, the methods of the first and second aspects and any possible implementation thereof are executed.

[0051] Eighthly, a computer program product is provided, comprising a computer program that, when executed, causes the communication method in the first and second aspects and any possible implementation thereof to be implemented.

[0052] The solutions provided in the third to seventh aspects above are used to implement or cooperate with the methods provided in the first or second aspects above, and therefore can achieve the same or corresponding beneficial effects as the first or second aspects, which will not be elaborated here. Attached Figure Description

[0053] Figure 1 is a schematic diagram of the architecture of the communication system used in the embodiments of this application;

[0054] Figure 2 is a schematic diagram of the communication structure between terminal devices and network devices;

[0055] Figure 3 is a schematic diagram of an O-RAN system provided in an embodiment of this application;

[0056] Figure 4 is a flowchart illustrating a communication method provided in an embodiment of this application;

[0057] Figure 5a is a schematic diagram of a first sequence mapped to time-frequency resources according to an embodiment of this application;

[0058] Figure 5b is a schematic diagram of another first sequence mapping to time-frequency resources provided in an embodiment of this application;

[0059] Figure 6a is a schematic diagram of another first sequence mapping to time-frequency resources provided in an embodiment of this application;

[0060] Figure 6b is a schematic diagram of another first sequence mapping to time-frequency resources provided in an embodiment of this application;

[0061] Figure 6c is a schematic diagram of another first sequence mapping to time-frequency resources provided in an embodiment of this application;

[0062] Figure 7 is a schematic diagram of a communication device provided in an embodiment of this application;

[0063] Figure 8 is a schematic diagram of another communication device provided in an embodiment of this application;

[0064] Figure 9 is a schematic diagram of another communication device provided in an embodiment of this application. Detailed Implementation

[0065] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0066] The embodiments of this application can be applied to various communication systems, such as wireless local area network (WLAN), narrowband internet of things (NB-IoT), global system for mobile communications (GSM), enhanced data rate for GSM evolution (EDGE), wideband code division multiple access (WCDMA), code division multiple access 2000 (CDMA2000), time division-synchronization code division multiple access (TD-SCDMA), long term evolution (LTE), universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX), satellite communication systems, 5th generation (5G) communication systems, and future communication network systems.

[0067] The terminal device involved in the embodiments of this application can be a device with wireless transceiver capabilities, specifically referring to a subscriber unit, user equipment (UE), access terminal, cellular phone, user station, mobile station (MS), customer-premises equipment (CPE), remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device. The terminal device can also be a satellite phone, cellular phone, smartphone, wireless data card, personal digital assistant (PDA) computer, tablet computer, wireless modem, laptop computer, machine-type communication (MTC) device, and wireless terminal in self-driving vehicles, etc. Terminal devices can also be cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, in-vehicle devices, wearable devices, computing devices or other processing devices connected to a wireless modem, communication devices mounted on high-altitude aircraft, drones, robots, point-of-sale (POS) machines, terminals in device-to-device (D2D) communication, terminals in vehicle-to-everything (V2X) communication, virtual reality (VR) terminal devices, augmented reality (AR) terminal devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, and wireless terminals in smart homes. Wireless terminals in the home (or terminal equipment in future communication networks), etc. Among these, user equipment includes vehicle user equipment.With the rise of the Internet of Things (IoT) technology, an increasing number of devices that previously lacked communication capabilities—such as, but not limited to, home appliances, vehicles, tools, service equipment, and service facilities—are acquiring wireless communication functionality by being equipped with wireless communication units. This allows them to access wireless communication networks and be remotely controlled. Because these devices are equipped with wireless communication units and thus possess wireless communication capabilities, they also fall under the category of wireless communication devices. This application does not impose any limitations.

[0068] In this embodiment, the device for implementing the functions of the terminal device can be the terminal device itself; or it can be a device capable of supporting the terminal device in implementing the functions, such as a chip system. This device can be installed in the terminal device or used in conjunction with the terminal device. In this embodiment, the chip system can be composed of chips, or it can include chips and other discrete components.

[0069] The network devices involved in this application embodiment are devices in a wireless network, such as radio access network (RAN) nodes that connect terminal devices to the wireless network. Network devices can be nodes in the RAN, also known as base stations, or RAN nodes (or devices). Network devices can be base transceiver stations (BTS) in GSM or CDMA networks, Node Bs (NBs) in WCDMA, evolved Node Bs (eNBs or eNodeBs) in LTE, or next-generation node Bs (gNBs) in 5G networks; network devices can be base stations in future evolved public land mobile networks (PLMNs), or access devices in the 3rd generation partnership project (3GPP); network devices can also be radio controllers in cloud radio access network (CRAN) scenarios. Optionally, the network devices in this application embodiment may include various forms of base stations, such as: relay stations, access points, devices that implement base station functions in communication systems evolved after 5G, mobile switching centers, home evolved NodeBs (HNBs), baseband units (BBUs), devices that perform base station functions in device-to-device (D2D) communication, access points (APs), wireless relay nodes, wireless backhaul nodes, transmission points (TPs), or transmission and reception points (TRPs) in wireless fidelity (WIFI) systems, devices that perform base station functions in vehicle-to-everything (V2X) and machine-to-machine (M2M) communication, and may also include centralized units (CUs) and distributed units (DUs) in CRAN systems, and network devices in non-terrestrial network (NTN) communication systems.The network device in this application embodiment can also be a gNB or transmission point in new radio (NR), one or a group (including multiple) of antenna panels of a base station in NR, or a network node constituting a gNB or transmission point. Alternatively, the network device can be an in-vehicle device, a wearable device, or a network device in a future communication network, or a network device in a future evolved PLMN network, or a network device deployed on a satellite. This application embodiment does not limit this. Furthermore, based on the size of the service coverage area provided, base stations can be divided into macro base stations for providing macro cells, micro base stations for providing pico cells, and femto base stations for providing femto cells. With the continuous evolution of wireless communication technology, future base stations may also adopt other names.

[0070] In this embodiment, the device for implementing the functions of the network device can be the network device itself; or it can be a device capable of supporting the network device in implementing the functions, such as a chip system. This device can be installed in the network device or used in conjunction with the network device.

[0071] To facilitate understanding of the methods provided in the embodiments of this application, the system architecture of the methods provided in the embodiments of this application will be described below. It is understood that the system architecture described in the embodiments of this application is for the purpose of more clearly illustrating the solutions of the embodiments of this application and does not constitute a limitation on the solutions provided in the embodiments of this application.

[0072] Figure 1 is a schematic diagram of the architecture of the communication system 1000 used in the embodiments of this application. As shown in Figure 1, the communication system includes a RAN 100 and a core network 200. Optionally, the communication system 1000 may also include an Internet 300. The RAN 100 includes at least one RAN node (110a and 110b in Figure 1, collectively referred to as 110), and may also include at least one terminal device (120a-120j in Figure 1, collectively referred to as 120). The RAN 100 may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1). The terminal device 120 is wirelessly connected to the RAN node 110, and the RAN node 110 is wirelessly or wiredly connected to the core network 200. The core network device in the core network 200 and the RAN node 110 in the RAN 100 can be independent and different physical devices, or they can be the same physical device integrating the logical functions of the core network device and the logical functions of the RAN node. Terminal devices and RAN nodes can be interconnected via wired or wireless means. Figure 1 is only a schematic diagram; this communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Figure 1.

[0073] RAN 100 can be a 3GPP-related cellular system, such as a 4G, 5G mobile communication system, or a future-oriented evolution system. RAN 100 can also be an open access network (open RAN, O-RAN, or ORAN), CRAN, or a Wi-Fi system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0074] RAN node 110, sometimes also referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and is used to help terminals achieve wireless access. Multiple RAN nodes 110 in communication system 1000 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal device 120 are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminal device 120j accessing RAN 100 through network element 120i, network element 120i is a base station; but for base station 110a, network element 120i is a terminal device. RAN node 110 and terminal device 120 are sometimes both referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal functions.

[0075] The communication between each network device and each terminal device in the communication system shown in Figure 1 can also be represented in another form. Figure 2 is a schematic diagram of the structure for communication between terminal devices and network devices. Terminal device 10 includes a processor 101, a memory 102, and a transceiver 103. Transceiver 103 includes a transmitter 1031, a receiver 1032, and an antenna 1033. Network device 20 includes a processor 201, a memory 202, and a transceiver 203. Transceiver 203 includes a transmitter 2031, a receiver 2032, and an antenna 2033. Receiver 1032 can be used to receive information through antenna 1033, and transmitter 1031 can be used to send information to network device 20 through antenna 1033. Transmitter 2031 can be used to send information to terminal device 10 through antenna 2033, and receiver 2032 can be used to receive information sent by terminal device 10 through antenna 2033.

[0076] Figure 3 is an example diagram of an O-RAN system. An O-RAN system may include components other than those shown in Figure 3. As shown in Figure 3, network devices are also called access network devices. Access network devices (such as eNBs, gNBs, or next-generation access network devices) communicate with the core network (CN) via a backhaul link and with terminal devices via an air interface.

[0077] Specifically, the baseband unit (BBU) in the access network equipment communicates with the core network via a backhaul link, and the radio unit (RU) in the access network equipment communicates with at least one terminal device via an air interface. The BBU communicates with at least one RU via a fronthaul link. The BBU and RU may or may not be co-located.

[0078] The BBU includes at least one control unit (CU) and at least one DU, which can communicate via at least one midhaul link.

[0079] There is an interface between the DU and RU. Depending on the functions of the DU and RU, and / or the different switching methods, the interface between the DU and RU can be a common public radio interface (CPRI) or an enhanced common public radio interface (eCPRI).

[0080] To facilitate understanding of the embodiments of this application, the terms involved in the embodiments of this application are explained below.

[0081] m-sequence: The m-sequence is the longest-period sequence generated by a shift register with linear feedback. Figure 1 shows the basic structure of the feedback shift register. As shown in Figure 1, the initial bit values ​​stored in the feedback shift register include: a1, a2, ..., a c If the feedback function The output sequence is Generally, the longest cycle generated by a Class C linear feedback shift register is equal to 2. c -1, the length of each m-sequence is 2. c -1.

[0082] Gold sequences are also a type of pseudo-random sequence. They can be viewed as the result of an element-wise XOR operation on two m-sequences with different primitive polynomials. The cross-correlation between the two m-sequences satisfies the three-valued property, and these two m-sequences are called a preferred m-sequence pair. Gold sequences have good autocorrelation and cross-correlation properties; moreover, the large number of gold sequences facilitates the carrying of information.

[0083] RM code: Reed-Muller code, is an error-correcting coding technique. It is defined by two parameters, r and m, denoted as RM(r, m), where r represents the encoding level and m represents the number of bits of information, and 0 ≤ r ≤ m. The length of an RM code is 2^n. m dimensionality

[0084] Hadamard matrix: An orthogonal square matrix consisting of two elements, 1 and -1, where any two rows or columns are orthogonal. Multiplying a Hadamard matrix by its transpose yields an identity matrix.

[0085] Sequence correlation value: For a sequence A = [a0, a1, ..., a...] N-1 ] and sequence B = [b0, b1, ..., b N-1 The correlation value can be calculated using formula (1). The larger the correlation value, the more similar sequences A and B are.

[0086] Where i is an integer, and N-1≥i≥0; N is a positive integer.

[0087] The background related to the embodiments of this application will be briefly introduced below.

[0088] The uplink transmission channels include the Physical Uplink Control Channel (PUCCH), the Physical Uplink Shared Channel (PUSCH), and the Physical Random Access Channel (PRACH). Among the various formats supported by PUCCH, formats 1, 3, and 4 are long PUCCHs, capable of carrying more than 2 bits of information. PUSCH can also carry a large number of bits. When network devices detect information from PUCCH and PUSCH, the computational complexity has a significant impact on communication performance.

[0089] Taking PUCCH format 3 as an example, the terminal device needs to encode the UCI using RM codes based on the coding matrix to obtain a 32-bit codeword. Since PUCCH format 3 occupies 1-16 RBs in the frequency domain and 4-14 symbols in the time domain, its resource element (RE) count is greater than 32. Therefore, the 32-bit codeword needs to be repeated, mapping it to the time and frequency resources in a frequency-first, then time-second order. Thus, when the network device detects the UCI, it needs to detect this 32-bit codeword, and the bit information corresponding to the determined 32-bit codeword is the UCI. The terminal device can also encode the UCI based on an m-sequence. If the number of bits in the UCI is m, the UCI encoding has 2... m Seed, requires 2 m Each m-sequence transmits a UCI, with different UCIs corresponding to different m-sequences. If the number of bits in the UCI information is m, it can be transmitted using 2... m A length of 2 m -1 m-sequences are transmitted for UCI. The length is 2. m -1 of 2 m m sequences can form a detection matrix. The network device performs correlation processing on the detection matrix and the received m sequences, and determines a sequence as the UCI from the detection matrix based on the correlation coefficient. Thus, during the correlation processing, 2... m ×(2 m -1) additions, with a computational complexity of 2. m ×(2 m -1).

[0090] Since all m sequences can form a matrix M, adding a row vector and a column vector of all zeros to matrix M yields a matrix...

[0091] For example, M is as shown in formula (2-1), then As shown in formula (2-2).

[0092] matrix The Hadamard matrix H has the relationship shown in formula (3).

[0093] Among them, P L and P S It is a permutation matrix.

[0094] Based on formula (3), the network device correlates the received signal with M, which is equivalent to... To perform correlation, and to receive the signal and The correlation can be converted into P. L HP S The addition complexity is negligible because each row and column of the permutation matrix has only one position with a value of 1, while the addition complexity of multiplying any matrix by a Hadamard matrix is ​​2^3. m ×log2(2 m -1), therefore, the computational complexity can be reduced.

[0095] For example, if m is 11, the length of the m sequence is (2... 11 -1), and the total number of resource units N is the product of the number of symbols 14 and the number of subcarriers in the frequency domain 12, which is 168. Obviously, the length of the sequence actually mapped to the frequency domain resources can only be 168, so the computational complexity is 2. 11 ×log2168=15139, which has a high complexity.

[0096] Figure 4 illustrates a schematic flowchart of a communication method provided in an embodiment of this application. As shown in Figure 4, the method includes:

[0097] S110, the first communication device acquires the first sequence corresponding to the first bit information to be acquired. The first sequence is the Kronecker product of the second sequence and the third sequence. The second sequence carries the first bit of the first bit information, and the third sequence carries the second bit of the first bit information.

[0098] In this embodiment, the first bit information is the bit corresponding to the information content that the first communication device needs to send to the second communication device. For example, the information content includes the ID of cell 1, which is represented by the first bit information. The first communication device needs to obtain a first signal by processing the sequence corresponding to the first bit information, i.e., the first sequence, through modulation or other methods, and send it to the second communication device. Here, the information content may also include HARQ-ACK response, channel state information (CSI) reporting, uplink data packets, cell ID information, etc., including other information besides bit information, which is not limited in this invention. Different first bit information corresponds to different first sequences; the first sequence is constructed by the Kronecker product of the second and third sequences. The second sequence carries the first bit, and the third sequence carries the second bit. The first bit and the second bit are used to determine the first bit information. In addition, in one embodiment, obtaining the first sequence as the Kronecker product of the second and third sequences does not necessarily mean that it needs to be specifically calculated by the Kronecker product during the acquisition process. It can be that the first sequence that satisfies the Kronecker product relationship is directly called or determined by pre-stored first sequences, or it can be that the first sequence is obtained based on the second and third sequences through equivalent calculation, fast calculation, or other calculation methods.

[0099] In one possible implementation, the first bit information can be obtained by concatenating the first bit and the second bit. When the length of the bit vector corresponding to the first bit information is m, the values ​​of the length m1 of the bit vector corresponding to the first bit and the length m2 of the bit vector corresponding to the second bit can be set according to actual needs, and this application embodiment does not impose any restrictions. Wherein, the sum of m1 and m2 is m, where m is a positive integer greater than 1, and m1 and m2 are positive integers greater than or equal to 1.

[0100] For example, m is 6, m1 and m2 are both 3; the first bit information is '101111' which corresponds to the first sequence, the first bit is '101' which corresponds to the second sequence; the second bit is '111' which corresponds to the third sequence; wherein, the first sequence is the Kronecker product of the second and third sequences.

[0101] In one possible implementation, the value of m1 is fixed, and m2 can be determined based on the values ​​of m and m1. For example, if the value of m1 is 2, and m is 4, then m2 is 2. Or, if the value of m1 is 2, and m is 5, then m2 is 3.

[0102] In one possible implementation, if m is fixed, then m1 and m2 can be pre-set. For example, if m is 8, then m1 and m2 are both 4; if m is 6, then m1 and m2 are both 3. Or, if m is 8, then m1 is 2 and m2 is 6; if m is 6, then m1 is 2 and m2 is 4.

[0103] In one possible implementation, m is fixed, and the first communication device can determine m1 and m2 based on whether m is odd or even. For example, if m is even, then both m1 and m2 are half of m. Or, if m is odd, then m1 is half of m-1 and m2 is half of m+1.

[0104] In one possible implementation, there is a first functional relationship between the first bit and the first bit information, and there is a second functional relationship between the second bit and the first bit information.

[0105] For example, the x-ary value of the first bit information B is BX, the x-ary value of the first bit B1 is B1X according to formula (4), and the x-ary value of the second bit B2 is B2X according to formula (5). B1X = mod(BX, B2X) max ) Formula (4)

[0106] Among them, B2 max It is the maximum value of the second bit in base B2x.

[0107] In one possible implementation, the first communication device may be configured with a first association relationship between bit information and sequences. A sequence associated with the first bit information is determined from the first association relationship and designated as a first sequence. Different sequences in the first association relationship are associated with different first bit information, and all sequences in the first association relationship constitute a first sequence set. Any sequence in the first sequence set is the Kronecker product of a sequence carrying a first bit in a second sequence set and a sequence carrying a second bit in a third sequence set.

[0108] For example, sequences 1-3 form a first sequence set, wherein bit information 1 is associated with sequence 1, bit information 2 is associated with sequence 2, and bit information 3 is associated with sequence 3. If the first bit information is bit information 2, then the first sequence is sequence 2; if the first bit information is bit information 3, then the first sequence is sequence 3.

[0109] Optionally, the first communication device is configured with a second association relationship between bit information and sequences, and a third association relationship between bit information and sequences. The first communication device can determine the sequence corresponding to the first information as a second sequence from the second association relationship, and determine the sequence corresponding to the second information as a third sequence from the third association relationship, and take the Kronecker product of the second sequence and the third sequence as the first sequence. If the second sequence includes p elements and the third sequence includes q elements, then the first sequence includes p × q elements.

[0110] The first communication device can determine the first bit and the second bit of the first bit information according to a preset allocation method. Here, the preset allocation method can be based on the order of the bits in the first bit information. For example, the first communication device can allocate the first m1 bits of the first bit information as the first bit and the remaining m2 bits as the second bit according to the preset allocation method; or, the first communication device can allocate the first m2 bits of the first bit information as the second bit and the remaining m1 bits as the first bit; or, the first communication device can allocate the odd-numbered bits of the first bit information as the first bit and the even-numbered bits as the second bit.

[0111] For example, the first bit information is 6 bits '101111' corresponding to the first sequence, wherein the first bit is an odd number of bits '111' corresponding to the second sequence, and the second bit is an even number of bits '011' corresponding to the third sequence.

[0112] In this embodiment, C1 sequences of length K1 form a second sequence set, which carries C1 bits of information; C2 sequences of length K2 form a third sequence set, which carries C2 bits of information. For example, the bit information is 2 bits, corresponding to 2... 2 2 bits of information, 2 2 The bit information includes "00", "01", "10", and "11". The first communication device can determine the sequence corresponding to the first bit from the second sequence set as the second sequence, and determine the sequence corresponding to the second bit from the third sequence set as the third sequence. The values ​​of C1 and K1 are related to the encoding method of the second sequence and the number of bits carried by the second sequence; the values ​​of C2 and K2 are related to the encoding method of the third sequence and the number of bits carried by it.

[0113] It should be noted that for a length of C X The sequence, whose bit information it can carry corresponds to a bit vector with a length of ceil(log2C) X Taking a binary sequence as an example, a sequence of length 5 can carry bit information whose corresponding bit vector length is 2, and the number of bits is 2. 2 Here, a sequence of length 5 can carry bit information including: “00”, “01”, “10”, and “11”.

[0114] For example, if the second sequence is an orthogonal sequence, then C1 and K1 need to be greater than or equal to 2. m1 Optionally, the second sequence set includes 2 m1 A length of 2 m1The sequence. If the third sequence is an m-sequence, then C2 is 2. m2 K2 is 2 m2 -1.

[0115] In one possible implementation, the first bit and the second bit are associated, and the second bit can be determined based on the first bit. In another possible implementation, the second bit can be determined based on the first bit. In yet another possible implementation, the first bit and the second bit have a corresponding relationship; for example, the first bit and the second bit are the same. In a possible implementation, the second bit can be determined based on the first bit and a preset processing method; for example, the second bit is the first bit multiplied by -1. Here, the first bit and the second bit correspond to different types of information content.

[0116] For example, the first bit information is "101101", where the first bit consists of the first three "101" bits and the second bit consists of the last three "101" bits. The first bit represents cell 5, and the second bit corresponds to the signal quality within the cell. The first communication device can indicate the signal quality of cell 5 to the second communication device through the first bit information.

[0117] In this embodiment, the second sequence and / or the third sequence are target element sequences, where the elements are {1, -1}. Optionally, the target element sequence may include row vectors or column vectors in a Hadamard matrix. Optionally, the target element sequence may be any one of the modulated m-sequence, gold sequence, and RM code. Modulation processing is used to convert the m-sequence, gold sequence, and RM code into the target element sequence. In one possible implementation, the modulation processing may include BPSK modulation. Optionally, the target element sequence may be obtained by repeating and / or truncating any one of the modulated m-sequence, gold sequence, and RM code, or it may be obtained by repeating and / or truncating any one of the m-sequence, gold sequence, and RM code before modulation processing.

[0118] For example, the second sequence is a row or column vector of the Hadamard matrix, and the third sequence is a sequence obtained by repeating and / or truncating the gold sequence. Taking a total number of subcarriers in the time-frequency resource equal to 12, the first bit of information contains 6 bits, the length of the second sequence is 2, and the length of the third sequence is 6 as an example, the second sequence can carry 1 bit, and the sequence set is {[1,1],[1,-1]}. To carry 5 bits, a period of 2 is required. 3 The sequence of gold values ​​of -1, with primitive polynomials x... 3 +x+1 and x 3 +x 2 Taking +1 as an example, 32 low cross-correlation sequences can be generated, as shown in Table 1.

[0119] Table 1

[0120] To match the time-frequency resource length limit, the above 32 gold sequences need to be truncated to a length of 6. Possible truncation methods are to truncate the first to sixth elements or the second to seventh elements.

[0121] For example, the second sequence and / or the third sequence is an m-sequence used to carry 2 bits of information. The length of the second sequence and / or the third sequence can be obtained by truncating the m-sequence of length 7, taking 4 bits. In one possible implementation, the first communication device can take the first 4 bits of the m-sequence of length 7 and modulate them to obtain the sequences in the second sequence set and / or the third sequence set.

[0122] It should be noted that the second and third sequences can be sequences with different encoding methods. For example, the second sequence may be an RM code, and the third sequence may be an m-sequence. Alternatively, the second and third sequences can be sequences with the same encoding method. For example, both the second and third sequences may be m-sequences. This can be set according to actual needs, and the embodiments of this application do not impose any limitations.

[0123] For example, the bit information is '110101', the first bit is the first three bits of the first bit information '110', the second bit is the last three bits of the first bit information '101', the second sequence and the third sequence are both m-sequences, and the set of the second sequence and the set of the third sequence can both be sets of m-sequences consisting of 8 m-sequences of length 7, where each m-sequence corresponds to a 3-bit bit information. Table 2 shows a correspondence between bit information and m-sequences, as shown in Table 1, where the first three bits of the bit information are the same as the first three bits of the m-sequence. The second sequence is the m-sequence [1,1,0,0,1,0,1] corresponding to 110, and the third sequence is the m-sequence [1,0,1,1,1,0,0] corresponding to 101.

[0124] In this embodiment, the first communication device can convert the m-sequence into a target element sequence, and the conversion method is equivalent to implementing binary phase shift keying (BPSK) modulation.

[0125] Table 2

[0126] In one possible implementation, the bit information is converted into decimal to obtain a decimal value, and the corresponding m-sequence in decimal can be the m-sequence corresponding to the bit information.

[0127] For example, if the bit information is '111' and its decimal value is 7, then the m-sequence corresponding to the bit information '111' is the 7th m-sequence in the set of m-sequences.

[0128] Here, the order of the m-sequences can be set according to actual needs, and changes in the order of the m-sequences have little impact on the computational complexity of detection.

[0129] In this application embodiment, the first sequence S1 can be S11 or S12. S11 can be constructed by formula (6), and S12 can be constructed by formula (7). This can be set as needed, and this application embodiment does not impose any restrictions.

[0130]

[0131] Wherein, S2 is the second sequence and S3 is the third sequence. The first sequence S11 in formula (6) includes K1 unit sequences, each of which has a length of K2, the same as the length of S3, and the j-th unit sequence is obtained by multiplying the j-th element of the third sequence S3 and the second sequence S2, where j is a positive integer. The first sequence S12 in formula (7) includes K2 unit sequences, each of which has a length of K1, the same as the length of S2, and the j-th unit sequence is obtained by multiplying the j-th element of the second sequence S2 and the third sequence S3.

[0132] For example, the first sequence S1 is considered as a K1×K2 matrix, the second sequence S2 as a 1×K1 matrix, and the third sequence S3 as a 1×K2 matrix. If the second sequence S2 is the 7th target element sequence in Table 1 and the third sequence S3 is the 4th target element sequence in Table 1, the first sequence S11 obtained by formula (6) is [1,-1,1,1,1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1, -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1]; while the first sequence S12 obtained by formula (7) is [1,1,- ...

[0133] S120, the first communication device determines the first signal based on the first sequence.

[0134] In this embodiment of the application, after obtaining the first sequence, the first communication device can first map the first sequence to the frequency domain to obtain a frequency domain signal; and then convert the frequency domain signal into a time domain signal.

[0135] It should be noted that, to adapt to time and frequency resource constraints, the first communication device needs to adjust the length of the first sequence to obtain an adjusted sequence of length N, where N is the total number of resource elements (REs), and N is greater than or equal to the length of the first sequence. If the length of the first sequence is greater than N, it is directly truncated to obtain the adjusted sequence. The value of N is determined by the system bandwidth, and is the product of the number of subcarriers and the number of symbols (OFDM symbols) on a subcarrier.

[0136] For example, the first sequence is [S1,S2,S3,S4,S5]; if N is 4, the adjusted sequence is [S1,S2,S3,S4]; if N is 7, the adjusted sequence is [S1,S2,S3,S4,S5,S1,S2].

[0137] Figures 5a and 5b illustrate how the first sequence is mapped to time-frequency resources. As shown in Figure 5a, the first sequence has a length of 24, occupies 1 RB in the frequency domain, and occupies 2 OFDM symbols in the time domain; N is 48, so the first sequence needs to be mapped to the time-frequency resources twice to obtain a sequence composed of first sequence 1 and first sequence 2, with a length of 48. As shown in Figure 5b, the first sequence has a length of 8, and occupies... Each RB occupies one OFDM symbol in the time domain; if N is 36, the first sequence needs to be mapped to the time-frequency resource 5 times to obtain the sequence composed of the first sequence 1-5, which has a length of 40, which is greater than N; therefore, the first sequence 5 in the dashed box needs to be truncated, and only the first sequence 5 in the solid box needs to be kept.

[0138] Optionally, the product of the length K1 of the second sequence and the length K2 of the third sequence is N. Thus, the length K1×K2 of the first sequence is the same as N, and the first sequence can be mapped exactly to the time-frequency resource.

[0139] Figures 6a-6c illustrate how the first sequence is mapped to time-frequency resources. As shown in Figure 6a, the third sequence has a length of 36, occupies 1 RB in the frequency domain and 3 OFDM symbols in the time domain. The second sequence has a length of 4, with values ​​[1, -1, 1, -1]. The first sequence includes 4 unit sequences, each with the same length as the third sequence: unit sequence 1 is the third sequence multiplied by 1, unit sequence 2 is the third sequence multiplied by -1, unit sequence 3 is the third sequence multiplied by 1, and unit sequence 4 is the third sequence multiplied by -1. As shown in Figure 6b, the third sequence has a length of 18, occupies 1 RB in the frequency domain and 1.5 OFDM symbols in the time domain. The second sequence has a length of 2, with values ​​[1, -1]. The first sequence includes 2 unit sequences, each with the same length as the third sequence: unit sequence 1 is the third sequence multiplied by 1, and unit sequence 2 is the third sequence multiplied by -1. As shown in Figure 6c, the third sequence has a length of 6, occupies 0.5 RB in the frequency domain and 1 OFDM symbol in the time domain. The second sequence has a length of 4 and takes the value [1,-1,1,-1]. The first sequence includes 4 unit sequences, each with the same length as the third sequence. Unit sequence 1 and unit sequence 2 occupy one OFDM symbol. Unit sequence 1 is the third sequence multiplied by 1, and unit sequence 2 is the third sequence multiplied by -1. Unit sequence 3 and unit sequence 4 occupy one OFDM symbol. Unit sequence 3 is the third sequence multiplied by 1, and unit sequence 4 is the third sequence multiplied by -1. If the third sequence is F and the second sequence is W, it can be seen that the first sequence S1 in Figures 6a and 6b can be obtained by formula (6), while the first sequence S in Figure 6c can be obtained by formula (7).

[0140] Optionally, the sequence constructed by the Kronecker product of the second and third sequences can be a fourth sequence. The first communication device can multiply the fourth sequence and the modulation sequence to obtain the first sequence, and then determine the first signal based on the first sequence. Here, the first communication device can multiply the modulation sequence and the fourth sequence to obtain the first sequence, wherein the odd-numbered bits of the modulation sequence are 1s and the even-numbered bits are j. In this way, it is equivalent to realizing... Modulation, the elements in the first sequence may include {1, -1, j, -j}.

[0141] For example, the fourth sequence is [1,1,-1,1,-1,-1], and the corresponding modulation sequence is [1,j,1,j,1,j]. Multiplying the fourth sequence and the modulation sequence yields the first sequence [1,j,-1,j,-1,-j].

[0142] In the embodiments of this application, the first communication device can directly map the adjustment sequence to the frequency domain to obtain a frequency domain signal; or it can map the adjustment sequence to the frequency domain through Discrete Fourier Transform (DFT), that is, perform a DFT on each OFDM symbol separately to obtain a frequency domain signal. At this time, the waveform of the frequency domain signal is a DFT-s-OFDM waveform.

[0143] In this embodiment, the first communication device can convert a frequency domain signal into a time domain signal using any of the following methods: Discrete Time Fourier Transform (DFT) or Inverse Fast Fourier Transform (IFFT). Specifically, during the conversion, the first communication device needs to perform oversampling, sampling the frequency domain signal at N points to obtain a time domain signal containing N sampling points, where N is greater than the number of REs in a single symbol.

[0144] In one possible implementation, the first communication device is equipped with multiple transmitting antennas, such as an antenna array system. The first communication device can perform beamforming on the frequency domain signal to obtain a first signal. Here, the first communication device can multiply the frequency domain signal by a precoding matrix to obtain the first signal; the first signal has a certain directionality.

[0145] In one possible implementation, after obtaining N sampled data, the first communication device can set a cyclic prefix (CP) on the sequence composed of N sampled data, and then perform digital-to-analog conversion to obtain the first signal.

[0146] In one possible implementation, the first communication device can modulate the first sequence to obtain a modulated first sequence, and then map the modulated first sequence to the frequency domain; alternatively, the first communication device can modulate an adjustment sequence to obtain a modulated first sequence, and then map the modulated first sequence to the frequency domain. The order of adjustment and modulation is not limited in this embodiment. The modulation method can be BPSK or [other modulation methods]. Modulation, etc., are not limited in this respect in the embodiments of this application.

[0147] S130, the first communication device sends the first signal to the second communication device.

[0148] In this embodiment of the application, after the first communication device obtains the first signal based on the first sequence, it can send the first signal to the second communication device.

[0149] S140, the second communication device determines the first bit information based on the first signal.

[0150] In this embodiment, the processing after the second communication device receives the first signal can be completed in the RU or the DU near the RU. After filtering, downsampling, and performing a Fast Fourier Transform (FFT) on the first signal, the second communication device can obtain a frequency domain signal. Correlation detection is then performed on the frequency domain signal using a local frequency domain sequence, and the bit information corresponding to the sequence is determined based on the correlation value detection sequence. Here, the local frequency domain sequence may include at least one of a first sequence set, a second sequence set, and a third sequence set.

[0151] In one possible implementation, the second communication device can directly determine the first bit information based on the frequency domain signal. In another possible implementation, the second communication device can determine the first bit and the second bit based on the frequency domain signal, and then determine the first bit information based on the first bit and the second bit.

[0152] In one possible implementation, the second communication device can determine a second sequence based on a frequency domain signal, and determine a second bit based on a first bit corresponding to the second sequence. The first bit information includes both a first bit and a second bit. Specifically, the second communication device is configured with a second sequence set. Correlation detection is performed on the frequency domain signal based on the second sequence set to obtain the second sequence. The first bit carried by the second sequence is determined, and then the second bit is determined based on the first bit, thus obtaining the first bit information. In this way, only correlation detection needs to be performed on the second sequence. Since the second sequence only carries the first bit, the computational complexity of the detection can be reduced.

[0153] For example, the first bit and the second bit are the same. The second communication device detects the second sequence and determines that the first bit corresponding to the second sequence is "101". Since the first bit and the second bit are the same, the second bit can be determined to be "101". The first bit "101" indicates cell 5, and the second bit "101" indicates the signal quality of the cell. The second communication device can determine the signal quality of cell 5 based on the first signal.

[0154] Optionally, the second communication device can determine the first sequence based on the frequency domain signal, and determine the first bit information based on the first sequence.

[0155] In one possible implementation, the second communication device is configured with a first sequence set, and performs correlation detection on the frequency domain signal based on the first sequence set to obtain a first sequence. Here, the second communication device can correlate all sequences in the first sequence set with the frequency domain signal, and determine a sequence from the first sequence set as the first sequence based on the correlation result.

[0156] In one possible implementation, the second communication device is configured with a second sequence set and a third sequence set, performs correlation detection on the frequency domain signal based on the second sequence set and the third sequence set to obtain the second sequence and the third sequence, and obtains the first sequence based on the second sequence and the third sequence.

[0157] In one possible implementation, the second communication device can correlate the frequency domain signal F with the second sequence set ST1 to obtain a correlated sequence set SS1, determine the second sequence from the second sequence set ST1 based on the correlated sequence set SS1, and then determine the third sequence from the third sequence set ST2 based on the correlated sequence set SS1.

[0158] The frequency domain signal is a sequence of length K1×K2. Correlation is performed on the frequency domain signal F and the second sequence set ST1 to obtain the correlated sequence set SS1, as shown in formula (8). ST1·F=SS1 Formula (8)

[0159] Consider the second sequence set ST1, which includes C1 sequences of length K1, as a C1×K1 matrix ST1. C1×K1 The frequency domain signal F can be viewed as a K1×K2 matrix F K1×K2 F K1×K2 If each row vector in the vector is a unit signal, then the frequency domain signal F includes K1 unit signals. For ST1 C1×K1 and F K1×K2 Taking the dot product, we can obtain the correlation matrix SS1. C1×K2 As shown in formula (9). Correlation matrix SS1 C1×K2 Each row vector in SS1 corresponds to a sequence in SS1, and SS1 contains C1 sequences. C1×K2 Each row vector in the vector represents ST1 C1×K1 The correlation between a corresponding row vector and the frequency domain signal F. ST1 C1×K1 ·F K1×K2 =SS1 C1×K2 Formula (9)

[0160] For example, if the second sequence is a row vector in a Hadamard matrix, the third sequence is [b1, b2], and the second sequence is [1, -1, 1, -1,], then the set of the second sequences ST1 includes 2 2 The sequence can be viewed as a matrix ST1 4×4 The four row vectors in the formula are shown in formula (10). The frequency domain signal F is [b1,b2,-b1,-b2,b1,b2,-b1,-b2], and SS1 can be obtained by formula (4). SS1 includes four sequences: [0,0], [4b1,4b2], [0,0] and [0,0].

[0161] Here, the frequency domain signal F can be regarded as a matrix F 4×2 Formula (9) can be expressed as formula (11). It can be seen that SS1 4×2 Each row vector in SS1 corresponds to a sequence in SS1.

[0162] If the second sequence set ST1 contains C1 column vectors of length K1, then ST1 can be regarded as a matrix ST1 K1×C1 By correlating the frequency domain signal with the second sequence set ST1, the correlation matrix SS1 can be obtained. C1×K2 As shown in formula (12). SS1 C1×K2 Each row vector in the vector represents ST1 K1×C1 The correlation between a corresponding column vector and the frequency domain signal F. ST1 T C1×K1 ·F K1×K2 =SS1 C1×K2 Formula (12)

[0163] Since there are C1 second sequences, each second sequence requires K1×K2 additions, which means adding K1 third sequences together. The computational complexity of formulas (9) and (12) is C1×K1×K2.

[0164] In this embodiment of the application, after obtaining the correlation sequence SS1, the second communication device can perform energy detection on the correlation sequence SS1 to obtain a first correlation value for each sequence; the first correlation value for each sequence represents the correlation between the sequence and the frequency domain signal F. The larger the first correlation value, the higher the correlation.

[0165] Here, the second communication device can sum the absolute values ​​or power of all elements of each sequence in the relevant sequence set SS1 to obtain the first correlation value of each sequence, and determine the index corresponding to the maximum value of the first correlation values ​​of all sequences as the first target index. The sequence corresponding to the first target index in the second sequence set is the detected second sequence.

[0166] In one possible implementation, the index of each sequence in the relevant sequence set SS1 represents the order of the sequence in the relevant sequence set SS1. For example, SS1 is {[0,0],[4b1,4b2],[0,0],[0,0]}, index 1 corresponds to the first sequence [0,0], index 2 corresponds to the second sequence [4b1,4b2], index 3 corresponds to the third sequence [0,0], and index 4 corresponds to the fourth sequence [0,0].

[0167] For example, the relevant sequence set SS1 is {[0,0],[4b1,4b2],[0,0],[0,0]}. The second communication device performs energy detection on the four sequences in SS1, including: summing the absolute values ​​of the two elements in the first sequence [0,0] to obtain the first relevant value 0 corresponding to index 1; summing the absolute values ​​of the two elements in the second sequence [4b1,4b2] to obtain the first relevant value |4b1|+|4b2| corresponding to index 2; summing the absolute values ​​of the two elements in the third sequence [0,0] to obtain the first relevant value 0 corresponding to index 3; and summing the absolute values ​​of the two elements in the fourth sequence [0,0] to obtain the first relevant value 0 corresponding to index 4. The maximum relevant value is |4b1|+|4b2|, and the first target index is index 2. The sequence corresponding to index 2 in the second sequence set ST1 is the second sequence.

[0168] Among them, energy detection of SS1 requires K1×K2 additions, with a computational complexity of K1×K2.

[0169] Optionally, after determining the first target index, the second communication device can use the sequence corresponding to the first target index in the relevant sequence set SS1 as the target first relevant sequence SS1. * The first and third relevant sequences of the target are correlated to obtain the relevant element set SS2, as shown in formula (13). SS1 * ·ST2=SS2 Formula (13)

[0170] Among them, the first relevant sequence of the target is SS1 * It can be viewed as a 1×K2 matrix SS1 * 1×K2 ; and, the third sequence set ST2 is considered as a C2×K2 matrix ST2 C2×K2 ; Combine each sequence in the third sequence set ST2 with the target first related sequence SS1 * Doing something related is equivalent to doing something related to SS1. * 1×K2 Matrix and Matrix ST2 T K2×C2 Performing the dot product yields the correlation matrix SS2, which contains C2 elements. 1×C2 SS2 1×C2 The related element set SS2, which has C2 elements, is shown in formula (14). SS1 * 1×K2 ST2 T K2×C2 =SS2 1×C2 Formula (14)

[0171] For example, the third sequence is [1,1], and the set of third sequences ST2 is {[1,1],[1,-1]}. The third sequence corresponds to ST2 in formula (15). T 2×2 The first column vector in the matrix is ​​used to determine the first relevant sequence SS1 of the target using formula (7). * After [4b1, 4b2], SS1 * 1×2 and ST2 T 2×2 Taking the dot product, we get SS2. 1×2 As shown in formula (16).

[0172] Here, the computational complexity of the second communication device in detecting the third sequence is K2×C2.

[0173] Among them, the second communication device obtains the correlation matrix SS2 1×C2 Then, the absolute value of each element can be used as the second correlation value corresponding to that element. For any element, if the second correlation value is the maximum value among them, then the index of that element in SS2 is the second target index, and the sequence corresponding to the second target index in the third sequence set ST2 is the third sequence.

[0174] For example, as shown in formula (12), if both b1 and b2 are 1, SS2 1×2 The corresponding set of related elements SS2 is {(4b1+4b2), (4b1-4b2)}. The second related value of the first element 4b1+4b2 in SS2 is |4b1+4b2|, which is 8; the second related value of the second element 4b1-4b2 in SS2 is |4b1-4b2|, which is 0. The second communication device can determine the index of the first element 4b1+4b2, that is, the order 1 of this element in SS2, as the second target index. The second target index corresponds to the sequence ST2 in the third sequence set. T 2×2 The first column vector in the matrix, which is also the first sequence [1,1] in the third sequence set ST2.

[0175] It should be noted that if SS2 2×2 Each row vector in the matrix is ​​a sequence in the third sequence set ST2, and the first sequence [1,1] in the third sequence set ST2 is ST2. T 2×2 The first row vector in the set. If each column vector in the ST2 matrix is ​​a sequence in the third sequence set ST2, then the first sequence [1,1] in the third sequence set ST2 is ST2. T 2×2The first column vector in.

[0176] In summary, the computational complexity of detecting the second sequence first and then detecting the third sequence based on the first relevant sequence set and the third sequence set by the second communication device is C1×K1×K2+K1×K2+K2×C2, which is lower than the previous method.

[0177] For example, the second and third sequences are both binary orthogonal codes, where m is 11, m1 is 5, and m2 is 6. If N is 168, then the computational complexity is 2^n. 5 ×168+168+2 12 =9640, compared to 15139, the computational complexity is reduced.

[0178] Optionally, the correlation value between any two sequences in the second sequence set is less than a first correlation threshold; and / or, the correlation value between any two sequences in the third sequence set is less than a second correlation threshold. The smaller the first correlation threshold, the lower the correlation between the sequences in the second sequence set, and the higher the detection performance when detecting the second sequence through correlation processing. The smaller the second correlation threshold, the lower the correlation between the sequences in the third sequence set, and the higher the detection performance when detecting the third sequence through correlation processing. Here, the first and second correlation thresholds can be the same or different; the first and second correlation thresholds can be set as needed, and this embodiment does not impose any limitations.

[0179] For example, the first correlation threshold and the second correlation threshold can both be 0.5; the first correlation threshold and the second correlation threshold can both be 0.4; the first correlation threshold is 0.3 and the second correlation threshold is 0.5, etc.

[0180] Optionally, at least one of the second and third sequences is a row vector or column vector in a Hadamard matrix. This ensures that the correlation value between any two sequences in the second sequence set is 0, and / or the correlation value between any two sequences in the third sequence set is 0, thereby improving the detection performance for at least one of the second and third sequences.

[0181] In one possible implementation, the detection method for the second and third sequences includes the first detection method. For example, the first detection method can be Fast Hadamard Transform (FHT), which reduces the computational complexity of detecting the second and third sequences to K²×C¹×log₂. a K1 + K1 × K2 + C2 × log a K2.

[0182] In one possible implementation, K1 × K2 = N. If the length of the second sequence K1 is K and the number of bits of the first bit information is m, then the number of bits m1 that the second sequence can carry for the first bit can be determined to be log0. a K, the length of the third sequence K2 is The number of bits m2 that the third sequence can carry for the second bit is The computational complexity for detecting the second and third sequences is O(n). If the second sequence is an orthogonal binary sequence, then C2 is... The computational complexity for detecting the second and third sequences is O(n).

[0183] For example, if the second sequence is a binary orthogonal code, m is 11, N is 168, and m1 is 5 and m2 is 6, then the computational complexity of the second communication device detecting the second and third sequences is . Compared to the computational complexity of 9640 without using the first detection method, this represents a further reduction.

[0184] Table 2 shows the maximum cross-correlation values ​​of different sequences used as the third sequence. The second sequence is always a row or column vector from a Hadamard matrix of length 4; the larger N is, the longer the third sequence. When the third sequence is derived from the gold sequence, its maximum cross-correlation value decreases significantly compared to other sequences as the length of the second sequence increases. Therefore, when the second sequence uses a sequence from the Hadamard matrix, using the gold sequence as the third sequence, which has the lowest correlation, can improve detection accuracy compared to using the other two sequences.

[0185] Table 3

[0186] In this embodiment, the second communication device detects a second sequence and a third sequence, and can determine a first sequence based on the second and third sequences, and determine first bit information based on the first sequence. The second communication device can combine the first bit and the second bit according to a preset allocation method to obtain the first bit information.

[0187] In one possible implementation, the preset allocation method is that the first m1 bits of the first bit information are used as the first bit, and the remaining m2 bits are used as the second bit. Then, after the second communication device obtains the second sequence and the third sequence, it can concatenate the second sequence and the third sequence in sequence to obtain the first sequence.

[0188] For example, if the second communication device determines that the first bit is '110' and the second bit is '101', it can obtain the first bit information as '110101'.

[0189] In one possible implementation, the preset allocation method can be that the first m2 bits are used as the second bit and the last m1 bits are used as the first bit; after obtaining the second sequence and the third sequence, the second communication device can concatenate the second sequence and the third sequence in sequence to obtain the first sequence.

[0190] For example, if the second communication device determines that the first bit is '110' and the second bit is '101', it can obtain the first bit information as '101110'.

[0191] The communication method provided in the embodiments of this application has been described above. The execution subject used to perform the above communication method will be described below.

[0192] Figure 7 shows a schematic block diagram of a communication device 700 provided in an embodiment of this application. This communication device can be applied to the first communication device in the method embodiment of Figure 4. The first communication device 700 includes:

[0193] The determining module 710 is used to determine a first signal based on a first sequence corresponding to the first bit information, wherein the first sequence is the Kronecker product of a second sequence and a third sequence, the second sequence carries the first bit in the first bit information, and the third sequence carries the second bit in the first bit information;

[0194] The transmitting module 720 is used to transmit the first signal.

[0195] In one possible implementation, the second sequence is a sequence in a second sequence set, any one of which is a row vector or column vector in a Hadamard matrix, and any one of which is a sequence obtained by performing at least one of the following processes on the gold sequence: repetition, truncation, or modulation.

[0196] In one possible implementation, at least one of the second sequence and the third sequence is a column vector or row vector in a Hadamard matrix.

[0197] In one possible implementation, the second sequence is a row vector or column vector in a Hadamard matrix; the third sequence is obtained by performing at least one of the following processes on any one of the gold sequence, m sequence, or RM code: repetition, truncation, or modulation.

[0198] In one possible implementation, the first sequence is obtained by multiplying a fourth sequence and a modulation sequence, wherein the fourth sequence is the Kronecker product of the second sequence and the third sequence, and the odd-numbered bits of the modulation sequence are 1 and the even-numbered bits are j.

[0199] Figure 8 shows a schematic block diagram of another communication device 800 provided in an embodiment of this application. This communication device can be applied to the second communication device in the method embodiment of Figure 4. The second communication device 800 includes:

[0200] The receiving module 810 is used to receive a first signal, the first signal being obtained based on a first sequence corresponding to the first bit information, the first sequence being the Kronecker product of a second sequence and a third sequence, the second sequence carrying the first bit in the first bit information, and the third sequence carrying the second bit in the first bit information;

[0201] The determining module 820 is used to determine the first bit information based on the first signal.

[0202] In one possible implementation, the determining module 820 is configured to perform correlation detection on the first signal based on all sequences in the first sequence set to obtain a first sequence, wherein different sequences in the first sequence set are associated with different bit information; and determine the first bit information based on the first sequence.

[0203] In one possible implementation, the determining module 820 is configured to perform correlation detection on the first signal based on all sequences in the first sequence set to obtain the second sequence and the third sequence; and determine the first sequence based on the second sequence and the third sequence.

[0204] In one possible implementation, the second sequence is a sequence in the second sequence set, and the third sequence is a sequence in the third sequence set. The determining module 820 is configured to correlate each sequence in the second sequence set with the first signal to obtain a correlated sequence set; determine the second sequence from the second sequence set based on the correlated sequence set; and determine the third sequence based on the correlated sequence set and the third sequence set.

[0205] In one possible implementation, the determining module 820 is configured to determine a second sequence from the second sequence set based on a first correlation value for each sequence in the related sequence set; the first correlation value is the sum of the absolute values ​​or powers of all elements of a corresponding sequence in the related sequence set.

[0206] In one possible implementation, the determining module 820 is configured to correlate each sequence in the third sequence set with the target first related sequence to obtain a set of related elements; and determine the third sequence from the third sequence set based on the set of related elements.

[0207] In one possible implementation, the third sequence is determined from the third sequence set based on a second correlation value for each element in the set of related elements; the second correlation value is the absolute value or power of a corresponding element in the set of related elements.

[0208] In one possible implementation, the second sequence is a sequence in a second sequence set, any one of which is a row vector or column vector in a Hadamard matrix, and any one of which is a sequence obtained by performing at least one of the following processes on the gold sequence: repetition, truncation, or modulation.

[0209] In one possible implementation, at least one of the second sequence and the third sequence is a column vector or row vector in a Hadamard matrix.

[0210] In one possible implementation, the second sequence is a row vector or column vector in a Hadamard matrix; the third sequence is obtained by performing at least one of the following processes on any one of the gold sequence, m sequence, or RM code: repetition, truncation, or modulation.

[0211] In one possible implementation, the first sequence is obtained by multiplying a fourth sequence and a modulation sequence, wherein the fourth sequence is the Kronecker product of the second sequence and the third sequence, and the odd-numbered bits of the modulation sequence are 1 and the even-numbered bits are j.

[0212] In one possible implementation, when the first communication device is used in a terminal device, the second communication device is used in a network device. In another possible implementation, when the first communication device is used in a network device, the second communication device is used in a terminal device.

[0213] Figure 9 shows a schematic block diagram of another communication device 900 provided in an embodiment of this application. This communication device 900 can be applied to a terminal device or a network device. The communication device 900 includes a processor 910, which implements the communication method provided in the embodiment of this application through logic circuits or executing code instructions.

[0214] Optionally, the communication device 900 may also include interface circuitry 920. Processor 910 and interface circuitry 920 are coupled to each other. It is understood that interface circuitry 920 may be a transceiver or an input / output interface.

[0215] Optionally, the communication device 900 may further include a memory 930 for storing instructions executed by the processor 910, or storing input data required for the processor 910 to execute instructions, or storing data generated after the processor 910 executes instructions.

[0216] The aforementioned processor 910 may be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by software instructions. The aforementioned processor may be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied in the execution of a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules may reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0217] This application also provides a communication system, including a first communication device and a second communication device in the communication method provided in this application.

[0218] This application also provides a computer-readable storage medium storing a computer program for implementing the methods in the above-described method embodiments. When the computer program is run on a computer, the computer can implement the methods in the above-described method embodiments.

[0219] This application also provides a computer program product, which includes computer program code. When the computer program code is run on a computer, the method in the above method embodiments is executed.

[0220] This application also provides a chip, including a processor connected to a memory for storing computer programs, and the processor for executing the computer programs stored in the memory, so that the chip performs the methods described in the above method embodiments.

[0221] It should be understood that in the embodiments of this application, the designations "first", "second", etc. are only for distinguishing different objects, such as different terminal devices or different network devices, and do not constitute a limitation on the scope of the embodiments of this application. The embodiments of this application are not limited thereto.

[0222] Furthermore, the term "and / or" in this application is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following related objects have an "or" relationship. The term "at least one" in this application can represent "one" and "two or more." For example, A, B, and C can represent: A existing alone, B existing alone, C existing alone, A and B existing simultaneously, A and C existing simultaneously, C and B existing simultaneously, and A, B, and C existing simultaneously.

[0223] In this embodiment of the application, expressions such as "A includes B" are used to indicate that A may or may not include other items besides B. When other items are not included, it can be understood as "A is B", in which case "A" can be replaced with "B".

[0224] In the embodiments of this application, "send" and "receive" indicate the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which may include direct transmission via the air interface or indirect transmission via the air interface by other units or modules. "Receive information from YY" can be understood as the source of the information being YY, which may include direct reception from YY via the air interface or indirect reception from YY via the air interface by other units or modules. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface.

[0225] In other words, sending and receiving can occur between devices, such as between network devices and terminal devices, or within a device, such as between components, modules, chips, software modules, or hardware modules within the device via buses, wiring, or interfaces.

[0226] It is understandable that information may undergo necessary processing, such as encoding and modulation, between the source and destination, but the destination can understand the valid information from the source. Similar statements in this application can be interpreted in a similar way and will not be elaborated further.

[0227] In the embodiments of this application, "instruction" can include direct and indirect instructions, as well as explicit and implicit instructions. The information indicated by a certain piece of information (hereinafter referred to as instruction information) is called the information to be instructed. In specific implementation, there are many ways to indicate the information to be instructed, such as, but not limited to, directly indicating the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly indicate the information to be instructed by indicating other information, where there is an association between the other information and the information to be instructed; or it can indicate only a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction can be implemented by using a pre-agreed (e.g., protocol predefined) arrangement of various information, thereby reducing the instruction overhead to a certain extent. This application does not limit the specific method of instruction. It is understood that for the sender of the instruction information, the instruction information can be used to indicate the information to be instructed; for the receiver of the instruction information, the instruction information can be used to determine the information to be instructed.

[0228] In this application, unless otherwise specified, the same or similar parts between the various embodiments can be referred to each other. In the various embodiments of this application, and in the various implementation methods / methods / implementations within each embodiment, unless otherwise specified or logically conflicting, the terminology and / or descriptions between different embodiments and between the various implementation methods / methods / implementations within each embodiment are consistent and can be mutually referenced. The technical features in different embodiments and the various implementation methods / methods / implementations within each embodiment can be combined according to their inherent logical relationships to form new embodiments, implementation methods, methods, or implementation approaches. The embodiments described below do not constitute a limitation on the scope of protection of this application.

[0229] Those skilled in the art will recognize that the units and algorithm steps of the various examples 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 implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art 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.

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

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

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

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

[0234] If the aforementioned functions are implemented as 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 this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

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

Claims

A communication method characterized by comprising: The method is applied to a first communication device, and comprises: determining a first signal based on a first sequence corresponding to first bit information, the first sequence being a Kronecker product of a second sequence and a third sequence, the second sequence carrying first bits in the first bit information, and the third sequence carrying second bits in the first bit information; sending the first signal. The method of claim 1, wherein the second sequence is a sequence in a second sequence set, and the third sequence is a sequence in a third sequence set, any sequence in the second sequence set being a row vector or a column vector in a Hadamard matrix, and any sequence in the third sequence set being obtained by at least one of repetition, truncation or modulation on a gold sequence. The method of claim 1, wherein At least one of the second sequence and the third sequence is a column vector or a row vector in a Hadamard matrix. The method of claim 1, wherein the second sequence is a row vector or a column vector in a Hadamard matrix, and the third sequence is obtained by at least one of repetition, truncation or modulation on any one of a gold sequence, an m-sequence or an RM code. The method of claim 1, wherein the first sequence is obtained by multiplication of a fourth sequence and a modulation sequence, the fourth sequence being a Kronecker product of the second sequence and the third sequence, and the modulation sequence having odd bits of 1 and even bits of j. A communication method characterized by comprising: The method is applied to a second communication device, and comprises: receiving a first signal, the first signal being obtained based on a first sequence corresponding to first bit information, the first sequence being a Kronecker product of a second sequence and a third sequence, the second sequence carrying first bits in the first bit information, and the third sequence carrying second bits in the first bit information; determining the first bit information based on the first signal. The method according to claim 6, characterized in that The determining of the first bit information based on the first signal comprises: performing correlation detection on the first signal based on all sequences in a first sequence set to obtain a first sequence, different sequences in the first sequence set being associated with different bit information; determining the first bit information based on the first sequence. The method of claim 7, wherein The performing of the correlation detection on the first signal based on all sequences in a first sequence set to obtain a first sequence comprises: performing correlation detection on the first signal based on all sequences in a first sequence set to obtain the second sequence and the third sequence; determining the first sequence based on the second sequence and the third sequence. The method of claim 7, wherein the second sequence is one sequence in the second sequence set, and the third sequence is one sequence in the third sequence set, and the performing of the correlation detection on the first signal based on all sequences in a first sequence set to obtain a first sequence comprises: performing correlation on each sequence in the second sequence set and the first signal to obtain a correlation sequence set; determining the second sequence from the second sequence set according to the correlation sequence set; determining the third sequence based on the correlation sequence set and the third sequence set. The method of claim 9, wherein The determining of the third sequence based on the correlation sequence set and the third sequence set comprises: correlating each sequence in the third sequence set with the target first correlation sequence to obtain a set of correlation elements; determining the third sequence from the third sequence set according to the set of correlation elements. The method according to any one of claims 6-10, wherein the second sequence is one sequence in a second sequence set, and the third sequence is one sequence in a third sequence set, any sequence in the second sequence set is a row vector or a column vector in a Hadamard matrix, and any sequence in the third sequence set is obtained by at least one of repetition, truncation or modulation on a gold sequence. The method according to any one of claims 6-10, characterized in that At least one of the second sequence and the third sequence is a column vector or a row vector in a Hadamard matrix. The method according to any one of claims 6-10, characterized in that the second sequence is a row vector or a column vector in a Hadamard matrix, and the third sequence is obtained by at least one of repetition, truncation or modulation on any one of a gold sequence, an m-sequence or an RM code. The method according to any one of claims 6-10, characterized in that the first sequence is obtained by multiplying a fourth sequence and a modulation sequence, the fourth sequence is a Kronecker product of the second sequence and the third sequence, and the modulation sequence has 1 in odd positions and j in even positions. A communication device, characterized by The apparatus comprises units for performing the method according to any one of claims 1-5, or units for performing the method according to any one of claims 6-14. A communication device characterized by comprising: The apparatus comprises: a processor configured to implement the method according to any one of claims 1-5, or the method according to any one of claims 6-14. A communication system characterized by The apparatus comprises a first communication device configured to perform the method according to any one of claims 1-5, and a second communication device configured to perform the method according to any one of claims 6-14. A computer-readable storage medium, characterized by, The apparatus comprises: The computer readable medium stores a computer program; The computer program, when executed on a computer or a processor, causes the method according to any one of claims 1-14 to be performed. A computer program product, characterized in that The computer program, when executed, causes the method according to any one of claims 1-14 to be implemented.

Images