Communication method, and apparatus

Abstract

The present application belongs to the technical field of communications, and provides a communication method and an apparatus. The method comprises: repeating a first sequence for r times to obtain a second sequence, the length of the first sequence being M0, M0 being a positive integer, r being a positive integer, the length of the second sequence being M, and M＝M0*r; and sending a first signal, the first signal being used for bearing the second sequence and a third sequence, and frequency division multiplexing being present between the second sequence and the third sequence. The second sequence can be obtained by repeating the first sequence for r times. Compared with the solution of first performing an r fold up-sampling on a time domain sequence having the length of M0, and then performing an M-point DFT, the described solution avoids the need for an M-point DFT, thereby reducing processing complexity and processing overhead.

Description

Communication method and apparatus

[0001] This application claims priority to the Chinese Patent Application No. 202410650263.0, filed on May 23, 2024, and entitled "Communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

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

[0003] A signal carrying data is sent from a sending end, passes through a transmission channel, and is received at a receiving end. Due to the changes (e.g., noise, fading, etc.) that the signal may undergo in the transmission channel, the received signal may differ from the sent signal. In order to accurately restore the correct signal, it is necessary to understand which changes the signal has undergone in the transmission process, and therefore a reference signal (RS) is introduced to help the receiving end to estimate the channel characteristics. However, this increases the processing complexity and processing overhead of the sending end.

[0004] Therefore, how to reduce the processing complexity and processing overhead of the sending end is a problem to be solved. SUMMARY

[0005] The present application provides a communication method and apparatus, which can reduce the complexity and processing overhead of the sending end in processing signals.

[0006] In a first aspect, a communication method is provided. The execution subject of the method provided in the first aspect can be a first apparatus. In the absence of special description, the first apparatus in the present application can refer to the first apparatus itself (e.g., a network device or a terminal device), or a component (e.g., a processor, a chip, or a chip system, etc.) in the first apparatus, or a logic module or software that can realize all or part of the functions of the first apparatus. For ease of description, the first apparatus is described below as an example.

[0007] The method can include: repeating a first sequence r times to obtain a second sequence, the length of the first sequence being M0, M0 being a positive integer, r being a positive integer, the length of the second sequence being M, M = M0*r; and sending a first signal, the first signal being used to carry the second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed.

[0008] Based on the above scheme, the second sequence can be obtained by repeating the first sequence r times. Compared with the scheme of first performing r times upsampling on the time domain sequence of M0 length, and then performing M-point discrete Fourier transform (DFT) to construct the second sequence, the above scheme avoids performing M-point DFT, thereby reducing the processing complexity and processing overhead.

[0009] In some implementations, the time domain sequence corresponding to the third sequence is time division multiplexed with the time domain sequence corresponding to the second sequence.

[0010] Based on the above scheme, the second sequence and the third sequence are not only frequency division multiplexed in the frequency domain, but also time division multiplexed between the time domain sequences corresponding to the second sequence and the third sequence. The time division multiplexing between the time domain sequence corresponding to the second sequence and the time domain sequence corresponding to the third sequence can reduce the peak to average power ratio (PAPR) of the first signal.

[0011] In some implementations, the third sequence is a data sequence, and the second sequence is a pilot sequence.

[0012] In some implementations, the first sequence is a sequence 1 with respect to PAPR.

[0013] In some implementations, the first sequence is generated according to a Zadoff-Chu (ZC) sequence.

[0014] In some implementations, the first sequence satisfies:

[0015] wherein, is an element in the first sequence Q sub , j is an imaginary number, q is a root index, q is coprime with M0, 1≤q

[0016] In some implementations, the first sequence is generated according to N ZC , N ZC is the largest prime number less than or equal to pM0, or is the smallest prime number greater than or equal to M0, 0

[0017] In some implementations, the first sequence satisfies:

[0018] wherein, is an element in the first sequence Q sub , j is an imaginary number, q is a root index, q is coprime with N ZC , and L is an integer.

[0019] Based on the above scheme, the first sequence can be generated in the frequency domain and constant modulus. The scheme repeats the first sequence r times to obtain the second sequence. In the case of constant modulus of the first sequence, the second sequence is also constant modulus, which helps to improve the channel estimation performance.

[0020] In some implementations, the first sequence is sequence 2 with respect to PAPR.

[0021] In some implementations, the first sequence is determined according to a first π / 2-binary phase shift keying (BPSK) sequence.

[0022] In some implementations, the first sequence is obtained by performing DFT on a first π / 2-BPSK sequence of length M0.

[0023] In some implementations, the third sequence is determined according to a second π / 2-BPSK sequence and a phase rotation of an odd multiple of π / 4.

[0024] Based on the above scheme, the phase rotation of an odd multiple of π / 4 can eliminate the 180-degree phase jump (for example, the phase difference between adjacent two elements in the sequence generated by time division multiplexing is 180 degrees or π) that occurs when the first π / 2-BPSK sequence and the second π / 2-BPSK sequence are time division multiplexed, thereby reducing the PAPR of the first signal and improving the transmission performance of the first signal.

[0025] In some implementations, the third sequence is determined according to a fourth sequence, and the fourth sequence is obtained by performing a phase rotation of an odd multiple of π / 4 on elements in the second π / 2-BPSK sequence.

[0026] In some implementations, the fourth sequence is obtained by performing a phase rotation of an odd multiple of π / 4 on all elements in the second π / 2-BPSK sequence.

[0027] In some implementations, the fourth sequence satisfies:

[0028] where c is the second π / 2-BPSK sequence, j is an imaginary number, γ is an odd number, is the fourth sequence.

[0029] In some implementations, the fourth sequence includes a first element, and the first element is obtained by performing a phase rotation of π / 4 on a second element in the second π / 2-BPSK sequence, and the phase difference between the second element and an adjacent element in a fifth sequence is π, and the fifth sequence includes the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, and the first π / 2-BPSK sequence is used to determine the first sequence.

[0030] The fifth sequence comprises the second π / 2-BPSK sequence and the first π / 2-BPSK sequence, for example, the fifth sequence is generated by time division multiplexing of the second π / 2-BPSK sequence and the first π / 2-BPSK sequence.

[0031] In some implementations, the first element satisfies:

[0032] wherein d n is the second element.

[0033] In some implementations, the third sequence is determined according to a sixth sequence, and the sixth sequence is obtained by phase tilting the fourth sequence.

[0034] In some implementations, the sixth sequence satisfies:

[0035] wherein c' is the sixth sequence, is the fourth sequence, j is an imaginary number, is an element in e3, δ1 indicates a position of a first element in the third sequence in a seventh sequence, the seventh sequence comprises the second sequence and the third sequence, M sc represents a number of subcarriers corresponding to a transmission bandwidth of the first signal.

[0036] The seventh sequence comprises the second sequence and the third sequence, for example, the seventh sequence is generated by frequency division multiplexing of the second sequence and the third sequence.

[0037] Based on the above scheme, the phase tilting processing is related to δ1, and the PAPR of the first signal can be reduced.

[0038] In some implementations, the number of elements of the third sequence is related to M0 and r.

[0039] In some implementations, the number of elements of the third sequence satisfies: (r-1)M0.

[0040] In a second aspect, a communication method is provided. The execution subject of the method provided in the second aspect can be a second device. In the absence of special description, the second device in the present application can refer to the second device itself (for example, a network device or a terminal device), a component (for example, a processor, a chip, or a chip system) in the second device, or a logic module or software capable of realizing all or part of the functions of the second device. For ease of description, the second device is taken as an example in the following description.

[0041] The method can comprise: receiving a first signal, the first signal carrying a second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed; wherein the second sequence is obtained by repeating a first sequence r times, the first sequence having a length of M0, M0 being a positive integer, r being a positive integer, the second sequence having a length of M, M=M0*r; and determining the third sequence according to the first signal.

[0042] In some implementations, the third sequence is used to determine a second π / 2-BPSK sequence according to a phase rotation of an odd multiple of π / 4.

[0043] In some implementations, the third sequence is used to determine a fourth sequence, the second π / 2-BPSK sequence being obtained by performing a phase rotation of an odd multiple of π / 4 on elements in the fourth sequence.

[0044] In some implementations, the second π / 2-BPSK sequence is obtained by performing a phase rotation of an odd multiple of π / 4 on all elements in the fourth sequence.

[0045] In some implementations, the second π / 2-BPSK sequence satisfies:

[0046] wherein c is the second π / 2-BPSK sequence, j is an imaginary number, γ is an odd number, is the fourth sequence.

[0047] In some implementations, the second π / 2-BPSK sequence comprises a second element, the second element being obtained by performing a phase rotation of π / 4 on a first element in the fourth sequence, a phase difference between the second element and an adjacent element in a fifth sequence being π, the fifth sequence comprising the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, the first π / 2-BPSK sequence being used to determine the first sequence.

[0048] The fifth sequence comprises the second π / 2-BPSK sequence and the first π / 2-BPSK sequence, for example, the fifth sequence being obtained by time division multiplexing the second π / 2-BPSK sequence and the first π / 2-BPSK sequence.

[0049] In some implementations, the first element satisfies:

[0050] wherein d n is the second element.

[0051] In some implementations, the third sequence is used to determine a sixth sequence, the fourth sequence being obtained by performing a phase tilt on the sixth sequence.

[0052] In some implementations, the fourth sequence satisfies:

[0053] where c' is the sixth sequence, is the fourth sequence, j is an imaginary number, is an element in e3, δ1 indicates a position of a first element in the third sequence in a seventh sequence, the seventh sequence includes the second sequence and the third sequence, M sc represents a number of subcarriers corresponding to a transmission bandwidth of the first signal.

[0054] The seventh sequence includes the second sequence and the third sequence, for example, the seventh sequence is generated by frequency division multiplexing the second sequence and the third sequence.

[0055] In some implementations, a number of elements of the third sequence is related to M0 and r.

[0056] In some implementations, a number of elements of the third sequence satisfies: (r-1)M0.

[0057] In a third aspect, a communication apparatus is provided, which includes a processing circuit (or processor) and an input output interface (also referred to as interface circuit), the input output interface being configured to input and / or output a signal, and the processing circuit being configured to perform the first aspect and any possible implementation of the first aspect, or the processing circuit being configured to perform the second aspect and any possible implementation of the second aspect.

[0058] In some implementations, the processing circuit is configured to communicate with other apparatuses via the interface circuit, and perform the first aspect and any possible implementation of the first aspect, or the second aspect and any possible implementation of the second aspect.

[0059] In a fourth aspect, a communication apparatus is provided. The communication apparatus can include units, modules, or means for performing functions of the communication apparatus.

[0060] In some implementations, the communication apparatus can include modules, units, or means for performing the methods / operations / steps / actions described in the first aspect and any possible implementation of the first aspect, which can be hardware circuits, software, or a combination of hardware circuits and software.

[0061] In some embodiments, the communication apparatus comprises a processing unit and a transceiver unit. The processing unit can be configured to repeat a first sequence r times to obtain a second sequence, the first sequence having a length of M0, M0 being a positive integer, r being a positive integer, the second sequence having a length of M, M=M0*r; and the transceiver unit can be configured to transmit a first signal, the first signal being configured to carry the second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed.

[0062] In some embodiments, the third sequence is time division multiplexed with the second sequence.

[0063] In some embodiments, the third sequence is a data sequence, and the second sequence is a pilot sequence.

[0064] In some embodiments, the first sequence is sequence 1 with respect to PAPR.

[0065] In some embodiments, the first sequence is generated according to a ZC sequence.

[0066] In some embodiments, the first sequence satisfies:

[0067] wherein, is an element in the first sequence Q sub , j is an imaginary number, q is a root index, q is coprime with M0, 1≤q

[0068] In some embodiments, the first sequence is generated according to N ZC , N ZC is a largest prime number less than or equal to pM0, or a smallest prime number greater than or equal to M0, 0

[0069] In some embodiments, the first sequence satisfies:

