Communication method and communication apparatus

Abstract

The present application provides a communication method and a communication apparatus. The method comprises: on the basis of sequences in a first sequence set, spreading a first modulation symbol to obtain a first spread symbol; and sending the first spread symbol, wherein the first sequence set is determined on the basis of Nset,2 second sequence sets, and Nset,2 is an integer greater than 1; each second sequence set comprises one or more second sequences, and the second sequences in each second sequence set are orthogonal; there are at least two sequence sets among Nset,2 second sequence sets, and the lengths of the second sequences comprised therein are different; and the sequences comprised in the first sequence set are orthogonal. Sequences in a first sequence set are used as spreading sequences to spread a first modulation symbol, thereby improving the flexibility of orthogonal spreading sequence selection.

Description

Communication methods and communication devices

[0001] This application claims priority to Russian patent application filed on August 27, 2024, with application number 2024124934 and entitled "Communication Method and Communication 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 a communication device. Background Technology

[0003] In a multiple access system, data transmitted by different terminal devices can be frequency-division multiplexed or code-division multiplexed. Frequency division multiplexing is called Frequency Division Multiple Access (FDMA), and code division multiplexing is called Code Division Multiple Access (CDMA). For CDMA, terminal devices can use a linear spreading sequence to spread the data before transmission. This spreading sequence can be selected from multiple orthogonal spreading sequences.

[0004] In existing schemes, the length of the extended sequence used by CDMA systems is a power of 2, for example, a length of 2... (p+1) The extended sequence can be based on a length of 2 p The extended sequence is generated from a candidate extended sequence and an extended sequence of length 2, where p is an integer greater than or equal to 0. However, in existing schemes, the length of the candidate extended sequence limits the flexibility of extended sequence selection. Therefore, how to increase the number of candidate extended sequences to improve the flexibility of extended sequence selection is a problem that needs to be considered. Summary of the Invention

[0005] This application provides a communication method and a communication device that can generate and improve the flexibility of orthogonal extended sequence selection.

