Communication method, apparatus, and system
By designing a new sequence, the PAPR of the signal generated by the Zadoff-Chu sequence was reduced, solving the problem of high PAPR in the prior art. The design of the power amplifier was optimized, reducing the energy consumption and power limitations of the terminal device.
Patent Information
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- HUAWEI TECH CO LTD
- Filing Date
- 2025-09-18
- Publication Date
- 2026-06-04
Smart Images

Figure CN2025122258_04062026_PF_FP_ABST
Abstract
Description
A communication method, apparatus and system
[0001] Cross-reference to related applications
[0002] This application claims priority to Chinese Patent Application No. 202411759745.6, filed on November 29, 2024, entitled "A Communication Method, Apparatus and System", the entire contents of which are incorporated herein by reference. Technical Field
[0003] This application relates to the field of communication technology, and in particular to a communication method, apparatus and system. Background Technology
[0004] In wireless communication systems, Zadoff-Chu (ZC) sequences are used to generate various signals, such as random access signals, synchronization signals, and reference signals (e.g., measurement reference signals, demodulation reference signals, etc.). ZC sequences possess a constant amplitude characteristic: the amplitude (or magnitude) of all elements in the ZC sequence is equal, all being 1. This characteristic ensures a constant power output at the transmitting end, which is beneficial for the design and optimization of power amplifiers, avoiding nonlinear distortion problems caused by variations in signal amplitude.
[0005] However, the peak-to-average power ratio (PAPR) of signals generated from ZC sequences is approximately between 3 and 5 dB. A higher PAPR results in higher energy consumption or more limited power transmission for the terminal device. Therefore, further research is needed to reduce the PAPR of the signal. Summary of the Invention
[0006] This application provides a communication method, apparatus, and system that, by designing a first sequence, enables a signal generated based on the first sequence to have a constant magnitude while having a low PAPR.
[0007] In a first aspect, embodiments of this application provide a communication method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a terminal device or network device), a component within that communication device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication device. For example, in the method provided in the first aspect, the first communication device generates a first signal according to a first sequence and sends the first signal; wherein the nth element of the first sequence is obtained based on a first value and a second value, the first value being obtained based on the sum of at least one element in a first set, and the second value being obtained based on the sum of at least one element in a second set; n = 0, 1, 2…L-1, L = 2 l Or L=2 l -1, where l is an integer greater than or equal to 1.
[0008] Using the above method, by designing a new sequence (such as the first sequence), the signal generated from the first sequence has a low PAPR while maintaining a constant magnitude.
[0009] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1;
[0010] Where {Z0(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z1(n, m)} represents the second set, m = 0, 1, ..., l-2; This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
[0011] In one possible design, L = 2 l ;
[0012] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1.
[0013] In one possible design, L = 2 l -1;
[0014] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1.
[0015] Thus, when the length of the first sequence is 2 l When the value is -1, low cross-correlation in the time domain between different sequences can be guaranteed.
[0016] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1;
[0017] Where {Z(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z(n, m)Z(n, m+1)} represents the second set, m = 0, 1, ..., l-2;
[0018] This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
[0019] In one possible design, L = 2 l Z = UT
[0020] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
[0021] In one possible design, L = 2 l -1; Z = UT
[0022] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents a matrix with 2l-1 rows and l columns; T is a square matrix with l rows and l columns, T(p, q) ∈ {0, 1}, and each row and each column has only one element with a value of 1, p = 0, 1, ..., l-1, q = 0, 1, ..., l-1.
[0023] In one possible design, L = 2 l Z = TU
[0024] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l A matrix with 1 row and 1 column; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2l -1.
[0025] In one possible design, L = 2 l -1; Z=TU
[0026] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
[0027] In one possible design, the method further includes: receiving first information, the first information being used to indicate P(k), k = 0, 1, ..., l-1.
[0028] In one possible design, generating a first signal based on a first sequence includes: obtaining a second sequence based on the first sequence; generating the first signal based on the second sequence mapped onto frequency domain resources; wherein the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2, ..., L-1;
[0029] Where α is a positive integer; β = 1, or β is a complex constant, or or C represents the cyclic shift value.
[0030] In one possible design, generating a first signal based on a first sequence includes: obtaining a third sequence based on the first sequence; generating the first signal based on the third sequence mapped onto frequency domain resources; wherein the first sequence is denoted as x(n), the third sequence is denoted as z(n), n = 0, 1, 2, ..., L-1; z(n) = I(n) + jQ(n).
[0031] Among them, I(n) and Q(n) are obtained from x(n).
[0032] In one possible design, generating a first signal based on a first sequence includes: acquiring the number of frequency domain resources used to carry the first signal; truncating the first sequence based on the number of frequency domain resources to obtain a fourth sequence; and generating the first signal based on the fourth sequence.
[0033] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1, and the fourth sequence is denoted as x′(m), m = 0, 1, 2, ..., M-1; M is the number of frequency domain resources, and M is less than L; x′(m) = x((m+N) Cs )modL)
[0034] Where, N Cs It is an integer.
[0035] Thus, when the length of the first sequence is greater than the number of frequency domain resources, the first communication device can truncate the first sequence according to the number of frequency domain resources. Compared with the method of "if the length of the first sequence is less than the number of REs, then the first sequence is repeated", this can ensure low cross-correlation between different sequences and / or reduce the PAPR of the signal.
[0036] Secondly, embodiments of this application provide a communication method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a communication device (e.g., a network device or terminal device), a component within that communication device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication device. For example, in the method provided in the second aspect, the second communication device receives a first signal and obtains a first sequence based on the first signal; wherein the nth element of the first sequence is obtained based on a first value and a second value, the first value being obtained based on the sum of at least one element in a first set, and the second value being obtained based on the sum of at least one element in a second set; wherein n = 0, 1, 2…L-1, L = 2 l Or L=2 l -1, where l is an integer greater than or equal to 1.
[0037] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1;
[0038] Where {Z0(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z1(n, m)} represents the second set, m = 0, 1, ..., l-2;
[0039] This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
[0040] In one possible design, L = 2 l ;
[0041] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1.
[0042] In one possible design, L = 2 l -1;
[0043] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1.
[0044] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1;
[0045] Where {Z(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z(n, m)Z(n, m+1)} represents the second set, m = 0, 1, ..., l-2;
[0046] This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
[0047] In one possible design, L = 2 l Z = UT
[0048] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
[0049] In one possible design, L = 2 l -1; Z = UT
[0050] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
[0051] In one possible design, L = 2 l Z = TU
[0052] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l A matrix with 1 row and 1 column; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
[0053] In one possible design, L = 2 l -1; Z=TU
[0054] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
[0055] In one possible design, the method further includes:
[0056] Send a first message, which is used to indicate P(k), k = 0, 1, ..., l-1.
[0057] In one possible design, a first sequence is obtained based on the first signal, including:
[0058] Based on the first signal, a second sequence mapped onto frequency domain resources is obtained;
[0059] The first sequence is obtained based on the second sequence;
[0060] Wherein, the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2, ..., L-1;
[0061] Where α is a positive integer; β = 1, or β is a complex constant, or or C represents the cyclic shift value.
[0062] In one possible design, a first sequence is obtained based on the first signal, including:
[0063] Based on the first signal, a third sequence mapped onto the frequency domain resources is obtained;
[0064] The first sequence is obtained based on the third sequence;
[0065] Wherein, the first sequence is denoted as x(n), the third sequence is denoted as z(n), n = 0, 1, 2, ..., L-1; z(n) = I(n) + jQ(n)
[0066] Among them, I(n) and Q(n) are obtained from x(n).
[0067] In one possible design, obtaining a first sequence based on the first signal includes: obtaining a fourth sequence based on the first signal, wherein the fourth sequence is a part of the first sequence.
[0068] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1, and the fourth sequence is denoted as x′(m), m = 0, 1, 2, ..., M-1, where M is less than L; x′(m) = x((m+N) Cs )modL)
[0069] Where, N Cs It is an integer.
[0070] It is understood that the communication method provided in the second aspect corresponds to the communication method provided in the first aspect, and the beneficial effects of the relevant technical features in the second aspect can be referred to the description in the first aspect.
[0071] Thirdly, this application provides a communication device that has the functions involved in the first or second aspect above. For example, the communication device includes modules, units, or means corresponding to the operations involved in the first or second aspect above. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.
[0072] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the first or second aspect described above.
[0073] In one possible design, the communication device includes a processor that can be coupled to a memory. The memory can store necessary computer programs or instructions for implementing the functions described in the first or second aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods in any possible design or implementation of the first or second aspect above, when executed.
[0074] In one possible design, the communication device includes a processor and a memory, the memory of which may store necessary computer programs or instructions for implementing the functions involved in the first or second aspect described above. The processor may execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the methods in any possible design or implementation of the first or second aspect described above.
[0075] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the methods in any possible design or implementation of the first or second aspect described above.
[0076] Understandably, in the third aspect described above, the processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.
[0077] Fourthly, this application provides a communication system, which may include a first communication device and a second communication device; wherein the first communication device is used to perform the method described in the first aspect, and the second communication device is used to perform the method described in the second aspect.
[0078] Fifthly, this application provides a computer-readable storage medium storing a computer program (or computer-readable instructions) in which, when a computer reads and executes some or all of the computer-readable instructions, the method in any of the possible designs of the first or second aspect described above is executed.
[0079] For example, a computer-readable storage medium can be any available medium that a computer can access. This includes, but is not limited to, non-transient computer-readable media, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD-ROM or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer.
[0080] Sixthly, this application provides a computer program product that, when read and executed by a computer, causes the method in any of the possible designs of the first or second aspect to be performed.
[0081] In a seventh aspect, this application provides a chip (or chip system) including a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory, such that the method in any of the possible designs of the first or second aspect described above is executed. Attached Figure Description
[0082] Figure 1 is a schematic diagram of the architecture of the communication system applicable to the embodiments of this application;
[0083] Figure 2 is a schematic diagram of the random access process;
[0084] Figure 3 is a schematic diagram of signal transmission between terminal equipment and network equipment;
[0085] Figure 4 is a flowchart illustrating the communication method provided in the embodiments of this application;
[0086] Figure 5 is a possible exemplary block diagram of the device involved in the embodiments of this application;
[0087] Figure 6 is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation
[0088] The technical solutions in the embodiments of this application will now be described with reference to the accompanying drawings. This application will focus on various aspects, embodiments, or features of a system that may include multiple devices, components, modules, etc. It should be understood and appreciated that each system may include additional devices, components, modules, etc., and / or may not include all the devices, components, modules, etc. discussed in conjunction with the accompanying drawings. Furthermore, combinations of these solutions may also be used.
[0089] In the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the term "example" is intended to present concepts in a concrete manner. In the embodiments of this application, "of," "corresponding, relevant," and "corresponding" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.
[0090] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, wireless fidelity, Wi-Fi, Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4th generation (4G) mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th generation (5G) mobile communication systems (such as New Radio (NR) systems), Future Communications systems, or other similar communication systems, without limitation. This application describes the communication system shown in Figure 1 as an example. When applying the technical solution of this application to other communication systems, the devices, components, modules, etc. in the embodiment can be replaced with corresponding devices, components, modules in other communication systems without limitation.
[0091] Figure 1 is a schematic diagram of the architecture of the communication system applied in the embodiments of this application. As shown in Figure 1, the communication system includes an access network 100. Optionally, the communication system may also include a core network 200 and an Internet 300. The access network 100 may include at least one network device, such as 110a and 110b in Figure 1, and may also include at least one terminal device, such as 120a-120j in Figure 1. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop computer, 120h is a printer, and 120i is a drone. The same terminal device or network device can provide different functions in different application scenarios. For example, the mobile phones in Figure 1 are 120a, 120e, 120f and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can access micro-station 110b, connect to laptop 120g and printer 120h. Mobile phone 120j can control drone 120i.
[0092] (1) Network equipment
[0093] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device in a radio access network (RAN) that provides wireless communication capabilities to terminal devices; this is called RAN equipment. The RAN can be an access network within the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these.
[0094] RAN equipment can also 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 base station in a future mobile communication system, or an access node in a WiFi system, etc.
[0095] RAN equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) and PDCP protocols of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into a CU control plane (CP) (i.e., CU-CP) and a CU user plane (UP) (i.e., CU-UP). The DU performs the functions of the RLC and MA layers of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. CU and DU can be set up separately, or they can be included in the same network element, such as in a baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. The RA device can be a macro base station (as shown in Figure 1, 110a), a micro base station or an indoor station (as shown in Figure 1, 110b), or a relay node or donor node, etc. The embodiments of this application do not limit the specific technology or specific device form used in the network equipment.
[0096] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.
[0097] (2) Terminal equipment
[0098] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, smart cities, etc. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. In the embodiments of this application, the device used to implement the functions of the terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing that function, such as a chip system or a combination of devices or components that can implement the functions of the terminal device. This device can be installed in the terminal device. The embodiments of this application do not limit the specific technology or specific device form used in the terminal device.
[0099] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal device, or by a device that includes the functions of the terminal device.
[0100] Network devices and terminal devices can be fixed in location 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 also be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.
[0101] The roles of network devices and terminal devices can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device. That is, 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol. In this case, relative to 110a, 120i is also a network device. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with network device functions, and 120a-120j in Figure 1 can be called communication devices with terminal device functions.
[0102] Network devices and terminal devices, network devices and network devices, and terminal devices and terminal devices can communicate through licensed spectrum, unlicensed spectrum, or both licensed and unlicensed spectrum simultaneously; there are no specific limitations.
[0103] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.
[0104] The following explanations address the relevant terms used in the embodiments of this application. These explanations are intended to make the embodiments of this application easier to understand and should not be construed as strict limitations on the terms within the scope of protection claimed in this application.
[0105] (1) Sequence
[0106] In this application's embodiments, the "sequence" includes one or more elements. These elements can be represented as complex numbers, including a real part and an imaginary part; alternatively, elements can also be represented as real numbers, without any specific limitation.
[0107] For example, the sequence s(n) contains L elements, where L is an integer greater than 1. n belongs to {0, ..., L-1}, that is, n∈{0, ..., L-1}. The “…” in {0, ..., L-1} represents an integer between 0 and L-1. For example, when L=5, n∈{0, 1, 2, 3, 4}. The L elements in {s(n)} can be: s(0), ..., s(L-1).
[0108] It is understood that this application embodiment uses a numbering method with a starting number of 0 and increments by a step size of 1 as an example, but it is not limited to this. For example, the numbering method can also be: a starting number of 1 and increments by a step size of 1. As another example, the numbering method can also be: a starting number of X and decrementes by a step size of 1, where X is an integer greater than 1.
[0109] (2) ZC sequence
[0110] In wireless communication systems, ZC sequences are used for various possible signals, such as random access signals, synchronization signals, reference signals (e.g., sounding reference signal (SRS), demodulation reference signal (DMRS), etc.), and signals transmitted on the physical uplink control channel (PUCCH). DMRS includes physical downlink shared channel (PDSCH) DMRS, physical uplink shared channel (PUSCH) DMRS (including PUSCH DMRS with single-carrier waveforms or PUSCH DMRS with non-single-carrier waveforms), and PUCCH DMRS (including PUCCH DMRS with single-carrier waveforms or PUCCH DMRS with non-single-carrier waveforms).
[0111] The ZC sequence is a complex sequence, and its mathematical expression is as follows:
[0112] Where u is the root index and L is the length of the ZC sequence.
[0113] ZC sequences possess a constant amplitude characteristic: the amplitude (or magnitude) of all elements in a ZC sequence is equal, all being 1. This characteristic ensures a constant power output at the transmitting end, which is beneficial for the design and optimization of power amplifiers, avoiding nonlinear distortion problems caused by signal amplitude variations. The magnitude is the square root of the complex signal and its conjugate dot product; for example, the magnitude of the complex number a+bj is...
[0114] ZC sequences exhibit good cross-correlation: ZC sequences with different root indices exhibit good cross-correlation, meaning their cross-correlation values are close to zero at all time delays.
[0115] (3) Random access signal
[0116] This section uses the ZC sequence as an example to describe one possible implementation.
[0117] Random access signals are used to initiate random access procedures. For example, random access signals are derived from random access preambles, which can be called random access preamble sequences, preamble sequences, or preambles. Random access signals are carried on the physical random access channel (PRACH).
[0118] Based on whether the preamble is selected by the terminal device itself, random access procedures can be divided into contention-based random access procedures and non-contention-based random access procedures. The following description uses a contention-based random access procedure as an example to illustrate one possible implementation of the random access procedure.
[0119] Figure 2 is a schematic diagram of a random access procedure provided in an embodiment of this application. As shown in Figure 2, it includes the following steps:
[0120] In step S200, the network device sends random access configuration information to the terminal device, and the terminal device receives the configuration information from the network device. This step can be considered preparatory work before performing the random access procedure and is not part of the random access procedure itself.
[0121] For example, a network device can send random access configuration information to a terminal device via system messages. This configuration information may include a logical root index number, which is used to determine the sequence set (or preamble set) of the current cell. The preamble set includes 64 preambles, i.e., 64 sequences.
[0122] Specifically, after receiving the logical root index number (denoted as i), the terminal device queries a predefined table to obtain the physical root index number (denoted as u), and then generates the root sequence X based on the physical root index number. u (n). Furthermore, the terminal device... (The rest of the text appears to be incomplete and requires further context.) u Perform a cyclic shift on [n] to generate a 64-sequence X. u,v (n), n = 0, 1, 2, ..., L-1; if for the root sequence X u If the number of sequences generated by the cyclic shift (n) is less than 64, then continue to generate the next root sequence and perform a cyclic shift on the next root sequence until 64 sequences are generated.
[0123] Wherein, sequence X u,v (n) can be generated by the following formula: X u,v (n)=X u ((n+Cv )mod L
[0124] The above C v For cyclic shift values, such as C v =vN CS , Indicates L / N CS Round down; N CS The cyclic shift interval is the specific value that can be configured by the network device.
[0125] The following example, with a root sequence length of 139, illustrates how a terminal device obtains 64 sequences from the preamble set.
[0126] The terminal device receives a logical root index number of 20, obtains a physical root index number of 11 by querying a predefined table, and can then generate a root sequence X. 11 (n), n = 0, 1, 2, ..., L-1. Further, assume N CS If the value is 4, then v = 0, 1, 2...34.
[0127] The first sequence: v = 0, C v =vN CS =0,X 11,0 (n)=X 11 (n), that is, the first sequence is the root sequence X. 11 (n), n = 0, 1, 2, ..., L-1;
[0128] Second sequence: v = 1, C v =vN CS =4,X 11,1 (n)=X 11 ((n+4) mod 139;
[0129] The third sequence: v = 2, C v =vN CS =8,X 11,2 (n)=X 11 ((n+8) mod 139;
[0130] And so on;
[0131] The 35th sequence: v = 34, C v =vN CS =136, X 11,34 (n)=X 11 ((n+136)mod 139.
[0132] Due to the root sequence X 11(n) If the number of sequences generated by the cyclic shift is less than 64, then continue to generate the next root sequence and perform a cyclic shift on the next root sequence. The physical root index number of the next root sequence in the predefined table is 128 (logical root index number is 21), therefore, the next root sequence is X. 128 (n), n = 0, 1, 2, ..., L-1.
[0133] The 36th sequence: v = 0, C v =vN CS =0,X 128,0 (n)=X 128 (n), that is, the 36th sequence is the root sequence X. 128 (n), n = 0, 1, 2, ..., L-1;
[0134] The 37th sequence: v = 1, C v =vN CS =4,X 128,1 (n)=X 128 ((n+4) mod 139;
[0135] And so on;
[0136] The 64th sequence: v = 28, C v =vN CS =112, X 128,28 (n)=X 128 ((n+112)mod 139, thus obtaining 64 sequences.
[0137] It is understandable that the above description is based on the example of a terminal device generating 64 sequences. In other examples, the terminal device can also determine the physical root index number and cyclic shift value corresponding to each of the 64 sequences without actually generating the sequence. After the terminal device selects one of the sequences (such as sequence a), it generates sequence a according to the physical root index number and cyclic shift value corresponding to sequence a.
[0138] S201, the terminal device sends a random access signal. This random access signal can be referred to as the first message or message 1 (Msg1) of the random access procedure.
[0139] For example, the terminal device selects a preamble (such as sequence a) from the preamble set of the current cell and generates a random access signal based on sequence a. Specifically, as shown in Figure 3, the terminal device performs a discrete fourier transformation (DFT) operation on sequence a, maps the DFT-derived sequence onto a resource element (RE) (i.e., mapped onto frequency domain resources), and performs an inverse fast fourier transformation (IFFT) to obtain the final symbol sequence (i.e., the random access signal), which is then sent to the network device via PRACH.
[0140] Where sequence a is denoted as x u,v (n), n = 0, 1, 2...L-1, and the sequence after the DFT operation is denoted as y. u,v (a), a = 0, 1, 2, ..., L-1, y u,v (a) and x u,v (n) satisfies the following formula:
[0141] Optionally, the sequence obtained by the above signal acquisition method (e.g., performing a discrete Fourier transform operation on sequence a, mapping the DFT-operated sequence onto resource units, and performing inverse fast Fourier transform processing to obtain the signal to be transmitted) can also be used as a signal for SRS, DMRS, or PUCCH transmission.
[0142] Optionally, the terminal device can directly map sequence a to frequency domain resources and perform inverse fast Fourier transform processing to obtain the signal to be transmitted; this method of generating signals can be used for synchronization signals, such as secondary synchronization signals (SSS), or signals that can be used for SRS, or signals that can be used for DMRS, or signals that can be used for PUCCH transmission.
[0143] It is understandable that the random access signal is generated by the baseband chip of the terminal device. The terminal device sending the random access signal includes the baseband chip transmitting the random access signal to the radio frequency chip. The terminal device also sends the random access signal to the network device via its radio frequency chip.
[0144] S202, after detecting the random access signal sent by the terminal device, the network device sends a random access response (RAR) to the terminal device. This random access response can be referred to as message 2 or message 2 (Msg2) in the random access procedure.
[0145] For example, as shown in Figure 3, after receiving the random access signal, the network device performs FFT processing and RE demapping on the random access signal, and performs inverse discrete fourier transformation (IDFT) on the sequence obtained by RE demapping to obtain sequence r. Then, based on the cross-correlation value between the sequence in the preamble set of the current cell and sequence r, the sequence with the largest cross-correlation value between the preamble set and sequence r (such as sequence a) is determined to be the sequence actually sent by the terminal device.
[0146] S203, the terminal device sends uplink signaling to the network device according to the RAR. This uplink signaling can be referred to as message 3 or message 3 (Msg3) of the random access procedure.
[0147] In S204, the network device sends a contention resolution message to the terminal device. Correspondingly, the terminal device can receive the contention resolution message from the network device. If the contention resolution message determines that the random access conflict has been won, the random access is considered successful; otherwise, the terminal device determines that the random access has failed. The contention resolution message can be referred to as message 4 or message 4 (Msg4) in the random access procedure.
[0148] It is understood that the random access process shown in Figure 2 above is only one possible process example, and the embodiments of this application do not limit it.
[0149] As described above, due to the constant amplitude characteristic of the ZC sequence, the signal generated from the ZC sequence has a constant power output at the transmitting end. However, the PAPR of the signal generated from the ZC sequence is relatively high, approximately ranging from 3 to 5 dB. A high PAPR can lead to increased energy consumption or limited power of the transmitted signal by the terminal device.
[0150] PAPR is defined as the ratio of peak power to average power of a signal. Since the dynamic range of a power amplifier is limited, an excessively high PAPR will cause the amplified signal to enter the nonlinear region. In the nonlinear region, the efficiency of the power amplifier will drop significantly. In order to achieve the same average output power, more DC power is required, which will increase the energy consumption of the terminal device to transmit the signal. In order to avoid entering the nonlinear region, power back-off is required. The higher the PAPR, the higher the power back-off is required. Therefore, the power of the terminal device to transmit the signal is limited.
[0151] Based on this, embodiments of this application provide a communication method, apparatus, and system, which, by designing a first sequence, ensures that the signal generated according to the first sequence has a constant magnitude while having a low PAPR.
[0152] The communication method provided in this application is described below with reference to specific embodiments. The communication method provided in this application involves a first communication device and a second communication device. The first communication device is a signal transmitter, and the second communication device is a signal receiver. For example, the first communication device may be a terminal device or a component within a terminal device, such as a processor, chip (e.g., baseband chip), or chip system disposed in the terminal device; the second communication device may be a network device or a component within a network device, such as a processor, chip, or chip system disposed in the network device. Alternatively, the first communication device may be a network device or a component within a network device, and the second communication device may be a terminal device or a component within a terminal device. In this application, the embodiment is described using the example of "the first communication device being a terminal device and the second communication device being a network device."
[0153] In this embodiment, "send" and "receive" indicate the direction of signal transmission. "Send" can also be understood as the "output" of the chip interface, and "receive" can be understood as the "input" of the chip interface. In other words, "send" or "receive" can occur between devices, such as between a network device and a terminal device via an air interface. "Send" or "receive" can also occur within a device, such as between components, modules, chips, software modules, or hardware modules within the device via a bus, wiring, or interface.
[0154] Figure 4 is a flowchart illustrating the communication method provided in this embodiment. As shown in Figure 4, the process may include:
[0155] S401, The terminal device generates a first signal according to the first sequence.
[0156] For example, the first signal may be a random access signal, a reference signal, or a synchronization signal, and there is no specific limitation.
[0157] (1) Introduce the first sequence.
[0158] The nth element of the first sequence is obtained based on the first value and the second value. The first value is obtained based on the sum of at least one element in the first set, and the second value is obtained based on the sum of at least one element in the second set; n = 0, 1, 2, ..., L-1, L = 2 l Or L=2 l -1, where l is an integer greater than or equal to 1. The elements in the second set are derived from the elements in the first set; for example, element a in the second set is the product of element a and element a+1 in the first set.
[0159] In this embodiment of the application, when the sequence length L is 2...l When the value is -1, low cross-correlation in the time domain between different sequences can be guaranteed.
[0160] As one possible implementation, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1, and is generated by the following formula (referred to as Formula 1):
[0161] The first set is {Z0(n, k)}, k = 0, 1, ..., l-1. That is, the first set can be understood as the sequence Z0(k) corresponding to n as a specified value, k = 0, 1, ..., l-1; the second set is {Z1(n, m)}, m = 0, 1, ..., l-2. That is, the second set can be understood as the sequence Z1(m) corresponding to n as a specified value, m = 0, 1, ..., l-2. Indicates the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
[0162] For example, the sequence P(k) is indicated by the network device to the terminal device. For instance, the network device sends first information to the terminal device, which indicates the sequence P(k), where k = 0, 1, ..., l-1. The value of α can be predefined or preconfigured, such as α = 1 or α = 2. {Z0(n, k)} and {Z1(n, m)} can also be predefined or preconfigured.
[0163] In one example, L = 2 l ,but:
[0164] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1.
[0165] In yet another example, L = 2 l -1, then:
[0166] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1.
[0167] As another possible implementation, the first sequence is generated by the following formula (referred to as Formula 2):
[0168] The first set is {Z(n, k)}, k = 0, 1, ..., l-1. That is, the first set can be understood as the sequence Z(k) corresponding to n as a specified value, k = 0, 1, ..., l-1; the second set is {Z(n, m)Z(n, m+1)}, m = 0, 1, ..., l-2. That is, the second set can be understood as the sequence Z(m)Z(m+1) corresponding to n as a specified value, m = 0, 1, ..., l-2. Indicates the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
[0169] For example, {Z(n, k)} can be predefined or preconfigured.
[0170] In one example, L = 2 l Then: Z = UT
[0171] Where Z is an n-row, l-column matrix, and {Z(n, k)} represents the nth row vector in the Z matrix. U is 2 l A matrix with -1 rows and l columns, where U(i, j) represents the element in the i-th row and j-th column of matrix U. i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; T is a square matrix T(p, q) ∈ {0, 1} with l rows and l columns, and each row and each column has only one element with a value of 1, p = 0, 1, ..., l-1, q = 0, 1, ..., l-1.
[0172] For example, if l = 3, then:
[0173] or
[0174] For another example, define a column sorting vector P = [p0, p1, ..., p...]. l-1 ], Among them, i x Let i be the row vector with row index x in the identity matrix I; when l = 3, p0 = 2, p1 = 0, p2 = 1, and i0 = [1, 0, 0], i1 = [0, 1, 0], i2 = [0, 0, 1].
[0175] Right now:
[0176] Then we have:
[0177] In yet another example, L = 2 l -1, then: Z = UT
[0178] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
[0179] In yet another example, L = 2 l Then: Z = TU
[0180] Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l A matrix with 1 row and 1 column; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
[0181] For example, l = 2, 2 l =4, then:
[0182] or
[0183] To give another example, define a vector P = [p0, p1, ..., p...]. l-1 ], Among them, i x Let x be the column vector with column index x in the identity matrix I; when l = 2, 2 l =4, p0=3, p1=0, p2=1, p3=2, and i0=[1,0,0,0], i1=[0,1,0,0], i2=[0,0,1,0], i3=[0,0,0,1], that is:
[0184] Then we have:
[0185] In yet another example, L = 2 l -1, then: Z = TU
[0186] Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is 2. l row and 2 lA square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
[0187] It is understandable that when matrix T is the identity matrix, Equation 2 is equivalent to Equation 1. In other words, Equation 1 can be regarded as a special case of Equation 2.
[0188] (2) The specific implementation of “the terminal device generates the first signal according to the first sequence” is introduced.
[0189] There are multiple ways to implement the generation of the first signal by the terminal device based on the first sequence. The following describes two possible implementations in conjunction with implementation method 1 and implementation method 2.
[0190] Implementation method 1: The terminal device obtains the second sequence based on the first sequence; then generates the first signal based on the second sequence mapped onto the frequency domain resources; wherein the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2...L-1.
[0191] Where β = 1, or β is a complex constant, or or C represents the cyclic shift value, which can be configured by the network device for the terminal device, and there are no specific restrictions.
[0192] For example, the terminal device generates a first signal based on a second sequence mapped onto frequency domain resources. Specifically, the terminal device maps the second sequence onto frequency domain resources and performs IFFT processing to generate the first signal. Other possible steps may also be included, but this application embodiment does not limit them.
[0193] By employing the method described in Implementation 1, placing x(n) in the exponent term ensures that the modulus of the second sequence mapped to the frequency domain resources is always 1, thereby guaranteeing that the modulus of the first signal is a constant value. Optionally, when the first signal is a reference signal used for channel estimation, it facilitates reducing the complexity of the channel estimation or channel acquisition algorithm.
[0194] Implementation Method 2: The terminal device obtains a third sequence based on the first sequence; then, based on the third sequence mapped onto frequency domain resources, it generates a first signal; where the first sequence is denoted as x(n), the third sequence is denoted as z(n), and n = 0, 1, 2, ..., L-1. z(n) = I(n) + jQ(n)
[0195] Here, I(n) and Q(n) are obtained based on x(n). For example, the terminal device can determine I(n) and Q(n) based on a pre-configured or pre-defined correspondence table and x(n). See Table 1 for an example of a possible correspondence representation, where the set of values for x(n) is {0,1,2,3}.
[0196] Table 1: Examples of Correspondence Relationships
[0197] For example, the terminal device generates a first signal based on a third sequence mapped onto frequency domain resources. Specifically, the terminal device maps the third sequence onto frequency domain resources and performs IFFT processing to generate the first signal. Other possible steps may also be included, but this application embodiment does not limit them.
[0198] By employing the method described in implementation 2 above, and performing an IQ transformation on x(n), it can be ensured that the modulus of the third sequence mapped to the frequency domain resources is always 1, thereby ensuring that the modulus of the first signal is a constant value. Optionally, when the first signal is a reference signal used for channel estimation, it is beneficial to reduce the complexity of the channel estimation or channel acquisition algorithm.
[0199] It is understandable that in the above implementation method 1 (or implementation method 2), the terminal device directly obtains the second sequence (or the third sequence) based on the first sequence. In other examples, the terminal device can also perform a cyclic shift on the first sequence, and then obtain the second sequence (or the third sequence) based on the cyclically shifted sequence.
[0200] For example, the length of the first sequence is greater than or equal to the number of frequency domain resources (e.g., the number of resource elements (REs)) used to carry the first signal. The network device can indicate the frequency domain resources used to carry the first signal to the terminal device, allowing the terminal device to obtain the number of frequency domain resources used to carry the first signal. If the length of the first sequence is equal to the number of REs, the terminal device can generate the first signal using implementation method 1 or implementation method 2; if the length of the first sequence is greater than the number of REs, the terminal device can truncate the first sequence according to the number of REs to obtain a fourth sequence, and then generate the first signal based on the fourth sequence. A specific implementation of "the terminal device generating the first signal based on the fourth sequence" can be found in the description of "the terminal device generating the first signal based on the first sequence".
[0201] The first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1, and the fourth sequence is denoted as x′(m), m = 0, 1, 2, ..., M-1; M is the number of frequency domain resources, and M is less than L. x′(m) = x((m+N) Cs )modL)
[0202] Where, N Cs It is an integer.
[0203] Understandably, in other examples, the length of the first sequence may also be less than the number of REs. In this case, the first sequence can be repeated, and the length of the repeated sequence is equal to the number of REs. The first signal can then be generated based on the repeated sequence. Compared to the method of "repeating the first sequence if its length is less than the number of REs," the above truncation method can ensure low cross-correlation between different sequences and / or reduce the PAPR of the signal.
[0204] (3) Taking the first signal as a random access signal as an example, a possible implementation is introduced.
[0205] For random access scenarios, taking a cell sequence set containing 64 sequences as an example, the network device can send first information to the terminal device. This first information indicates sequence P(k), where k = 0, 1, ..., l-1. The first information can be understood as a logical root index, and sequence P(k) as a physical root index. Then, the terminal device can determine a root sequence based on the physical root index and the aforementioned formula 1 or formula 2. Further, the terminal device performs a cyclic shift on the root sequence to generate 64 sequences. If the number of sequences generated by the cyclic shift is less than 64, the next root sequence is generated, and the next root sequence is cyclically shifted until 64 sequences are generated. For details, refer to the previous description of the random access process. Finally, the terminal device can select a sequence (such as the first sequence) from the cell sequence set and generate a first signal based on the first sequence.
[0206] S402, the terminal device sends a first signal; correspondingly, the network device receives the first signal.
[0207] It is understandable that the first signal can be generated by the baseband chip of the terminal device. Sending the first signal by the terminal device includes the baseband chip transmitting the first signal to the radio frequency chip of the terminal device. Sending the first signal by the terminal device also includes the radio frequency chip of the terminal device sending the first signal to the network device.
[0208] S403, the network device obtains the first sequence based on the first signal.
[0209] For example, regarding implementation method 1 above: after receiving the first signal, the network device obtains a second sequence mapped onto frequency domain resources based on the first signal; and then obtains sequence r based on the second sequence. Regarding implementation method 2 above: after receiving the first signal, the network device obtains a third sequence mapped onto frequency domain resources based on the first signal; and then obtains sequence r based on the third sequence.
[0210] Furthermore, taking a random access scenario as an example, the network device can determine the sequence with the largest cross-correlation value with sequence r in the sequence set of the current cell (such as the first sequence) as the sequence actually sent by the terminal device based on the cross-correlation value between the sequence and sequence r in the sequence set of the current cell.
[0211] Using the above method, by designing a first sequence, the signal generated based on the first sequence has a constant magnitude while its PAPR approaches 3dB, meaning that compared to the ZC sequence, it can reduce the PAPR of the signal. The method provided in this application can be applied to various scenarios requiring a constant magnitude and low PAPR (such as random access signals, synchronization signals, reference signals, etc.), and is not specifically limited thereto.
[0212] Regarding the above embodiments, it is understood that:
[0213] (1) In this application, “predefined” usually refers to information that is defined by the standard, does not require configuration by other devices, and is recorded / written in advance in the hardware and / or software of the terminal device or network device itself, or can be understood as information that cannot be changed by the network device or terminal device.
[0214] In this application, "pre-configuration" can refer to the server sending relevant information to network devices or terminal devices; alternatively, it can refer to defining the relevant information and pre-writing it into the network devices or terminal devices. This application does not limit the specific method used. Furthermore, the relevant information can be changed or updated.
[0215] (2) In the embodiments of this application, unless otherwise specified or in case of logical conflict, the terms and / or descriptions in different examples or implementations are consistent and can be referenced by each other. The technical features in different examples or implementations can be combined to form new embodiments according to their inherent logical relationships. In addition, different implementations or different examples can be referenced or referenced by each other.
[0216] (3) The various numerical designations used in this application are merely for descriptive convenience and are not intended to limit the scope of this application. The step numbers in the above flowcharts are only examples of the execution process and do not constitute a restriction on the order of execution of the steps. That is, the size of each step number does not imply the order of execution, and the execution order of each step should be determined by its function and internal logic. In addition, not all steps shown in the flowcharts are mandatory steps, and some steps can be added or deleted based on actual needs.
[0217] The above mainly describes the solution provided by the embodiments of this application from the perspective of the interaction between the first communication device and the second communication device. It is understood that, in order to achieve the above functions, the first communication device and the second communication device may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments disclosed herein, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0218] In this application embodiment, the first communication device and the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into a separate functional unit, or two or more functions can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.
[0219] In the case of using integrated units, FIG5 shows a possible exemplary block diagram of the device involved in the embodiments of this application. As shown in FIG5, the device 500 may include a processing unit 502 and a communication unit 503. The processing unit 502 is used to control and manage the operation of the device 500. The communication unit 503 is used to support communication between the device 500 and other devices. Optionally, the communication unit 503 is also called a transceiver unit, and may include a receiving unit and / or a sending unit, respectively used to perform receiving and sending operations. The device 500 may also include a storage unit 501 for storing the program code and / or data of the device 500.
[0220] (1) The device 500 can be the first communication device in the above embodiments. The processing unit 502 can support the device 500 in performing the actions of the first communication device in the above method embodiments. Alternatively, the processing unit 502 mainly performs the internal actions of the first communication device in the method embodiments, and the communication unit 503 can support communication between the device 500 and other devices.
[0221] For example, in one embodiment, processing unit 502 is configured to: generate a first signal according to a first sequence; communication unit 503 is configured to: send the first signal; wherein the nth element of the first sequence is obtained based on a first value and a second value, the first value is obtained based on the sum of at least one element in a first set, and the second value is obtained based on the sum of at least one element in a second set; n = 0, 1, 2...L-1, L = 2 l Or L=2l -1, where l is an integer greater than or equal to 1.
[0222] In one possible design, the communication unit 503 is further configured to: receive first information, the first information being used to indicate P(k), k = 0, 1, ..., l-1.
[0223] In one possible design, the processing unit 502 is specifically used to: obtain a second sequence based on the first sequence; generate the first signal based on the second sequence mapped onto frequency domain resources; wherein the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2...L-1;
[0224] Where α is a positive integer; β = 1, or β is a complex constant, or or C represents the cyclic shift value.
[0225] In one possible design, processing unit 502 is specifically configured to: obtain a third sequence based on the first sequence; generate the first signal based on the third sequence mapped onto frequency domain resources; wherein the first sequence is denoted as x(n), the third sequence is denoted as z(n), n = 0, 1, 2...L-1; z(n) = I(n) + jQ(n)
[0226] Among them, I(n) and Q(n) are obtained from x(n).
[0227] In one possible design, the processing unit 502 is specifically configured to: obtain the number of frequency domain resources, which are used to carry the first signal; truncate the first sequence according to the number of frequency domain resources to obtain a fourth sequence; and generate the first signal according to the fourth sequence.
[0228] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1, and the fourth sequence is denoted as x′(m), m = 0, 1, 2, ..., M-1; M is the number of frequency domain resources, and M is less than L; x′(m) = x((m+N) Cs )modL)
[0229] Where, N Cs It is an integer.
[0230] (2) The device 500 can be the second communication device in the above embodiments. The processing unit 502 can support the device 500 in performing the actions of the second communication device in the above method embodiments. Alternatively, the processing unit 502 mainly performs the internal actions of the second communication device in the method embodiments, and the communication unit 503 can support communication between the device 500 and other devices.
[0231] For example, in one embodiment, the communication unit 503 receives a first signal; the processing unit 502 is configured to: obtain a first sequence based on the first signal; wherein the nth element of the first sequence is obtained based on a first value and a second value, the first value being obtained based on the sum of at least one element in a first set, and the second value being obtained based on the sum of at least one element in a second set; wherein n = 0, 1, 2...L-1, L = 2 l Or L=2 l -1, where l is an integer greater than or equal to 1.
[0232] In one possible design, the communication unit 503 is also used to: send first information, the first information being used to indicate P(k), k = 0, 1, ..., l-1.
[0233] In one possible design, the processing unit 502 is specifically used to: obtain a second sequence mapped onto frequency domain resources based on the first signal; and obtain the first sequence based on the second sequence; wherein the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2...L-1;
[0234] Where α is a positive integer; β = 1, or β is a complex constant, or or C represents the cyclic shift value.
[0235] In one possible design, processing unit 502 is specifically configured to: obtain a third sequence mapped onto frequency domain resources based on the first signal; and obtain the first sequence based on the third sequence; wherein the first sequence is denoted as x(n), the third sequence is denoted as z(n), n = 0, 1, 2, ..., L-1; z(n) = I(n) + jQ(n).
[0236] Among them, I(n) and Q(n) are obtained from x(n).
[0237] In one possible design, the processing unit 502 is specifically configured to: obtain a fourth sequence based on the first signal, the fourth sequence being a part of the first sequence.
[0238] In one possible design, the first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1, and the fourth sequence is denoted as x′(m), m = 0, 1, 2, ..., M-1, where M is less than L; x′(m) = x((m+N) Cs )modL)
[0239] Where, N Cs It is an integer.
[0240] It should be understood that the division of units in the above device is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, all units in the device can be implemented entirely through software calls from processing elements; all units can be implemented entirely in hardware; or some units can be implemented through software calls from processing elements, and some units can be implemented in hardware. For example, each unit can be a separate processing element, or it can be integrated into a chip within the device. Alternatively, it can be stored as a program in memory, called and executed by a processing element of the device. Moreover, these units can be fully or partially integrated together, or implemented independently. The processing element mentioned here can also be called a processor, which can be an integrated circuit with signal processing capabilities. In the implementation process, the operations of the above methods or the various units mentioned above can be implemented through integrated logic circuits in the processor element or through software calls from processing elements.
[0241] In one example, a unit in any of the above devices can be one or more integrated circuits configured to implement the methods described above, such as: one or more application-specific integrated circuits (ASICs), or one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these forms of integrated circuits. As another example, when a unit in the device can be implemented in the form of a processing element scheduler, the processing element can be a processor, such as a general-purpose central processing unit (CPU), or other processor capable of calling programs. Furthermore, these units can be integrated together and implemented as a System-on-a-Chip (SoC).
[0242] The receiving unit described above is an interface circuit of the device, used to receive signals from other devices. For example, when the device is implemented as a chip, the receiving unit is an interface circuit for the chip to receive signals from other chips or devices. The transmitting unit described above is an interface circuit of the device, used to transmit signals to other devices. For example, when the device is implemented as a chip, the transmitting unit is an interface circuit for the chip to transmit signals to other chips or devices.
[0243] Based on the same technical concept, this application also provides a communication device for implementing the functions of the first or second communication device described above. As shown in FIG6, the device may be a communication equipment or a chip within a communication equipment. The device includes a processor 601 and a communication interface 602, and optionally, a memory 603. FIG6 only shows the main components of the communication device. In addition to the processor 601 and the communication interface 602, the communication device may further include a memory 603 and an input / output device (not shown in the figure).
[0244] The processor 601 is used to execute the program code stored in the memory 603, specifically to perform the actions of the processing unit 502 described above, which will not be described in detail here. The communication interface 602 is specifically used to perform the actions of the communication unit 503 described above, which will not be described in detail here.
[0245] Processor 601 can be a CPU, a digital processing unit, etc. Processor 601 can be used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data, such as, but not limited to, baseband-related processing. Communication interface 602 can be used for transmitting and receiving signals, such as, but not limited to, radio frequency transceiver. The above-mentioned devices can be disposed on separate chips, or at least partially or entirely on the same chip. For example, processor 601 can be further divided into an analog baseband processor and a digital baseband processor. The analog baseband processor can be integrated with the transceiver on the same chip, while the digital baseband processor can be disposed on a separate chip. With the continuous development of integrated circuit technology, more and more devices can be integrated on the same chip. For example, a digital baseband processor can be integrated with multiple application processors (such as, but not limited to, graphics processors, multimedia processors, etc.) on the same chip. Such a chip can be called a system-on-a-chip (SoC). Whether to dispose of the devices independently on different chips or integrate them on one or more chips often depends on the specific needs of the product design. This embodiment of the invention does not limit the specific implementation of the above-mentioned devices.
[0246] The communication interface 602 can be a transceiver, an interface circuit such as a transceiver circuit, or a transceiver chip, etc. Optionally, the communication interface 602 may include radio frequency (RF) circuitry and an antenna. The RF circuitry is mainly used for converting baseband signals to RF signals and processing RF signals. The antenna is mainly used for transmitting and receiving RF signals in the form of electromagnetic waves. Input / output devices, such as touch screens, displays, and keyboards, are mainly used for receiving user input data and outputting data to the user.
[0247] Memory 603 is used to store programs executed by processor 601. Memory 603 can be non-volatile memory, such as a hard disk drive (HDD) or solid-state drive (SSD), or it can be volatile memory, such as random-access memory (RAM). Memory 603 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited to this.
[0248] When the communication device is powered on, the processor 601 can read the software program in the memory 603, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 601 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit then performs RF processing on the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 601. The processor 601 converts the baseband signal into data and processes the data.
[0249] In another implementation, the radio frequency circuitry and antenna can be set up independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuitry and antenna can be arranged remotely, independent of the communication device.
[0250] This embodiment does not limit the specific connection medium between the communication interface 602, processor 601, and memory 603. In Figure 6, the memory 603, processor 601, and communication interface 602 are connected via a bus 604, which is represented by a thick line. The connection methods between other components are merely illustrative and not intended to be limiting. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, only one thick line is used in Figure 6, but this does not imply that there is only one bus or one type of bus.
[0251] Optionally, the communication device described above can be a standalone device or part of a larger device. For example, the communication device can be:
[0252] (1) An independent integrated circuit (IC), or chip, or chip system or subsystem;
[0253] (2) A collection of one or more ICs, optionally including a storage component for storing data and instructions;
[0254] (3) Application-specific integrated circuit (ASIC), such as modem;
[0255] (4) Modules that can be embedded in other devices;
[0256] (5) Receivers, smart terminals, wireless devices, handheld devices, mobile units, vehicle-mounted devices, cloud devices, artificial intelligence devices, etc.;
[0257] (6) Others, etc.
[0258] In this application embodiment, "multiple" can refer to two or more. Therefore, in this application embodiment, "multiple" can also be understood as "at least two". "At least one" can be understood as one or more, such as one, two, or more. For example, "including at least one" means including one, two, or more. For example, including at least one of A, B, and C, then it could include A, B, C, A and B, A and C, B and C, or A, B, and C. "And / or" describes the association relationship between related objects. Specifically, there can be three relationships. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / ", unless otherwise specified, generally indicates that the preceding and following related objects have an "or" relationship.
[0259] Furthermore, the terms "system" and "network" in the embodiments of this application can be used interchangeably, as can "according to" and "based on". The ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are generally used to distinguish different objects and are not used to limit the order, sequence, priority, or importance of multiple objects. For example, the first communication device and the second communication device in the embodiments of this application are used to distinguish between two communication devices, and do not limit the priority or importance of these two communication devices.
[0260] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0261] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.
[0262] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.
[0263] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.
Claims
1. A communication method, characterized in that, The method includes: Generate a first signal based on the first sequence; Send the first signal; Wherein, the nth element of the first sequence is obtained based on a first value and a second value, the first value being obtained based on the sum of at least one element in the first set, and the second value being obtained based on the sum of at least one element in the second set; n = 0, 1, 2, ..., L-1, L = 2 l Or L=2 l -1, where l is an integer greater than or equal to 1.
2. The method according to claim 1, characterized in that, The first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1; Where {Z0(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z1(n, m)} represents the second set, m = 0, 1, ..., l-2; This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
3. The method according to claim 2, characterized in that, L=2 l ; Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1.
4. The method according to claim 2, characterized in that, L=2 l -1; Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1.
5. The method according to claim 1, characterized in that, The first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1; Where {Z(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z(n, m)Z(n, m+1)} represents the second set, m = 0, 1, ..., l-2; This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
6. The method according to claim 5, characterized in that, L=2 l ; Z=UT Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
7. The method according to claim 5, characterized in that, L=2 l -1; Z=UT Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
8. The method according to claim 5, characterized in that, L=2 l ; Z=TU Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l A matrix with 1 row and 1 column; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
9. The method according to claim 5, characterized in that, L=2 l -1; Z; TU Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
10. The method according to any one of claims 2 to 9, characterized in that, The method further includes: Receive first information, which is used to indicate P(k), k = 0, 1, ..., l-1.
11. The method according to any one of claims 1 to 10, characterized in that, Based on the first sequence, a first signal is generated, including: Based on the first sequence, the second sequence is obtained; The first signal is generated based on the second sequence mapped onto frequency domain resources; Wherein, the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2, ..., L-1; Where α is a positive integer; β = 1, or β is a complex constant, or or C represents the cyclic shift value.
12. The method according to any one of claims 1 to 10, characterized in that, Based on the first sequence, a first signal is generated, including: Based on the first sequence, the third sequence is obtained; The first signal is generated based on the third sequence mapped onto the frequency domain resources; Wherein, the first sequence is denoted as x(n), the third sequence is denoted as z(n), and n = 0, 1, 2, ..., L-1; z(n) = I(n) + jQ(n) Among them, I(n) and Q(n) are obtained from x(n).
13. The method according to any one of claims 1 to 10, characterized in that, Based on the first sequence, a first signal is generated, including: Obtain the quantity of frequency domain resources, which are used to carry the first signal; Based on the quantity of frequency domain resources, the first sequence is truncated to obtain the fourth sequence; The first signal is generated according to the fourth sequence.
14. A communication method, characterized in that, The method includes: Receive the first signal; Based on the first signal, a first sequence is obtained; Wherein, the nth element of the first sequence is obtained based on a first value and a second value, the first value being obtained based on the sum of at least one element in the first set, and the second value being obtained based on the sum of at least one element in the second set; Where n = 0, 1, 2, ..., L-1, L = 2 l Or L=2 l -1, where l is an integer greater than or equal to 1.
15. The method according to claim 14, characterized in that, The first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1; Where {Z0(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z1(n, m)} represents the second set, m = 0, 1, ..., l-2; This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
16. The method according to claim 15, characterized in that, L=2 l ; Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1.
17. The method according to claim 15, characterized in that, L=2 l -1; Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1.
18. The method according to claim 14, characterized in that, The first sequence is denoted as x(n), n = 0, 1, 2, ..., L-1; Where {Z(n, k)} represents the first set, k = 0, 1, ..., l-1; {Z(n, m)Z(n, m+1)} represents the second set, m = 0, 1, ..., l-2; This represents the first value. Let α represent the second value, where α is a positive integer, and P(k)∈{0,1,…,2}. α -1}.
19. The method according to claim 18, characterized in that, L=2 l ; Z=UT Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
20. The method according to claim 18, characterized in that, L=2 l -1; Z=UT Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is a square matrix with l rows and l columns, T(p, q)∈{0,1}, and each row and each column has only one element with a value of 1, p=0,1,…,l-1, q=0,1,…,l-1.
21. The method according to claim 18, characterized in that, L=2 l ; Z=TU Where i = 0, 1, ..., 2 l -1, j = 0, 1, ..., l-1; U represents 2 l A matrix with 1 row and 1 column; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
22. The method according to claim 18, characterized in that, L=2 l -1; Z; TU Where i = 0, 1, ..., 2 l -2, j = 0, 1, ..., l-1; U represents 2 l A matrix with -1 rows and l columns; T is 2. l row and 2 l A square matrix of columns, T(p, q) ∈ {0, 1}, where each row and each column has only one element with the value 1, and p = 0, 1, ..., 2. l -1, q = 0, 1, ..., 2 l -1.
23. The method according to any one of claims 15 to 22, characterized in that, The method further includes: Send a first message, which is used to indicate P(k), k = 0, 1, ..., l-1.
24. The method according to any one of claims 14 to 23, characterized in that, Based on the first signal, a first sequence is obtained, including: Based on the first signal, a second sequence mapped onto frequency domain resources is obtained; The first sequence is obtained based on the second sequence; Wherein, the first sequence is denoted as x(n), the second sequence is denoted as y(n), and n = 0, 1, 2, ..., L-1; Where α is a positive integer; β = 1, or β is a complex constant, or or C represents the cyclic shift value.
25. The method according to any one of claims 14 to 23, characterized in that, Based on the first signal, a first sequence is obtained, including: Based on the first signal, a third sequence mapped onto the frequency domain resources is obtained; The first sequence is obtained based on the third sequence; Wherein, the first sequence is denoted as x(n), the third sequence is denoted as z(n), and n = 0, 1, 2, ..., L-1; z(n) = I(n) + jQ(n) Among them, I(n) and Q(n) are obtained from x(n).
26. The method according to any one of claims 14 to 23, characterized in that, Based on the first signal, a first sequence is obtained, including: Based on the first signal, a fourth sequence is obtained, which is a part of the first sequence.
27. A communication device, characterized in that, The device includes a processor coupled to a memory in which a computer program is stored; the processor is configured to invoke part or all of the computer program in the memory such that the method as described in any one of claims 1 to 26 is executed.
28. A communication system, characterized in that, The communication system includes a first communication device and a second communication device, wherein the first communication device is used to perform the method as described in any one of claims 1 to 13, and the second communication device is used to perform the method as described in any one of claims 14 to 26.
29. A computer-readable storage medium, characterized in that, The storage medium stores a computer program that, when some or all of the computer program is executed by a computer, causes the method described in any one of claims 1 to 26 to be performed.
30. A computer program product, characterized in that, When the computer reads and executes the computer program product, the method described in any one of claims 1 to 26 is performed.