[0070] wherein, is an element in the first sequence Q sub , j is an imaginary number, q is a root index, q is coprime with N ZC , and L is an integer.

[0071] In some embodiments, the first sequence is sequence 2 with respect to PAPR.

[0072] In some embodiments, the first sequence is determined according to a first π / 2-BPSK sequence.

[0073] In some embodiments, the third sequence is determined according to a second π / 2-BPSK sequence and a phase rotation of an odd multiple of π / 4.

[0074] In some implementations, the third sequence is determined according to a fourth sequence, the fourth sequence being obtained by performing phase rotation of an odd multiple of π / 4 on elements in the second π / 2-BPSK sequence.

[0075] In some implementations, the fourth sequence is obtained by performing phase rotation of an odd multiple of π / 4 on all elements in the second π / 2-BPSK sequence.

[0076] In some implementations, the fourth sequence satisfies:

[0077] where c is the second π / 2-BPSK sequence, j is an imaginary number, γ is an odd number, is the fourth sequence.

[0078] In some implementations, the fourth sequence includes a first element, the first element being obtained by performing phase rotation of π / 4 on a second element in the second π / 2-BPSK sequence, the second element having a phase difference of π between adjacent elements in a fifth sequence, the fifth sequence including the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, the first π / 2-BPSK sequence being used to determine the first sequence.

[0079] In some implementations, the first element satisfies:

[0080] where d n is the second element.

[0081] In some implementations, the third sequence is determined according to a sixth sequence, the sixth sequence being obtained by performing phase tilting on the fourth sequence.

[0082] In some implementations, the sixth sequence satisfies:

[0083] where c' is the sixth sequence, is the fourth sequence, j is an imaginary number, is an element in e3, δ1 indicates a position of a first one of elements in the third sequence in a seventh sequence, the seventh sequence including the second sequence and the third sequence, M sc represents a number of subcarriers corresponding to a transmission bandwidth of the first signal.

[0084] In some implementations, a number of elements of the third sequence is related to M0 and r.

[0085] In some implementations, the number of elements of the third sequence satisfies: (r-1)M0.

[0086] In some embodiments, the communication apparatus can include a module, unit, or means for performing the method / operation / step / action described in the second aspect and any possible implementation manner of the second aspect, which can be hardware circuit, software, or a combination of hardware circuit and software.

[0087] In some embodiments, the communication apparatus includes a transceiver and a processing unit. The transceiver can be configured to receive a first signal, the first signal carrying a second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed, wherein the second sequence is obtained by repeating a first sequence r times, the first sequence having a length of M0, M0 being a positive integer, r being a positive integer, the second sequence having a length of M, M=M0*r; and the processing unit can be configured to determine the third sequence based on the first signal.

[0088] In some embodiments, the third sequence is used to determine a second π / 2-BPSK sequence based on a phase rotation of an odd multiple of π / 4.

[0089] In some embodiments, the third sequence is used to determine a fourth sequence, the second π / 2-BPSK sequence being obtained by performing a phase rotation of an odd multiple of π / 4 on elements in the fourth sequence.

[0090] In some embodiments, the second π / 2-BPSK sequence is obtained by performing a phase rotation of an odd multiple of π / 4 on all elements in the fourth sequence.

[0091] In some embodiments, the second π / 2-BPSK sequence satisfies:

[0092] wherein c is the second π / 2-BPSK sequence, j is an imaginary number, γ is an odd number, is the fourth sequence.

[0093] In some embodiments, the second π / 2-BPSK sequence includes a second element, the second element being obtained by performing a phase rotation of π / 4 on a first element in the fourth sequence, a phase difference between the second element and an adjacent element in a fifth sequence being π, the fifth sequence including the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, the first π / 2-BPSK sequence being used to determine the first sequence.

[0094] In some embodiments, the first element satisfies:

[0095] wherein d n is the second element.

[0096] In some implementations, the third sequence is used to determine a sixth sequence, and the fourth sequence is obtained by phase tilting the sixth sequence.

[0097] In some implementations, the third sequence is used to determine a sixth sequence, and the fourth sequence is obtained by phase tilting the sixth sequence.

[0098] In some implementations, the fourth sequence satisfies:

[0099] where c' is the sixth sequence, is the fourth sequence, j is an imaginary number, is an element in e3, δ1 indicates a position of a first element in the third sequence in a seventh sequence, the seventh sequence including the second sequence and the third sequence, M sc represents a number of subcarriers corresponding to a transmission bandwidth of the first signal.

[0100] In some implementations, a number of elements of the third sequence is related to M0 and r.

[0101] In some implementations, the number of elements of the third sequence satisfies: (r-1)M0.

[0102] In a fifth aspect, a computer-readable storage medium is provided, and the computer-readable storage medium has stored thereon a computer program or instructions, which, when executed by a processor, cause the first aspect and any possible method of the first aspect to be performed (or implemented), or cause the second aspect and any possible method of the second aspect to be performed (or implemented).

[0103] In a sixth aspect, a computer program product is provided, and the computer program product contains a computer program or instructions, which, when executed by a processor, cause the first aspect and any possible method of the first aspect to be performed (or implemented), or cause the second aspect and any possible method of the second aspect to be performed (or implemented).

[0104] In a seventh aspect, a communication apparatus is provided, and the communication apparatus includes a processor configured to cause the first aspect and any possible method of the first aspect to be performed (or implemented), or cause the second aspect and any possible method of the second aspect to be performed (or implemented) by executing a computer program (or computer executable instructions) stored in a memory and / or by a logic circuit.

[0105] In a possible implementation, the apparatus further includes a memory. In a possible implementation, the processor and the memory are integrated together. In another possible implementation, the memory is located outside the communication apparatus. The processor can include one or more.

[0106] In a possible implementation, the communication apparatus further includes a communication interface for the communication apparatus to communicate with other devices, such as transmitting or receiving data and / or signals. Exemplarily, the communication interface can be a transceiver, a circuit, a bus, a module, or other types of communication interfaces.

[0107] In an implementation, the communication apparatus of the third aspect, the fourth aspect, or the seventh aspect can be a chip or a chip system.

[0108] An eighth aspect provides a chip including a processor configured to invoke a computer program or computer instructions in a memory, so that the processor performs or implements any of the implementation manners of the first aspect, or so that the processor performs or implements any of the implementation manners of the second aspect.

[0109] In some implementation manners, the processor is coupled with the memory through an interface.

[0110] A ninth aspect provides a communication system including a first apparatus configured to perform the first aspect and any of the possible implementation manners of the first aspect, and a second apparatus configured to perform the second aspect and any of the possible implementation manners of the second aspect.

[0111] The description of the beneficial effects of any of the second aspect to the ninth aspect can refer to the description of the beneficial effects of the first aspect. BRIEF DESCRIPTION OF DRAWINGS

[0112] FIG. 1 is a schematic diagram of a communication system 100.

[0113] FIG. 2 is a schematic diagram of a new radio (NR) orthogonal frequency division multiplexing (OFDM) system.

[0114] FIG. 3 is a schematic diagram of some demodulation reference signal (DMRS) resource configurations.

[0115] FIG. 4 is a schematic diagram of some pilot and data frequency division multiplexing (FDM).

[0116] FIG. 5 is a schematic diagram of another pilot and data FDM.

[0117] FIG. 6 is a schematic flow chart of a communication method according to an embodiment of the present application.

[0118] FIG. 7 is a schematic diagram of some π / 2-BPSK symbols according to an embodiment of the present application.

[0119] FIG. 8 is a schematic flow chart of another communication method according to an embodiment of the present application.

[0120] FIG. 9 is a schematic diagram of another π / 2-BPSK symbols according to an embodiment of the present application.

[0121] FIG. 10 is a schematic diagram of a power distribution according to an embodiment of the present application.

[0122] FIG. 11 is a schematic block diagram of a communication apparatus according to an embodiment of the present application.

[0123] FIG. 12 is a schematic block diagram of another communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0124] The technical solutions in the present application will be described below with reference to the accompanying drawings.

[0125] The present application will present various aspects, embodiments or features around a system which can include a plurality of devices, components, modules, etc. Each system can include devices, components, modules, etc. other than those illustrated and / or can not include all of the devices, components, modules, etc. discussed in connection with the accompanying drawings.

[0126] In the embodiments of the present application, the words "exemplary", "for example", etc. can be used to mean example, instance, or illustration, in order to convey a conception that a specific embodiment or implementation, or aspect thereof, is used as a non-limiting example. Any embodiment or implementation described as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments or implementations.

[0127] The service scenarios described in the embodiments of the present application are for more clearly illustrating the technical solutions of the embodiments of the present application, and do not constitute a limitation to the technical solutions provided by the embodiments of the present application. It can be known by those skilled in the art that, with the appearance of new service scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0128] Reference within the specification to "one embodiment" or "an embodiment" or "some embodiments" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the application. The appearances of the phrase "in one embodiment" or "in some embodiments" within the specification are not necessarily all referring to the same embodiment, however, it is contemplated that the features, structures, or characteristics of one embodiment can be combined with those of another embodiment in any suitable manner. The terms "including", "containing", "comprising", and "having" are used herein to mean "including but not limited to".

[0129] The terms "first", "second", and the like, as used in the description of the application, do not imply any particular order, but are used for the purpose of distinguishing between the different elements, and are not meant to be a limitation on the present application.

[0130] It should be understood that the size of the serial number of each process in various embodiments of the application does not mean the order of execution, and the execution order of each process should be determined according to its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the application.

[0131] It can be understood that the term "and / or" in this article is only a description of the association relationship between the associated objects, which means that there can be three relationships, for example, A and / or B, which can represent the existence of A alone, the existence of A and B together, and the existence of B alone. In addition, the character " / " in this article generally represents that the front and rear associated objects are a "or" relationship.