[0006] Firstly, a communication method is provided. This method can be applied to a first device. Unless otherwise specified, the first device can be a terminal device or a network device, or a component within the terminal device or network device (e.g., a processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the terminal device or network device. For ease of description, the following description uses the first device as an example.

[0007] The method includes: expanding a first modulation symbol based on a first sequence in a first sequence set to obtain a first expanded symbol; and transmitting the first expanded symbol; wherein the first sequence set is based on N set,2 The N is determined by a set of second sequences. set,2 N is a positive integer greater than 1; set,2 Each of the N second sequence sets comprises one or more second sequences, and any two second sequences in each second sequence set are orthogonal; the N set,2 There exist at least two sets of second sequences in the set of second sequences, and the lengths of the second sequences included in the at least two sets of second sequences are different; the set of first sequences includes at least two first sequences, and any two first sequences in the set of first sequences are orthogonal.

[0008] Based on the above scheme, since the first sequence set is based on N set,2 The set of second sequences is determined by N, and the second sequences included in each set of second sequences are orthogonal, and N set,2 If at least two sets of second sequences in a set of first sequences have different lengths, then the first sequence in the first set of first sequences can be used as an extension sequence to extend the first modulation symbol, thereby improving the flexibility of orthogonal extension sequence selection.

[0009] In some implementations of the first aspect, any two first sequences in the first sequence set have the same length, which is L1, where L1 is a positive integer; any two second sequences in each second sequence set have the same length, and the length of the second sequences included in each second sequence set is divisible by L1.

[0010] Based on the above scheme, a sequence set containing longer extended sequences (i.e., the first sequence set) can be generated from a sequence set including shorter extended sequences (i.e., the second sequence set). Since the first sequence set is based on N... set,2 The set of second sequences is determined by N, and the second sequences included in each set of second sequences are orthogonal, and N set,2 If at least two second sequence sets contain second sequences of different lengths, the first sequence in the first sequence set can be used as an extension sequence to extend the first modulation symbol, thereby improving the flexibility of orthogonal extension sequence selection.

[0011] In some implementations of the first aspect, the length of the second sequence included in each set of second sequences satisfies at least the following relationship with the length L1 of the first sequence:

[0012] Where, N set,2The length of any second sequence in the u-th second sequence set of the _n ... 2,u u = 0, ..., N set,2 -1; This means that u can take values ​​from 0 to N. set,2 -1 of L 2,u The product of two digits.

[0013] In some implementations of the first aspect, the length of the second sequence included in each set of second sequences is a prime number.

[0014] In some implementations of the first aspect, the first sequence set comprises N1 first sequences, and the number of second sequences included in each second sequence set satisfies at least the following relationship with N1:

[0015] Where, N set,2 The number of second sequences included in the u-th second sequence set in the N second sequence sets is N. 2,u u = 0, ..., N set,2 -1; This means that u can take values ​​from 0 to N. set,2 -1 of N 2,u The product of two digits.

[0016] In some implementations of the first aspect, the first sequence in the first sequence set is based on N. set,2 The Kronecker product of the second sequence of the second sequence set is determined.

[0017] In some implementations of the first aspect, the first sequence set comprises N1 first sequences, where the N1 first sequences are N1 rows or N1 columns of the first matrix A1; N set,2 N second sequence sets correspond to set,2 N second matrices set,2 The u-th second sequence set in the N second sequence sets includes 2,u The second sequence is N. set,2 The u-th second matrix B in the second matrix 2,u N 2,u row or N 2,u Columns, the first matrix A1 and N set,2 The following relationships must be satisfied between the second matrices:

[0018] Where, N 2,u Let u be a positive integer, where u = 0, ..., N set,2 -1, N represents set,2 The Kronecker product of the second matrix.

[0019] It is understood that in this application, for variables composed of the same letters, and for variables composed of the same letters and numbers, there is no distinction between italics and non-italics; they represent the same variable. For example, N set,2 and N set,2 It is the same variable, N 2,u and N 2,u It is a variable.

[0020] In some implementations of the first aspect, N set,2 The N included in the u-th second sequence set in the n second sequence sets 2,u The second sequence is determined based on the orthogonal variable spreading factor (OVSF) code, or the Fourier transform matrix, or the inverse Fourier transform matrix, N. 2,u It is a positive integer.

[0021] In some implementations of the first aspect, first indication information is obtained, which indicates that one of the sequence sets in at least one third sequence set is the first sequence set.

[0022] For example, each of the at least one third sequence set is based on N set,2 The second sequence set is determined.

[0023] Optionally, the N corresponding to each third sequence set set,2 The sets of second sequences are not completely identical.

[0024] Based on the above scheme, different N values ​​can be utilized. set,2 A second sequence set determines different third sequence sets, and the first sequence set can be selected from different third sequence sets through the first indication information, which improves the flexibility of the first sequence set selection.

[0025] In some implementations of the first aspect, the first modulation symbol includes at least two modulation symbols. For each of the at least two modulation symbols, it can be extended based on a first sequence in a first sequence set, or, each modulation symbol can be extended based on different first sequences in the first sequence set, or each modulation symbol corresponds to a different first sequence in the first sequence set.

[0026] In some implementations of the first aspect, the first extended symbol is transmitted within one or more resource units, wherein the extended symbol transmitted on each of the plurality of resource units is obtained by extending different first sequences in the first sequence set; the extended symbols transmitted on the plurality of resource units constitute the first extended symbol.

[0027] In some implementations of the first aspect, the first modulation symbol includes G groups of modulation symbols, each group of modulation symbols in the G groups of modulation symbols includes at least one modulation symbol, G is a positive integer, and the G groups of modulation symbols are extended based on the G first sequences in the first sequence set to obtain G groups of extended symbols, and the G first sequences correspond one-to-one with the G groups of modulation symbols.

[0028] In some implementations of the first aspect, the G groups of extended symbols are transmitted within G resource units; wherein the G groups of extended symbols correspond one-to-one with the G resource units, and the G groups of extended symbols constitute the first extended symbol.

[0029] In some implementations of the first aspect, the first modulation symbol includes at least two modulation symbols, the first extended symbol includes at least two second extended symbols, the at least two modulation symbols and the at least two second extended symbols correspond one-to-one, each of the at least two second extended symbols is obtained by extending the modulation symbol corresponding to each extended symbol based on the first sequence; the first extended symbol corresponds to one or more third extended symbols, each of the one or more third extended symbols includes one or more second extended symbols of the at least two second extended symbols; each of the one or more second extended symbols is arranged continuously or at equal intervals in each third extended symbol.

[0030] In some implementations of the first aspect, if each second extended symbol is equally spaced in each third extended symbol, the interval of the equally spaced arrangement is related to a first ratio, which is the ratio of the number of elements contained in each third extended symbol to the length of the first sequence.

[0031] Secondly, a communication method is provided, which can be applied to a second device. Unless otherwise specified, the second device can be a network device or a terminal device, or a component within a network device or terminal device (e.g., a processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of a network device or terminal device. For ease of description, the following description uses the second device as an example.

[0032] The method includes: receiving a first spreading symbol; despreading the first spreading symbol based on a first sequence in a first sequence set to obtain a first modulation symbol; wherein the first sequence set is based on N set,2 Determined by a set of second sequences, N set,2 N is a positive integer greater than 1. set,2 Each of the N second sequence sets comprises one or more second sequences, and any two second sequences in each second sequence set are orthogonal; N set,2There exist at least two sets of second sequences in the set of second sequences, and the lengths of the second sequences included in the at least two sets of second sequences are different; the set of first sequences includes at least two first sequences, and any two first sequences in the set of first sequences are orthogonal.

[0033] Based on the above scheme, since the first sequence set is based on N set,2 The set of second sequences is determined by N, and the second sequences included in each set of second sequences are orthogonal, and N set,2 If at least two sets of second sequences contain second sequences of different lengths, the first sequence in the first sequence set can be used as the de-expansion sequence to de-expand the first extended symbol.

[0034] In some implementations of the second aspect, any two first sequences in the first sequence set have the same length, which is L1, where L1 is a positive integer. Any two second sequences in each second sequence set have the same length, and the length of the second sequences included in each second sequence set is divisible by L1.

[0035] In some implementations of the second aspect, the relationship between the length of the second sequence included in each set of second sequences and the length L1 of the first sequence is as described in the first aspect.

[0036] In some implementations of the second aspect, the length of the second sequence included in each set of second sequences is a prime number.

[0037] In some implementations of the second aspect, the first sequence set includes N1 first sequences, and the relationship between the number of second sequences included in each second sequence set and N1 is as described in the first aspect.

[0038] In some implementations of the second aspect, the first sequence in the first sequence set is based on N. set,2 The Kronecker product of the second sequences in a set of second sequences is used to determine the specific determination method, as described in the first aspect.

[0039] In some implementations of the second aspect, N set,2 The N included in the u-th second sequence set in the n second sequence sets 2,u The second sequence is determined based on the OVSF code, or the Fourier transform matrix, or the inverse Fourier transform matrix, N. 2,u It is a positive integer.

[0040] In some implementations of the second aspect, first indication information is obtained, which indicates that one of the sequence sets in at least one third sequence set is the first sequence set.

[0041] For example, each of the at least one third sequence set is based on N set,2 The second sequence set is determined.

[0042] Optionally, the N corresponding to each third sequence set set,2 The sets of second sequences are not completely identical.

[0043] In some implementations of the second aspect, the first extended symbol includes at least two second extended symbols, the first modulation symbol includes at least two modulation symbols, the at least two second extended symbols correspond one-to-one with the at least two first modulation symbols, and the at least two modulation symbols are obtained by de-extending each of the at least two second extended symbols based on a first sequence in the first sequence set; or, the at least two modulation symbols are obtained by de-extending each of the at least two second extended symbols based on different first sequences in the first sequence set, or in other words, each modulation symbol corresponds to a different first sequence in the first sequence set.

[0044] In some implementations of the second aspect, the first extended symbol is transmitted within one or more resource units, wherein the extended symbol transmitted on each of the multiple resource units is obtained by extending different first sequences in the first sequence set; the extended symbols transmitted on the multiple resource units constitute the first extended symbol.

[0045] In some implementations of the second aspect, the first modulation symbol includes G groups of modulation symbols, each of the G groups of modulation symbols including at least one modulation symbol, where G is a positive integer, and the first extended symbol includes G groups of extended symbols, which are obtained by extending the G groups of modulation symbols based on G first sequences in the first sequence set, with each of the G first sequences corresponding one-to-one with the G groups of modulation symbols.

[0046] In some implementations of the first aspect, the G-group of extended symbols corresponds one-to-one with the G resource units, and the G-group of extended symbols constitutes the first extended symbol.

[0047] In some implementations of the second aspect, the first modulation symbol includes at least two modulation symbols, and the first extended symbol includes at least two second extended symbols. The at least two modulation symbols and the at least two second extended symbols correspond one-to-one. Each of the at least two second extended symbols is obtained by extending the modulation symbol corresponding to each extended symbol based on the first sequence. The first extended symbol corresponds to one or more third extended symbols. Each of the one or more third extended symbols includes one or more second extended symbols of the at least two second extended symbols. Each of the one or more second extended symbols is arranged continuously or at equal intervals in each third extended symbol.

[0048] In some implementations of the second aspect, if each second extended symbol is equally spaced in each third extended symbol, the interval of the equally spaced arrangement is related to a first ratio, which is the ratio of the number of elements contained in each third extended symbol to the length of the first sequence.

[0049] Thirdly, a communication apparatus is provided for performing the methods of the first or second aspect and any possible implementation thereof. Specifically, the apparatus may include units and / or modules for performing the methods of the first or second aspect and any possible implementation thereof, such as processing units and / or communication units.

[0050] In one implementation, the device is a communication device (such as a terminal device or a network device). When the device is a communication device, the communication unit can be a transceiver or an input / output interface; the processing unit can be at least one processor. Optionally, the transceiver can be a transceiver circuit. Optionally, the input / output interface can be an input / output circuit.

[0051] In another implementation, the device is a chip, chip system, circuit, or communication module for communication equipment (such as terminal equipment or network equipment). When the device is a chip, chip system, or circuit for communication equipment, the communication unit may be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit; the processing unit may be at least one processor, processing circuit, or logic circuit.

[0052] Fourthly, a communication device is provided, the device comprising: at least one processor configured to cause the device to perform the methods of the first or second aspect and any possible implementation thereof.

[0053] Optionally, the at least one processor is configured to execute computer programs or instructions to perform the methods described in the first or second aspect and any possible implementation thereof.

[0054] Optionally, the device further includes a memory for storing the computer program or instructions.

[0055] Optionally, the at least one processor is coupled to a memory for storing the computer program or instructions. The memory may be located externally to the device.

[0056] Optionally, the device also includes a communication interface through which the processor reads instructions from memory. This can be understood as the communication interface being coupled to the processor and used to input computer programs or instructions to the processor, or to output information from the processor.

[0057] Unless otherwise specified, or if the transmission and acquisition / reception operations involved do not contradict their actual function or internal logic in the relevant description, they can be understood as output, input, or other operations, or as transmission and reception operations performed by radio frequency circuits and antennas. This application does not limit them in this regard.

[0058] In one implementation, the device is a communication device (such as a terminal device or a network device).

[0059] In another implementation, the device is a chip, chip system, circuit, or communication module for communication equipment (such as terminal equipment or network equipment). Optionally, the chip is a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core or a system-in-package (SIP) chip.

[0060] Fifthly, a computer-readable storage medium is provided that stores a computer program (e.g., program code) or instructions that, when executed on a communication device, cause the communication device to perform the methods described in the first or second aspect and any possible implementation thereof.

[0061] In a sixth aspect, a computer program product containing instructions is provided, which, when run on a computer, causes the computer to perform the methods described in the first or second aspect and any possible implementation thereof.

[0062] A seventh aspect provides a communication system, including a first device and a second device. The first device is configured to execute a method provided in any implementation of the first aspect, and the second device is configured to execute a method provided in any implementation of the second aspect.

[0063] Eighthly, this application provides a chip, which includes a processor and a communication interface. The processor reads instructions stored in a memory through the communication interface and executes the method provided in any of the above aspects or their implementations.

[0064] Optionally, as one implementation, the chip also includes a memory that stores computer programs or instructions. The processor is used to execute the computer programs or instructions stored in the memory. When the computer programs or instructions are executed, the processor is used to perform the methods provided by any of the above aspects or their implementations.

[0065] The chip may include an input circuit or interface for transmitting information or data, and an output circuit or interface for receiving information or data. Attached Figure Description

[0066] Figure 1 is a schematic diagram of a wireless communication system applicable to an embodiment of this application.

[0067] Figure 2 is a schematic diagram of an orthogonal extended sequence.

[0068] Figure 3 is a schematic diagram of a communication method 300 provided in an embodiment of this application.

[0069] Figure 4 is a schematic diagram of the first extended symbol provided in an embodiment of this application.

[0070] Figure 5 is a schematic diagram of the extended symbols of different resource units provided in the embodiments of this application.

[0071] Figure 6 is a schematic diagram of the arrangement of extended symbols provided in the embodiments of this application.

[0072] Figure 7 is a schematic diagram of a communication device 700 provided in an embodiment of this application.

[0073] Figure 8 is a schematic diagram of another communication device 800 provided in an embodiment of this application.

[0074] Figure 9 is a schematic diagram of a chip system 900 provided in an embodiment of this application. Detailed Implementation

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

[0076] Figure 1 is a schematic diagram of the architecture of a communication system 1000 used in an embodiment of this application. As shown in Figure 1, the communication system includes a radio access network (RAN) 100. Optionally, the communication system 1000 may also include a core network 200 and an Internet 300.

[0077] RAN100 may include at least one RAN node (as shown in Figure 1, 110a and 110b, collectively referred to as 110), and at least one terminal (as shown in Figure 1, 120a-120j, collectively referred to as 120). RAN100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment (not shown in Figure 1). Terminal 120 is wirelessly connected to RAN node 110. Terminals and RAN nodes can be interconnected via wired or wireless means. RAN node 110 is wirelessly or wired connected to core network 200. The core network equipment in core network 200 and RAN node 110 in RAN100 can be independent and different physical devices, or they can be the same physical device integrating some or all of the logical functions of the core network equipment and some or all of the logical functions of the RAN node.

[0078] RAN100 can be an evolved universal terrestrial radio access (E-UTRA) system, a new radio (NR) system, a future communications system, or a future radio access system as defined in the 3rd generation partnership project (3GPP), or a wireless fidelity (WiFi) system. RAN100 can also include two or more of the above-mentioned different radio access systems. RAN100 can also be an open RAN (O-RAN).

[0079] RAN nodes, also known as network devices, radio access network devices, RAN entities, or access nodes, are used to help terminals access communication systems wirelessly. In one application scenario, an RAN node can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a next-generation base station in a future communication system, a base station in a future mobile communication system, or an access node in a WiFi system. RAN nodes can be macro base stations (as shown in Figure 1, 110a), micro base stations or indoor stations (as shown in Figure 1, 110b), relay nodes, or donor nodes.

[0080] In another application scenario, multiple RAN nodes can collaborate to help terminals achieve wireless access, with different RAN nodes implementing different functions of the base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). Here, the CU performs the functions of the base station's Radio Resource Control (RRC) and Packet Data Convergence Protocol (PDCP), and can also perform the functions of the Service Data Adaptation Protocol (SDAP). The DU performs the functions of the base station's Radio Link Control (RANC) and Medium Access Control (MAC) layers, and can also perform some or all of the physical layer functions. For specific descriptions of these protocol layers, refer to the relevant 3GPP technical specifications. The RU can be used to implement radio frequency signal transmission and reception. The CU and DU can be two independent RAN nodes, or they can be integrated into the same RAN node, such as within a baseband unit (BBU). RUs can be included in radio frequency equipment, such as remote radio units (RRUs) or active antenna units (AAUs). CUs can be further divided into two types of RAN nodes: CU-control plane and CU-user plane.

[0081] In different systems, RAN nodes can have different names. For example, in an O-RAN system, a CU can also be called an open CU (O-CU), a DU can also be called an open DU (O-DU), and an RU can be called an open RU (O-RU). In this application, the RAN node can be implemented through software modules, hardware modules, or a combination of software and hardware modules. For example, the RAN node can be a server loaded with the corresponding software modules. The embodiments of this application do not limit the specific technology or device form used in the RAN node. For ease of description, a network device or base station is used as an example of a RAN node below.

[0082] A terminal is a device with wireless transceiver capabilities, capable of sending signals to or receiving signals from a base station. Terminals can also be called terminal equipment, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiments of this application do not limit the specific technology or device form used in the terminal.

[0083] Base stations and terminals can be fixed or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of the base stations and terminals.

[0084] The roles of base stations and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. For terminals 120j that access the wireless access network 100 through 120i, terminal 120i is a base station; however, for base station 110a, 120i is a terminal, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a base station-to-base station interface protocol. In this case, relative to 110a, 120i is also a base station. Therefore, both base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with base station functions, and 120a-120j in Figure 1 can be called communication devices with terminal functions.

[0085] Communication between base stations and terminals, between base stations, and between terminals can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0086] In the embodiments of this application, the functions of the base station can be executed by modules (such as chips) within the base station, or by a control subsystem that includes base station functions. This control subsystem, including base station functions, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities. Similarly, the functions of the terminal can be executed by modules (such as chips or modems) within the terminal, or by a device that includes terminal functions.

[0087] In this application, spreading can also be called spread spectrum, and correspondingly, "performing spreading" can also be called "performing spread spectrum", and "spreading sequence" can also be called "spreading sequence".