[0132] The technical solutions of the embodiments of the application can be applied to various communication systems, including but not limited to: long term evolution (LTE) system, NR system and other fifth generation (5 th generation,5G) mobile communication system, narrow band internet of things (NB-IoT) system, enhanced machine type communication (eMTC) system, enhanced mobile broadband (eMBB) system, ultra reliable low latency communication (URLLC) system, satellite communication system, LTE-machine-to-machine (LTE-M) system, or sixth generation (6 thFuture communication systems after 5G (e.g., 6G) mobile communication systems, etc.

[0133] In embodiments of the present application, the term "communication" can also be described as "data transmission", "signal transmission", "information transmission" or "transmission", etc. In embodiments of the present application, transmission can include sending or receiving. Illustratively, transmission can be uplink transmission, for example, the terminal device can send a signal to the network device; transmission can also be downlink transmission, for example, the network device can send a signal to the terminal device; transmission can also be sidelink transmission, for example, the terminal device can send a signal to another terminal device. Illustratively, "transmission" can be air interface level transmission, or can be signal sending at chip input (I) / output (O) port, rather than air interface level transmission.

[0134] FIG. 1 is a schematic diagram of a communication system 100. As shown in FIG. 1, the communication system 100 includes a radio access network 110 and a core network 120. Optionally, the communication system 100 can also include an Internet 130. The radio access network 110 can include at least one network device (e.g., 111a and 111b in FIG. 1) and at least one terminal device (e.g., 112a-112j in FIG. 1). The terminal device is connected to the network device in a wireless manner. The network device is connected to the core network 120 in a wireless or wired manner. The core network 120 can include one or more core network devices. The core network device and the network device can be independent and different physical devices, or the functions of the core network device and the logical functions of the network device can be integrated on the same physical device, or a physical device can integrate part of the functions of the core network device and part of the functions of the network device. The terminal device and the terminal device, and the network device and the network device can be connected to each other in a wired or wireless manner. The terminal device and the terminal device, the network device and the network device, and the terminal device and the network device can communicate with each other in a wireless manner through air interface resources. Illustratively, the air interface resources can include at least one of time domain resources, frequency domain resources, code resources and space resources. FIG. 1 is only a schematic diagram, and the communication system 100 can also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG. 1.

[0135] The network device can be any device with wireless transceiver function, for example, the network device can be a base station for accessing terminal devices to a radio access network (RAN). The network device can also be referred to as an access network device or an access network node. It can be understood that in systems using different wireless access technologies, the names of devices with network device functions may vary. For the convenience of description, the apparatuses providing wireless communication access functions for terminal devices in the embodiments of the present application are collectively referred to as base stations. In the embodiments of the present application, the network device includes but is not limited to various forms of macro base stations (such as 111a in FIG. 1), micro base stations or indoor stations (such as 111b in FIG. 1), pico base stations, small stations, balloon stations, relay stations, access points, etc. The network device can include an evolved node B (eNB or eNodeB) in LTE, an access point (AP) in a wireless fidelity (WiFi) system, a wireless relay node, a wireless backhaul node, a transmission point (TP) or a transmission reception point (TRP), a master eNodeB (MeNB), a secondary eNodeB (SeNB), a multi-standard radio (MSR) node, a home base station, a network controller, etc., and can also include a next generation NodeB (gNB) or a transmission point (TRP or TP) in a 5G system, one or a group of (including multiple antenna panels) antenna panels of a base station in a 5G system, a network node constituting a gNB or a transmission point, such as a baseband unit (BBU) or a distributed unit (DU), and can also include network devices, servers or vehicle-mounted devices, etc. in networks evolved after 5G such as 6G. The network device can also be a module or unit that completes part of the function of the base station, for example, it can be a central unit (CU) or a DU.

[0136] In the embodiments of the present application, the apparatus for implementing the function of the network device can be a network device, or an apparatus capable of supporting the network device to implement the function, such as a chip system, which can be installed in the network device. The chip system can be composed of a chip, or can include a chip and other discrete devices.

[0137] In another possible scenario, a plurality of network devices cooperates to assist a terminal to implement wireless access, and different network devices respectively implement part of functions of a base station. For example, a network device can be a CU, a DU, a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can be included in the same network element, for example, in a BBU. The RU can be included in a radio frequency device or a radio frequency unit, for example, in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0138] In different systems, the CU (or CU-CP and CU-UP), the DU, or the RU can also have different names, but those skilled in the art can understand their meanings. For example, in an open radio access network (O-RAN) system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, the CU-CP, the CU-UP, the DU, and the RU are taken as examples for description in this application. Any one of the CU (or the CU-CP, the CU-UP), the DU, and the RU in this application can be implemented by means of a software module, a hardware module, or a combination of a software module and a hardware module. The embodiments of this application do not limit the specific technology and the specific device form adopted by the network device.

[0139] The terminal device can be a device providing voice and / or data connectivity to users; the terminal device can also be a device having wireless connection function. The terminal device can be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; can also be deployed on water surface (such as ships, etc.); can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The terminal device can also be referred to as user equipment (UE), access terminal, terminal, subscriber unit, subscriber station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, wireless network device, user agent or user apparatus. In the embodiments of the present application, the terminal device includes but is not limited to: cellular phone, mobile phone, wireless data card, wireless modem, pad, laptop computer, notebook computer, palm computer, mobile internet device (MID), computer with wireless transceiver function, cordless phone, session initiation protocol (SIP) phone, smart phone, wireless local loop (WLL) station, personal digital assistant (PDA), handset with wireless communication function, computing device or other device connected to wireless modem, vehicle-mounted device (such as automobile, bicycle, electric vehicle, airplane, ship, train, high-speed rail, etc.), wearable device (such as smart watch, smart bracelet, pedometer, smart glasses, etc.), satellite terminal, terminal device in Internet of Things or Internet of Vehicles, and any form of terminal in future network, relay user equipment or terminal in future evolved public land mobile network (PLMN), etc.The terminal device can also be a virtual reality (VR) device, an augmented reality (AR) device, a smart point of sale (POS) machine, a customer-premises equipment (CPE), a light UE, a reduced capability UE (RedCap UE), a machine type communication (MTC) terminal, a terminal device in industrial control, a terminal device in self driving, a terminal device in remote medical, a terminal device in smart grid, a wireless terminal in transportation safety, a terminal device in smart city, a terminal device in smart home, a haptic terminal device, a smart home device (e.g., a refrigerator, a television, an air conditioner, an electricity meter, etc.), a smart robot, a mechanical arm, a workshop device, a wireless terminal in self driving, or a flight device (e.g., a smart robot, a hot air balloon, a drone, an airplane), and the like. The terminal device can also be a vehicle device, such as a whole vehicle device, a vehicle-mounted module, a road side unit (RSU), a vehicle-mounted chip, an on board unit (OBU), or a telematics box (T-BOX), and the like. The terminal device can also be other devices with terminal functions, for example, the terminal device can also be a device in device to device (D2D) communication. The embodiments of the present application are not limited in this regard.

[0140] In the embodiments of the present application, the device for implementing the function of the terminal device can be a terminal device, or a device capable of supporting the terminal device to implement the function, such as a chip or a chip system, which can be installed in the terminal device. The chip system can be composed of a chip, or can include a chip and other discrete devices. In the technical solutions of the embodiments of the present application, the device for implementing the function of the terminal device is a terminal device, which can also be referred to as a terminal. In the following, the terminal device can be taken as an example of a UE to describe the technical solutions provided in the embodiments of the present application.

[0141] The roles of the base station and the terminal can be relative, for example, the helicopter or the drone 112i in FIG. 1 can be configured as a mobile base station, and for those terminals 112j accessing the wireless access network 110 through 112i, the terminal 112i is a base station; but for the base station 111a, 112i is a terminal, that is, 111a communicates with 112i through a wireless air interface protocol. Of course, 111a and 112i can also communicate through a base station-to-base station interface protocol, in which case 112i is also a base station relative to 111a. Therefore, the base station and the terminal can be collectively referred to as a communication device, and 111a and 111b in FIG. 1 can be referred to as a communication device with a base station function, and 112a-112j in FIG. 1 can be referred to as a communication device with a terminal function.

[0142] The network device and the terminal device can communicate through a wireless link. The transmission link from the network device to the terminal device can be referred to as a downlink (DL) or a downlink channel, which is used to transmit a downlink signal. The transmission link from the terminal device to the network device can be referred to as an uplink (UL) or an uplink channel, which is used to transmit an uplink signal. The transmission link from the terminal device to the terminal device can be referred to as a sidelink (SL) or a sidelink channel.

[0143] FIG. 2 is a schematic diagram of an NR OFDM system. In the figure, optional modules (or steps) in the system are represented by dashed lines. FIG. 2 is exemplary only and does not limit the embodiments of the present application. The embodiments of the present application can be applied to the system shown in FIG. 2, or to a system having more or fewer modules than the system shown in FIG. 2, or to other systems.

[0144] Unless otherwise specified, the embodiments of the present application can use capital letters to represent frequency domain sequences (or signals), and lowercase letters to represent time domain sequences (or signals).

[0145] Referring to FIG. 2, in some examples, a data sequence can include M consecutive frequency domain data S(kM), S(kM+1), …, S(kM+M-1).

[0146] A serial-to-parallel (S / P) module in the transmitting end can convert the data in the above M frequency domains into an M-dimensional data block S k = [S(kM), S(kM+1), …, S(kM+M-1)] T . Wherein, the subscript k can represent the serial number of the OFDM signal (or OFDM symbol); the superscript T can represent transposition. The above M-dimensional data block S k may be understood as a frequency domain sequence.

[0147] By subcarrier mapping, S k The M data carried can be modulated onto M sc of the N subcarriers, obtaining an N-dimensional data vector X k . Wherein, M sc =M, N is a positive integer greater than or equal to M. The (N-M sc ) subcarriers other than the M sc subcarriers in the N subcarriers can be understood as being modulated by data 0. The N-dimensional data vector X k can be understood as a frequency domain sequence.

[0148] The N-dimensional data vector X k can be obtained by N-point inverse discrete Fourier transform (IDFT), obtaining a group of sampling points, which can include N complex time domain sampling points x k =[x k (0), x k (1), …, x k (N-1)] T .

[0149] The above sampling points can be converted into serial data by a parallel-to-serial (P / S) module. Then, after processing by a cyclic prefix (CP) module, a digital to analog converter (DAC), a radio frequency (RF) module, an antenna and the like, the transmission of the OFDM signal is realized.

[0150] The receiving end can obtain the data carried in the signal according to the received OFDM signal by RF module, analog to digital converter (ADC), CP removal module, S / P module, N-point DFT, subcarrier demapping, P / S module and the like.

[0151] In some possible implementation manners, the IDFT can be replaced by inverse fast Fourier transform (IFFT). In some possible implementation manners, the DFT can be replaced by fast Fourier transform (FFT). In the embodiments of the present application, the IDFT and the IFFT can be replaced by each other, and the DFT and the FFT can be replaced by each other, which will not be described herein.

[0152] Referring to FIG. 2, in some examples, the data sequence can include M consecutive time-domain data s(kM), s(kM+1), …, s(kM+M-1).

[0153] The S / P module in the sending end can convert the data in the above M time domains into an M-dimensional data block s k = [s(kM), s(kM+1), …, s(kM+M-1)] T The above M-dimensional data block s k may be understood as a time-domain sequence.

[0154] Before subcarrier mapping, the data block s k to be transmitted in the time domain can be processed by DFT to obtain a frequency-domain sequence S k For example, the DFT module can perform M-point DFT operation on s k to obtain the frequency-domain sequence S k Then, S k may be processed by subcarrier mapping, IDFT, P / S module, CP adding module, DAC, RF module, antenna and the like, so as to realize sending of a DFT-s-OFDM signal.

[0155] When processing the received DFT-s-OFDM signal, the receiving end also correspondingly adds IDFT processing. For example, the position of IDFT can be referred to FIG. 2, which will not be described herein.

[0156] Through DFT operation of the sending end, the DFT-s-OFDM signal has the characteristic of single carrier. DFT-s-OFDM can have a PAPR much lower than that of a multi-carrier signal such as OFDM. Therefore, under the same power amplifier, the signal design based on DFT-s-OFDM can provide greater output power and higher power amplifier efficiency, so as to achieve the purpose of improving coverage and reducing energy consumption.

[0157] Embodiments of the present application are applicable to uplink transmission, downlink transmission and sidelink transmission, etc. For example, in uplink transmission, the above M sc may be replaced by wherein, PUSCH represents physical uplink shared channel (PUSCH). For another example, in downlink transmission, the above M sc may be replaced by wherein, PDSCH represents physical downlink shared channel (PDSCH).

[0158] RS can be a known signal agreed (or configured) by the sending end and the receiving end in advance. RS can change in the transmission channel, thereby obtaining the changed RS'. RS can be transmitted in the transmission channel together with the signal carrying data. After receiving the signal (RS'), the receiving end can compare the difference between RS and RS' to understand the change of the signal carrying data in the transmission channel, perform channel characteristic estimation, and obtain the channel characteristic H. According to the channel characteristic H, the received signal can be restored to the correct signal.

[0159] Exemplarily, RS can include DMRS, sounding reference signal (SRS), positioning reference signal (PRS) or other signals. For example, DMRS can be used for channel estimation in demodulation.

[0160] The resource configuration mode of DMRS is briefly introduced below.

[0161] PUSCH can be used to transmit uplink data. The following describes an example of uplink transmission. However, it is clear to those skilled in the art that the embodiments of the present application are also applicable to downlink transmission, sidelink transmission and other transmissions.

[0162] Exemplarily, DMRS can be used for channel estimation in demodulation of data signals (or data symbols) in PUSCH. DMRS and data symbols can be time-division multiplexed and occupy different time domain units, for example, different symbols. Among them, DMRS signals can not carry data, and data signals can not carry DMRS.

[0163] Exemplarily, DMRS can occupy one or two symbols in the time domain, corresponding to single-symbol DMRS and double-symbol DMRS respectively.

[0164] Exemplarily, the resource configuration of DMRS in the frequency domain can be divided into type 1 and type 2.

[0165] For example, the frequency domain resources of type 1 can be comb-shaped in the frequency domain. The resources of type 1 can be divided into two code division multiplexing (CDM) groups. Code division multiplexing can be used between antenna ports in each CDM group, and the two CDM groups can be offset by 1 subcarrier in the frequency domain. For example, in the case of single-symbol DMRS, the resource configuration of type 1 can support 4 antenna ports, and the antenna ports supported by one CDM group can include {1000, 1001}, and the antenna ports supported by the other CDM group can include {1002, 1003}. For another example, in the case of double-symbol DMRS, the resource configuration of type 1 can support 8 antenna ports, and the antenna ports supported by one CDM group can include {1000, 1001, 1004, 1005}, and the antenna ports supported by the other CDM group can include {1002, 1003, 1006, 1007}.

[0166] For example, the resources of type 2 can be divided into three CDM groups. Code division multiplexing can be used between antenna ports in each CDM group, and the two adjacent CDM groups can be offset by 2 subcarriers in the frequency domain. For example, in the case of single-symbol DMRS, the resource configuration of type 2 can support 6 antenna ports, and the antenna ports supported by the three CDM groups can include {1000, 1001}, {1002, 1003}, and {1004, 1005}, respectively. In the case of double-symbol DMRS, the resource configuration of type 2 can support 12 antenna ports, and the antenna ports supported by the three CDM groups can include {1000, 1001, 1006, 1007}, {1002, 1003, 1008, 1009}, and {1004, 1005, 1010, 1011}, respectively.

[0167] FIG. 3 is a schematic diagram of some DMRS resource configurations. FIG. 3 is merely an example and does not limit the present application. The resource configuration of the pilot signal (or referred to as the reference signal) of the present application can be configured according to the manner shown in FIG. 3, or can be configured in other manners.

[0168] It is assumed that one slot includes 14 symbols and one resource block (RB) includes 12 resource elements (REs). The 12 REs correspond to 12 subcarriers respectively. Or, one RE corresponds to one symbol in the time domain and one subcarrier in the frequency domain. It is assumed that the 14 symbols correspond to indexes 0-13 respectively and the 12 subcarriers correspond to indexes 0-11 respectively. It is assumed that the DMRS and the PUSCH are transmitted after a physical downlink control channel (PDCCH).

[0169] Figure 3(a) shows a schematic diagram of a two-symbol DMRS type 1 resource configuration. Referring to Figure 3(a), one antenna port can have 6 REs in one RB for transmitting DMRS. In a time-frequency resource grid corresponding to one symbol and one RB, one CDM group can occupy even-indexed subcarriers, i.e., subcarrier indexes 0, 2, 4, 6, 8, 10. Another CDM group can occupy odd-indexed subcarriers, i.e., subcarrier indexes 1, 3, 5, 7, 9, 11.

[0170] Figure 3(b) shows a schematic diagram of a two-symbol DMRS type 2 resource configuration. It can be seen that, compared with type 1, the frequency domain resources of type 2 can reduce the frequency domain density of DMRS. One antenna port has 4 REs in one RB for transmitting pilot. In a time-frequency resource grid corresponding to one symbol and one RB, one CDM group can occupy subcarriers with indexes 0, 1, 6, 7, another CDM group can occupy subcarriers with indexes 2, 3, 8, 9, and a further CDM group can occupy subcarriers with indexes 4, 5, 10, 11.

[0171] From Figure 3, it can be seen that, for a single antenna port, whether the resource configuration is type 1 or type 2, the DMRS only occupies part of the subcarriers in one RB, and the unoccupied subcarriers are vacant. In some possible implementation manners, the REs unoccupied by the single antenna port can not be vacant, but used for transmitting single-carrier data. For example, in the frequency domain, the data sequence DFT result can be placed on the vacant REs in Figure 3. In this way, the symbol where the DMRS is located is also used for carrying data, which can improve the spectral efficiency and reduce the demodulation delay. For example, if the symbol where the DMRS is located is only used for carrying the DMRS, and the data is carried on another symbol (for example, the symbol after the symbol where the DMRS is located), the receiving end needs to receive two symbols to start demodulating the data. In the case where the symbol where the DMRS is located is also used for carrying data, the receiving end only needs to receive one symbol to start demodulating the data.

[0172] FIG. 4 is a schematic diagram of some pilot and data FDM. FIG. 4 is merely an example and does not limit the present application. For example, the pilot and data in embodiments of the present application can adopt the FDM manner shown in FIG. 4, or other manners.

[0173] (a) of FIG. 4 shows a scheme of FDM based on single-symbol type 1 DMRS resource. Referring to (a) of FIG. 4, the subcarriers corresponding to odd indexes within one RB can be used to carry pilots (e.g., DMRS), and the remaining subcarriers can be used to carry data symbols. That is, the pilots can be uniformly inserted in the frequency domain resource with a density of 1 / 2, or in other words, every (Δ-1) subcarriers, there is one pilot, and the data can be placed in the middle of the pilots. Uniformly placing the pilots is beneficial to obtaining better channel estimation performance.

[0174] The FDM of the pilots and the data can also be understood as that the pilots are uniformly inserted in the frequency domain resource with a density of 1 / Δ, that is, every (Δ-1) subcarriers, there is one pilot. (a) of FIG. 4 can be regarded as the case of Δ=2. (b) and (c) of FIG. 4 can be regarded as the cases of Δ=3 and Δ=4, respectively.

[0175] Suppose that the subcarrier index in the transmission bandwidth starts from 0, and after FDM, the signal on the transmission bandwidth can be mathematically described as formula 1-1.

[0176] wherein, δ represents the index of the first subcarrier in the transmission bandwidth where the pilot is mapped, and δ can be an integer in the set [0, Δ-1]. can be obtained by upsampling the M0-long pilot sequence {Q m} with a sampling factor of Δ. Wherein, m is an integer taken from 0 to M0-1, or in other words, m=0, 1, …, M0-1. That is, M sc =Δ*M0. Wherein, can satisfy formula 1-2.

[0177] can carry multiplexed frequency domain data, and if (k-δ) is divisible by Δ, then

[0178] It can be understood that in the schemes shown in (b) and (c) of FIG. 4, δ=0.

[0179] FIG. 5 is a schematic diagram of some other pilot and data FDM. FIG. 5 is merely an example and does not limit the present application. For example, the pilot and data in embodiments of the present application can adopt the FDM manner shown in FIG. 5, or other manners.

[0180] In FIG. 5, different frequency domain resources can be represented by different letters, for example, a represents one frequency domain resource, and b represents another frequency domain resource. Different time domain resources can be represented by different numbers, for example, 1 represents one time domain resource, and 2 represents another time domain resource. In this way, a0 and b0 can be elements that are multiplexed on the same time domain resource with different frequency resources. Exemplarily, a0 can represent one element in a pilot sequence; b0 can represent one element in a data sequence.

[0181] (a) of FIG. 5 shows a way of FDM transmission of a multi-stream DFT-s-OFDM signal. In which, a0-a5 can be one stream, for example, a pilot stream; b0-b5 can be another stream, for example, a data stream. In the scheme shown in (a) of FIG. 5, from the input of DFT, each of the time domain resources with indexes 0-5 is FDMed, which can destroy the single carrier characteristic and cause much higher PAPR than single-stream DFT-s-OFDM signal transmission.

[0182] (b) of FIG. 5 shows another way of FDM transmission of a multi-stream DFT-s-OFDM signal. On the basis of FDM, time division multiplexing (TDM) is also used between the two streams. For example, from the input of DFT, the sequences carried by the streams do not overlap in time with each other. The DFT input of the first stream is a0 0 a1 0 a2 0, and the DFT input of the second stream is 0 b0 0 b1 0 b2, so (a0, a1, a2) of the first stream and (b0, b1, b2) of the second stream do not overlap.

[0183] (c) of FIG. 5 shows another way of FDM transmission of a multi-stream DFT-s-OFDM signal. In which, the DFT input of the first stream is a0 a1 a2 0 0 0, and the DFT input of the second stream is 0 0 0 b0 b1 b2, so (a0, a1, a2) of the first stream and (b0, b1, b2) of the second stream do not overlap.

[0184] Exemplarily, the frequency domain signal corresponding to each stream can be mapped in a continuous manner in the frequency domain. However, the present application is not limited thereto, for example, the frequency domain signal corresponding to each stream can also be mapped in a distributed manner in the frequency domain, such as mapping one signal every other subcarrier.

[0185] It is assumed that the length of the final pilot sequence is M. In combination with the description of FIG. 2 and FIG. 5, the sending end needs to up-sample the time-domain sequence of length M0 (for example, r times up-sampling), to obtain a time-domain sequence of length M, and then perform M-point DFT on the time-domain sequence to obtain a frequency-domain sequence of length M. In the above scheme, the sending end performs M-point DFT, and the processing complexity is high and the processing overhead is large.

[0186] Therefore, how to reduce the processing complexity and processing overhead of the sending end is a problem to be solved.

[0187] FIG. 6 is a schematic flowchart of a communication method 600 provided by an embodiment of the present application. The method 600 can reduce the processing complexity and processing overhead of the sending end. The optional operations in the method 600 are shown in dashed lines in FIG. 6. The method 600 will be described below in combination with FIG. 6.

[0188] S610, the first device repeats the first sequence r times to obtain a second sequence.

[0189] In the case where no special description is made, the first device in the present application can refer to the first device itself (for example, a network device or a terminal device), or can refer to a component (for example, a processor, a chip, or a chip system, etc.) in the first device, or can be a logic module or software capable of realizing all or part of the functions of the first device. For the convenience of description, the first device will be described below.

[0190] In some other possible implementation manners, S610 can be replaced by: the first device determines the second sequence according to the first sequence. Or, the first device determines the second sequence according to the first sequence and r. Wherein, the second sequence is obtained by repeating (or circulating) the first sequence r times. Wherein, the second sequence can include r first sequences.

[0191] Optionally, the length of the first sequence is M0. Wherein, M0 can be a positive integer, and r can be a positive integer. Optionally, r can be an integer greater than or equal to 2. Optionally, the length of the second sequence is M. Wherein, M = M0*r. "*" can represent multiplication. "*" can be replaced by "·", "×" or other symbols. "*" can also be omitted. Wherein, r can also be referred to as an up-sampling factor, a factor, or have other names.

[0192] Exemplarily, it is assumed that is an integer from 0 to M0-1. Or, the first sequence is Wherein, is an element in Q sub .

[0193] Repeating the first sequence r times can obtain the second sequence