[0088] In a multiple access system, data transmitted by different terminal devices can be frequency-division multiplexed or code-division multiplexed. Frequency division multiplexing is called Frequency Division Multiple Access (FDMA), and code division multiplexing is called Code Division Multiple Access (CDMA). For CDMA, terminal devices can use linear spreading sequences to spread the data before transmission. These spreading sequences are selected from multiple orthogonal spreading sequences. For example, these orthogonal spreading sequences can be Fourier transform matrices, where one spreading sequence is a row or column of the Fourier transform matrix. These multiple orthogonal spreading sequences can also be called orthogonal cover codes (OCC). It can be seen that when different terminal devices select different spreading sequences from multiple orthogonal spreading sequences, the data transmitted by different terminal devices are orthogonal.

[0089] In large-scale multiple access systems, there is a need to support a greater number of terminal devices, and the number of terminal devices transmitting data is also relatively large. However, the resources available for data transmission are limited, as are the number of orthogonal spreading sequences. In this case, non-orthogonal multiple access (NoMA) technology can be considered. This means that interference exists between the data transmitted by multiple terminal devices. The receiving device uses successive interference cancellation (SIC) technology to eliminate interference between different terminal devices, thereby improving demodulation performance. For example, when NoMA uses a linear spreading sequence to spread data, the multiple selectable linear spreading sequences are non-orthogonal, and the interference between the linear spreading sequences determines the interference between the data transmitted by different terminal devices.

[0090] In existing schemes, CDMA systems use extended sequences of power-of-2 length, with a length of 2... (p+1) The extended sequence can be based on a length of 2 p The extended sequence is generated from a length of 2 and an extended sequence of length 2. The length of the extended sequence can be called the spreading factor (SF). When a suitable extended sequence is chosen, a length of 2 is used. (p+1) The extended sequence can be with a length of 2 p ,2 (p-1) The extended sequences of , ..., 2 are orthogonal.

[0091] Figure 2 illustrates a method for generating extended sequences. As shown in Figure 2, based on the extended sequence [+1] with SF=1, orthogonal extended sequences [+1+1] and [+1-1] with SF=2 can be generated; and based on the orthogonal extended sequences [+1+1] and [+1-1], orthogonal extended sequences [+1+1+1+1], [+1+1-1-1], [+1-1+1-1], and [+1-1-1+1] with SF=4 can be generated; and so on, resulting in 256 orthogonal extended sequences with SF=256. When different devices use extended sequences with different spreading factors to extend data (such as modulation symbols), by selecting appropriate extended sequences, the data from different devices can be made orthogonal. Based on this, different devices can transmit data of different packet sizes or different bit rates that are mutually orthogonal.

[0092] In the existing scheme, the length of the extended sequence is a power of 2, which limits the flexibility of the extended sequence selection. For example, other lengths of extended sequences can be selected. When the extended sequence is of other lengths, how to achieve orthogonality between extended sequences with different extension factor lengths, and how to increase the number of extended sequences to achieve non-orthogonality are issues that need to be considered.

[0093] In view of this, this application provides a communication method and a communication apparatus that can support orthogonal code division multiplexing among a wider range of spread sequence lengths, improving the flexibility of spread sequence selection. Simultaneously, when different devices use spread sequences with different spread factors to spread data (such as modulation symbols), by selecting a suitable spread sequence from a wider range of spread sequence lengths, the data from different devices can be made orthogonal. Furthermore, symbols obtained by spreading based on the same spread sequence can support different arrangements, achieving non-orthogonal code division multiplexing and thus supporting a larger number of devices.

[0094] Figure 3 is a schematic diagram of a communication method 300 provided in this application. For ease of description, the following example uses a transmitting end (e.g., a first device) and a receiving end (e.g., a second device) as examples. The first device and the second device can be a terminal device and a network device, respectively. The terminal device can be replaced by components of a terminal device (e.g., a chip, chip system, circuit, or communication module), and the network device can be replaced by components of a network device (e.g., a chip, chip system, circuit, or communication module). The following description uses the first device as a terminal device and the second device as a network device as an example. Furthermore, the steps described below as being performed by a single executing entity can also be divided into steps performed by multiple executing entities, which can be logically and / or physically separated.

[0095] The method 300 shown in Figure 3 may include the following steps.

[0096] S310, the terminal device extends the first modulation symbol based on the first sequence in the first sequence set to obtain the first extended symbol.

[0097] The first sequence set is based on N set,2 Determined by a set of second sequences, N set,2 It is a positive integer greater than 1. In N set,2 In N sets of second sequences, each set includes at least one sequence (denoted as a second sequence) of the same length. The lengths of the second sequences contained in different sets of second sequences may be the same or different. For example, N set,2There exist at least two sets of second sequences in a given set, and the lengths of the second sequences contained in these at least two sets of second sequences are different. Furthermore, the second sequences contained in each set of second sequences are orthogonal to each other.

[0098] In other words, for N set,2 Each of the N second sequence sets corresponds to a second sequence length, which is the length of the second sequences included in that second sequence set. That is, N set,2 N second sequence sets correspond to set,2 The length of the second sequence, N set,2 There are at least two different second sequence lengths among the second sequence lengths.

[0099] The first sequence set includes at least two first sequences; these at least two first sequences are orthogonal to each other. That is, any two first sequences included in the first sequence set are orthogonal to each other.

[0100] For example, each first sequence in the first sequence set is a non-zero sequence, that is, not all elements in the first sequence are 0.

[0101] As an example, the magnitude of any element in each first sequence is not zero.

[0102] As another example, one or more first sequences in the first sequence set contain one or more elements that are 0.

[0103] In this application, orthogonality between any two sequences can be defined as the inner product between any two sequences being 0. Taking the orthogonality of any two first sequences in the first sequence set as an example, let the first sequence set be denoted as X, which includes N1 first sequences, where N1 is a positive integer; the length of each first sequence is L1, where L1 is a positive integer; the j-th first sequence in the first sequence set can be represented as x. j , j = 0, ..., N1-1; the N1 first sequences included in the first sequence set can be represented as The j1st first order of the first sequence set and the j2nd first sequence in the first sequence set The inner product I can be expressed as:

[0104] Where j1 and j2 are integers between 0 and N1-1, and j1 ≠ j2, x j1 (m) represents the m-th element in the j1-th first sequence, where m is an integer between 0 and L1-1. express The conjugate complex number. First sequence and the first sequence If they are orthogonal, then the inner product I of these two first sequences is 0.

[0105] Optionally, the length of the second sequence contained in each second sequence set is a factor of L1; or, in other words, the length of the sequence corresponding to each second sequence set is a factor of L1, that is, the sequence length is divisible by L1. That is, the length of the second sequence corresponding to the u-th second sequence set in the second sequence set is denoted as L. 2,u L 2,u It is a factor of L1, u = 0, ..., N set,2 -1.

[0106] Optionally, the length of the second sequence corresponding to each set of second sequences is a prime number. That is, L 2,u It is the quality factor of L1.

[0107] Based on the above scheme, N can be used. set,2 Each second sequence set determines the first sequence set, and the length of the sequence contained in each second sequence set is a factor of the length L1 of the first sequence. In other words, a longer sequence set can be generated based on a sequence set with a short sequence length, and interference can be controlled when different terminal devices use sequences with different sequence lengths for expansion.

[0108] Optionally, N set,2 N corresponding to the second sequence set set,2 The length of the second sequence and L1 must satisfy at least the following relationship: N set,2 The product of the second sequence lengths is L1, that is:

[0109] Here, ∏ represents a product.

[0110] Optionally, N set,2 Each of the N second sequence sets corresponds to a number of second sequences included in that set (denoted as the number of second sequences), N set,2 N corresponding to the second sequence set set,2 The number of second sequences and N1 (the number of first sequences included in the set of first sequences, as described above) must satisfy at least the following relationship: N set,2 The product of the number of second sequences is N1, that is:

[0111] Where, N 2,u This represents the number of second sequences corresponding to the u-th second sequence set in the second sequence set, where u = 0, ..., N. set,2 -1. Refer to the descriptions above for other symbols.

[0112] It can be understood that for a sequence of length L1, there are at most L1 orthogonal sequences (i.e., any two sequences among these L1 are orthogonal). That is, the first sequence set contains N1 first sequences, where N1 is a positive integer less than or equal to L1. Optionally, N1 is greater than 1.

[0113] Specifically, N1 = L1. For ease of description, N1 = L1 will be used hereafter to describe the first sequence in the first sequence set.

[0114] Similarly, N 2,u Not exceeding L 2,u A positive integer. Optionally, N 2,u Greater than 1.

[0115] In particular, N 2,u =L 2,u The following is followed by N. 2,u =L 2,u The following is a description of an example.

[0116] The following details how the first sequence set is determined.

[0117] In one possible implementation, the first sequence in the first sequence set is based on N. set,2 The Kronecker product is obtained by calculating the second sequence of the second sequence set.

[0118] Specifically, the first matrix, composed of all the first sequences in the first sequence set, is formed by N. set,2 The Kronecker product is obtained by calculating the second matrix, that is, by calculating N with the first matrix. set,2 The Kronecker product of each second matrix yields the same matrix. set,2 The second matrix and N set,2 There is a one-to-one correspondence between the N sets of second sequences. set,2 The second sequences included in one of the sets of second sequences form a second matrix.

[0119] For example, the second sequences included in a set of second sequences form a second matrix arranged by rows or columns. Or, each row (or column) of the second matrix corresponds to a second sequence included in the set of second sequences.

[0120] It should be understood that the correspondence between the first matrix and the first sequence is the same as the correspondence between the second matrix and the second sequence. That is, if a row of the second matrix corresponds to a second sequence, then a row of the first matrix corresponds to a first sequence; if a column of the second matrix corresponds to a second sequence, then a column of the first matrix corresponds to a first sequence.

[0121] In other words, Nset,2 The u-th second sequence set of a set of second sequences is represented as Y. u u = 0, ..., N set,2 -1. Y u Contains N 2,u A second sequence, Y u Let L be the length of the second sequence included. 2,u Y u The kth second sequence in the array is represented as y. u,k k is the index of the second sequence, k = 0, ..., N 2,u -1. When u takes values ​​from 0 to N set,2 For any value in -1, the u-th second sequence set corresponds to the u-th second matrix. The u-th second matrix (denoted as B) 2,u ) and N in the u-th second sequence set 2,u The second sequence y u,k The relationship between them can be represented as: B 2,u (k,n)=y u,k (n);

[0122] Or, B 2,u (n,k)=y u,k (n).

[0123] Among them, y u,k (n) represents the second sequence y u,k The nth element in the array, where n = 0, ..., L 2,u -1; B 2,u (k,n) represents the element in the k-th row and n-th column of the u-th second matrix; B 2,u (n,k) represents the elements in the nth row and kth column of the u-th second matrix; that is, the u-th second matrix contains N elements. 2,u row and L 2,u A column, where each row of the u-th second matrix corresponds to a second sequence; or, the u-th second matrix contains L 2,u row and N 2,u A column, where a column of the u-th second matrix corresponds to a second sequence.