[0194] The second sequence can also be denoted as Q={Q m wherein m is an integer from 0 to M-1. Alternatively, m=0, 1, …, M-1.

[0195] The first sequence can be a sequence in frequency domain. In one example, the first sequence can be a sequence generated directly in frequency domain. In another example, the first sequence can be obtained from a time domain sequence of length M0 by M0-point DFT.

[0196] Exemplarily, the first sequence can be a pilot sequence. For example, a DMRS sequence or other reference signal RS sequence. The present application does not limit the specific name of the first sequence, and the first sequence can also be referred to as a first pilot sequence / information, a first pilot / RS, or other names.

[0197] The second sequence can be regarded as a sequence in frequency domain. Exemplarily, the second sequence can be a pilot sequence. For example, a DMRS sequence or other reference signal RS sequence. The present application does not limit the specific name of the second sequence, and the second sequence can also be referred to as a second pilot sequence / information, a second pilot / RS, or other names.

[0198] S620, the first device sends the first signal to the second device. Correspondingly, the second device receives the first signal from the first device.

[0199] In the absence of special description, the second device in the present application can refer to the second device itself (for example, a network device or a terminal device), or a component (for example, a processor, a chip, or a chip system, etc.) in the second device, or a logic module or software capable of realizing all or part of the functions of the second device. For the convenience of description, the second device is described below as an example.

[0200] In some other possible implementation manners, S620 can be replaced by: the first device outputs the first signal. Exemplarily, the first device can be applied to a communication device. The first device outputs the first signal can mean that the first device outputs the first signal to outside the communication device. For example, the first device performs air interface level transmission. The first device outputs the first signal can also mean that the first device outputs the first signal to another device inside the communication device but outside the first device. For example, the first device can be a baseband chip, and the baseband chip can output the first signal to a radio frequency chip of the communication device.

[0201] In some possible implementation, S620 can be replaced by: the second device acquires the first signal. Exemplarily, the second device can be applied to a communication device. The second device acquires the first signal can be that the second device acquires the first signal from outside the communication device. For example, the first device performs receiving at air interface level. The second device acquires the first signal can also be that the second device acquires the first signal from another device in the communication device. For example, the first device can be a baseband chip, and the baseband chip can acquire the first signal from a radio frequency chip in the communication device.

[0202] Optionally, the first signal is used to carry the second sequence and the third sequence. Alternatively, the first signal includes the first sequence and the second sequence. Alternatively, the first signal corresponds to the second sequence and the third sequence.

[0203] Exemplarily, the first signal can be a DFT-s-OFDM signal. However, the present application is not limited thereto, and the first signal can also be other signals.

[0204] The third sequence can be regarded as a sequence in the frequency domain. In some possible implementation, the third sequence can be similar to the M-dimensional data block S k Exemplarily, the third sequence can be a data sequence. For example, an uplink data sequence, a downlink data sequence, or a sidelink data sequence. The present application does not limit the specific name of the third sequence, and the third sequence can also be referred to as a sequence, information, data, frequency domain data, or have other names.

[0205] Optionally, the second sequence and the third sequence are frequency division multiplexed. Alternatively, the first device transmits the second sequence and the third sequence in a frequency division multiplexed manner. Exemplarily, the second sequence and the third sequence can be staggered in the frequency domain. For example, in FIG. 4, the pilot part can be regarded as the second sequence, and the data part can be regarded as the third sequence. However, the present application is not limited thereto, and the second sequence and the third sequence can also be frequency division multiplexed in other manners.

[0206] S630, the second device determines the third sequence according to the first signal.

[0207] In some examples, the second device can process the first signal to obtain the third sequence. In other examples, the second device can determine the third sequence according to the second sequence. For example, the second sequence can be a pilot sequence, and the third sequence can be a data sequence. The second device can determine the data sequence according to the pilot sequence. Exemplarily, S630 can refer to the demodulation method of the receiving end in FIG. 2 to determine the third sequence. However, the present application is not limited thereto, and the second device can also determine the third sequence in other manners.

[0208] Based on the above scheme, the second sequence can be obtained by repeating the first sequence r times. Compared with the scheme of first performing r times upsampling on the time domain sequence of length M0, and then performing M-point DFT to construct the second sequence, the above scheme avoids performing M-point DFT, thereby reducing the processing complexity and processing overhead.

[0209] In some possible implementation manners, the time domain sequence corresponding to the third sequence is time division multiplexed with the time domain sequence corresponding to the second sequence.

[0210] It can be understood that the second sequence and the third sequence are not only frequency division multiplexed in the frequency domain, but also time division multiplexed between the time domain sequences corresponding to the second sequence and the third sequence. For example, the time domain sequences corresponding to the second sequence and the third sequence can be staggered in the time domain, for example, similar to the arrangement manner of (b) in FIG. 5. For example, the arrangement manner of (b) in FIG. 5 can also be referred to as TDM manner 1.

[0211] The time domain sequence corresponding to the second sequence (which can be referred to as time domain sequence 1 in the following) can be a sequence obtained by performing IDFT on the second sequence. The time domain sequence 1 can obtain the second sequence by performing DFT. Similarly, the time domain sequence corresponding to the third sequence (which can be referred to as time domain sequence 2 in the following) can be a sequence obtained by performing IDFT on the third sequence. The time domain sequence 2 can obtain the third sequence by performing DFT.

[0212] For ease of understanding, the time division multiplexing between the time domain sequence 1 and the time domain sequence 2 is introduced below in combination with formulas. The following introduction is only exemplary and does not limit the embodiments of the present application.

[0213] Suppose the second sequence is denoted as Q={Q m}, where m is an integer from 0 to M-1. Or, m=0, 1, …, M-1. The time domain sequence corresponding to the second sequence (i.e., the time domain sequence 1) can be denoted as {q n}, n=0, 1, …, M-1. Those skilled in the art can understand that upsampling on the time domain sequence is equivalent to periodically repeating the frequency domain sequence. Therefore, the second sequence is obtained by repeating the first sequence r times, and the time domain sequence 1 can be regarded as being obtained by performing upsampling with a sampling factor of r on the sequence of length M0. . Wherein, For example, the time domain sequence 1 can be represented by formula 2-1.

[0214] As can be seen from formula 2-1, there are (r-1) 0s between two adjacent non-zero elements in the time domain sequence 1. In other words, in the time domain sequence 1, there is 1 non-zero element and (r-1) 0s for every r consecutive elements.

[0215] Suppose the third sequence is denoted as {C m}. The third sequence can be obtained by performing M-point DFT on the time-domain sequence 2. The time-domain sequence 2 can be denoted as {c n}. In the time-domain sequence 2, there can be one 0 every (r-1) data. The position of the 0 in the time-domain sequence 2 is the same as (or corresponds to) the position of the non-zero element in the time-domain sequence 1. That is, the time-domain sequence 1 and the time-domain sequence 2 are time-division multiplexed. Exemplarily, the time-domain sequence 2 can be represented by formula 2-2.

[0216] Optionally, the non-zero data in the third sequence can be represented by a time-domain sequence 3. The time-domain sequence 3 can be denoted as wherein, M0-1 can be a positive number from 0 to (r-1)M0-1. Alternatively,

[0217] Based on the above scheme, the second sequence and the third sequence are not only frequency-division multiplexed in the frequency domain, but also time-division multiplexed between the time-domain sequences corresponding to the second sequence and the third sequence. The time-division multiplexing between the time-domain sequence corresponding to the second sequence and the time-domain sequence corresponding to the third sequence can reduce the PAPR of the first signal.

[0218] In some possible implementation manners, the first sequence is a sequence 1 related to PAPR. For example, the sequence 1 related to PAPR can include a ZC sequence.

[0219] Exemplarily, the sequence 1 related to PAPR can be denoted as wherein, The phase tilting can be performed on the base sequence according to formula 3-1. The phase tilting processing is related to α.

[0220] wherein, M ZC may represent the length of the sequence . Different values of α and δ can obtain different sequences.

[0221] Exemplarily, wherein, may represent the number of subcarriers in one RB. may be divided into multiple groups. Wherein, u can represent the group number, for example, u∈{0,1,...,29}; v can represent the sequence number of the base sequence in one group. According to m / 2 δ , one group can contain one or two base sequences.

[0222] For example, in the case of 1 / 2≤m / 2 δ ≤5, each group includes one MZC Long base sequence (base sequence with index v = 0). For example, in the case of 6 ≤ m / 2 δ , each group can include 2 M ZC long base sequences (base sequences with indexes v = 0 and v = 1, respectively). In this case, the base sequences can be related to the length M of the sequence ZC .

[0223] In some examples, in the case of 6 ≤ m / 2 , the base sequence can satisfy formulas 3-2 and 3-3.

[0224] where mod denotes the modulo operation. In this case, q can satisfy formulas 3-4 and 3-5.

[0225] where N zc can be the largest prime number less than M zc .

[0226] In other examples, in the case of M ZC ∈ {6, 12, 18, 24}, the base sequence can satisfy formula 3-6.

[0227] For example, in the case of M zc = 6, the base sequence can be taken from one or more entries in Table 1. However, the present application does not limit this, and the base sequence can also be taken from other values other than Table 1.

[0228] Table 1

[0229] In yet other examples, in the case of M zc = 30, the base sequence can satisfy formula 3-7.

[0230] The present application does not limit the name of the sequence 1 with respect to PAPR. For example, the sequence 1 with respect to PAPR can also be referred to as a low-PAPR sequence 1, a low-PAPR type 1, a low-PAPR sequence generation type 1, or other names.

[0231] In some possible implementations, the first sequence is generated according to a ZC sequence. For example, the first sequence can be generated directly in the frequency domain. For another example, the first sequence can be a ZC sequence. In some possible implementations, the method 600 further includes that the first device generates the first sequence in the frequency domain. Alternatively, the first sequence is generated as a sequence in the frequency domain. Exemplarily, the first sequence can be generated directly in the frequency domain without being transformed from another time-domain sequence.

[0232] Based on the above scheme, the first sequence can be constant modulus. The scheme repeats the first sequence r times to obtain the second sequence, and in the case that the first sequence is constant modulus, the second sequence is also constant modulus, which helps to improve the channel estimation performance.

[0233] If the first sequence is transformed from another time-domain sequence, the first sequence can not be constant modulus. For example, the other time-domain sequence is also generated based on a ZC sequence, such as in the manner of formula 3-3. When M0 is not a prime number, although the time-domain sequence is constant modulus, the first sequence is not constant modulus.

[0234] In some possible implementations, the first sequence is related to M0. For example, the first sequence is generated according to M0. In some possible implementations, the first sequence is related to a root index. For example, the first sequence is generated according to the root index.

[0235] In some possible implementations, the first sequence satisfies formula 4-1.

[0236] wherein, Q sub may be an element in the first sequence Q For example, j can be an imaginary number, q can be a root index, q can be coprime with M0, 1≤q

[0237] In some possible implementations, the first sequence is related to N ZC For example, the first sequence can be generated according to N ZC may be the largest prime number less than or equal to pM0, or can be the smallest prime number greater than or equal to M0, 0 ZC For example, p = 1. For another example, p = 0.9.

[0238] In some examples, N ZC may be the largest prime number less than or equal to pM0, so that the first sequence can be generated based on cyclic extension. In other examples, N ZC may be the smallest prime number greater than or equal to M0, so that the first sequence can be generated based on truncation.

[0239] In some possible implementations, the first sequence satisfies formula 4-2 and formula 4-3.

[0240] wherein, is an element in the first sequence Q sub , j is an imaginary number, q is a root index, q is coprime with N ZC , and L is an integer.

[0241] For example, L = 0, formula 4-2 can be transformed into formula 4-4. Alternatively, the first sequence can satisfy formula 4-4 without being derived from formula 4-2 and / or formula 4-3.

[0242] For another example, L can be or wherein, and may represent rounding up and rounding down, respectively.

[0243] For example, N zc = M0, L = 0, formula 4-2 can be transformed into formula 4-5. Alternatively, the first sequence can satisfy formula 4-5 without being derived from formula 4-2 and / or formula 4-3.

[0244] In some possible implementations, the first sequence is sequence 2 with respect to PAPR. For example, sequence 2 with respect to PAPR can include a π / 2-BPSK sequence.

[0245] In the embodiments of the present application, π can be replaced by pi, Pi, PI or other symbols, and π can also be replaced by 180 degrees.

[0246] For example, sequence 2 with respect to PAPR can also be denoted as Sequence 2 with respect to PAPR can satisfy formula 5-1.

[0247] wherein, may represent a base sequence. M can represent the length of the sequence Different values of α and δ can result in different sequences.

[0248] For example, wherein, may represent the number of subcarriers in an RB. may be divided into multiple groups. Wherein, u can represent a group number, for example, u ∈ {0, 1,..., 29}; v can represent the sequence number of a base sequence in a group. For example, in 1 / 2 ≤ m / 2 δIn the case of M ≥ 30, each group can include one M-long base sequence (base sequence with index v = 0).

[0249] Exemplarily, the sequence may satisfy formula 5-2.

[0250] wherein, may be related to the length of the sequence.

[0251] In some examples, in the case of M ≥ 30, the sequence may be a π / 2-BPSK symbol sequence, which is obtained by π / 2-BPSK modulation on a bit sequence {b(i)}, as shown in formula 5-3.

[0252] In other examples, in the case of M = 6, the sequence may satisfy formula 5-4.

[0253] Exemplarily, φ(i) can be taken from one or more entries in Table 2. However, the present application does not limit this, and φ(i) can also be taken from other values other than Table 2.

[0254] Table 2

[0255] In yet other examples, in the case of M ∈ {12, 18, 24}, the sequence may be a π / 2-BPSK symbol sequence.

[0256] In some possible implementations, the first sequence is determined according to a first π / 2-BPSK sequence.

[0257] For example, the first π / 2-BPSK sequence can be a sequence of M0 length. M0-point DFT is performed on the first π / 2-BPSK sequence to obtain the first sequence. In some possible implementations, the method 600 further includes: the first device generates the first π / 2-BPSK sequence; and the first device performs M0-point DFT on the first π / 2-BPSK sequence to obtain the first sequence.

[0258] wherein, the elements included in the π / 2-BPSK sequence can also be understood as π / 2-BPSK symbols.

[0259] Exemplarily, the first π / 2-BPSK sequence can be obtained by π / 2-BPSK modulation on a gold sequence. For example, the first device can generate a gold sequence of M0 length; and π / 2-BPSK modulation is performed on the gold sequence to obtain the first π / 2-BPSK sequence.

[0260] The first π / 2-BPSK sequence can also be referred to as a sequence, information, a time-domain sequence, a symbol, a symbol sequence, or have another name.

[0261] Those skilled in the art can understand that, although the above scheme also performs DFT operation, the above scheme performs M0-point DFT. Compared with the scheme of constructing the second sequence by performing M-point DFT, the above scheme still reduces the processing complexity and processing overhead.

[0262] In some embodiments, the first sequence can be determined according to the first π / 2-BPSK sequence. The third sequence can be determined according to the second π / 2-BPSK sequence. It should be noted that the second π / 2-BPSK sequence can also be referred to as a sequence, information, a time-domain sequence, a symbol, a symbol sequence, or have another name.

[0263] For example, the aforementioned time-domain sequence 1, i.e., may be the first π / 2-BPSK sequence. For another example, the aforementioned time-domain sequence 3, i.e., may be the second π / 2-BPSK sequence.

[0264] The fifth sequence can include the first π / 2-BPSK sequence and the second π / 2-BPSK sequence. For example, the fifth sequence can be formed by interleaving the elements in and .

[0265] Those skilled in the art can understand that one feature of the π / 2-BPSK sequence is that the phase difference between two adjacent elements (or symbols) is π / 2. However, in the fifth sequence, the phase difference between two adjacent elements can be π. For example, assuming r=2, assuming and , the time-domain sequence 4 can be obtained as:

[0266] FIG. 7 is a schematic diagram of some π / 2-BPSK symbols according to an embodiment of the present application. FIG. 7 is merely an example and does not limit the present application. The sequence provided by the present application can or can not have the features shown in FIG. 7.

[0267] The elements included in the π / 2-BPSK sequence can also be understood as π / 2-BPSK symbols.

[0268] Fig. 7(a) shows the trajectory of each symbol in time-domain sequence 4 on the complex plane. The horizontal coordinate can represent the real part of the symbol, and the vertical coordinate can represent the imaginary part of the symbol.

[0269] A phase jump of 180 degrees occurs in Fig. 7(a), which can also be referred to as a zero crossing. For example, a phase jump occurs from the symbol in the upper left corner to the symbol in the lower right corner. For another example, a phase jump occurs from the symbol in the lower left corner to the symbol in the upper right corner.

[0270] Since the single-carrier signal generated by the single-carrier modulation can be regarded as an interpolation of the symbol sequence input to the single-carrier modulation, the phase jump can cause a zero signal to be generated in the single-carrier signal, thereby causing the signal to have a high PAPR.

[0271] Therefore, how to reduce the PAPR of the signal is a problem to be solved.

[0272] Fig. 8 is a schematic flowchart of another communication method 800 provided by an embodiment of the present application. The method 800 can reduce the PAPR of the signal. The method 800 can be combined with the method 600. The method 800 will be described below in combination with Fig. 8.

[0273] S810, the first device determines a first signal.

[0274] Optionally, the first signal is used to carry a second sequence and a third sequence. The second sequence and the third sequence can be frequency division multiplexed.

[0275] The descriptions of the first device, the first signal, the second sequence, and the third sequence can refer to the related descriptions in the method 600. The difference is that in the method 600, the second sequence is obtained by repeating the first sequence r times, while in the method 800, the second sequence carried by the first signal can also be determined by other manners. For example, the first device can determine the second sequence according to M-point DFT. However, the present application does not limit the second sequence in the method 800 to be obtained by repeating the first sequence r times. In other words, the second sequence in the method 800 can also be obtained by repeating the first sequence r times, that is, the second sequence is determined in a similar manner to the method 600.

[0276] S820, the first device sends the first signal to the second device. Correspondingly, the second device receives the first signal from the first device.

[0277] The description of S820 above can refer to the related description in the method 600. For example, some descriptions of S620.

[0278] S830, the second device determines a third sequence according to the first signal.

[0279] The description of S830 above can refer to the related description in method 600. For example, some description of S630.

[0280] In some possible implementation, the third sequence is determined according to a phase rotation of π / 4 odd multiple and the second π / 2-BPSK sequence. In some possible implementation, the method 800 further includes: determining, by the first device, the third sequence according to a phase rotation of π / 4 odd multiple and the second π / 2-BPSK sequence.

[0281] For example, the second π / 2-BPSK sequence can be the aforementioned time domain sequence 3. For example, the phase rotation of π / 4 odd multiple can include a phase rotation of π / 4, a phase rotation of -π / 4, a phase rotation of 3π / 4, and the like, without being exhaustive.

[0282] Based on the above scheme, the phase jump in the fifth sequence can be eliminated by the phase rotation of π / 4 odd multiple, thereby reducing the PAPR of the first signal.

[0283] In some possible implementation, the third sequence is determined according to a fourth sequence, the fourth sequence being obtained by performing a phase rotation of π / 4 odd multiple on elements in the second π / 2-BPSK sequence.

[0284] In some possible implementation, the method 800 further includes: performing, by the first device, a phase rotation of π / 4 odd multiple on elements in the second π / 2-BPSK sequence to obtain a fourth sequence; and determining, by the first device, the third sequence according to the fourth sequence. For example, the first device can perform DFT (for example, M-point DFT) on the fourth sequence to obtain the third sequence.

[0285] For example, the fourth sequence can be obtained by performing a phase rotation of π / 4 odd multiple on part or all of the elements in the second π / 2-BPSK sequence.

[0286] In some possible implementation, the fourth sequence is obtained by performing a phase rotation of π / 4 odd multiple on all of the elements in the second π / 2-BPSK sequence. In other words, the fourth sequence is obtained by performing a phase rotation of π / 4 odd multiple on the whole of the second π / 2-BPSK sequence.

[0287] For example, the fourth sequence satisfies formula 6-1.

[0288] wherein c is the second π / 2-BPSK sequence, j is an imaginary number, and γ is an odd number, For the fourth sequence. For example, the gamma can be -1, 1, -3, 3 or other odd number. The formula 6-1 can also be understood as making a phase rotation to the c as a whole. The amount of phase rotation is an odd multiple of π / 4. In addition, the fourth sequence can also be understood as an offset quadrature phase shift keying (OQPSK) sequence.

[0289] (b) of FIG. 7 shows a constellation diagram of a possible fourth sequence. In which, the vertical coordinate represents the quadrature component, and the horizontal coordinate represents the in-phase component.

[0290] Exemplarily, assuming r = 2, Δ = 2, M sc = 3240, the time domain sequence 5 can be obtained according to the fourth sequence (for example, the fourth sequence determined according to the formula 6-1) and the time domain sequence 1. The symbol trajectory diagram of the time domain sequence 5 is shown in (c) of FIG. 7. It can be seen that the phase difference between any two adjacent symbols in the time domain sequence 5 is not π.

[0291] In some possible implementations, the fourth sequence includes a first element, and the first element is obtained by performing a phase rotation of π / 4 on a second element in the second π / 2-BPSK sequence.

[0292] The second element can be an element that has a phase jump. For example, the phase difference between the second element and an adjacent element in a fifth sequence is π. The fifth sequence includes the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, and the first π / 2-BPSK sequence is used to determine the first sequence. For another example, the method 800 can include: determining, by the first device, a second element, the second element being an element that has a phase jump; and performing, by the first device, a phase rotation of π / 4 on the second element to obtain a first element.

[0293] The first element or the second element can also be referred to as a symbol, a data symbol or other names, which are not limited in the present application.

[0294] Exemplarily, the first element may satisfy the formula 6-2.

[0295] wherein d n is the second element.

[0296] For example, the fifth sequence is {…, p n ,d n ,p n+1 ,…}, the second element is d n , and the first π / 2-BPSK sequence includes p n and pn+1 wherein the phase difference between d n and p n may be π, or the phase difference between d n and p n+1 may be π. Alternatively, the phase difference between d n and p n is π, and the phase difference between d n and p n+1 is π.

[0297] The second element can be a part or all of the elements in the second π / 2-BPSK sequence where phase jump occurs, which is not limited in the present application. The second element can be one or more elements.

[0298] Exemplarily, assume that p n , p n+1 and p n+2 are three pilot π / 2-BPSK symbols in the first π / 2-BPSK sequence. Wherein the phase difference between p n and p n+1 is π / 2, and the phase difference between p n+1 and p n+2 is π / 2. Assume that d n and d n+1 are two data π / 2-BPSK symbols in the first π / 2-BPSK sequence, and the phase difference between d n and d n+1 is π / 2. Assume that the phase of d n is equal to the phase of p n+2 .

[0299] Assume that in the fifth sequence, the phase difference between d n and p n is π, and the phase difference between d n+1 and p n+1 is π. Therefore, the second element includes d n and d n+1 .

[0300] The second element where phase jump occurs is phase-rotated by π / 4, which can also be understood as that the first element is located on the number axis of the complex plane. As an example, the first element is located on the number axis between the two pilot π / 2-BPSK symbols adjacent to the second element.

[0301] Further, the first element is located on the number axis between the two pilot π / 2-BPSK symbols adjacent to the second element, including the positive half axis and the negative half axis. Alternatively, the first element is farthest away from the two pilot π / 2-BPSK symbols adjacent to the second element.

[0302] Exemplarily, the first element Formula 6-3 can be satisfied.

[0303] FIG. 9 is a schematic diagram of another π / 2-BPSK sequence provided by the embodiments of the present application. FIG. 9 is merely an example and does not constitute a limitation on the present application. The sequence provided by the embodiments of the present application can or can not have the features shown in FIG. 9.

[0304] The foregoing scheme can also be understood as a restriction condition on the rotation of the element, which is that the first element is farthest from the two adjacent pilot π / 2-BPSK symbols of the second element. FIG. 9 shows an example under this restriction condition, but FIG. 9 does not constitute a limitation on the present application.

[0305] For example, referring to (a) in FIG. 9. For the phase rotation of d n , d n may be rotated to the number axis between the two pilot symbols p n and p n before and after d n+1 . For another example, for the phase rotation of d n+1 , d n+1 may be rotated to the number axis between the two pilot symbols p n+1 and p n+1 before and after d n+2 . Further, based on the restriction condition, d n is rotated to the negative half of the y-axis between p n and p n+1 , denoted as d d n+1 is rotated to the negative half of the x-axis between p n+1 and p n+2 , denoted as d

[0306] According to the processing of (a) in FIG. 9, the time-domain sequence 6 obtained is: p n , p n+1 , p n+2 . The trajectory diagram of the time-domain sequence 6 is shown in (b) in FIG. 9. It can be seen that after the phase rotation of the element that will cause phase jump, the phase difference between the two adjacent symbols in the time-domain sequence 6 is not π.

[0307] In some possible implementation manners, the third sequence is determined according to a sixth sequence, and the sixth sequence is obtained by performing phase tilting on the fourth sequence.

[0308] In some possible implementation manners, the first device determines the third sequence according to the fourth sequence, including: the first device performs phase ramping (PR) on the fourth sequence to obtain a sixth sequence; and the first device determines the third sequence according to the sixth sequence. Exemplarily, the first device can perform DFT (for example, M-point DFT) on the sixth sequence to obtain the third sequence.

[0309] In some implementation manners, the sixth sequence satisfies formula 7-1 and formula 7-2.

[0310] wherein c' is the sixth sequence, is the fourth sequence, j is an imaginary number, is an element in e3, δ1 indicates a position of a first element in the third sequence in a seventh sequence, the seventh sequence includes the second sequence and the third sequence, M sc represents a number of subcarriers corresponding to a transmission bandwidth of the first signal.

[0311] The seventh sequence includes the second sequence and the third sequence, for example, the seventh sequence is generated by frequency division multiplexing of the second sequence and the third sequence.

[0312] Based on the above scheme, the phase ramping processing is related to δ1, and the PAPR of the first signal can be reduced.

[0313] The following briefly introduces an illustrative principle of generating PR. Assuming that a time-domain signal (or sequence) {x m} of M length, a frequency-domain signal (or sequence) {X m} of M length can be obtained by DFT. A τ-point cyclic shift is performed on {X m}, and wherein

[0314] IDFT is performed on , and a time-domain signal x of M length can be obtained. Those skilled in the art can understand that the cyclic shift of the time (frequency) domain sequence is equivalent to introducing PR to the frequency (time) domain sequence. For example, the above can be represented by formula 7-3.

[0315] Therefore, if DFT is directly performed on the fifth sequence including the second π / 2-BPSK sequence (or the fourth sequence) and the first π / 2-BPSK sequence, PR can be introduced.

[0316] Exemplarily, assuming that M-point IDFT is performed on the seventh sequence, a time-domain sequence z = {z k} The skilled in the art can understand that the up-sampling of the frequency domain sequence corresponds to the period repetition of the time domain sequence. Therefore, z can satisfy formula 7-4.

[0317] wherein the first π / 2-BPSK sequence q = {q n} is the fourth sequence, e1 = {e n} is the fourth sequence, e1 = {e 1,k} is the fourth sequence, e1 = {e 2,k} is the fourth sequence, e1 = {e δ1 is the index of the first subcarrier of the mapped data in the transmission bandwidth, δ1 is an integer in the set [0, Δ-1], and δ1 ≠ δ. The symbol * represents the dot product.

[0318] The skilled in the art can understand that when mapping one pilot per Δ subcarriers onto the frequency domain resource, if δ is not zero, this will introduce PRs to {q n} if δ1 is not zero, this will introduce PRs to {c n} if δ1 is not zero, this will introduce PRs to {c

[0319] Assuming δ = 0, the fourth sequence is subjected to PR (or inverse PR). For example, according to formula 7-1 and formula 7-2, the fourth sequence is subjected to PR, and the sixth sequence can be obtained.

[0320] In some possible implementation manners, the number of elements of the third sequence is related to M0 and r.

[0321] For example, the number of elements of the third sequence satisfies formula 8-1. (r-1)M0 (Formula 8-1)

[0322] The determination manner of the third sequence can be notified by the first device to the second device. In some possible implementation manners, the method 800 further includes that the first device sends first information to the second device, and the first information is used to indicate that the third sequence is determined according to the second π / 2-BPSK sequence and the phase rotation of the odd multiple of π / 4. For another example, the first information can be used to indicate that the third sequence is determined according to the fourth sequence, and the fourth sequence is obtained by performing the phase rotation of the odd multiple of π / 4 on all elements in the second π / 2-BPSK sequence, or the fourth sequence includes a first element, and the first element is obtained by performing the phase rotation of π / 4 on a second element in the second π / 2-BPSK sequence, and the second element is an element with phase jump. For example, the phase difference between the second element and the adjacent element in the fifth sequence is π. The fifth sequence includes the second π / 2-BPSK sequence and the first π / 2-BPSK sequence.

[0323] In some possible implementation manners, the method 800 further can comprise: the second device processing the third sequence according to the first information. For example, the second device can demodulate the third sequence according to the first information.

[0324] In some possible implementation manners, the third sequence can be determined in a predefined manner. For example, predefined by a protocol. In one example, the protocol defines that when a data π / 2-BPSK symbol sequence and a pilot π / 2-BPSK symbol sequence are transmitted in a TDM and FDM manner as described in the above embodiments, the techniques proposed in the above embodiments are used to limit the phase jump of 180 degrees on the data sequence. In another example, the techniques for limiting the phase jump of 180 degrees in the above example include inverse PR.

[0325] In some possible implementation manners, the number of elements in the third sequence is less than or equal to the first threshold.

[0326] For example, the second sequence can occupy of the power, and the third sequence occupies of the power. According to the above scheme, the power occupied by the third sequence (for example, the data sequence) can be reduced by the first threshold without changing the allocated power of the second sequence (for example, the pilot sequence). The above scheme can reduce the peak value of the first signal. Those skilled in the art can understand that reducing the peak value of the signal also helps to reduce the impact of the power amplifier (PA) nonlinearity on the signal.

[0327] Exemplarily, reducing the power occupied in the third sequence can be achieved by reducing the number of non-zero elements in the third sequence without changing the energy of the non-zero elements in the third sequence. In one example, the number of elements in the third sequence can originally be (r-1)M0. The number of elements in the third sequence can be reduced to less than (r-1)M0.

[0328] FIG. 10 is a schematic diagram of a power distribution provided by an embodiment of the present application. FIG. 10 is merely an example and does not constitute a limitation on the present application. The coordinate axes in FIG. 10 can be understood as indexes. For example, sampling indexes. For another example, pre-DFT sampling indexes. In FIG. 10, the vertical lines with triangles can represent elements in the second sequence; the vertical lines with circles can represent elements in the third sequence.

[0329] Suppose Δ=r=2, and M0=4. Suppose the generated second sequence and third sequence are as shown in (a) of FIG. 10. At this time, the number of elements in the third sequence is (r-1)M0.

[0330] An example of the number of elements in the third sequence being less than or equal to the first threshold can be seen in (b) in FIG. 10. In this scheme, the power occupied by the third sequence is reduced to 1 / 4. It can be seen that sampling indexes 5 and 7 do not place elements of the third sequence, but place 0.

[0331] In some possible implementation, the proportion of elements in the third sequence to elements in the second sequence and the third sequence is less than or equal to a second threshold. The second threshold can be correspondingly modified according to the first threshold described above.

[0332] The following describes a device embodiment corresponding to the method embodiment of the present application. The following only briefly introduces the device, and the specific implementation steps and details of the scheme can be referred to the method embodiment described above.

[0333] To implement the functions in the method provided in the present application, the communication device can include hardware structures and / or software modules to implement the above functions in the form of hardware structures, software modules, or hardware structures plus software modules. Whether a certain function in the above functions is implemented in the form of hardware structure, software module, or hardware structure plus software module depends on the specific application and design constraints of the technical solution.

[0334] FIG. 11 is a schematic block diagram of a communication device 1000 according to an embodiment of the present application. The communication device 1000 includes a processor 1010 and a communication interface 1020. Optionally, the processor 1010 and the communication interface 1020 can be connected to each other through a bus. The communication device 1000 can be the first device or the second device. Exemplarily, the first device can be a terminal device or a network device; and the second device can be a terminal device or a network device.

[0335] Optionally, the communication apparatus 1000 can further include a memory 1040. The memory 1040 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), a cache, an erasable programmable read only memory (EPROM), a synchronous dynamic random access memory (SDRAM), a hard disk drive (HDD), a solid-state drive (SSD), or a compact disc read-only memory (CD-ROM). The memory 1040 is used to store relevant instructions and / or data. The memory 1040 can be integrated with the processor 1010 or separately arranged.

[0336] The processor 1010 can be one or more central processing units (CPUs). In the case where the processor 1010 is a CPU, the CPU can be a single-core CPU or a multi-core CPU. The processor 1010 can be a signal processor, a chip, or other integrated circuits that can implement the method of the present application, or a part of the foregoing processor, chip, or integrated circuit for processing functions. In addition, the communication interface 1020 can also be an input / output interface for input or output of signals or data, or an input / output circuit.

[0337] Exemplarily, the communication apparatus 1000 is a first device, and the processor 1010 is configured to: repeat a first sequence r times to obtain a second sequence, the first sequence having a length of M0, M0 being a positive integer, r being a positive integer, the second sequence having a length of M, M = M0*r; and transmit a first signal, the first signal being used to carry the second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed.

[0338] Exemplarily, the communication apparatus 1000 is a second device, and the processor 1010 is configured to: receive a first signal, the first signal carrying a second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed; wherein the second sequence is obtained by repeating a first sequence r times, the first sequence having a length of M0, M0 being a positive integer, r being a positive integer, the second sequence having a length of M, M = M0*r; and determine the third sequence according to the first signal.

[0339] The foregoing merely is an example description. The communication apparatus 1000 is responsible for performing the method or steps related to the first device or the second device in the foregoing method embodiments.

[0340] In a possible implementation, the communication interface 1020 can be a transceiver. The transceiver can include a transmitter configured to perform a transmitting operation and a receiver configured to perform a receiving operation. For example, the processor 1010 can be configured to control the transceiver to receive and / or transmit a signal.

[0341] In a possible implementation, the communication interface 1020 can also be a communication circuit, a pin, an input / output interface, a bus, or the like.

[0342] The communication apparatus 1000 can include a transmitter but not a receiver. Alternatively, the communication apparatus 1000 can include a receiver but not a transmitter. Whether the communication apparatus 1000 includes the transmitter and the receiver can depend on whether the communication apparatus 1000 performs the transmitting operation and the receiving operation in the foregoing schemes.

[0343] The foregoing merely is an example description. The specific content can be referred to the content shown in the foregoing method embodiments. The implementation of each operation in FIG. 11 can also correspond to the description of the corresponding method embodiments shown in FIG. 6 to FIG. 10.

[0344] For example, the communication apparatus 1000 can be configured to perform the schemes shown in FIG. 6 to FIG. 10.

[0345] For example, the communication apparatus 1000 can be configured to perform the schemes shown in FIG. 6 to FIG. 10.

[0346] For example, the communication apparatus 1000 can be configured to perform the schemes shown in FIG. 6 to FIG. 10.

[0347] For other implementation manners, refer to the detailed description of the foregoing embodiments shown in FIG. 6 to FIG. 10, which will not be described herein. It should be understood that the specific process of each component performing the foregoing corresponding process has been described in detail in the foregoing method embodiments, and will not be described herein for the sake of brevity.

[0348] FIG. 12 is a schematic block diagram of another communication apparatus 1100 according to an embodiment of the present application. The communication apparatus 1100 can be a first device or a second device, or a chip or a module of the first device or the second device, and is configured to implement the method related to the embodiments shown in FIG. 6 to FIG. 10. For details, refer to the related description in the foregoing method embodiments.

[0349] The communication apparatus 1100 includes a transceiver unit 1110. The transceiver unit 1110 is described below.

[0350] The transceiver unit 1110 can include a transmitting unit and a receiving unit. The transmitting unit is configured to perform the transmitting action of the communication device, and the receiving unit is configured to perform the receiving action of the communication device. For the convenience of description, the transmitting unit and the receiving unit are combined into one transceiver unit in the embodiments of the present application. Here, a unified description is made, and no further description is made hereinafter. The transceiver unit 1110 can implement the corresponding communication function. The transceiver unit 1110 can also be referred to as a communication interface or a communication module.

[0351] The communication device 1100 can include a transmitting unit and not include a receiving unit. Alternatively, the communication device 1100 can include a receiving unit and not include a transmitting unit. Specifically, whether the transmitting action and the receiving action are included in the above-mentioned schemes performed by the communication device 1100 can be determined.

[0352] Exemplarily, the transceiver unit 1110 is configured to transmit the first signal and the like.

[0353] Optionally, the communication device 1100 can further include a processing unit 1120 configured to perform the content related to processing, coordination and the like of the communication device 1100.

[0354] Exemplarily, the transceiver unit 1110 is configured to receive the first signal and the like.

[0355] Optionally, the communication device 1100 can further include a processing unit 1120 configured to perform the content related to processing, coordination and the like of the communication device 1100.

[0356] The above-mentioned content is only exemplary description. The communication device 1100 will be responsible for performing the related methods or steps in the foregoing method embodiments.

[0357] Optionally, the communication device 1100 further includes a storage unit 1130 configured to store programs or codes for performing the foregoing methods. Alternatively, the storage unit 1130 can be configured to store instructions and / or data, and the processing unit 1120 can read the instructions and / or data in the storage unit 1130, so that the communication device 1100 implements the foregoing method embodiments. For example, the communication device 1100 can be configured to perform the schemes shown in FIGS. 6 to 10.

[0358] Exemplarily, the processing unit 1120 can be configured to repeat a first sequence r times to obtain a second sequence, the length of the first sequence is M0, M0 is a positive integer, r is a positive integer, the length of the second sequence is M, M=M0*r; and the transceiver unit 1110 can be configured to transmit a first signal, the first signal is configured to carry the second sequence and a third sequence, the second sequence and the third sequence are frequency division multiplexed.

[0359] Exemplarily, the transceiving unit 1110 can be configured to receive a first signal, the first signal carrying the second sequence and the third sequence, the second sequence and the third sequence being frequency division multiplexed; and the processing unit 1120 can be configured to determine the third sequence according to the first signal.

[0360] For other implementation manners, refer to the detailed description of the embodiments shown in the foregoing FIG. 6 to FIG. 10, which will not be repeated here. It should be understood that the specific processes of the components performing the corresponding processes have been described in the foregoing method embodiments, and will not be repeated here for the sake of brevity.

[0361] When the communication apparatus 1000 in FIG. 11 is a chip, the communication interface 1020 can be a transceiver, an input / output circuit or a communication interface of the chip. The processor 1010 can be an integrated processor on the chip, or a microprocessor, or an integrated circuit. The transmitting operation of the first apparatus or the second apparatus in the foregoing method embodiments can be understood as the output of the chip, and the receiving operation of the first apparatus or the second apparatus in the foregoing method embodiments can be understood as the input of the chip.

[0362] When the communication apparatus 1100 in FIG. 12 is a chip, the transceiving unit 1110 can be a transceiver, an input / output circuit or a communication interface of the chip. The processing unit 1120 can be an integrated processor on the chip, or a microprocessor, or an integrated circuit. The transmitting operation of the first apparatus or the second apparatus in the foregoing method embodiments can be understood as the output of the chip, and the receiving operation of the first apparatus or the second apparatus in the foregoing method embodiments can be understood as the input of the chip.

[0363] The application further provides a chip, comprising a processor, configured to invoke and run instructions stored in a memory, so that a communication apparatus installed with the chip performs the method in any of the examples.

[0364] The application further provides another chip, comprising an input interface, an output interface and a processor, the input interface, the output interface and the processor being connected through internal connection paths, the processor being configured to execute code in a memory, when the code is executed, the processor is configured to perform the method in any of the examples. Optionally, the chip further comprises a memory, configured to store a computer program or code.

[0365] The application further provides a processor, configured to be coupled with a memory, configured to perform the method and function related to the sensing apparatus or the communication apparatus in any of the embodiments, or configured to perform the method and function related to the first apparatus or the second apparatus in any of the embodiments.

[0366] In another embodiment of the present application, a computer program product containing computer programs or instructions is provided, when the computer program product is run on a computer, the method of the foregoing embodiments is implemented.

[0367] The present application also provides a computer program, when the computer program is run on a computer, the method of the foregoing embodiments is implemented.

[0368] In another embodiment of the present application, a computer readable storage medium is provided, the computer readable storage medium stores a computer program, when the computer program is executed by a computer, the method of the foregoing embodiments is implemented.

[0369] The present application also provides a communication system, the communication system comprises a first device and a second device. The first device and the second device are respectively configured to perform the method performed by the first device and the second device in the foregoing embodiments.

[0370] Those skilled in the art can understand that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed in hardware or software mode depends on the specific application and design constraints of the technical solution. The skilled person can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0371] Those skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working process of the system, device and unit described above can refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

[0372] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0373] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or they can be distributed on a plurality of network units. According to actual needs, some or all of the units can be selected to achieve the purpose of the embodiment.

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

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

Claims

1. A communication method characterized by comprising: The method comprises the following steps: repeating a first sequence r times to obtain a second sequence, the length of the first sequence being M0, M0 being a positive integer, r being a positive integer, the length of the second sequence being M, M=M0*r; sending a first signal, the first signal being used to carry the second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed.

2. The method of claim 1, wherein, The time domain sequence corresponding to the third sequence and the time domain sequence corresponding to the second sequence are time division multiplexed.

3. The method according to claim 1 or 2, characterized in that, The third sequence is a data sequence, and the second sequence is a pilot sequence.

4. The method according to any one of claims 1 to 3, characterized in that, The first sequence is sequence 1 related to peak-to-average power ratio (PAPR).

5. The method according to any one of claims 1 to 4, characterized in that, The first sequence is generated according to a ZC sequence.

6. The method according to any one of claims 1 to 5, characterized in that, The first sequence satisfies: wherein For the elements in the first sequence Q sub j is an imaginary number, q is a root index, q is coprime with M0, 1 ≤ q < M0, and M is an even number.

7. The method according to any one of claims 1 to 5, characterized in that, The first sequence is generated according to N ZC generated, the N ZC is a largest prime number less than or equal to pM0, or a smallest prime number greater than or equal to M0, 0 < p < 1.

8. The method of claim 7, wherein, The first sequence satisfies: wherein For the elements in the first sequence Q sub j is an imaginary number, q is a root index, q is coprime with N ZC L is an integer.