[0124] The first matrix is ​​denoted as A1, then A1 and N set,2 The second matrix B 2,u At least the following conditions must be met:

[0125] or,

[0126] Optionally, A1 and N1 first sequences x j The relationship between j = 0, 2, ..., N1-1 can be expressed as: A1(j,m) = x j (m);

[0127] Alternatively, A1(m,j)=x j (m).

[0128] Where j = 0, ..., N1-1, m = 0, ..., L1-1, x j (m) represents the first sequence x j The m-th element in the matrix; A1(j,m) represents the element in the j-th row and m-th column of the first matrix; A1(j,m) represents the element in the j-th row and m-th column of the first matrix. That is, the first matrix consists of N1 rows and L1 columns, and one row of the first matrix corresponds to one first sequence; or, the first matrix consists of L1 rows and N1 columns, and one column of the first matrix corresponds to one first sequence.

[0129] Based on the above scheme, the first sequence of the first sequence set can be based on N. set,2 The first matrix of the first sequence set is obtained by performing the Kronecker product on the second sequence of the second sequence set, i.e., based on N. set,2 N second sequence sets set,2 The Kronecker product of the second matrix is ​​determined, and selecting an extended sequence from this first sequence set can improve the flexibility of extended sequence selection.

[0130] Furthermore, the first sequence set can be viewed as being generated in a nested manner; for example, it can be based on N. set,2 The first to Nth elements of the second sequence set set,2 -1. Performing the Kronecker product on the second sequence of the second sequence set yields sequence set #1. Then, the first sequence set is based on N. set,2 The Nth sequence in the second sequence set set,2 The second sequence set is obtained by performing a Kronecker product with the sequence set #1. In this case, terminal device #1 can use the first sequence from the first sequence set for expansion, and terminal device #2 can use the sequences from the sequence set #1 for expansion. At this time, although the two terminal devices use different lengths of expansion sequences, the expansion symbols obtained by the two terminal devices can be made orthogonal, thereby controlling and reducing interference when different terminal devices use sequences of different lengths for expansion.

[0131] The following examples illustrate how to base N set,2 The second sequence set determines the first sequence set.

[0132] For example, the orthogonal sequences in each second sequence set can be determined either by predefinition or by signaling indication.

[0133] The first possible scenario, N set,2Each of the sets of second sequences can be a predefined orthogonal sequence, or the second matrix corresponding to each set of second sequences can be a predefined matrix.

[0134] With N set,2 The u-th second sequence set contains N. 2,u There are L orthogonal sequences, and the length of the second sequence included in the u-th second sequence set is L. 2,u For example, the L 2,u An orthogonal sequence can be determined based on an orthogonal variable spreading factor (OVSF) code, a Fourier transform matrix, or an inverse Fourier transform matrix; or, in other words, the L... 2,u The second matrix corresponding to each orthogonal sequence is determined by the OVSF code, the Fourier transform matrix, or the inverse Fourier transform matrix.

[0135] Specifically, when N 2,u =L 2,u Time: N of the u-th second sequence set 2,u N orthogonal sequences 2,u The second sequence can be an L contained in the OVSF code. 2,u A sequence; or a sequence of size L 2,u ×L 2,u The Fourier transform matrix L 2,u row (or L) 2,u In this case, each row (or column) of the Fourier transform matrix represents a second sequence; or it can be of size L. 2,u ×L 2,u L of the inverse Fourier transform matrix 2,u row (or L) 2,u In this case, each row (or column) of the inverse Fourier transform matrix represents a second sequence.

[0136] When N 2,u <L 2,u hour:

[0137] In one possible implementation, N of the u-th second sequence set 2,u The second sequence is the L contained in the OVSF code. 2,u N in the sequence 2,u There are several sequences. At this point, N can be predefined. 2,u The position of a sequence in an OVSF code, for example, the start (or end) L in a predefined OVSF code. 2,u N sequences are the set of the u-th second sequence. 2,u The second sequence.

[0138] In another possible implementation, N of the u-th second sequence set 2,u The second sequence is of size L. 2,u ×L 2,u N of the Fourier transform matrix 2,u row or N 2,u In this case, each row or column of the Fourier transform matrix represents a sequence.

[0139] In another possible implementation, N of the u-th second sequence set 2,u The second sequence is of size L. 2,u ×N 2,u N of the inverse Fourier transform matrix 2,u row or N 2,u In this case, each row or column of the inverse Fourier transform matrix represents a sequence.

[0140] For example, a Fourier transform matrix of size M×M is represented as F M×M ,Right now:

[0141] in, The parameter i in the equation represents the imaginary sign, i.e., i 2 =-1. For example,

[0142] It should be understood that the inverse Fourier transform matrix of size M×M and the Fourier transform matrix F of size M×M are related. M×M Similarly, the difference lies in that: for the inverse Fourier transform matrix, the parameter ω satisfies

[0143] Similarly, in the latter two possible implementations, N 2,u row or N 2,u The position of a column in the Fourier transform matrix (or inverse Fourier transform matrix) can be predefined, for example, by predefining the initial N. 2,u Or N 2,u N is the set of the u-th second sequence. 2,u The second sequence.

[0144] Optionally, N of the u-th second sequence set 2,u The second sequence can be other types of orthogonal sequences, and this application does not limit it.

[0145] With N 2,u =L 2,u For example, the second set of sequences is shown in the following example:

[0146] In one example, N 2,u =L 2,u=4, the four second sequences in the u-th second sequence set are: the four sequences contained in the OVSF code of length 4, for example, these four sequences are: [1,1,1,1], [1,1,-1,-1], [1,-1,1,-1], and [1,-1,-1,1]. Furthermore, the M sequences of the OVSF code of length M can form a matrix of size M×M, denoted as W. M×M Each row or column of this matrix can be a sequence of OVSF codes. For example, the four sequences of the aforementioned OVSF codes form a 4×4 matrix W. 4×4 :

[0147] Matrix W 4×4 The four rows in the matrix W represent the four orthogonal sequences in the u-th second sequence set; or, matrix W... 4×4 The four columns in the set are four orthogonal sequences in the u-th second sequence set.

[0148] In another example, N 2,u =L 2,u =4, the four second sequences of the u-th second sequence set are represented by a 4×4 Fourier transform matrix F. 4×4 Sure:

[0149] Where i represents the imaginary sign. The Fourier transform matrix F 4×4 The 4 rows or 4 columns correspond to the 4 second sequences in the u-th second sequence set.

[0150] The second possible scenario, N set,2 Each of the second sequence sets can be based on signaling instructions, or the second matrix corresponding to each second sequence set can be based on signaling instructions.

[0151] For example, corresponding to the second sequence length L 2,u Two orthogonal sequences, OVSF code and Fourier transform matrix, can be predefined. A second sequence set is determined from these two orthogonal sequences through signaling indication. The second sequence set includes sequences of length L. 2,u of the second sequence.

[0152] Optionally, in this application, N set,2 A sequence consisting of two second sequence lengths This is called a factor sequence, and the factor sequence and N set,2 Each of the second sequence sets corresponds one-to-one with N. set,2 Each second matrix corresponds to a factor sequence. The second matrix corresponding to each length can be predefined using the methods described above or based on signaling instructions.

[0153] It should be understood that if each set of second sequences is determined, the first sequence can be determined according to the methods described above.

[0154] In addition, N set,2 Factors Different arrangements of factors correspond to different factor sequences, and the first sequence set determined by the second sequence set corresponding to different arrangements is different; in other words, different factor sequences correspond to different first sequence sets. For example, factor sequences include... Factor sequence The corresponding first sequence set and factor sequence The corresponding first sequence sets are different.

[0155] The following provides a specific example of the factor sequence corresponding to the first sequence set. In the following example, assume N1 = L1, N 2,u =L 2,u , Both can be prime factors or some can be prime factors; the first matrix A1 and N set,2 The relationship between the second matrices satisfies:

[0156] In the following example, suppose the j-th first sequence is represented as x. j x j It can be represented as:

[0157] Where i represents the imaginary number sign, The phase of the first sequence is defined as L1 elements; therefore, the phase of the first sequence can be called the first phase sequence. It contains L1 elements. for The m-th element. It can be understood that since different first sequences are orthogonal, the first phase sequences corresponding to different first sequences... They are different. In other words, N1 orthogonal first phase sequences correspond to N1 first sequences, or, to put it another way, N1 first sequences can be determined based on N1 orthogonal first phase sequences.

[0158] Example #1:

[0159] The length of the first sequence is L1 = 6, N set,2 =2, the factor sequence is [2,3], and the second matrix corresponding to each factor sequence is the Fourier transform matrix (i.e., B). 2,0 =F 2×2 B 2,1 =F 3×3 ),but That is, A1 can be represented as:

[0160] Taking each row of the first matrix as an example of a first sequence, based on A1, we can obtain 6 first phase sequences of the first sequence set, as shown in Table 1.

[0161] Table 1

[0162] That is, calculation based on the first phase sequence in Table 1 (Right now This yields the first sequence. This is understandable. and The values ​​are the same, meaning that taking the modulo of L1 based on a first phase sequence yields a new phase sequence, and the first sequence determined by this first phase sequence and the new phase sequence is the same. For example, taking the modulo of [0,-2,2,0,-2,2] based on L1=6 yields a new sequence [0,4,2,0,4,2]. and The same applies. That is, the six first phase sequences of the first sequence set obtained based on A1 can also be shown in Table 2.

[0163] Table 2

[0164] In other words, the first set of sequences determined based on Table 1 and Table 2 is the same.

[0165] Example #2:

[0166] The length of the first sequence is L1 = 6, N set,2 =2, the factor sequence is [3,2], and the second matrix corresponding to each factor sequence is the Fourier transform matrix (i.e., B). 2,0 =F 3×3 B 2,1 =F 2×2 ),but

[0167] Based on A1, we can obtain the six first phase sequences of the first sequence set, as shown in Table 3.

[0168] Table 3

[0169] That is, calculation based on the first phase sequence in Table 3. (Right now The first sequence can be obtained.

[0170] Example #3:

[0171] The length of the first sequence is L1 = 12, Nset,2 =3, the factor sequence is [2, 2, 3], and the second matrix corresponding to each factor sequence is the Fourier transform matrix (i.e., B). 2,0 =F 2×2 B 2,1 =F 2×2 B 2,2 =F 3×3 ),but

[0172] Based on A1, 12 first phase sequences of the first sequence set can be obtained, as shown in Table 4.

[0173] Table 4

[0174] That is, calculation based on the first phase sequence in Table 4. (Right now The first sequence can be obtained.

[0175] Example #4:

[0176] The length of the first sequence is L1 = 12, N set,2 =3, the factor sequence is [2, 3, 2], and the second matrix corresponding to each factor sequence is the Fourier transform matrix (i.e., B). 2,0 =F 2×2 B 2,1 =F 3×3 B 2,2 =F 2×2 ),but

[0177] Based on A1, 12 first phase sequences of the first sequence set can be obtained, as shown in Table 5.

[0178] Table 5