9. The method according to any one of claims 1 to 3, characterized in that, The first sequence is sequence 2 related to PAPR.

10. The method according to any one of claims 1 to 3, 9, characterized in that, The first sequence is determined according to a first π / 2-binary phase shift keying (BPSK) sequence.

11. The method according to any one of claims 1 to 3, 9, 10, characterized in that, The third sequence is determined according to a second π / 2-BPSK sequence and a phase rotation of an odd multiple of π / 4.

12. The method of claim 11, wherein, The third sequence is determined according to a fourth sequence, the fourth sequence being obtained by performing a phase rotation of an odd multiple of π / 4 on elements in the second π / 2-BPSK sequence.

13. The method of claim 12, wherein, The fourth sequence is obtained by performing a phase rotation of an odd multiple of π / 4 on all elements in the second π / 2-BPSK sequence.

14. The method according to claim 12 or 13, characterized in that, The fourth sequence satisfies: wherein c is the second π / 2-BPSK sequence, j is an imaginary number, and γ is an odd number, The fourth sequence is obtained by performing a phase rotation of π / 4 on a second element in the second π / 2-BPSK sequence, a phase difference between the second element and an adjacent element in a fifth sequence being π, the fifth sequence comprising the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, the first π / 2-BPSK sequence being used to determine the first sequence.

15. The method of claim 12, wherein, The third sequence is determined according to a sixth sequence, the sixth sequence being obtained by performing phase tilting on the fourth sequence.

16. The method of claim 15, wherein, The first element Satisfies: wherein d n is the second element.

17. The method according to any one of claims 12 to 16, characterized in that, The number of elements of the third sequence is related to M0 and r.

18. The method of claim 17, wherein, The sixth sequence satisfies: wherein c' is the sixth sequence, for the fourth sequence, j is an imaginary number, For the elements in e3, d1 indicates the position of the first element in the plurality of elements of the third sequence in the seventh sequence, the seventh sequence comprising the second sequence and the third sequence, M sc represents the number of subcarriers corresponding to the transmission bandwidth of the first signal.

19. The method of any one of claims 1 to 18, wherein, The number of elements of the third sequence satisfies: (r-1)M0.

20. The method of claim 19, wherein, The method comprises the following steps:

21. A method of communication, comprising: receiving a first signal, the first signal carrying a second sequence and a third sequence, the second sequence and the third sequence being frequency division multiplexed; wherein the second sequence is obtained by repeating a first sequence r times, the length of the first sequence being M0, M0 being a positive integer, r being a positive integer, the length of the second sequence being M, M=M0*r; determining the third sequence according to the first signal. The third sequence is used to determine a second π / 2-BPSK sequence according to a phase rotation of an odd multiple of π / 4.

22. The method of claim 21, wherein, The third sequence is used to determine a fourth sequence, the second π / 2-BPSK sequence being obtained by performing a phase rotation of an odd multiple of π / 4 on elements in the fourth sequence.

23. The method of claim 22, wherein, The second π / 2-BPSK sequence is obtained by performing a phase rotation of an odd multiple of π / 4 on all elements in the fourth sequence.

24. The method of claim 23, wherein, The fourth sequence is obtained by performing a phase rotation of π / 4 on a second element in the second π / 2-BPSK sequence, a phase difference between the second element and an adjacent element in a fifth sequence being π, the fifth sequence comprising the second π / 2-BPSK sequence and a first π / 2-BPSK sequence, the first π / 2-BPSK sequence being used to determine the first sequence.

25. The method of claim 23 or 24, wherein, The second π / 2-BPSK sequence satisfies: wherein c is the second π / 2-BPSK sequence, j is an imaginary number, and γ is an odd number, ​ 26. The method of claim 23, wherein, The second pi / 4-BPSK sequence comprises a second element, the second element being a phase rotation of a first element in the fourth sequence by pi / 4, a phase difference between the second element and an adjacent element in a fifth sequence being pi, the fifth sequence comprising the second pi / 4-BPSK sequence and a first pi / 4-BPSK sequence, the first pi / 4-BPSK sequence being used to determine the first sequence.

27. The method of claim 26, wherein, The first element satisfies: wherein d n is the second element.

28. The method of any one of claims 23-27, wherein, The third sequence is used to determine a sixth sequence, the fourth sequence being a phase tilt of the sixth sequence.

29. The method of claim 28, wherein, The fourth sequence satisfies: wherein c' is the sixth sequence, for the fourth sequence, j is an imaginary number, For the elements in e3, d1 indicates the position of the first element in the plurality of elements of the third sequence in the seventh sequence, the seventh sequence comprising the second sequence and the third sequence, M sc represents the number of subcarriers corresponding to the transmission bandwidth of the first signal.

30. The method of any one of claims 21-29, wherein, A number of elements of the third sequence is related to M0 and r.

31. The method of claim 30, wherein, The number of elements of the third sequence satisfies: (r-1)M0.

32. A communications device, characterized by Comprising: A processor configured to cause a method as claimed in any of claims 1 to 20 to be performed, or to cause a method as claimed in any of claims 21 to 31 to be performed, by executing computer programs or instructions.

33. The communication apparatus according to claim 32, wherein, The communication device further comprises a memory configured to store the computer programs or the instructions.

34. A computer-readable storage medium, characterized in that, The computer readable storage medium has stored thereon computer programs or instructions which, when run on a computer, cause a method as claimed in any of claims 1 to 20 to be performed, or cause a method as claimed in any of claims 21 to 31 to be performed.

35. A computer program product, characterised in that, A computer program or instructions which, when run, cause a method as claimed in any of claims 1 to 20 to be implemented, or cause a method as claimed in any of claims 21 to 31 to be implemented.

Images