[0179] That is, calculation based on the first phase sequence in Table 5. (Right now The first sequence can be obtained.

[0180] Example #5:

[0181] The length of the first sequence is L1 = 12, N set,2 =3, the factor sequence is [3, 2, 2], and the second matrix corresponding to each factor sequence is the Fourier transform matrix (i.e., B). 2,0 =F 3×3 B 2,1 =F 2×2 B 2,2 =F 2×2 ),but

[0182] Based on A1, 12 first phase sequences of the first sequence set can be obtained, as shown in Table 6.

[0183] Table 6

[0184] That is, calculation based on the first phase sequence in Table 6. (Right now The first sequence can be obtained.

[0185] Example #6 (some factors are non-prime factors):

[0186] The length of the first sequence is L1 = 8, N set,2 =2, the factor sequence is [2, 4], and the second matrix corresponding to each factor sequence is the Fourier transform matrix (i.e., B). 2,0 =F 2×2 B 2,1 =F 4×4 ),but

[0187] Based on A1, the eight first phase sequences of the first sequence set can be obtained as shown in Table 7.

[0188] Table 7

[0189] That is, calculation based on the first phase sequence in Table 7. (Right now The first sequence can be obtained.

[0190] Example #7 (Some factors are non-prime factors, and some factors are non-Fourier transform matrices):

[0191] The length of the first sequence is L1 = 12, N set,2 =2, the factor sequence is [4, 3], the 0th second matrix B 2,0 The matrix is ​​determined based on the OVSF code, and the first second matrix B is... 2,1 The Fourier transform matrix (i.e., B) 2,0 =W 4×4 B 2,1 =F 3×3 ),but

[0192] Based on A1, 12 first phase sequences of the first sequence set can be obtained, as shown in Table 8.

[0193] Table 8

[0194] That is, calculation based on the first phase sequence in Table 8 (Right now The first sequence can be obtained.

[0195] Example #8 (partial factor is 1, only one prime factor):

[0196] Specifically, in the second sequence set, the number of sets is 2(N). set,2 =2), and if the length of the second sequence in one of the second sequence sets is 1, then one of the second sequences in that second sequence set is [1]. In this case, the first sequence set and the other second sequence set are the same. In this case, the first sequence set can be predefined.

[0197] For example, the length of the first sequence L1 = 3, N set,2 =2, the factor sequence is [3, 1], at this time the first matrix When the first second matrix B 2,0 When the matrix is ​​the Fourier transform matrix, the first matrix is ​​F. 3×3 .

[0198] For example, the length of the first sequence L1 = 4, N set,2 =2, the factor sequence is [4, 1], at this time the first matrix When the first second matrix B 2,0 When the matrix is ​​determined based on OVSF codes, the first matrix is ​​W. 4×4 When the first second matrix B 2,0 When the matrix is ​​a Fourier transform matrix, the first matrix is ​​F. 4×4 .

[0199] It should be understood that multiplying the first phase sequence in the above example by a non-zero real number H yields a new first phase sequence. (Right now Correspondingly, for Multiplying the denominator in the equation by the same non-zero real number H results in... calculate The first sequence can be obtained. Calculation. The first sequence obtained and the calculation The first sequence obtained is the same.

[0200] Based on the above scheme, when the factor sequence corresponding to the first sequence set of terminal device #1 is a subsequence of the factor sequence corresponding to the first sequence set of terminal device #2, orthogonality between the data symbols obtained by the expansion of these two terminal devices can be achieved. This means that interference can be controlled when different terminal devices use sequences of different lengths for expansion. For example, terminal device #1 uses the first sequence set in example #1, with a factor sequence of [2, 3]; terminal device #2 can use the first sequence set in example #3, with a factor sequence of [2, 2, 3]. The factor sequence [2, 3] can be considered a subsequence of the factor sequence [2, 2, 3], meaning [2, 3] is the sequence composed of the last two consecutive elements of [2, 2, 3]. Therefore, the data symbols obtained by the expansion of terminal device #1 can be orthogonal to the data symbols obtained by the expansion of terminal device #2.

[0201] The above details the N-based set,2 The second sequence set determines the implementation method of the first sequence set. For a first sequence set used by a terminal device, this first sequence set can be agreed upon by the terminal device and the network device.

[0202] For example, the first sequence set is N set,3 One of the three sets of sequences, N set,3 N is a positive integer. set,3 Each of the three third sequence sets is based on N. set,2 The set of second sequences is determined. Optionally, N corresponds to each set of third sequences. set,2 Each set of second sequences is distinct. Any two sequences in each set of third sequences are orthogonal, meaning the inner product between any two sequences is 0.

[0203] As an example, N set,3 The set of third sequences is predefined.

[0204] For example, N set,3 =6, and this set of 6 third sequences is predefined, as shown in Table 9. S v N represents set,3 The v-th third sequence set in a set of n third sequences, where v ranges from 0 to N. set,3 -1. The six sets of third sequences can be generated based on any one of the examples #1 to #8.

[0205] The terminal device can obtain indication information (denoted as indication information #1) to determine the first sequence set. The indication information #1 can indicate the index v of the third sequence set.

[0206] Table 9

[0207] As another example, N set,3 The method for generating the third sequence set is predefined.

[0208] For example, N set,3 =6, the vth third sequence set S v Generated based on the method shown in example #n above, where n takes any value from 1 to 8. For example, the v-th third sequence set S... v The generation method is shown in Table 10.

[0209] Table 10

[0210] The terminal device can obtain indication information (denoted as indication information #2) to determine the generation method of the first sequence set, and generate the first sequence set based on the generation method. Indication information #2 can indicate the index v of the third sequence set, that is, indication information #2 indicates the v-th third sequence set S. v The generation method, the terminal device is based on S v The first sequence set is generated using the following method.

[0211] The aforementioned indication information (indication information #1 or indication information #2) may come from network devices. This indication information may be carried in downlink control information (DCI), or higher-layer signaling (such as radio resource control (RRC) signaling), or other downlink signaling, without limitation.

[0212] Optionally, N set,3 The third sequence set contains N set,2 A partial or complete set of second sequences in a set of second sequences.

[0213] Optionally, N set,3 The third sequence set contains N set,2 The first sequence set is determined by a subset of the second sequence sets.

[0214] For example, N set,3 The third sequence set contains N set,2 The starting N′ of the second sequence set set,2 The first sequence set determined by the second sequence set, N′ set,2 are positive integers and 1≤N′ set,2 <N set,2 It's understandable, N set,2 N second sequence sets correspond to set,2 Second matrix: Then the initial N′set,2 The second sequence set is Referring to the method described above, based on the initial N′ set,2 The first sequence set determined by the second sequence set can be represented as follows:

[0215] For example, N set,3 The third sequence set contains N set,2 The last N′ of the second sequence set set,2 The first sequence set determined by the second sequence set, N′ set,2 are positive integers and 1≤N′ set,2 <N set,2 It's understandable that the ending N′ set,2 The second sequence set is N. set,2 The second matrix The Nth set,2 -N′ set2 N set,2 -N′ set2 +1,…,N set,2 -1 second matrix (i.e.) Referring to the method described above, based on the last N′ set,2 The first sequence set determined by the second sequence set can be represented as follows:

[0216] Optionally, prior to S310, the method further includes: the terminal device determining a first sequence set.

[0217] For example, the terminal device uses indication information #1 from N set,3 The first sequence set is selected from the three third sequence sets. Alternatively, the terminal device generates the first sequence set based on the generation method indicated by instruction information #2.

[0218] In particular, when N set,3 When = 1, the third sequence set is the selected first sequence set.

[0219] Based on the above scheme, by predefining multiple sets of third sequences, the computational resources required to generate the first sequence set each time can be saved.

[0220] The following describes the specific method of expanding the first modulation symbol based on the first sequence set.

[0221] For example, the first modulation symbol includes A modulation symbol, It is a positive integer. For example, the terminal device can generate this first modulation symbol based on the modulation scheme of the bit data to be transmitted.

[0222] The modulation method can be Pi / 2 binary phase shift keying (BPSK) modulation, BPSK modulation, quadrature phase shift keying (QPSK) modulation, etc., without limitation. The bit data to be transmitted can be determined by encoding, interleaving, scrambling, etc., of the original bit data (which may be related to specific services), without limitation.

[0223] In other words, the terminal device modulates the first modulation symbol based on the first sequence in the first sequence set. The first extended symbol is obtained by spreading the modulation symbols.

[0224] For example, the first extended symbol can be transmitted within one or more resource units, that is, the first modulation symbol can be transmitted within one or more resource units. Each resource unit in the multiple resource units can correspond to a portion of the elements of the first extended symbol, that is, a portion of the modulation symbol of the first modulation symbol. Here, a resource unit may include one or more resource elements (REs).

[0225] In one possible implementation, each modulation symbol in the first modulation symbol corresponds to the same first sequence.

[0226] That is, the terminal device can expand each modulation symbol in the first modulation symbol based on a first sequence from the first sequence set to obtain a first extended symbol. In other words, each modulation symbol is expanded using the same first sequence.

[0227] For example, the first modulation symbol is represented as D mod The first sequence set is If the terminal device determines a first sequence as the j′-th first sequence in the set of first sequences, then the first extended symbol (denoted as D) spread The first modulation symbol and the second modulation symbol must satisfy at least the following relationship: D spread (d×L1+m)=D mod (d)×x j′ (m);

[0228] Where m is the index of the j′-th element in the first sequence, m = 0, ..., L1-1; D mod (d) represents the d-th modulation symbol in the first modulation symbol. Dspread (d×L1+m) represents the d×L1+m-th element in the first extended symbol. At this point, the first extended symbol contains... There are L1 elements. It can be understood that after the d-th modulation symbol is expanded, it yields L1 elements (i.e., L1 values), which is the first expanded symbol D. spread The d×L1, d×L1+1, ..., d×L1+L1-1 elements in the array.

[0229] In this implementation, the terminal device can obtain the index of the first sequence and then determine the first sequence. For example, the network device can indicate the index of a first sequence through signaling; the terminal device receives the index and then determines a first sequence. There is no limitation on the way the network device indicates the index of a first sequence; for example, the network device can indicate the index of the first sequence through DCI, RRC signaling, or other downlink signaling.

[0230] It is understandable that when the first extended symbol is sent in multiple resource units, each resource unit corresponds to the same first sequence.

[0231] Optionally, the first extended symbol is sequentially mapped to multiple resource units and transmitted within those resource units. For example, if there are two resource units, numbered resource unit 0 and resource unit 1, and each resource unit contains the same number of REs, then the first half of the elements of the first extended symbol can be transmitted in resource unit 0, and the second half can be transmitted in resource unit 1.

[0232] In another possible implementation, the first sequence corresponding to each modulation symbol in the first modulation symbol is different.

[0233] In one example, the first modulation symbol may include G groups of modulation symbols, each group of which includes at least one modulation symbol, where G is a positive integer. Based on G (G less than or equal to N1) first sequences in the first sequence set, the G groups of modulation symbols are extended to obtain G groups of extended symbols, meaning that each of the G first sequences corresponds one-to-one with the G groups of modulation symbols. The first extended symbol is composed of these G groups of extended symbols.

[0234] Optionally, the G-group extended symbols are transmitted within G resource units; there is a one-to-one correspondence between the G-group extended symbols and the G resource units.

[0235] In this implementation, the first sequence corresponding to each modulation symbol can be predefined or generated based on a predefined method. For example, the index of the first sequence corresponding to each modulation symbol can be generated based on a pseudo-random sequence. The first sequence corresponding to each modulation symbol can also be based on signaling indication.

[0236] For example, the first extended symbol D spreadand the first modulation symbol D mod The relationship can also be represented as: D spread (d×L1+m)=D mod (d)×x j′ (m);

[0237] Here, the d-th modulation symbol corresponds to the j′-th first sequence. The index of the first sequence (i.e., the value of j′) corresponding to different modulation symbols can be different.

[0238] The above uses a terminal device as an example to introduce a method for extending modulation symbols based on a first sequence. Optionally, for different terminal devices using the same time and frequency resources, the length of the first sequence used by different terminal devices can be different when extending each modulation symbol based on the first sequence. In other words, the set of first sequences selected by different terminal devices can be different.

[0239] Figure 4 is a schematic diagram of the first extended symbols corresponding to different terminal devices. As shown in Figure 4, terminal devices #1 to #3 transmit the first extended symbols within the same time-frequency resources (i.e., the same resource units). The length of the first sequence corresponding to terminal device #1 can be 3, the length of the first sequence corresponding to terminal device #2 can be 6, and the length of the first sequence corresponding to terminal device #3 can be 12. In Figure 4, different graphics represent the results obtained by expanding different modulation symbols (called the second extended symbols); the positions of different graphics also indicate the positions of the modulation symbols in the first extended symbols after expansion. For example, if the second extended symbol corresponding to the 0th modulation symbol of terminal device #1 is in the first 3 positions, it means that the 0th modulation symbol of terminal device #1 is expanded using the first sequence to obtain the first 3 elements of the first extended symbol.

[0240] In Figure 4, the first sequence length of terminal device #1 is a factor of the first sequence length of terminal device #2 and also a factor of the first sequence length of terminal device #3; the first sequence length of terminal device #2 is a factor of the first sequence length of terminal device #3. When the three terminal devices use the first sequence provided in this application, such as terminal device #1 using the Fourier transform matrix F in Example #8... 3×3 The first sequence obtained can be used by terminal device #2 (the factor sequence is [2, 3]) and terminal device #3 (the factor sequence is [2, 2, 3]), which can reduce the interference between the first extended symbols of the three terminal devices.

[0241] For example, for each modulation symbol of each terminal device in Figure 4, the same first sequence can be used for expansion. For instance, terminal device #1 can use the Fourier transform matrix F from example #8.3×3 The 0th row (first row) expands each modulation symbol. Terminal device #2 can use the first first sequence of example #1 (factor sequence is [2, 3]) to expand each modulation symbol, and terminal device #3 can use the second first sequence of example #3 (factor sequence is [2, 2, 3]) to expand each modulation symbol. At this time, the first expanded symbols of the three terminal devices are orthogonal to each other.

[0242] In another possible implementation, different resource units of multiple resource units can correspond to different first sequences.

[0243] Specifically, each resource unit corresponds to a first sequence, and the modulation symbols transmitted within each resource unit can be extended based on a first sequence corresponding to the resource unit.

[0244] In this implementation, the first sequence corresponding to each resource unit can be predefined or generated based on a predefined method. For example, the index of the first sequence corresponding to each resource unit can be generated based on a pseudo-random sequence. The first sequence corresponding to each resource unit can also be based on signaling indication.

[0245] Optionally, the lengths of the first sequences corresponding to different resource units in the multiple resource units may be the same or different (i.e., the lengths of the first sequences may be the same or different).

[0246] When the lengths of the first sequences corresponding to different resource units in multiple resource units are different, the lengths of the first sequences corresponding to different resource units can be predefined or generated based on a predefined method. For example, the length of the first sequence of each resource unit in multiple resource units can be generated based on a pseudo-random sequence. The lengths of the first sequences corresponding to multiple resource units can also be based on signaling indications.

[0247] Accordingly, the terminal device determines the first sequence set and the first sequence used by each resource unit.

[0248] In this context, a resource element can correspond to one or more symbols in time, or a resource element can contain one or more symbols; multiple resource elements can correspond to the same one or more symbols, meaning that multiple resource elements are located within the same one or more symbols. One of the symbols can be an orthogonal frequency division multiplexing (OFDM) symbol, or a single-carrier frequency-division multiple access (SC-FDMA) symbol, etc., and this application does not impose any limitations on the embodiments.

[0249] Optionally, a resource unit may correspond to one or more symbols in time, and the one or more symbols corresponding to multiple resource units may be different.

[0250] Optionally, multiple resource units may correspond to one or more time slots in time, with the one or more time slots corresponding to multiple resource units being the same; or the one or more time slots corresponding to multiple resource units being different. One of the time slots contains at least two symbols.

[0251] Optionally, when a resource element corresponds to multiple symbols in time, the number of subcarriers, i.e. the number of resource particles, contained in each symbol is the same.

[0252] As shown in Figure 5, there are two resource units, each containing one time slot: time slot #0 and time slot #1. For terminal device #1, in time slot #0, the second extended symbol corresponding to each modulation symbol (e.g., each modulation symbol from the 0th to the 3rd modulation symbol) is obtained by extending a first sequence of length 3; in time slot #1, the second extended symbol corresponding to each modulation symbol is obtained by extending a first sequence of length 2. In Figure 5, different graphics represent the results of extending different modulation symbols (i.e., the second extended symbol).

[0253] In this application, the arrangement of the extended symbols obtained after each modulation symbol is extended in the first extended symbol is not limited.

[0254] For example, the first modulation symbol may include at least two modulation symbols, and the first extended symbol may include at least two second extended symbols. The at least two modulation symbols correspond one-to-one with the at least two second extended symbols, and each of the at least two second extended symbols is obtained by extending the modulation symbol corresponding to each extended symbol based on a first sequence. For example, as shown in FIG6(a), for terminal device #1, the first modulation symbol includes eight modulation symbols (modulation symbols 0 to 7), and the second extended symbol corresponding to each modulation symbol is obtained by extending each modulation symbol based on the first sequence corresponding to each modulation symbol.

[0255] Optionally, the first extended symbol corresponds to one or more third extended symbols (i.e., the first extended symbol is divided into blocks, and each block corresponds to one third extended symbol). Each third extended symbol may include one or more of the second extended symbols, and each of the one or more second extended symbols is arranged continuously or at equal intervals in each third extended symbol.

[0256] For example, as shown in Figure 6(a), the first extension symbol includes two third extension symbols, and the first modulation symbol corresponding to terminal device #1 includes eight modulation symbols. That is, the first extension symbol corresponding to terminal device #1 includes eight second extension symbols, and each third extension symbol includes four second extension symbols, with each second extension symbol arranged consecutively in each third extension symbol. Similarly, each second extension symbol corresponding to terminal device #2 and terminal device #3 is arranged consecutively in each third extension symbol.

[0257] For example, as shown in Figure 6(b), each second extension symbol corresponding to terminal device #1 is arranged at equal intervals in each third extension symbol.

[0258] When each second extended symbol is arranged at equal intervals with each third extended symbol, the interval of this equal interval arrangement can be related to a first ratio, which is the ratio of the number of elements contained in each third extended symbol to the length of the first sequence. The number of elements contained in each third extended symbol can be the maximum value of the length of the first sequence corresponding to a terminal device using the same time-frequency resources as the terminal device.

[0259] For example, as shown in Figure 6, terminal devices #1, #2, and #3 use the same time-frequency resources to transmit extended sequences. The length of the first sequence corresponding to terminal device #1 is 3, the length of the first sequence corresponding to terminal device #2 is 6, and the length of the first sequence corresponding to terminal device #3 is 12. Therefore, the number of elements contained in each third extended symbol can be 12. As shown in Figure 6(b), each second extended symbol corresponding to terminal device #1 is arranged at an equal interval of 3 in each third extended symbol, that is, the interval of the equal interval arrangement is 3 (i.e., the first ratio is 3).

[0260] The arrangement of the extended symbols obtained after expanding each modulation symbol can be predefined or indicated by signaling. For example, continuous arrangement and equal-interval arrangement corresponding to multiple intervals can be predefined, and the network device can indicate the arrangement by signaling; the terminal device selects the arrangement of multiple elements obtained after expanding each modulation symbol in the first extended symbol according to the signaling indication.

[0261] Based on the above scheme, when the lengths of the multiple first sequences selected by multiple terminal devices are divisible, a portion of the terminal devices can be arranged at equal intervals, thereby controlling and reducing interference when multiple terminal devices use first sequences of different lengths for expansion.

[0262] S320, the terminal device sends a first extended symbol to the network device. Correspondingly, the network device receives the first extended symbol.

[0263] The first extended symbol may include at least two second extended symbols, and the correspondence between the at least two second extended symbols and the first modulation symbol is described above.

[0264] S330, the network device de-spreads the first extended symbol based on the first sequence in the first sequence set to obtain the first modulation symbol.

[0265] It should be understood that the first sequence set used by the network device is the same as the first sequence set used by the terminal device. For example, if the network device and the terminal device agree on the first sequence set (or the method of generating the first sequence set), the network device knows the first sequence set or generates the first sequence set based on the method of generating the first sequence set.

[0266] It should also be understood that the first sequence used by the network device when de-expanding each of the first extended symbols is the same as the first sequence used by the terminal device when expanding each modulation symbol.

[0267] For example, if the first sequence is agreed upon by the network device and the terminal device, then the network device knows the first sequence corresponding to each modulation symbol.

[0268] If the first sequence is determined by the terminal device, the terminal device can indicate the first sequence corresponding to each modulation symbol to the network device. For example, if the terminal device selects a first sequence from the set of first sequences to extend each modulation symbol, it can indicate the index of that first sequence in the set of first sequences to the network device. As another example, if the terminal device selects multiple first sequences from the set of first sequences to extend each modulation symbol separately, it can indicate the index of the first sequence corresponding to each modulation symbol in the set of first sequences to the network device.

[0269] The methods provided in the embodiments of this application have been described in detail above with reference to Figures 3 to 6. It is understood that the sequence numbers of the above processes do not imply an order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application. It is also understood that in the above method embodiments, the methods and operations implemented by the device can also be implemented by components that can be used by the device (e.g., chips or circuits), without limitation.

[0270] The communication device provided in the embodiments of this application will be described in detail below with reference to Figures 7 to 9. It should be understood that the description of the device embodiments corresponds to the description of the method embodiments. Therefore, for the sake of brevity, the contents not described in detail can be referred to the method embodiments above, and will not be repeated here.

[0271] Figure 7 is a schematic diagram of a communication device 700 provided in an embodiment of this application. The communication device 700 includes a transceiver unit 710. The transceiver unit 710 can be used to implement corresponding communication functions. The transceiver unit 710 can also be referred to as a communication interface or a communication unit. Optionally, the communication device 700 further includes a processing unit 720, which can be used to perform processing, such as expanding modulation symbols based on a first sequence, or de-expanding expanded symbols based on a first sequence.

[0272] Optionally, the device 700 further includes a storage unit. The storage unit can be used to store instructions and / or data, and the processing unit 720 can read the instructions and / or data from the storage unit to enable the device to implement the aforementioned method embodiments.

[0273] In a first possible design, the device 700 can be the terminal device in the foregoing embodiments, which can implement the steps or processes corresponding to those executed by the terminal device in the above method embodiments. Specifically, the transceiver unit 710 can be used to perform transceiver-related operations (such as sending and / or receiving data or messages) of the terminal device in the above method embodiments; the processing unit 720 can be used to perform processing-related operations of the terminal device in the above method embodiments, or operations other than transceiver (such as operations other than sending and / or receiving data or messages).

[0274] In one possible implementation, the transceiver unit 720 is used to extend a first modulation symbol based on a first sequence in a first sequence set to obtain a first extended symbol; the transceiver unit 710 is used to transmit the first extended symbol; wherein, the first sequence set is based on N set,2 The N is determined by a set of second sequences. set,2 N is a positive integer greater than 1; set,2 Each of the N second sequence sets comprises one or more second sequences, and any two second sequences in each second sequence set are orthogonal; the N set,2 There exist at least two sets of second sequences in the set of second sequences, and the lengths of the second sequences included in the at least two sets of second sequences are different; the set of first sequences includes at least two first sequences, and any two first sequences in the set of first sequences are orthogonal.

[0275] The specific details of the first and second sequence sets can be found in the description above.

[0276] Optionally, the transceiver unit 710 is further configured to acquire first indication information, which indicates that one of the sequence sets in at least one third sequence set is the first sequence set. The at least one third sequence set refers to the description above.

[0277] Optionally, the processing unit 720 is specifically configured to: extend each of the at least two modulation symbols based on a first sequence in the first sequence set; or, extend each of the at least two modulation symbols based on different first sequences in the first sequence set.

[0278] The correspondence between the first modulation symbol and the first extended symbol is described above.

[0279] In a second possible design, the device 700 can be a network device as described in the foregoing embodiments. This device 700 can implement the steps or processes performed by the network device corresponding to those described in the method embodiments above. Specifically, the transceiver unit 710 can be used to perform transceiver-related operations (such as sending and / or receiving data or messages) of the network device described in the method embodiments above; the processing unit 720 can be used to perform processing-related operations of the network device described in the method embodiments above, or operations other than transceiver operations (such as operations other than sending and / or receiving data or messages).

[0280] In one possible implementation, the transceiver unit 710 is used to receive a first spreading symbol; the processing unit 720 is used to despread the first spreading symbol based on a first sequence in a first sequence set to obtain a first modulation symbol; wherein, the first sequence set is based on N set,2 The N is determined by a set of second sequences. set,2 N is a positive integer greater than 1; set,2 Each of the N second sequence sets comprises one or more second sequences, and any two second sequences in each second sequence set are orthogonal; the N set,2 There exist at least two sets of second sequences in the set of second sequences, and the lengths of the second sequences included in the at least two sets of second sequences are different; the set of first sequences includes at least two first sequences, and any two first sequences in the set of first sequences are orthogonal.

[0281] The specific details of the first and second sequence sets can be found in the description above.

[0282] Optionally, the transceiver unit 710 is further configured to transmit first indication information, the first indication information indicating that one of the sequence sets in at least one third sequence set is the first sequence set. The at least one third sequence set refers to the description above.

[0283] It should be understood that the specific process of each unit performing the above-mentioned corresponding steps has been described in detail in the above method embodiments, and will not be repeated here for the sake of brevity.

[0284] It should also be understood that the device 700 here is embodied in the form of a functional unit. The term "unit" here can refer to an application-specific integrated circuit (ASIC), electronic circuitry, a processor (e.g., a shared processor, a proprietary processor, or a group processor, etc.) and memory for executing one or more software or firmware programs, integrated logic circuitry, and / or other suitable components supporting the described functions. In an alternative example, those skilled in the art will understand that the device 700 can specifically be the communication device in the above embodiments, and can be used to execute the various processes and / or steps corresponding to the communication device in the above method embodiments; to avoid repetition, these will not be described again here.

[0285] The apparatus 700 of each of the above-described schemes has the function of implementing the corresponding steps performed by the communication device (such as a terminal device or a network device) in the above-described methods. The function can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the transceiver unit can be replaced by a transceiver (e.g., the transmitting unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as processing units, can be replaced by processors, each executing the transceiver operations and related processing operations in the respective method embodiments.

[0286] In addition, the transceiver unit 710 described above can also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit.

[0287] It should be noted that the device in Figure 7 can be the communication device (such as a terminal device or a network device) in the aforementioned embodiments, or it can be a chip or a chip system, such as a system on a chip (SoC). The transceiver unit can be an input / output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. No limitations are imposed here.

[0288] Figure 8 is a schematic diagram of another communication device 800 provided in an embodiment of this application. The device 800 includes a processor 810, which is coupled to a memory 820. The memory 820 is used to store computer programs or instructions and / or data. The processor 810 is used to execute the computer programs or instructions stored in the memory 820, or to read the data stored in the memory 820, in order to execute the methods in the above method embodiments.

[0289] Optionally, there may be one or more processors 810.

[0290] Optionally, the memory 820 may be one or more.

[0291] Alternatively, the memory 820 can be integrated with the processor 810, or it can be set separately.

[0292] Optionally, as shown in FIG8, the device 800 further includes a transceiver 830 for receiving and / or transmitting signals. For example, the processor 810 is used to control the transceiver 830 to receive and / or transmit signals.

[0293] As an example, processor 810 may have the functions of processing unit 720 shown in FIG. 7, memory 820 may have the functions of storage unit, and transceiver 830 may have the functions of transceiver unit 710 shown in FIG. 7.

[0294] As one approach, the device 800 is used to implement the operations performed by a communication device (such as a terminal device or a network device) in the various method embodiments described above.

[0295] For example, processor 810 is used to execute computer programs or instructions stored in memory 820 to implement the relevant operations of the communication device in the various method embodiments above.

[0296] It should be understood that the processor mentioned in the embodiments of this application can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor.

[0297] It should also be understood that the memory mentioned in the embodiments of this application can be volatile memory and / or non-volatile memory. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM). For example, RAM can be used as an external cache. By way of example and not limitation, RAM includes the following forms: static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM).

[0298] It should be noted that when the processor is a general-purpose processor, DSP, ASIC, FPGA, or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, the memory (storage module) can be integrated into the processor.

[0299] It should also be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0300] Figure 9 is a schematic diagram of a chip system 900 provided in an embodiment of this application. The chip system 900 (or may also be called a processing system) includes logic circuitry 910 and an input / output interface 920.

[0301] The logic circuit 910 can be a processing circuit in the chip system 900. The logic circuit 910 can be coupled to a memory unit, calling instructions from the memory unit, enabling the chip system 900 to implement the methods and functions of the embodiments of this application. The input / output interface 920 can be an input / output circuit in the chip system 900, outputting processed information from the chip system 900, or inputting data or signaling information to be processed into the chip system 900 for processing.

[0302] As one approach, the chip system 900 is used to implement the operations performed by the communication device (such as a terminal device or a network device) in the various method embodiments described above.

[0303] For example, logic circuit 910 is used to implement processing-related operations performed by a communication device (such as a terminal device or a network device) in the above method embodiments; input / output interface 920 is used to implement sending and / or receiving-related operations performed by a communication device (such as a terminal device or a network device) in the above method embodiments.

[0304] This application also provides a computer-readable storage medium storing a computer program or instructions for implementing the methods executed by a communication device (such as a terminal device or a network device) in the above-described method embodiments. For example, when the computer program or instructions are run on the communication device, the communication device (such as a terminal device or a network device) performs the above-described methods (such as method 300).

[0305] This application also provides a computer program product comprising instructions that, when executed by a computer, implement the methods described above as performed by a communication device (such as a sending end or a receiving end). For example, when the computer program or instructions are run on the communication device, the communication device (such as a terminal device or a network device) performs the methods described above (such as method 300).

[0306] This application also provides a communication system that includes the terminal device and / or network device described in the above embodiments. For example, the system includes the terminal device and network device shown in the embodiment of FIG3.

[0307] The explanations and beneficial effects of the relevant contents in any of the devices provided above can be found in the corresponding method embodiments provided above, and will not be repeated here.

[0308] In the several embodiments provided in this application, it should be understood that the disclosed apparatus 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 mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of apparatus or units may be electrical, mechanical, or other forms.

[0309] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. For example, the computer can be a personal computer, a server, or a network device, etc. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state disks, SSDs). For example, the aforementioned available media include, but are not limited to, USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks, and other media capable of storing program code.

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

Claims

1. A communication method, characterized in that, The method includes: The first modulation symbol is extended based on the first sequence in the first sequence set to obtain the first extended symbol; Send the first extended symbol; Wherein, the first sequence set is based on N set,2 The N is determined by a second sequence set. set,2 It is an integer greater than 1; The N set,2 Each set of second sequences in the set of second sequences includes one or more second sequences, and any two second sequences in each set of second sequences are orthogonal; The N set,2 There exist at least two sets of second sequences in a set of second sequences, wherein the lengths of the second sequences included in the at least two sets of second sequences are different; The first sequence set includes at least two first sequences, and any two first sequences in the first sequence set are orthogonal.

2. A communication method, characterized in that, The method includes: Receive the first extended symbol; The first extended symbol is de-extended based on the first sequence in the first sequence set to obtain the first modulation symbol; Wherein, the first sequence set is based on N set,2 The N is determined by a second sequence set. set,2 It is an integer greater than 1; The N set,2 Each set of second sequences in the set of second sequences includes one or more second sequences, and any two second sequences in each set of second sequences are orthogonal; The N set,2 There exist at least two sets of second sequences in a set of second sequences, wherein the lengths of the second sequences included in the at least two sets of second sequences are different; The first sequence set includes at least two first sequences, and any two first sequences in the first sequence set are orthogonal.

3. The method according to claim 1 or 2, characterized in that, Any two first sequences in the first sequence set have the same length, which is L1, where L1 is a positive integer. Any two second sequences in each second sequence set have the same length, and the length of the second sequences included in each second sequence set is divisible by L1.

4. The method according to any one of claims 1 to 3, characterized in that, The length of the second sequence included in each second sequence set satisfies at least the following relationship with the length L1 of the first sequence: Wherein, the N set,2 The length of any second sequence in the u-th second sequence set of the _n ... 2,u u = 0, ..., N set,2 -1.

5. The method according to claim 4, characterized in that, The length of the second sequence included in each set of second sequences is a prime number.

6. The method according to any one of claims 1 to 5, characterized in that, The first sequence set includes N1 first sequences, and the number of second sequences included in each second sequence set satisfies at least the following relationship with N1: Wherein, the N set,2 The number of second sequences included in the u-th second sequence set in the N second sequence sets is N. 2,u u = 0, ..., N set,2 -1.

7. The method according to any one of claims 1 to 6, characterized in that, The first sequence in the first sequence set is based on the N set,2 The Kronecker product of the second sequence of the second sequence set is determined.

8. The method according to claim 7, characterized in that, The first sequence set includes N1 first sequences, wherein the N1 first sequences are N1 rows or N1 columns of the first matrix A1; The N set,2 N second sequence sets correspond to set,2 The second matrix, the N set,2 The u-th second sequence set in the N second sequence sets includes 2,u The second sequence is the N set,2 The u-th second matrix B in the second matrix 2,u N 2,u row or N 2,u Column, the first matrix A1 and the N set,2 The following relationships must be satisfied between the second matrices: Wherein, the N 2,u Let u be a positive integer, where u = 0, ..., N set,2 -1, N represents set,2 The Kronecker product of the second matrix.

9. The method according to any one of claims 1 to 8, characterized in that, The N set,2 The N included in the u-th second sequence set in the n second sequence sets 2,u The second sequence is determined based on the orthogonal variable spreading factor (OVSF) code, or the Fourier transform matrix, or the inverse Fourier transform matrix, wherein N 2,u It is a positive integer.

10. The method according to any one of claims 1 to 9, characterized in that, The method further includes: Obtain first indication information, wherein the first indication information indicates that one of the sequence sets in at least one third sequence set is the first sequence set.

11. The method according to claim 10, characterized in that, Each of the at least one third sequence set is based on N set,2 The second sequence set is determined.

12. The method according to claim 11, characterized in that, The N corresponding to each third sequence set set,2 The sets of second sequences are not completely identical.

13. The method according to claim 1, or any one of 3 to 12, characterized in that, The first modulation symbol includes at least two modulation symbols, and the expansion of the first modulation symbol based on a first sequence in the first sequence set includes: Each of the at least two modulation symbols is extended based on a first sequence from the first sequence set; or... Each of the at least two modulation symbols is extended based on a different first sequence in the first sequence set.

14. The method according to any one of claims 1 to 13, characterized in that, The first extended symbol is transmitted within one or more resource units, and the extended symbol transmitted on each of the plurality of resource units is obtained based on different first sequence extensions in the first sequence set; The extended symbols sent on the plurality of resource units constitute the first extended symbol.

15. The method according to claim 1, or any one of 3 to 14, characterized in that, The first modulation symbol includes G groups of modulation symbols, each group of G groups of modulation symbols including at least one modulation symbol, where G is a positive integer. The expansion of the first modulation symbol based on a first sequence in the first sequence set includes: The G groups of modulation symbols are extended based on the G first sequences in the first sequence set to obtain G groups of extended symbols, wherein the G first sequences correspond one-to-one with the G groups of modulation symbols.

16. The method according to claim 15, characterized in that, Sending the first extended symbol includes: Transmit the G groups of extended symbols within G resource units; The G groups of extended symbols correspond one-to-one with the G resource units, and the G groups of extended symbols constitute the first extended symbol.

17. The method according to any one of claims 1 to 16, characterized in that, The first modulation symbol includes at least two modulation symbols, and the first extended symbol includes at least two second extended symbols. The at least two modulation symbols and the at least two second extended symbols correspond one-to-one. Each of the at least two second extended symbols is obtained by extending the modulation symbol corresponding to each extended symbol based on the first sequence. The first extended symbol corresponds to one or more third extended symbols, and each of the one or more third extended symbols includes one or more second extended symbols of the at least two second extended symbols; Each of the one or more second extended symbols is arranged consecutively or at equal intervals in each of the third extended symbols.

18. The method according to claim 17, characterized in that, If each second extended symbol is arranged at equal intervals in each third extended symbol, then the interval of the equal intervals is related to a first ratio, which is the ratio of the number of elements contained in each third extended symbol to the length of the first sequence.

19. A communication device, characterized in that, The device includes a transceiver unit and a processing unit. The processing unit is configured to extend the first modulation symbol based on the first sequence in the first sequence set to obtain the first extended symbol; The transceiver unit is used to transmit the first extended symbol; Wherein, the first sequence set is based on N set,2 The N is determined by a second sequence set. set,2 It is a positive integer greater than 1; The N set,2 Each set of second sequences in the set of second sequences includes one or more second sequences, and any two second sequences in each set of second sequences are orthogonal; The N set,2 There exist at least two sets of second sequences in a set of second sequences, wherein the lengths of the second sequences included in the at least two sets of second sequences are different; The first sequence set includes at least two first sequences, and any two first sequences in the first sequence set are orthogonal.

20. A communication device, characterized in that, The device includes a transceiver unit and a processing unit. The transceiver unit is used to receive the first extended symbol; The processing unit is configured to de-expand the first extended symbol based on the first sequence in the first sequence set to obtain the first modulation symbol; Wherein, the first sequence set is based on N set,2 The N is determined by a second sequence set. set,2 It is a positive integer greater than 1; The N set,2 Each set of second sequences in the set of second sequences includes one or more second sequences, and any two second sequences in each set of second sequences are orthogonal; The N set,2 There exist at least two sets of second sequences in a set of second sequences, wherein the lengths of the second sequences included in the at least two sets of second sequences are different; The first sequence set includes at least two first sequences, and any two first sequences in the first sequence set are orthogonal.

21. The apparatus according to claim 19 or 20, characterized in that, Any two first sequences in the first sequence set have the same length, which is L1, where L1 is a positive integer. Any two second sequences in each second sequence set have the same length, and the length of the second sequences included in each second sequence set is divisible by L1.

22. The apparatus according to any one of claims 19 to 21, characterized in that, The length of the second sequence included in each second sequence set satisfies at least the following relationship with the length L1 of the first sequence: Wherein, the N set,2 The length of any second sequence in the u-th second sequence set of the _n ... 2,u u = 0, ..., N set,2 -1.

23. The apparatus according to claim 22, characterized in that, The length of the second sequence included in each set of second sequences is a prime number.

24. The apparatus according to any one of claims 19 to 23, characterized in that, The first sequence set includes N1 first sequences, and the number of second sequences included in each second sequence set satisfies at least the following relationship with N1: Wherein, the N set,2 The number of second sequences included in the u-th second sequence set in the N second sequence sets is N. 2,u u = 0, ..., N set,2 -1.

25. The apparatus according to any one of claims 19 to 23, characterized in that, The first sequence in the first sequence set is based on the N set,2 The Kronecker product of the second sequence of the second sequence set is determined.

26. The apparatus according to claim 25, characterized in that, The first sequence set includes N1 first sequences, wherein the N1 first sequences are N1 rows or N1 columns of the first matrix A1; The N set,2 N second sequence sets correspond to set,2 The second matrix, the N set,2 The u-th second sequence set in the N second sequence sets includes 2,u The second sequence is the N set,2 The u-th second matrix B in the second matrix 2,u N 2,u row or N 2,u Column, the first matrix A1 and the N set,2 The following relationships must be satisfied between the second matrices: Wherein, the N 2,u Let u be a positive integer, where u = 0, ..., N set,2 -1, N represents set,2 The Kronecker product of the second matrix.

27. The apparatus according to any one of claims 19 to 26, characterized in that, The N set,2 The N included in the u-th second sequence set in the n second sequence sets 2,u The second sequence is determined based on the orthogonal variable spreading factor (OVSF) code, or the Fourier transform matrix, or the inverse Fourier transform matrix, wherein N 2,u It is a positive integer.

28. The apparatus according to any one of claims 19 to 27, characterized in that, The transceiver unit is also used for: Obtain first indication information, wherein the first indication information indicates that one of the sequence sets in at least one third sequence set is the first sequence set.

29. The apparatus according to claim 28, characterized in that, Each of the at least one third sequence set is based on N set,2 The second sequence set is determined.

30. The apparatus according to claim 29, characterized in that, The N corresponding to each third sequence set set,2 The sets of second sequences are not completely identical.

31. The apparatus according to claim 19, or any one of 21 to 30, characterized in that, The processing unit is specifically used for: Each of the at least two modulation symbols is extended based on a first sequence from the first sequence set; or... Each of the at least two modulation symbols is extended based on a different first sequence in the first sequence set.

32. The apparatus according to any one of claims 19 to 31, characterized in that, The first extended symbol is transmitted within one or more resource units, and the extended symbol transmitted on each of the plurality of resource units is obtained based on different first sequence extensions in the first sequence set; The extended symbols sent on the plurality of resource units constitute the first extended symbol.

33. The apparatus according to claim 19, or any one of 21 to 32, characterized in that, The first modulation symbol includes G groups of modulation symbols, each group of the G groups of modulation symbols including at least one modulation symbol, where G is a positive integer, and the processing unit is specifically used for: The G groups of modulation symbols are extended based on the G first sequences in the first sequence set to obtain G groups of extended symbols, wherein the G first sequences correspond one-to-one with the G groups of modulation symbols.

34. The apparatus according to claim 33, characterized in that, Sending the first extended symbol includes: Transmit the G groups of extended symbols within G resource units; The G groups of extended symbols correspond one-to-one with the G resource units, and the G groups of extended symbols constitute the first extended symbol.

35. The apparatus according to any one of claims 19 to 34, characterized in that, The first modulation symbol includes at least two modulation symbols, and the first extended symbol includes at least two second extended symbols. The at least two modulation symbols and the at least two second extended symbols correspond one-to-one. Each of the at least two second extended symbols is obtained by extending the modulation symbol corresponding to each extended symbol based on the first sequence. The first extended symbol corresponds to one or more third extended symbols, and each of the one or more third extended symbols includes one or more second extended symbols of the at least two second extended symbols; Each of the one or more second extended symbols is arranged consecutively or at equal intervals in each of the third extended symbols.

36. The apparatus according to claim 35, characterized in that, If each second extended symbol is arranged at equal intervals in each third extended symbol, then the interval of the equal intervals is related to a first ratio, which is the ratio of the number of elements contained in each third extended symbol to the length of the first sequence.

37. A communication device, characterized in that, Includes a processor configured to cause the communication device to perform the method of any one of claims 1 to 18.

38. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed on a communication device, cause the communication device to perform the method as described in any one of claims 1 to 18.

39. A chip, characterized in that, The device includes a processor and a communication interface, the communication interface being used to receive data and / or information and transmit the received data and / or information to the processor, the processor processing the data and / or information to perform the method as described in any one of claims 1 to 18.

40. A computer program product, characterized in that, The computer program product includes computer program code that, when run on a computer, causes the method as described in any one of claims 1 to 18 to be implemented.

Images