Signal transmission method and communication device

Abstract

Provided are a method for transmitting a signal and a communication device, the method comprising: determining a first sequence {s (k)} according to a modulation symbol sequence {d (n)}, where s (k) is the kth element of the first sequence {s (k)}, k = 0, 1, 2,..., K-1, d (n) is the nth element of the modulation symbol sequence {d (n)}, n = 0, 1, 2,..., N-1, K and N are positive integers, and n = 0, 1, 2,..., N-1; the first sequence {s (k)} is a sequence obtained after continuous phase modulation (CPM) and sampling are carried out on the modulation symbol sequence {d (n)}; determining a second sequence {x (k)} according to the first sequence {s (k)} and discrete Fourier transform (DFT); mapping the second sequence {x (k)} onto a plurality of consecutive subcarriers to generate a first signal; and sending the first signal. According to the technical scheme of the invention, the CPM is combined with the multiplication of the mask sequence or the cyclic shift, so that the transmitted signal has a lower PAPR, and the uplink coverage is enhanced.

Description

Technical Field

[0001] This application relates to the field of communications, and more particularly, to a method for transmitting signals and a communication device. Background Art

[0002] The peak-to-average power ratio (PAPR) is the ratio of the peak power to the average power of a signal. However, the dynamic range of a power amplifier is limited. When the PAPR is too high, it will cause the power amplifier to enter the non-linear region, resulting in non-linear distortion of the signal after passing through the power amplifier, causing spectrum spreading and in-band signal distortion, and reducing system performance.

[0003] To avoid the power amplifier entering the non-linear region, power back-off is required. The higher the PAPR, the lower the power that needs to be backed off. However, power back-off will lead to a decrease in coverage performance, and coverage is one of the important indicators of wireless communication. In the new radio access technology (NR), the physical uplink shared channel (PUSCH) supports the discrete Fourier transform spread orthogonal frequency division multiplexing multiple access (DFT-s-OFDM) waveform and uses the binary phase shift keying (BPSK) modulation method with π / 2. The DFT-s-OFDM waveform can reduce the PAPR of the signal, but its ability to reduce the PAPR is limited, and the coverage performance still needs to be improved. Therefore, there is an urgent need for a method to reduce the PAPR of the transmitted signal and enhance the uplink coverage. Summary of the Invention

[0004] This application provides a method for transmitting signals and a communication device to reduce the PAPR of the transmitted signal and enhance the uplink coverage.

[0005] In a first aspect, a method for transmitting signals is provided. This method can be executed by a terminal device, or alternatively, by a chip or circuit of the terminal device. This application does not make any limitations in this regard. For ease of description, the following will take the execution by the terminal device as an example for illustration.

[0006] The method includes: determining a first sequence {s(k)} according to a modulation symbol sequence {d(n)}, where s(k) is the k-th element of the first sequence {s(k)}, k = 0, 1, 2, …, K−1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, n = 0, 1, 2, …, N−1, K and N are positive integers, and the first sequence {s(k)} is a sequence after continuous phase modulation (CPM) and sampling of the modulation symbol sequence {d(n)}; determining a second sequence {x(k)} according to the first sequence {s(k)} and discrete Fourier transform (DFT); mapping the second sequence {x(k)} onto a plurality of consecutive subcarriers to generate a first signal; and transmitting the first signal.

[0007] Optionally, before determining the first sequence {s(k)}, source bits may be encoded and interleaved. For example, the encoding method may be low density parity check code (LDPC) encoding, or polar encoding, or turbo encoding. Perform continuous phase modulation (CPM) on the interleaved bit sequence to obtain a continuous signal s(t), and sample the continuous signal s(t) to determine the first sequence {s(k)}.

[0008] Based on the above solution, through CPM, the phase of the continuous signal output within one period is continuous. Sample the continuous signal to determine the first sequence, and then determine the second sequence according to the first sequence and discrete Fourier transform (DFT). The second sequence determined by the solution of the embodiment of the present application can make the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0009] Combined with the first aspect, in some implementation manners of the first aspect, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive d(n), where L is a positive integer.

[0010] Combined with the first aspect, in some implementation manners of the first aspect, the CPM is a non-recursive CPM, and the non-recursive CPM satisfies that the output at any time is determined by L + 1 consecutive input values.

[0011] Based on the above solution, the continuous signal of the non-recursive CPM output within one period is only related to L + 1 consecutive bit sequence inputs. After sampling, the first sequence is determined, which reduces the error propagation of demodulation and decoding. Thus, while ensuring the reduction of the error propagation of demodulation and decoding and improving the performance of demodulation and decoding, the first signal has a lower PAPR, thereby enhancing the uplink coverage.

[0012] In combination with the first aspect, in certain implementations of the first aspect, s(k) satisfies:

[0013]

[0014] where L is a positive integer, i = 0, 1, …, L - 1, R is the sampling rate, T is the signal period, h is the modulation index, M is the modulation order, for rounding down, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

[0015] In combination with the first aspect, in certain implementations of the first aspect, the initial values of the CPM satisfy: d(-1) = d(N - 1), d(-2) = d(N - 2), …, d(-L) = d(N - L), where L is a positive integer.

[0016] Based on the above scheme, by initializing the CPM in a tail-biting manner, the phases at the start and end positions of the continuous signal obtained through the CPM are continuous. In this way, without additional overhead, the phases at the start and end positions of the CPM signal can be ensured to be continuous, enabling the first signal to have a lower PAPR, thereby enhancing the uplink coverage.

[0017] In combination with the first aspect, in certain implementations of the first aspect, before the CPM, the method further includes: circularly expanding the modulation symbol sequence {d(n)} by length L, where L is a positive integer.

[0018] Optionally, before the non-recursive CPM, the modulation symbol sequence {d(n)} is circularly expanded by length L. That is, non-recursive CPM is performed on the circularly expanded modulation symbol sequence {d(n)}.

[0019] Optionally, the last L elements of the modulation symbol sequence {d(n)} can also be added to the front of the modulation symbol sequence before performing CPM.

[0020] Based on the above scheme, through non-recursive CPM, the continuous signal output by the non-recursive CPM within one period is only related to the continuous L + 1 modulation symbol sequences input, thus reducing the error propagation in demodulation and decoding; in addition, tail-biting initialization is performed on the non-recursive CPM, so without additional overhead, the phases at the start and end positions of the continuous signal obtained through the non-recursive CPM are continuous. Therefore, after sampling, the first sequence is determined, and then based on the first sequence and DFT, the second sequence is determined, enabling the first signal to have a lower PAPR, thereby enhancing the uplink coverage.

[0021] In combination with the first aspect, in some implementations of the first aspect, determining the second sequence {x(k)} according to the first sequence {s(k)} and the discrete Fourier transform DFT includes:

[0022] Multiplying the first sequence {s(k)} by the mask sequence bit by bit and then performing a K-point DFT to determine the second sequence {x(k)} of length K; or,

[0023] Performing a K-point DFT on the first sequence {s(k)} and then performing a cyclic shift to determine the second sequence {x(k)} of length K.

[0024] Based on the above scheme, the determined first sequence is processed by multiplying by the mask sequence or performing a cyclic shift, so that the determined second sequence is more suitable, so that the first signal has a lower PAPR, thereby improving the coverage performance.

[0025] In combination with the first aspect, in some implementations of the first aspect, the mask sequence is [1, -1, 1, -1,...] or [-1, 1, -1, 1,...].

[0026] Optionally, multiply the first sequence {s(k)} by the mask sequence bit by bit, and then perform a K-point DFT on the sequence obtained after multiplying by the mask sequence [1, -1, 1, -1,...] or [-1, 1, -1, 1,...], so as to determine a second sequence {x(k)} of length K.

[0027] In combination with the first aspect, in some implementations of the first aspect, the number of bits of the cyclic shift is half of the length of the second sequence {x(k)}.

[0028] Optionally, before performing a cyclic shift on the first sequence {s(k)}, perform a K-point DFT transformation on the first sequence {s(k)}. Then perform a cyclic shift on the transformed sequence to determine a second sequence {x(k)} of length K; where the number of bits of the cyclic shift is half of the length of the second sequence {x(k)}.

[0029] In combination with the first aspect, in some implementations of the first aspect, mapping the second sequence {x(k)} to a plurality of subcarriers to generate a first signal includes:

[0030] Mapping the K terms of the second sequence {x(k)} to K consecutive subcarriers; or,

[0031] Mapping k' terms of the second sequence {x(k)} to k' consecutive subcarriers, where k' < K and is a positive integer.

[0032] The embodiments of the present application do not specifically limit the manner in which the terminal device maps the terms in the second sequence {x(k)} to multiple subcarriers.

[0033] Optionally, the terminal device may map K terms in the second sequence to K consecutive subcarriers respectively. For example, the terminal device may map the K terms in the second sequence to K consecutive subcarriers in ascending order (or descending order) of subcarriers. One term is mapped to one subcarrier.

[0034] It should be noted that mapping one term in the entire second sequence to one subcarrier means carrying this term on this subcarrier.

[0035] Optionally, the terminal device maps k' terms in the second sequence {x(k)} to k' consecutive subcarriers to obtain a frequency-domain signal.

[0036] Exemplarily, the first l elements and the last l elements of the second sequence {x(k)} are removed, that is, the elements in the middle part of the second sequence are intercepted. For example, [x(l), x(l + 1),..., x(K - l - 1)] in the second sequence {x(k)} = [x(0), x(1),..., x(K - 1)] is intercepted and mapped to multiple subcarriers. That is, K - 2l terms in the second sequence {x(k)} are mapped to K - 2l subcarriers to obtain a frequency-domain signal of K - 2l points, where k' = K - 2l.

[0037] In combination with the first aspect, in some implementation manners of the first aspect, the modulation symbol sequence {d(n)} is a sequence obtained by amplitude modulation of a data bit sequence.

[0038] In combination with the first aspect, in some implementation manners of the first aspect, the amplitude modulation is an M-order non-negative amplitude modulation.

[0039] In a second aspect, a method for transmitting a signal is provided. This method may be executed by a network device, or may be executed by a chip or circuit of the network device. The present application does not limit this. For the sake of description, the following takes the execution by the network device as an example for illustration.

[0040] The method includes: receiving a first signal, where the first signal is a signal generated according to a second sequence {x(k)}, and the second sequence {x(k)} is determined according to a first sequence {s(k)} and a discrete Fourier transform (DFT), where the first sequence {s(k)} is determined according to a modulation symbol sequence {d(n)}, s(k) is the k-th element of the first sequence {s(k)}, k = 0, 1, 2,..., K - 1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, n = 0, 1, 2,..., N - 1, K and N are positive integers, and the first sequence {s(k)} is a sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)}; obtaining data carried on the second sequence {x(k)} from the first signal.

[0041] As an example, the process by which the network device obtains the second sequence includes: the network device receives the first signal on K consecutive subcarriers; removes the cyclic prefix of the first signal to obtain a time-domain signal; performs a K-point DFT on the time-domain signal to obtain a frequency-domain signal; and based on the frequency-domain signal, performs an inverse discrete Fourier transformation (IDFT) on the frequency-domain signal to obtain the second sequence {x(k)}.

[0042] As another example, the process by which the network device obtains the second sequence {x(k)} includes: the network device receives an output signal on K - 2l subcarriers; removes the cyclic prefix of the output signal to obtain a time-domain signal; performs a (K - 2l)-point DFT on the time-domain signal to obtain a frequency-domain signal; and based on the frequency-domain signal, performs an IDFT transformation on the frequency-domain signal to obtain the second sequence {x(k)}.

[0043] Optionally, the network device can also locally store the second sequence {x(k)}, and the network device can read the second sequence {x(k)} stored locally or the network device can generate the second sequence {x(k)} according to a formula.

[0044] Based on the above solution, through CPM, the phase of the continuous signal output within one period is continuous, which can reduce the power of the CPM signal. Sampling the continuous signal to determine the first sequence, and then determining the second sequence according to the first sequence and the discrete Fourier transform (DFT). The second sequence determined by the solution of the embodiments of the present application can make the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0045] In combination with the second aspect, in some implementation manners of the second aspect, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive d(n), where L is a positive integer.

[0046] In combination with the second aspect, in some implementations of the second aspect, the CPM is a non-recursive CPM, and the non-recursive CPM is such that the output at any given time is determined by L + 1 consecutive input values.

[0047] Based on the above solution, the continuous signal of the non-recursive CPM output within one period is only related to L + 1 consecutive bit sequence inputs. After sampling, the first sequence is determined, thus reducing the error propagation in demodulation and decoding. Therefore, while ensuring the reduction of error propagation in demodulation and decoding and improving the performance of demodulation and decoding, the first signal has a lower PAPR, thereby enhancing the uplink coverage.

[0048] In combination with the second aspect, in some implementations of the second aspect, s(k) satisfies:

[0049]

[0050] where L is a positive integer, i = 0, 1,..., L - 1, R is the sampling rate, T is the signal period, h is the modulation index, M is the modulation order, is the floor function, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

[0051] In combination with the second aspect, in some implementations of the second aspect, the initial values of the CPM satisfy: d(-1) = d(N - 1), d(-2) = d(N - 2),..., d(-L) = d(N - L), where L is a positive integer.

[0052] Based on the above solution, by initializing the CPM in a tail-biting manner, the phases at the start and end positions of the continuous signal obtained through the CPM are continuous. In this way, without additional overhead, the phases at the start and end positions of the CPM signal can be ensured to be continuous, making the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0053] In combination with the second aspect, in some implementations of the second aspect, before the CPM, the method further includes: circularly expanding the modulation symbol sequence {d(n)} by L, where L is a positive integer.

[0054] Optionally, before the non-recursive CPM, the modulation symbol sequence {d(n)} is circularly expanded by L. That is, the non-recursive CPM is performed on the modulation symbol sequence after circularly expanding it by L.

[0055] Optionally, the last L elements of the modulation symbol sequence {d(n)} can also be added to the front of the modulation symbol sequence before performing the CPM.

[0056] ​Based on the above solution, through non-recursive CPM, the continuous signal of non-recursive CPM output within one period is only related to the continuous L + 1 bit sequence inputs, which reduces the error propagation in demodulation and decoding. In addition, by circularly expanding the modulation symbol sequence or adding the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence, without additional overhead, the phases at the starting and ending positions of the continuous signal obtained through non-recursive CPM are continuous. Thus, after sampling, the first sequence is determined, and then based on the first sequence and the discrete Fourier transform (DFT), the second sequence is determined, enabling the first signal to have a lower PAPR, thereby enhancing the uplink coverage.

[0057] Combined with the second aspect, in some implementation manners of the second aspect, determining the second sequence {x(k)} according to the first sequence {s(k)} and the discrete Fourier transform DFT includes:

[0058] Multiplying the first sequence {s(k)} bit by bit with the mask sequence and then performing K-point DFT to determine the second sequence {x(k)} of length K; or,

[0059] Performing K-point DFT on the first sequence {s(k)} and then performing circular shift to determine the second sequence {x(k)} of length K.

[0060] Based on the above solution, the determined first sequence is processed by multiplying with the mask sequence or circular shift, making the determined second sequence more suitable, so that the first signal has a lower PAPR, thereby improving the coverage performance.

[0061] Combined with the second aspect, in some implementation manners of the second aspect, the mask sequence is [1, -1, 1, -1, …] or [-1, 1, -1, 1, …].

[0062] Optionally, multiply the first sequence {s(k)} bit by bit with the mask sequence, and then perform K-point DFT on the sequence obtained after multiplying with the mask sequence [1, -1, 1, -1, …] or [-1, 1, -1, 1, …], thereby determining a second sequence {x(k)} of length K.

[0063] Combined with the second aspect, in some implementation manners of the second aspect, the number of bits of the circular shift is half of the length of the second sequence {x(k)}.

[0064] Optionally, before cyclically shifting the first sequence {s(k)}, perform a K-point DFT transformation on the first sequence {s(k)}. Then cyclically shift the transformed sequence to determine a second sequence {x(k)} of length K; wherein, the number of bits for cyclic shift is half of the length of the second sequence {x(k)}.

[0065] In combination with the second aspect, in some implementations of the second aspect, receiving the first signal includes:

[0066] Receiving the first signal on K consecutive subcarriers; or,

[0067] Receiving the first signal on k' consecutive subcarriers, where k' < K and is a positive integer.

[0068] In combination with the second aspect, in some implementations of the second aspect, the modulation symbol sequence {d(n)} is a sequence obtained by amplitude modulating a data bit sequence.

[0069] In combination with the second aspect, in some implementations of the second aspect, the amplitude modulation is an M-order non-negative amplitude modulation.

[0070] In a third aspect, a communication device is provided. The device includes: a processing unit that determines a first sequence {s(k)} according to a modulation symbol sequence {d(n)}, where s(k) is the k-th element of the first sequence {s(k)}, k = 0, 1, 2,..., K - 1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, n = 0, 1, 2,..., N - 1, K and N are positive integers, and the first sequence {s(k)} is a sequence after continuous phase modulation (CPM) and sampling of the modulation symbol sequence {d(n)}; determines a second sequence {x(k)} according to the first sequence {s(k)} and discrete Fourier transform (DFT);

[0071] a transceiver unit for transmitting a first signal.

[0072] The processing unit is further configured to map the second sequence {x(k)} to a plurality of consecutive subcarriers to generate a first signal.

[0073] The transceiver unit can perform the receiving and transmitting processes in the foregoing first aspect, and the processing unit can perform other processes in the foregoing first aspect except for receiving and transmitting.

[0074] Fourthly, a communication device is provided, which includes: a transceiver unit that receives a first signal, where the first signal is a signal generated according to a second sequence {x(k)}, and the second sequence {x(k)} is determined according to a first sequence {s(k)} and a discrete Fourier transform (DFT). Among them, the first sequence {s(k)} is determined according to a modulation symbol sequence {d(n)}, s(k) is the k-th element of the first sequence {s(k)}, where k = 0, 1, 2, …, K - 1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, where n = 0, 1, 2, …, N - 1, and K and N are positive integers. The first sequence {s(k)} is a sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)}.

[0075] A processing unit configured to obtain data carried on the second sequence {x(k)} from the first signal.

[0076] The transceiver unit can perform the receiving and sending processes in the foregoing second aspect, and the processing unit can perform other processes in the foregoing second aspect except for receiving and sending.

[0077] Fifthly, a communication device is provided, which includes a processor configured to execute a computer program, so that the device performs the methods in the foregoing first aspect to the second aspect and any possible implementation manners thereof.

[0078] Optionally, the processor is one or more.

[0079] Optionally, the communication device further includes a memory configured to store the computer program, and the memory is one or more.

[0080] Optionally, the memory can be integrated with the processor, or the memory is separately provided from the processor, or the memory is located inside the processor.

[0081] Optionally, the communication device further includes a transceiver circuit, such as a transceiver or an input / output circuit.

[0082] Sixthly, a communication system is provided, which includes: a network device and a terminal device. The network is configured to perform the method in any possible implementation manner of the foregoing first aspect, and the terminal device is configured to perform the method in any possible implementation manner of the foregoing second aspect.

[0083] Seventhly, a computer-readable storage medium is provided. The computer-readable storage medium stores a computer program or code, and when the computer program or code runs on a computer, the computer is caused to perform the methods in the foregoing first aspect to the second aspect and any possible implementation manners thereof.

[0084] In an eighth aspect, a chip is provided, including at least one processor configured to run a computer program, such that a device installed with the chip executes the methods in the above first aspect to the second aspect and any possible implementation manners thereof.

[0085] Wherein, the chip may include an output circuit or interface for sending information or data, and an input circuit or interface for receiving information or data.

[0086] In a ninth aspect, a computer program product is provided, the computer program product including: computer program code which, when running on a computer, executes the methods in the above first aspect to the second aspect and any possible implementation manners thereof. Description of the Drawings

[0087] Figure 1 is a schematic diagram of a communication system applicable to the embodiments of the present application.

[0088] Figure 2 is a schematic diagram of a π / 2BPSK modulated DFT-s-OFDM waveform.

[0089] Figure 3 is a schematic flowchart of a method for transmitting a signal provided by an embodiment of the present application.

[0090] Figure 4 is a schematic flowchart of mapping a second sequence to subcarriers.

[0091] Figure 5 is a schematic flowchart of generating a first signal provided by an embodiment of the present application.

[0092] Figure 6 is a schematic flowchart of generating a first signal provided by another embodiment of the present application.

[0093] Figure 7 is a schematic structural diagram of a communication device provided by an embodiment of the present application.

[0094] Figure 8 is a schematic structural diagram of a communication device provided by an embodiment of the present application.

[0095] Figure 9 is a schematic structural diagram of a communication device provided by an embodiment of the present application. Detailed Embodiments

[0096] Next, the technical solutions in the present application will be described with reference to the drawings.

[0097] The technical solution provided by this application can be applied to various communication systems, such as: the 5th generation (5G) or new radio (NR) system, the long term evolution (LTE) system, the LTE frequency division duplex (FDD) system, the LTE time division duplex (TDD) system, the wireless local area network (WLAN) system, the satellite communication system, future communication systems such as the 6th generation mobile communication system, or a fusion system of multiple systems, etc. The technical solution provided by this application can also be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine type communication (MTC), and the Internet of Things (IoT) communication system or other communication systems.

[0098] As an example, V2X communication can include: vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, vehicle-to-network (V2N) communication. V2V refers to communication between vehicles. V2P refers to communication between a vehicle and a person (including pedestrians, cyclists, drivers, or passengers, etc.). V2I refers to communication between a vehicle and infrastructure, such as a road side unit (RSU) or a network device. Among them, the RSU includes two types: the terminal type of RSU, which is located by the roadside and is in a non-mobile state, and mobility does not need to be considered; the base station type of RSU, which can provide timing synchronization and resource scheduling for the vehicles communicating with it. V2N refers to communication between a vehicle and a network device. It can be understood that the above is an exemplary description, and the embodiments of this application are not limited thereto. For example, V2X can also include V2X communication based on the NR system in the current 3GPP Rel-16 and subsequent versions, etc.

[0099] Figure 1 is a schematic diagram of the communication system 100 applicable to the embodiments of this application. As Figure 1As shown, the communication system 100 may include a network device 110 and at least one terminal device (such as Figure 1 the terminal device 120 in). The terminal device 120 is connected to the network device 110 wirelessly. The terminal device can be in a fixed position or movable. Figure 1 This is just a schematic diagram. The communication system may further include other network devices, such as wireless relay devices and wireless backhaul devices, which are not drawn in Figure 1 . The embodiments of the present application do not limit the number of network devices and terminal devices included in the communication system.

[0100] The terminal device in the embodiments of the present application may also be referred to as a user equipment (UE), access terminal, user unit, user station, mobile station, mobile device, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.

[0101] The terminal device may be a device that provides voice / data to users. For example, it may be a handheld device with wireless connection function, in-vehicle device, etc. Currently, some examples of terminals are: mobile phone, tablet computer, laptop computer, palmtop computer, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, cellular phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (WLL) station, personal digital assistant (PDA), handheld device with wireless communication function, computing device or other processing devices connected to a wireless modem, wearable device, terminal device in a 5G network or terminal device in a future evolved public land mobile network (PLMN), etc. The embodiments of the present application do not limit this.

[0102] By way of example and not limitation, in the embodiments of the present application, the terminal device may also be a wearable device. A wearable device, also known as a wearable intelligent device, is a general term for devices developed by applying wearable technologies to the intelligent design of daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is either worn directly on the body or integrated into the user's clothing or accessories. A wearable device is not just a hardware device, but also realizes powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable intelligent devices include those with complete functions, large sizes, and can realize complete or partial functions without relying on a smartphone, such as smart watches or smart glasses, etc., as well as those that only focus on a certain type of application function and need to cooperate with other devices such as smartphones, such as various smart bracelets and smart jewelry for physical sign monitoring.

[0103] The network device in the embodiments of the present application can be a device for communicating with a terminal device. This network device can also be referred to as an access network device or a radio access network device. For example, the network device can be a base station. The network device in the embodiments of the present application can refer to a radio access network (RAN) node (or device) that connects a terminal device to a wireless network. The base station can generally cover various names as follows, or be replaced with the following names, such as: Node B, evolved Node B (eNB), next generation Node B (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, slave station, multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. The base station can be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof. The base station can also refer to a communication module, a modem or a chip disposed in the foregoing device or apparatus. The base station can also be a mobile switching center and a device that undertakes the function of a base station in D2D, V2X, M2M communications, a network-side device in a 6G network, a device that undertakes the function of a base station in a future communication system, etc. The base station can support networks with the same or different access technologies. The embodiments of the present application do not limit the specific technologies and specific device forms adopted by the network device.

[0104] The base station can be fixed or mobile. For example, a helicopter or a drone can be configured to act as a mobile base station, and one or more cells can move according to the position of the mobile base station. In other examples, a helicopter or a drone can be configured to be a device for communicating with another base station.

[0105] In some deployments, the network device mentioned in the embodiments of this application may be a device including a CU, or a DU, or a device including a CU and a DU, or a control plane CU node (Central Unit-Control Plane, CU-CP) and a user plane CU node (Central Unit-User Plane, CU-UP) and a DU node.

[0106] In different systems, the CU (or CU-CP and CU-UP), DU, or RU may also have different names, but those skilled in the art can understand their meanings. For example, in an Open Radio Access Network (Open RAN, ORAN) system, the CU may also be referred to as an O-CU (Open CU), the DU may also be referred to as an O-DU, the CU-CP may also be referred to as an O-CU-CP, the CU-UP may also be referred to as an O-CU-UP, and the RU may also be referred to as an O-RU. Any unit of the CU (or CU-CP, CU-UP), DU, and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0107] In the embodiments of this application, the apparatus for implementing the functions of the network device may be the network device or an apparatus capable of supporting the network device to implement such functions, such as a chip system or a chip, and this apparatus may be installed in the network device. In the embodiments of this application, the chip system may be composed of chips or may also include chips and other discrete devices.

[0108] The network device and the terminal device may be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they may also be deployed on water; they may also be deployed on airplanes, balloons, and satellites in the air. The embodiments of this application do not limit the scenarios where the network device and the terminal device are located.

[0109] The network device and the terminal device, the network device and the network device, and the terminal device and the terminal device may communicate through licensed spectrum, or through unlicensed spectrum, or through both licensed spectrum and unlicensed spectrum at the same time; they may communicate through spectrum below 6 gigahertz (GHz), or through spectrum above 6 GHz, or through both spectrum below 6 GHz and spectrum above 6 GHz at the same time. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0110] In an embodiment of the present application, the functions of the network device can also be performed by a module (such as a chip) in the network device, or can be performed by a control subsystem including the functions of the network device. The control subsystem including the functions of the network device here can be a control center in the above application scenarios such as smart grid, industrial control, intelligent transportation, and smart city. The functions of the terminal device can also be performed by a module (such as a chip or a modem) in the terminal device, or can be performed by a device including the functions of the terminal device.

[0111] In the present application, the network device sends a downlink signal or downlink information to the terminal device, and the downlink information is carried on a downlink channel; the terminal device sends an uplink signal or uplink information to the network device, and the uplink information is carried on an uplink channel. In order to communicate with the network device, the terminal device needs to establish a wireless connection with a cell controlled by the network device. The cell that has established a wireless connection with the terminal device is called the serving cell of the terminal device. When the terminal device communicates with the serving cell, it is also interfered by signals from neighboring cells.

[0112] The peak-to-average power ratio (PAPR) is the ratio of the peak power to the average power of a signal. When the waveforms corresponding to each modulation symbol have the same or similar phases at a certain time-domain sampling point, the superimposed signal of multiple modulation symbols will generate a large instantaneous peak power, thereby bringing a high PAPR. Since the linear dynamic range of the power amplifier is limited, too high PAPR will cause the power amplifier to enter the nonlinear region, resulting in nonlinear distortion of the signal after passing through the power amplifier, causing spectrum expansion and in-band signal distortion, and reducing the system performance. To avoid high-PAPR signals from entering the nonlinear region of the power amplifier, the terminal device can use power back-off technology to back off the power of the signal. However, the higher the PAPR, the higher the power that needs to be backed off, so the coverage range of this signal is smaller, resulting in a decline in the coverage performance of the signal.

[0113] Figure 2 It is a schematic diagram of the π / 2BPSK modulation DFT-s-OFDM waveform. As Figure 2 shown, for example, taking the number of subcarriers as M, after encoding and interleaving the source bits, the bit b(i) is obtained. After π / 2BPSK modulation of the interleaved bits, M modulation symbols d(i) are obtained, and its modulation formula is:

[0114]

[0115] The M modulation symbols are subjected to M-point discrete Fourier transform (DFT) to obtain a frequency-domain signal; further, the frequency-domain signal is windowed and filtered to obtain a filtered frequency-domain signal, and then the frequency-domain signal is mapped onto M subcarriers to generate an output signal for transmission, that is, a π / 2BPSK+DFT-s-OFDM signal. Among them, an inverse fast Fourier transformation (IFFT) is used to generate the output signal. Specifically, the signal mapped onto the subcarriers is subjected to an N-point IFFT transformation to obtain a time-domain signal, where N can be determined by the system bandwidth and N is greater than M. When there are multiple transmit antennas, the frequency-domain signal can also be multiplied by a precoding matrix before subcarrier mapping. Then, a cyclic prefix (CP) is added to the time-domain signal and then digital-to-analog conversion is performed to obtain the output signal, and the output signal is transmitted through an antenna. However, the PAPR value of the signal obtained by this scheme is affected by the coefficient of windowing in the frequency domain, and the PAPR of the output signal obtained by the above scheme is relatively high. For example, it can reach 2 to 3 dB.

[0116] In view of this, the present application proposes a method for transmitting a signal and a communication device. By performing continuous phase modulation (CPM) on a bit sequence after coding and interleaving, the phase of the continuous signal output within one period is continuous. The continuous signal is sampled to determine a first sequence, and then a second sequence is determined according to the first sequence and DFT. The second sequence is mapped onto a plurality of consecutive subcarriers to generate a first signal, and the first signal is transmitted; after multiplying the sequence after CPM sampling by a mask sequence or performing a cyclic shift, the PAPR of the output signal is reduced, thereby enhancing the uplink coverage.

[0117] Figure 3 It is a schematic flowchart of a method 300 for transmitting a signal provided by an embodiment of the present application. As Figure 3 shown, the method 300 may include the following multiple steps. It should be understood that the process can be executed by a network device and a terminal device, and the terminal device is used to send a signal to the network device. For the sake of convenience of description, the following will be described with the network device and the terminal device as the execution entities.

[0118] S310. The terminal device determines a first sequence {s(k)} according to the modulation symbol sequence {d(n)}.

[0119] Exemplarily, s(k) is the k-th element of the first sequence {s(k)}, where k = 0, 1, 2, …, K-1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, where n = 0, 1, 2, …, N-1, K and N are positive integers, and the first sequence {s(k)} is the sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)}.

[0120] Optionally, before step S310, method 300 further includes an encoding and interleaving process. Figure 3 which is not shown in the figure.

[0121] Exemplarily, the source bits are encoded to obtain the encoded bits. Among them, the encoding method can be low density parity check code (LDPC) encoding, or polar code encoding, or turbo encoding.

[0122] Exemplarily, the encoded bits are interleaved to obtain an interleaved bit sequence. For example, the interleaved bit sequence is: {b(n)} = b(0), b(1),..., b(mN-1), where b(n) is the n-th element in the bit sequence {b(n)}, n = 1, 2, …, mN-1, and m = log2M.

[0123] Furthermore, the interleaved bit sequence {b(n)} is amplitude modulated to obtain a modulation symbol sequence {d(n)}, where d(n) is the n-th element in the modulation symbol sequence {d(n)}, n = 1, 2, …, N-1.

[0124] Furthermore, CPM is performed on the modulation symbol sequence {d(n)} obtained after amplitude modulation to obtain a continuous signal s(t).

[0125] Exemplarily, the modulation symbol sequence {d(n)} is used as the input of CPM, and CPM is performed on it to obtain a continuous signal s(t). The specific process of CPM is as follows:

[0126] The expression of the continuous signal s(t) obtained after CPM is as follows:

[0127]

[0128] where represents the phase of the continuous signal s(t), which can be expressed by the following formula:

[0129]

[0130] Wherein, L is a positive integer, which can be the response length, for example, it can be 2, 3, 4, etc.; h is the modulation index, which can be a fraction, for example, it can be 1 / 2, 1 / 4; T is the signal period; denotes the floor function for ; q(t) is the phase response function, which can be expressed by the following formula:

[0131]

[0132] Exemplarily, F(t) can be a rectangular pulse function, a cosine pulse function, which is not limited herein. In the embodiments of the present application, the raised cosine pulse function is taken as an example for illustration, and it can be expressed as:

[0133]

[0134] Substituting formula (4) into formula (3), the following formula can be obtained:

[0135]

[0136] Furthermore, the obtained continuous signal s(t) is sampled at equal intervals.

[0137] Exemplarily, the sampling interval is set to T / R, that is The sampling rate R can be an integer or a fraction. For example, R can be 1, 3 / 2, 2, etc. Thus, the first sequence {s(k)} is obtained. The specific expression of the first sequence {s(k)} can be as follows formula (6):

[0138]

[0139] It should be noted that, in the embodiments of the present application, some steps of generating the first signal can also be equivalently implemented by one step. The embodiments of the present application do not limit this. For example, the first sequence {s(k)} can also achieve the same effect without first performing CPM and then sampling. For example, the specific expression can be as follows:

[0140]

[0141] Wherein, h is the modulation index, M is the modulation order, denotes the floor function for ; R is the sampling rate, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

[0142] It should be noted that, in the embodiments of the present application, the index of the modulation symbol sequence {d(n)} or the index of the bit sequence {b(n)} is only used to represent the order relationship of the sequence elements, and can start from 0 or 1, or start from other numbers. The embodiments of the present application do not limit this.

[0143] Exemplarily, the amplitude modulation may be non - negative amplitude modulation, where non - negative means that the value range of the modulation symbol d(n) is: 0, 1, …, M - 1, and M represents the modulation order.

[0144] Specifically, when the modulation order M = 2, d(n)=b(n), where b(n) is the n - th element in the interleaved bit sequence {b(n)}. After modulation, the modulation symbol d(n) takes 0 or 1, that is, d(n)=0 or d(n)=1.

[0145] When the modulation order M = 4, 2 bits of b(n) are modulated into one modulation symbol d(n). The modulated modulation symbol d(n) can be d(n)=0, or d(n)=1, or d(n)=2, or d(n)=3. Specifically, the bit sequences [0, 0], [0, 1], [1, 0], [1, 1] are modulated into 0, 1, 2, 3 respectively. When the modulation order M = 8 or 16, the modulation process of the bit sequence b(n) is also the same as the above - mentioned method, which will not be elaborated here.

[0146] It should be noted that the modulation method in the embodiments of this application is only an example. The relationship between the bit sequence {b(n)} and the modulation symbol sequence {d(n)} can also be other defined corresponding relationships. For example, the bit sequences [0, 0], [0, 1], [1, 0], [1, 1] can also be modulated into 0, 2, 1, 3 respectively. The embodiments of this application do not make any limitations in this regard.

[0147] It should also be noted that the bit sequence {b(n)} can be a bit stream, a bit string or a bit set, etc. The modulation symbol sequence {d(n)} can also be a modulation symbol stream, a modulation symbol string or a modulation symbol set, etc. The embodiments of this application are not limited thereto.

[0148] Optionally, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive modulation symbols d(n), where L is a positive integer. For example, L can be the response length, and the value can be: 2, 3, 4, etc.

[0149] Optionally, the CPM can be non - recursive CPM, and the non - recursive CPM satisfies that the output at any time is determined by L + 1 consecutive input values.

[0150] Exemplarily, assuming R = 4, L = 2, then formula (7) can be expressed as:

[0151]

[0152] For example, when k = 0, It can be seen that s(0) at this time is related to the modulation symbols d(-2), d(-1), and d(0). That is to say, s(0) is related to L + 1 = 3 modulation symbols. It should be noted that when k = 0, non-recursive CPM needs to be initialized, that is, the values of the modulation symbols d(-2) and d(-1) need to be determined. Here, d(-2) and d(-1) are set to 0.

[0153] For another example, when k = 8, at this time It can be seen that s(8) at this time is related to the modulation symbols d(0), d(1), and d(2). That is to say, s(0) is related to L + 1 = 3 modulation symbols.

[0154] It should be noted that during the process of non-recursive CPM, the continuous signal s(t) output within the Qth period, where t ∈ [(Q - 1)t, QT], is only related to the input of continuous L + 1 modulation symbols. In this way, when a bit has a decoding error or demodulation error, the error will not spread to all subsequent bits, but only to a few bits, thereby reducing the error propagation of demodulation or decoding and improving the performance of demodulation or decoding.

[0155] In the embodiments of this application, the continuous signal of non-recursive CPM output within one period is only related to the input of continuous L + 1 bit sequences. After sampling, the first sequence is determined, which reduces the error propagation of demodulation and decoding. Thus, while ensuring the reduction of the error propagation of demodulation and decoding, the performance of demodulation and decoding is improved, thereby enhancing the uplink coverage.

[0156] Optionally, the initialization method of this CPM is tail-biting initialization.

[0157] When performing CPM, if k = 0, due to the existence of the values of d(-1), d(-2),..., d(-L), it needs to be initialized. Traditional CPM sets the values of d(-1), d(-2),..., d(-L) to 0, but this cannot ensure the phase continuity between the starting position and the ending position of the CPM signal. Therefore, in the embodiments of this application, tail-biting initialization is performed, and the specific implementation method can be as follows:

[0158] The modulation symbol sequence {d(n)} is circularly extended by L and then CPM is performed; or,

[0159] The last L elements of the modulation symbol sequence {d(n)} are added to the front of the modulation symbol sequence {d(n)} and then CPM is performed.

[0160] In the embodiments of the present application, initialization is performed in a tail-biting manner, such that the values of the modulation symbols d(-1), d(-2), …, d(-L) are related to L elements of the modulation symbol sequence {d(n)}. Without increasing overhead, the phase continuity at the start and end positions of the CPM signal can be ensured, so that the first signal has a lower PAPR.

[0161] Specifically, the modulation symbol sequence {d(n)} satisfies: d(-1) = d(N - 1), d(-2) = d(N - 2), …, d(-L) = d(N - L).

[0162] Exemplarily, assuming N = 4, R = 4, L = 2, then at this time, formula (7) can be expressed as:

[0163]

[0164] For example, when k = 0, It can be seen that at this time, s(0) is related to the modulation symbols d(-2), d(-1), d(0). That is to say, s(0) is related to L + 1 = 3 modulation symbols. It should be noted that when k = 0, tail-biting initialization is performed on the CPM, that is, the values of the modulation symbols d(-2) and d(-1) are not set to 0, but are set to: d(-2) = d(2), d(-1) = d(3). That is, the modulation symbol sequence {d(0), d(1), d(2), d(3)} is cycled by L = 2 lengths, or the last L = 2 elements d(2) and d(3) of the modulation symbol sequence {d(0), d(1), d(2), d(3)} are added to the front of the modulation symbol sequence {d(0), d(1), d(2), d(3)}. Then s(0) is related to the last 2 elements d(2) and d(3) of the modulation symbol sequence {d(n)}.

[0165] For another example, when k = 8, at this time It can be seen that at this time s(8) is related to the modulation symbols d(0), d(1), d(2). That is to say, s(0) is related to L + 1 = 3 modulation symbols. At this time, s(8) does not include d(-1), d(-2), …, d(-L). Therefore, the first 8 values of the first sequence {s(k)} are related to the last elements of the modulation symbol sequence {d(n)}.

[0166] In the embodiment of the present application, by initializing the CPM in a tail-biting manner, the values of the modulation symbols d(-1), d(-2), …, d(-L) are related to L elements of the modulation symbol sequence {d(n)}, and there is no additional cost to fill zeros at the tail of the modulation symbols. Also, the phases at the starting position and the ending position of the continuous signal can be made continuous. In this way, without additional cost, the phases at the starting position and the ending position of the CPM signal can be ensured to be continuous, making the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0167] Optionally, the CPM is a non-recursive CPM, and the initialization method of the non-recursive CPM is tail-biting initialization. Among them, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive modulation symbols d(n). The non-recursive CPM satisfies that the output at any moment is determined by L + 1 consecutive input values.

[0168] The tail-biting initialization is to perform CPM after circularly expanding the modulation symbol sequence {d(n)} by length L; or, to perform CPM after adding the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)}.

[0169] For example, assume N = 4, R = 4, L = 2, when k = 0, At this time, s(0) is related to the modulation symbols d(-2), d(-1), d(0). That is to say, s(0) is related to L + 1 = 3 modulation symbols. It should be noted that when k = 0, the non-recursive CPM is initialized in a tail-biting manner, that is, the values of the modulation symbols d(-2), d(-1) are set to: d(-2) = d(2), d(-1) = d(3). That is, the modulation symbol sequence {d(0), d(1), d(2), d(3)} is circularly expanded by L = 2 lengths or the last L = 2 elements d(2) and d(3) of the modulation symbol sequence {d(0), d(1), d(2), d(3)} are added to the front of the modulation symbol sequence {d(0), d(1), d(2), d(3)}, then s(0) is related to the last 2 elements d(2) and d(3) of the modulation symbol sequence {d(n)}.

[0170] In the embodiment of the present application, through the non-recursive CPM, the continuous signal output by the non-recursive CPM within one period is only related to the input of L + 1 consecutive modulation symbol sequences, which reduces the error propagation of demodulation and decoding; in addition, the non-recursive CPM is initialized in a tail-biting manner, so that without additional cost, the phases at the starting position and the ending position of the continuous signal obtained through CPM are continuous. Then, the first sequence is determined after sampling, and the second sequence is determined according to the first sequence and the DFT, which can make the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0171] S320. Determine a second sequence {x(k)} according to the first sequence {s(k)} and the discrete Fourier transform (DFT).

[0172] Method 1:

[0173] Exemplarily, multiply the first sequence {s(k)} determined in step S310 by a mask sequence, which can be [1, -1, 1, -1, …] or [-1, 1, -1, 1, …]. Specifically, multiply the first sequence {s(k)} and the mask sequence bit by bit. Assume the first sequence {s(k)} is: [s(0), s(1),..., s(K - 1)]. When K is even, the result of multiplying it by the mask sequence is: [s(0)×1, s(1)×(-1),..., s(K - 1)×(-1)] or [s(0)×(-1), s(1)×1,..., s(K - 1)×1]; when K is odd, the result of multiplying it by the mask sequence is: [s(0)×1, s(1)×(-1),..., s(K - 1)×1] or [s(0)×(-1), s(1)×1,..., s(K - 1)×(-1)].

[0174] Further, perform a K-point DFT on the sequence after multiplying by the mask sequence to obtain the sequence {x(k)} = [x(0), x(1),..., x(K - 1)], where k = 0, 1, 2,..., K - 1. The sequence {x(k)} is the second sequence determined after performing a K-point DFT on the first sequence multiplied by the mask sequence.

[0175] Method 2:

[0176] Exemplarily, perform a K-point DFT on the first sequence {s(k)} to obtain the sequence {x′(k)} = [x(0), x(1),..., x(K - 1)], and perform a cyclic shift on this sequence, where the number of shifted bits is half of the length of the sequence {x′(k)}. The result of the cyclic shift is: {x(k)} = [x K / 2 , x K+1 ,..., x K-1 , x0, x1,..., x K-1 . The sequence {x(k)} is the second sequence determined by performing a cyclic shift after a K-point DFT transformation on the first sequence {s(k)}.

[0177] S330. Map the second sequence {x(k)} to a plurality of consecutive subcarriers to generate a first signal.

[0178] Exemplarily, the first signal may be a physical uplink shared channel (PUSCH), a physical uplink control channel (PUCCH), etc. The embodiments of the present application do not limit the specific implementation form of the first signal.

[0179] In one example, all K terms in the second sequence {x(k)} are mapped to K consecutive subcarriers to generate the first signal.

[0180] In another example, a partial number of terms of the second sequence {x(k)} are intercepted, for example, k' terms are intercepted, where k' < K and is a positive integer, and they are mapped to k' consecutive subcarriers to generate the first signal.

[0181] For the specific steps of the terminal device mapping the second sequence {x(k)} to multiple consecutive subcarriers to generate the first signal, see Figure 4 , which will not be elaborated here.

[0182] S340: Send the first signal to the network device. Correspondingly, the network device receives the first signal from the terminal device.

[0183] Specifically, the terminal device sends the first signal through radio frequency, that is, the terminal device sends the first signal carrying the second sequence {x(k)} on the above-mentioned multiple subcarriers. The network device receives the first signal sent by the terminal device through radio frequency, that is, the network device receives the first signal carried on the above-mentioned multiple subcarriers.

[0184] Optionally, the process for the network device to receive the first signal carried on multiple subcarriers is: obtain the time-domain signal and remove the cyclic prefix; then perform DFT on the signal after removing the cyclic prefix to obtain the frequency-domain signal.

[0185] S350: The network device obtains the data carried on the second sequence {x(k)} from the first signal.

[0186] Exemplarily, the network device obtaining the data carried on the second sequence {x(k)} from the first signal includes performing equalization processing, demodulation processing, and decoding processing on the first signal to obtain the data carried on the second sequence {x(k)}.

[0187] It should be noted that equalization can be used to compensate for the impact of signal transmission, or signal transmission and filtering, etc. For example, in multi-antenna reception, this equalization can be multi-antenna reception equalization. Due to the influence of the channel, the signal will be distorted during transmission, and the distortion brought by the signal transmission process can be compensated through equalization.

[0188] It should be understood that the embodiments of the present application do not limit the specific implementation process of equalization. For example, the first signal is processed by equalization to obtain the data carried on the second sequence {x(k)}; alternatively, the first signal may also obtain the data carried on the second sequence {x(k)} through other equivalent implementation manners, and the embodiments of the present application are not limited thereto.

[0189] As an example, the process for the network device to obtain the data carried on the second sequence {x(k)} includes: the network device receives the first signal on K subcarriers; removes the cyclic prefix of the output signal to obtain a time-domain signal; performs a K-point DFT on the time-domain signal to obtain a frequency-domain signal; performs equalization based on the frequency-domain signal, then performs an inverse discrete Fourier transformation (IDFT) on the frequency-domain signal, and then demodulates the signal after IDFT to obtain the data carried on the second sequence {x(k)}.

[0190] As another example, the process for the network device to obtain the data carried on the second sequence {x(k)} includes: the network device receives the first signal on K - 2l subcarriers, that is, receives the output signal on k' subcarriers; removes the cyclic prefix of the output signal to obtain a time-domain signal; performs a (K - 2l)-point DFT on the time-domain signal to obtain a frequency-domain signal; based on the frequency-domain signal, performs an IDFT transformation on the frequency-domain signal to obtain the data carried on the second sequence {x(k)}.

[0191] The following combines Figure 4 , and maps the second sequence {x(k)} to multiple consecutive subcarriers to generate the first signal in step S330 above. A detailed description is given.

[0192] Figure 4 is a schematic flowchart of mapping the second sequence {x(k)} to multiple subcarriers. The following describes Figure 4 step S330 in

[0193] S3301. Map the second sequence {x(k)} to multiple subcarriers to obtain a frequency-domain signal.

[0194] In one example, the terminal device maps all K terms in the entire second sequence {x(n)} to K consecutive subcarriers to obtain a K-point frequency-domain signal.

[0195] The embodiments of the present application do not specifically limit the manner in which the terminal device maps all K terms in the entire second sequence {x(k)} to K consecutive subcarriers.

[0196] Optionally, the terminal device maps all K terms in the second sequence {x(k)} to K consecutive subcarriers. For example, the terminal device can map the K terms in the second sequence {x(k)} to K consecutive subcarriers in ascending (or descending) order of subcarrier numbers. One term is mapped to one subcarrier.

[0197] Optionally, the terminal device can also map the K terms in the second sequence {x(k)} to K equidistant subcarriers respectively. The interval can be greater than or equal to one subcarrier. For example, the terminal device can map the K terms in the second sequence {x(k)} to K equidistant subcarriers in ascending (or descending) order of subcarrier numbers. One term is mapped to one subcarrier.

[0198] It should be noted that mapping one term in the entire second sequence {x(k)} to one subcarrier means carrying this term on this subcarrier.

[0199] In another example, the terminal device intercepts part of the terms in the second sequence {x(k)}, such as intercepting k' terms, where k' < K and is a positive integer, and maps them to k' consecutive subcarriers to obtain a frequency-domain signal.

[0200] Exemplarily, the first l elements and the last l elements of the second sequence {x(k)} are removed, that is, the middle part of the second sequence is intercepted. For example, the second sequence {x(k)} = [x(0), x(1),..., x(K - 1)] intercepts [x(l), x(l + 1),..., x(K - l - 1)] and maps it to multiple subcarriers, that is, maps K - 2l terms in the second sequence to K - 2l subcarriers to obtain a frequency-domain signal with K - 2l points.

[0201] Optionally, the terminal device can map the K - 2l terms in the second sequence {x(k)} to 2M - 1 consecutive subcarriers respectively; or the terminal device can map the K - 2l terms in the second sequence to K - 2l equidistant subcarriers respectively. The specific process is as described above and will not be elaborated here.

[0202] S3302. Convert the frequency-domain signal into a time-domain signal and add a cyclic prefix to this time-domain signal to generate a first signal.

[0203] Optionally, the terminal device performs IDFT on the frequency-domain signal to obtain the corresponding time-domain signal, and then adds CP to this time-domain signal.

[0204] Optionally, the frequency-domain signal can also be multiplied by a precoding matrix and then subcarrier mapping is performed. Then CP is added to the time-domain signal to generate a first signal and send it.

[0205] Based on the above solution, through non-recursive CPM, the continuous signal of non-recursive CPM output within one period is only related to the input of consecutive L + 1 modulation symbol sequences, thus reducing the error propagation in demodulation and decoding. In addition, tail-biting initialization is performed on the non-recursive CPM, so that there is no additional overhead, and the phases at the starting position and the ending position of the continuous signal obtained through CPM are continuous. Then, after sampling, the first sequence is determined, and based on the first sequence and DFT, the second sequence is determined, which can make the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0206] Figure 5 It is a schematic flowchart of method 500 for transmitting signals provided by an embodiment of the present application. As Figure 5 shown, the method includes the following multiple steps. It should be understood that the relevant descriptions in the above Figures 3 to 4 shown embodiments are equally applicable to this implementation manner, Figures 3 to 4 and the content already described in the above

[0207] S510. Encode the source bits.

[0208] Exemplarily, the source bits are encoded to obtain the encoded bits. Among them, the encoding method can be LDPC encoding, or polar encoding, or turbo encoding.

[0209] S511. Interleave the encoded bit sequence.

[0210] Exemplarily, the encoded bits are interleaved to obtain the interleaved bit sequence. For example, the interleaved bit sequence is: {b(n)} = b(0), b(1),..., b(mN - 1), where b(n) is the nth element in the bit sequence {b(n)}, n = 1, 2,..., mN - 1, and m = log2M.

[0211] S512. After amplitude modulation of the interleaved bit sequence, perform CPM sampling to determine the first sequence {s(k)}.

[0212] The interleaved bit sequence {b(n)} is amplitude modulated to obtain the modulation symbol sequence {d(n)}. Among them, d(n) is the nth element in the modulation symbol sequence {d(n)}, n = 1, 2,..., N - 1. Then, CPM sampling is performed on the modulation symbol sequence {d(n)}.

[0213] Optionally, non-recursive CPM sampling is performed on the modulation symbol sequence {d(n)} to determine the first sequence {s(k)}. Among them, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive modulation symbols d(n), and L is a positive integer.

[0214] Optionally, CPM sampling can also be performed on the modulation symbol sequence {d(n)} to determine the first sequence {s(k)}. Among them, the initialization method of the CPM is tail-biting initialization, and the tail-biting initialization is to cyclically expand the modulation symbol sequence {d(n)} by L and then perform CPM; or, add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM.

[0215] Optionally, non-recursive CPM sampling can also be performed on the modulation symbol sequence {d(n)}, and the initialization method of the non-recursive CPM is tail-biting initialization; among them, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive modulation symbols d(n), and the tail-biting initialization is to cyclically expand the modulation symbol sequence {d(n)} by L and then perform CPM; or, add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM..

[0216] Among them, the specific implementation method of the above step S512 can refer to the relevant description of the above step S310.

[0217] S513. Multiply the first sequence (s(k)} by the mask sequence and perform DFT transformation to determine the second sequence {x(k)}.

[0218] Exemplarily, multiply the first sequence {s(k)} by the mask sequence bit by bit, and the mask sequence is [1, -1, 1, -1,...] or [-1, 1, -1, 1,...].

[0219] S514. Map the second sequence {x(k)} to multiple consecutive subcarriers to obtain a frequency-domain signal.

[0220] In one example, the terminal device maps all K terms in the entire second sequence {x(n)} to K consecutive subcarriers to obtain a K-point frequency-domain signal.

[0221] The embodiments of the present application do not specifically limit the manner in which the terminal device maps all K terms in the entire second sequence {x(n)} to K consecutive subcarriers.

[0222] Optionally, the terminal device maps all K terms in the second sequence {x(k)} to K consecutive subcarriers. For example, the terminal device can map the K terms in the second sequence {x(k)} to K consecutive subcarriers in ascending (or descending) order of subcarrier numbers. One term is mapped to one subcarrier.

[0223] Optionally, the terminal device can also map the K terms in the second sequence {x(k)} to K equally-spaced subcarriers, where the spacing can be greater than or equal to one subcarrier. For example, the terminal device can map the K terms in the second sequence {x(k)} to K equally-spaced subcarriers in ascending (or descending) order of subcarrier numbers. One term is mapped to one subcarrier.

[0224] It should be noted that mapping one term in the entire second sequence {x(k)} to one subcarrier means carrying this term on this subcarrier.

[0225] In another example, the terminal device intercepts a partial number of terms of the second sequence {x(k)}, for example, intercepts k' terms, where k' < K and is a positive integer, and maps them to k' consecutive subcarriers to obtain a frequency-domain signal.

[0226] Exemplarily, the first l elements and the last l elements of the second sequence {x(k)} are removed, that is, the elements in the middle part of the second sequence are intercepted. For example, the elements [x(;), x(l + 1),..., x(K - ; - 1)] in the second sequence {x(k)} = [x(0), x(1),..., x(K - 1)] are intercepted and mapped to multiple subcarriers, that is, K - 2l terms in the second sequence are mapped to K - 2; subcarriers to obtain a K - 2l - point frequency-domain signal.

[0227] Optionally, the terminal device can map the K - 2; terms in the second sequence {x(k)} to 2M - 1 consecutive subcarriers respectively; or the terminal device can map the K - 2l terms in the second sequence to K - 2l equally-spaced subcarriers respectively. The specific process is as described above and will not be elaborated here.

[0228] S515: Perform IDFT transformation on the frequency-domain signal to obtain a time-domain signal, and add CP to it to generate a first signal.

[0229] Optionally, perform IDFT transformation on the frequency-domain signal to obtain the corresponding time-domain signal, and then add CP to this time-domain signal.

[0230] Optionally, the frequency-domain signal can also be multiplied by a precoding matrix and then subjected to subcarrier mapping. Then add CP to the time-domain signal to generate a first signal and send it.

[0231] In the embodiment of the present application, after CPM and sampling, the first sequence is determined, and then the first sequence is multiplied by a mask and DFT to determine the second sequence. The second sequence determined by the solution of the embodiment of the present application can make the first signal have lower PAPR and good demodulation and decoding, thereby enhancing the uplink coverage.

[0232] Figure 6 It is a schematic flowchart of a method 600 for transmitting signals provided by an embodiment of the present application. As Figure 6 shown, the method includes the following steps. It should be understood that the relevant descriptions in the above Figures 3 to 4 shown embodiments are equally applicable to this implementation, Figures 3 to 4 and the content already described in the above embodiments will not be repeated here.

[0233] S610. Encode the source bits.

[0234] Exemplarily, the source bits are encoded to obtain the encoded bits. Among them, the encoding method can be LDPC encoding, or polar encoding, or turbo encoding.

[0235] S611. Interleave the encoded bit sequence.

[0236] Exemplarily, the encoded bits are interleaved to obtain the interleaved bit sequence. For example, the interleaved bit sequence is: {b(n)} = b(0), b(1),..., b(mN - 1), where b(n) is the nth element in the bit sequence {b(n)}, n = 1, 2,..., mN - 1, and m = log2M.

[0237] S612. After amplitude modulation of the interleaved bit sequence and then CPM sampling, determine the first sequence {s(k)}.

[0238] The interleaved bit sequence {b(n)} is amplitude - modulated to obtain the modulated symbol sequence {d(n)}. Among them, d(n) is the nth element in the modulated symbol sequence {d(n)}, n = 1, 2,..., N - 1. Then the modulated symbol sequence {d(n)} is subjected to CPM sampling.

[0239] Optionally, non - recursive CPM sampling is used for the modulated symbol sequence {d(n)} to determine the first sequence {s(k)}. Among them, the value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive modulated symbols d(n), and L is a positive integer.

[0240] Optionally, the modulation symbol sequence {d(n)} can also be sampled by CPM to determine the first sequence {s(k)}. Among them, the initialization method of this CPM is tail-biting initialization, and this tail-biting initialization is to cyclically expand the modulation symbol sequence {d(n)} by length L and then perform CPM; or, add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM.

[0241] Optionally, the modulation symbol sequence {d(n)} can also be sampled by non-recursive CPM, and the initialization method of this non-recursive CPM is tail-biting initialization; among them, any value of s(k) in the first sequence {s(k)} is determined by L+1 consecutive modulation symbols d(n), and this tail-biting initialization is to cyclically expand the modulation symbol sequence {d(n)} by length L and then perform CPM; or, add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM..

[0242] Among them, the specific implementation method of the above step S612 can refer to the relevant description of the above step S310.

[0243] S613. Perform DFT transformation on the first sequence {s(k)}, and perform circular shift on the transformed sequence to determine the second sequence {x(k)}.

[0244] Perform DFT of K points on the first sequence, and then perform circular shift on the sequence after DFT transformation to determine the second sequence {x(k)}, where the number of bits of the shift is half of the length of the second sequence {x(k)}.

[0245] S614. Map the second sequence {x(k)} to multiple consecutive subcarriers to obtain a frequency-domain signal.

[0246] In one example, the terminal device maps all K terms in the entire second sequence {x(n)} to K consecutive subcarriers to obtain a K-point frequency-domain signal.

[0247] The embodiments of the present application do not specifically limit the manner in which the terminal device maps all K terms in the entire second sequence {x(n)} to K consecutive subcarriers.

[0248] Optionally, the terminal device maps all K terms in the second sequence {x(k)} to K consecutive subcarriers. For example, the terminal device can map the K terms in the second sequence {x(k)} to K consecutive subcarriers in ascending (or descending) order of subcarriers. One term is mapped to one subcarrier.

[0249] Optionally, the terminal device may also map the K terms in the second sequence {x(k)} to K subcarriers with equal intervals respectively. This interval may be greater than or equal to one subcarrier. For example, the terminal device may map the K terms in the second sequence {x(k)} to K subcarriers with equal intervals in ascending (or descending) order of subcarriers. One term is mapped to one subcarrier.

[0250] It should be noted that mapping one term in the entire second sequence {x(k)} to one subcarrier means carrying this term on this subcarrier.

[0251] In another example, the terminal device intercepts a partial number of terms in the second sequence {x(k)}, such as intercepting k' terms, where k' < K and is a positive integer, and maps them to k' consecutive subcarriers to obtain a frequency-domain signal.

[0252] Exemplarily, the first; elements and the last; elements of the second sequence {x(k)} are removed, that is, the elements in the middle part of the second sequence are intercepted. For example, the [x(l), x(l + 1),..., x(K - l - 1)] in the second sequence {x(k)} = [x(0), x(1),..., x(K - 1)] is intercepted and mapped to multiple subcarriers. That is to say, the K - 2; terms in the second sequence are mapped to K - 2l subcarriers to obtain a frequency-domain signal with K - 2l points.

[0253] Optionally, the terminal device may map the K - 2l terms in the second sequence {x(k)} to K - 2l consecutive subcarriers respectively; or the terminal device may map the K - 2l terms in the second sequence to K - 2l subcarriers with equal intervals respectively. The specific process is as described above and will not be elaborated here.

[0254] S615: Perform an IDFT transformation on the frequency-domain signal to obtain a time-domain signal, and add a CP to it to generate a first signal.

[0255] Optionally, perform an IDFT transformation on the frequency-domain signal to obtain the corresponding time-domain signal, and then add a CP to this time-domain signal.

[0256] Optionally, the frequency-domain signal may also be multiplied by a precoding matrix and then subjected to subcarrier mapping. Then add a CP to the time-domain signal to generate a first signal and send it.

[0257] In the embodiment of the present application, after CPM and sampling, the first sequence is determined, and then the first sequence is circularly shifted and DFT is performed to determine the second sequence. The second sequence determined by the solution of the embodiment of the present application can make the first signal have a lower PAPR and good demodulation and decoding performance, thereby enhancing the uplink coverage.

[0258] The following will describe the device embodiments of the present application in conjunction with Figures 7 to 9 This will describe the device embodiments of the present application. These devices can be used to implement the functions of the terminal device or network device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiments of the present application, the communication device can be a terminal device or a network device, or can also be a module (such as a chip) applied to the terminal device or network device.

[0259] Figure 7 is a schematic structural diagram of the communication device according to the embodiments of the present application. Figure 7 The shown communication device 1000 can correspond to the terminal device in the above text. For example, Figure 7 As shown, the communication device 1000 includes a processing unit 1010 and a transceiver unit 1020. The transceiver unit 1020 can communicate with the outside, and the processing unit 1010 is used for data processing. The transceiver unit 1020 can also be referred to as a communication interface or a transceiver unit.

[0260] In a possible design, the device 1000 can implement the steps or processes executed by the terminal device in the above method embodiments. Among them, the processing unit 1010 is used to execute the operations related to the processing of the terminal device in the above method embodiments, and the transceiver unit 1020 is used to execute the operations related to the transceiver of the network device in the above method embodiments.

[0261] Exemplarily, the processing unit 1010 is used to determine a first sequence {s(k)} according to the modulation symbol sequence {d(n)}. Wherein, s(k) is the k-th element of the first sequence {s(k)}, k = 0, 1, 2,..., K - 1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, n = 0, 1, 2,..., N - 1, K and N are positive integers, and the first sequence {s(k)} is the sequence after continuous phase modulation (CPM) and sampling of the modulation symbol sequence {d(n)}; determine a second sequence {x(k)} according to the first sequence {s(k)} and the discrete Fourier transform (DFT).

[0262] Exemplarily, the transceiver unit 1020 is used to send a first signal.

[0263] Exemplarily, the processing unit 1010 is further used to map the second sequence {x(k)} to a plurality of consecutive subcarriers to generate a first signal.

[0264] In another possible design, the device 1000 can implement the steps or processes executed by the network device in the above method embodiments. Among them, the processing unit 1010 is used to execute the operations related to the processing of the network device in the above method embodiments, and the transceiver unit 1020 is used to execute the operations related to the transceiver of the network device in the above method embodiments.

[0265] Exemplarily, the transceiver unit 1020 is configured to receive a first signal, where the first signal is a signal generated according to a second sequence {x(k)}, and the second sequence {x(k)} is determined according to a first sequence {s(k)} and a discrete Fourier transform (DFT). Among them, the first sequence {s(k)} is determined according to a modulation symbol sequence {d(n)}, s(k) is the k-th element of the first sequence {s(k)}, where k = 0, 1, 2, …, K−1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, where n = 0, 1, 2, …, N−1, K and N are positive integers, and the first sequence {s(k)} is a sequence after continuous phase modulation (CPM) and sampling of the modulation symbol sequence {d(n)}.

[0266] Exemplarily, the processing unit 1010 is configured to obtain the data carried on the second sequence {x(k)} from the first signal.

[0267] It should be understood that the device 1000 here is embodied in the form of functional units. The term "unit" here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor, or a group of processors, etc.) for executing one or more software or firmware programs, and a memory, a combined logic circuit, and / or other suitable components that support the described functions. In an alternative example, those skilled in the art can understand that the device 1000 may specifically be the sending end in the above embodiments, and can be used to execute each process and / or step corresponding to the sending end in the above method embodiments. Or, the device 1000 may specifically be the receiving end in the above embodiments, and can be used to execute each process and / or step corresponding to the receiving end in the above method embodiments. To avoid repetition, details are not described herein again.

[0268] The device 1000 in each of the above solutions has the function of implementing the corresponding steps executed by the sending end in the above method. Or, the device 1000 in each of the above solutions has the function of implementing the corresponding steps executed by the receiving end in the above method. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions. For example, the transceiver unit can be replaced by a transceiver (for example, the sending unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver). Other units, such as the processing unit, etc., can be replaced by a processor to respectively execute the transceiver operations and related processing operations in each method embodiment.

[0269] In addition, the above transceiver unit may also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit may be a processing circuit. In an embodiment of the present application, the device 1000 may be the receiving device or the transmitting device in the foregoing embodiments, or may be a chip or a chip system in the receiving device or the transmitting device, for example: a system on chip (SoC). Among them, the transceiver unit may be an input / output circuit, a communication interface. The processing unit is a processor, a microprocessor or an integrated circuit integrated on the chip. There is no limitation here.

[0270] Figure 8 It is a schematic structural diagram of a communication device 2000 provided by an embodiment of the present application. As Figure 8 shown, the device 2000 includes a processor 2010 and a transceiver 2020. Among them, the processor 2010 and the transceiver 2020 communicate with each other through an internal connection path. The processor 2010 is used to execute instructions to control the transceiver 2020 to send signals and / or receive signals.

[0271] Optionally, the device 2000 may further include a memory 2030, and the memory 2030 communicates with the processor 2010 and the transceiver 2020 through an internal connection path. The memory 2030 is used to store instructions, and the processor 2010 may execute the instructions stored in the memory 2030.

[0272] It should be understood that the device 2000 may specifically be the sending end or the receiving end in the above embodiments, or may be a chip or a chip system. Correspondingly, the transceiver 2020 may be the transceiver circuit of the chip, and there is no limitation here. Specifically, the device 2000 may be used to execute each step and / or process corresponding to the sending end or the receiving end in the above method embodiments.

[0273] Optionally, the memory 2030 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A part of the memory may also include a non-volatile random access memory. For example, the memory may also store information about the device type. The processor 2010 may be used to execute the instructions stored in the memory, and when the processor 2010 executes the instructions stored in the memory, the processor 2010 is used to execute each step and / or process of the above method embodiments corresponding to the sending end or the receiving end.

[0274] Figure 9 It is a schematic structural diagram of a communication device provided by another embodiment of the present application. As Figure 9As shown in the figure, the communication device 3000 includes a processor 3010 and an interface circuit 3020. The processor 3010 and the interface circuit 3020 are coupled to each other. It can be understood that the interface circuit 3020 can be a transceiver or an input / output interface. Optionally, the communication device 3000 may further include a memory 3030, which is used to store instructions executed by the processor 3010, or input data required for the processor 3010 to execute instructions, or data generated after the processor 3010 executes instructions.

[0275] When the communication device 3000 is used to implement the above method embodiments, the processor 3010 is used to execute the functions of the above processing unit 1010, and the interface circuit 3020 is used to execute the functions of the above transceiver unit 3020.

[0276] When the above communication device is a chip applied to a terminal device, the chip implements the functions of the terminal device in the above method embodiments. The chip receives information from other modules (such as a radio frequency module or an antenna) in the terminal device, and this information is sent by other network elements to the terminal device; or, the chip sends information to other modules (such as a radio frequency module or an antenna) in the terminal device, and this information is sent by the terminal device to other network elements.

[0277] In addition, an embodiment of the present application further provides a communication device, which includes at least one processor and at least one memory. The at least one processor is coupled to the at least one memory. The at least one processor is used to execute computer programs or instructions stored in the at least one memory, so that the communication device executes the methods in the above method embodiments.

[0278] In the implementation process, each step of the above method can be completed by the integrated logic circuit in the hardware of the processor or the instructions in the form of software. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as being executed and completed by the hardware processor, or executed and completed by a combination of the hardware and software modules in the processor. The software module can be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This storage medium is located in the memory, and the processor reads the information in the memory and combines its hardware to complete the steps of the above method. To avoid repetition, it will not be described in detail here.

[0279] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, the steps of the above method embodiments can be completed by the integrated logic circuit in the hardware of the processor or instructions in software form. The above processor can be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The processor in the embodiments of the present application can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the art such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register, etc. This storage medium is located in the memory, and the processor reads the information in the memory and combines its hardware to complete the steps of the above method.

[0280] It can be understood that the memory in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory, dynamic random access memory, synchronous dynamic random access memory, double data rate synchronous dynamic random access memory, enhanced synchronous dynamic random access memory, synchronous link dynamic random access memory and direct memory bus random access memory. It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0281] In the embodiments of the present application, the above-described method can be executed by a network device and a terminal device, or can be executed by a chip, a chip system or a circuit of the network device and the terminal device, and the chip, the chip system or the circuit can be installed in the network device and the terminal device.

[0282] The embodiments of the present application also provide a computer-readable storage medium, on which computer instructions for implementing the methods executed by the network device or the terminal device in the above method embodiments are stored.

[0283] The embodiments of the present application also provide a computer program product, including instructions, which when executed by a computer, implement the methods executed by the network device or the terminal device in the above method embodiments.

[0284] The embodiments of the present application also provide a communication system, which includes the network device or the terminal device in the above embodiments.

[0285] For the explanations and beneficial effects of the relevant content in any of the above-mentioned devices, reference can be made to the corresponding method embodiments provided above, and details are not repeated here.

[0286] For the convenience of understanding the above embodiments provided by the present application, the following points are explained:

[0287] 1) In the present application, if there is no special description and logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments according to their internal logical relationships.

[0288] 2) In the present application, "at least one" means one or more, and "a plurality" means two or more. "And / or" describes the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. In the text description of the present application, the character " / " generally represents an "or" relationship between the associated objects before and after. "At least one (item)" or its similar expression refers to any combination of these items, including any combination of single item (item) or multiple items (items). For example, at least one (item) of a, b, and c can represent: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Where a, b, and c can be single or multiple respectively.

[0289] 3) In the present application, "first", "second", and various numerical numbers (for example, #1, #2, etc.) are used for distinction for the convenience of description, and are not used to limit the scope of the embodiments of the present application. For example, to distinguish different messages, etc., rather than for describing a specific order or sequence. It should be understood that the objects described in this way can be interchanged under appropriate circumstances so as to be able to describe the solutions other than the embodiments of the present application.

[0290] 4) In this application, "communication" can also be described as "data transmission", "information transmission", "data processing", etc. "Transmission" includes "sending" and "receiving".

[0291] Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered to exceed the scope of this application.

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

[0293] In several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of the devices or units can be in electrical, mechanical, or other forms.

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

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

[0296] When the above-mentioned functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memories, random access memories, magnetic disks, or optical discs.

[0297] As described above, the above are only specific implementation manners of this application, but the protection scope of this application is not limited thereto. Any person skilled in the art within the technical scope disclosed by this application can easily think of changes or substitutions, which should all be covered within the protection scope of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

Claims

1. A method for transmitting a signal, characterized in that, The method includes: Determining a first sequence {s(k)} according to a modulation symbol sequence {d(n)}, where s(k) is the k-th element of the first sequence {s(k)}, k = 0, 1, 2, …, K-1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, n = 0, 1, 2, …, N-1, K and N are positive integers, and the first sequence {s(k)} is a sequence after continuous phase modulation (CPM) and sampling of the modulation symbol sequence {d(n)}; Determining a second sequence {x(k)} according to the first sequence {s(k)} and discrete Fourier transform (DFT); Mapping the second sequence {x(k)} to a plurality of consecutive subcarriers to generate a first signal; Transmitting the first signal.

2. The method according to claim 1, wherein The value of any s(k) in the first sequence {s(k)} is determined by L+1 consecutive d(n), where L is a positive integer.

3. The method according to claim 1, characterized in that The CPM is non-recursive CPM, and the non-recursive CPM satisfies that the output at any time is determined by L+1 consecutive input values.

4. The method according to any one of claims 1 to 3, characterized in that, The s(k) satisfies: wherein, L is a positive integer, i = 0, 1, …, L−1, R is the sampling rate, T is the signal period, h is the modulation index, M is the modulation order, and is to round down, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

5. The method according to any one of claims 1 to 3, characterized in that, The initial value of the CPM satisfies: d(-1) = d(N-1), d(-2) = d(N-2), …, d(-L) = d(N-L), where L is a positive integer.

6. The method according to any one of claims 1 to 3, characterized in that Before the CPM, the method further includes: circularly expanding the modulation symbol sequence {d(n)} by length L, where L is a positive integer.

7. The method according to any one of claims 1 to 6, characterized in that, The determining the second sequence {x(k)} according to the first sequence {s(k)} and discrete Fourier transform (DFT) includes: Multiplying the first sequence {s(k)} with a mask sequence bit by bit and then performing K-point DFT to determine the second sequence {x(k)} of length K; or, Performing K-point DFT on the first sequence {s(k)} and then performing circular shift to determine the second sequence {x(k)} of length K.

8. The method according to claim 7, wherein The mask sequence is [1, -1, 1, -1, …] or [-1, 1, -1, 1, …].

9. The method according to claim 7, characterized in that The number of bits of the circular shift is half of the length of the second sequence {x(k)}.

10. The method according to any one of claims 1 to 9, characterized in that, The mapping the second sequence {x(k)} to a plurality of consecutive subcarriers to generate a first signal includes: Mapping K terms of the second sequence {x(k)} to K consecutive subcarriers; or, Mapping k′ terms of the second sequence {x(k)} to k′ consecutive subcarriers, where k′ < K and is a positive integer.

11. The method according to any one of claims 1 to 10, characterized in that, The modulation symbol sequence {d(n)} is a sequence obtained by amplitude modulation of a data bit sequence.

12. The method according to claim 11, wherein The amplitude modulation is M-order non-negative amplitude modulation.

13. A method for transmitting a signal, characterized in that The method includes: Receive a first signal, where the first signal is a signal generated according to a second sequence {x(k)}, and the second sequence {x(k)} is determined according to a first sequence {s(k)} and a discrete Fourier transform DFT. Among them, the first sequence {s(k)} is determined according to a modulation symbol sequence {d(n)}. s(k) is the k-th element of the first sequence {s(k)}, where k = 0, 1, 2, …, K - 1, d(n) is the n-th element of the modulation symbol sequence {d(n)}, where n = 0, 1, 2, …, N - 1, and K and N are positive integers. The first sequence {s(k)} is a sequence after continuous phase modulation CPM and sampling of the modulation symbol sequence {d(n)}. Obtain the data carried on the second sequence {x(k)} from the first signal.

14. The method according to claim 13, wherein The value of any s(k) in the first sequence {s(k)} is determined by L + 1 consecutive d(n), where L is a positive integer.

15. The method according to claim 13, wherein The CPM is a non-recursive CPM, and the non-recursive CPM satisfies that the output at any moment is determined by L + 1 consecutive input values.

16. The method according to any one of claims 13 to 15, characterized in that, The s(k) satisfies: wherein, L is a positive integer, i = 0, 1, …, L−1, R is the sampling rate, T is the signal period, h is the modulation index, M is the modulation order, and is for rounding down, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

17. The method according to any one of claims 13 to 15, characterized in that, The initial value of the CPM satisfies: d(-1) = d(N - 1), d(-2) = d(N - 2), …, d(-L) = d(N - L), where L is a positive integer.

18. The method according to any one of claims 13 to 15, characterized in that Before the CPM, the method further includes: circularly expanding the modulation symbol sequence {d(n)} by length L, where L is a positive integer.

19. The method according to any one of claims 13 to 18, characterized in that The second sequence {x(k)} is determined according to the first sequence {s(k)} and DFT, including: Multiplying the first sequence {s(k)} by a mask sequence bit by bit and then performing a K-point DFT to determine the second sequence {x(k)} of length K; or Performing a K-point DFT on the first sequence {s(k)} and then performing a cyclic shift to determine the second sequence {x(k)} of length K.

20. The method according to claim 19, wherein The mask sequence is [1, -1, 1, -1, …] or [-1, 1, -1, 1, …].

21. The method according to claim 19, wherein The number of bits of the cyclic shift is half of the length of the second sequence {x(k)}.

22. The method according to any one of claims 13 to 21, characterized in that, The receiving the first signal includes: Receiving the first signal on K consecutive subcarriers; or Receiving the first signal on k' consecutive subcarriers, where k' < K and is a positive integer.

23. The method according to any one of claims 13 to 22, characterized in that, The modulation symbol sequence {d(n)} is a sequence obtained by amplitude modulation of a data bit sequence.

24. The method according to claim 23, wherein The amplitude modulation is an M-order non-negative amplitude modulation.

25. A communication device, characterized in that, Including: A processor, where the processor is coupled to a memory; The processor is configured to execute a computer program stored in the memory, so that the device executes the method according to any one of claims 1 to 12, or so that the device executes the method according to any one of claims 13 to 24.

26. A communication system, characterized in that, Including: A network device and a terminal device; the terminal device is configured to execute the method according to any one of claims 1 to 12; the network device is configured to execute the method according to any one of claims 13 to 24.

27. A computer-readable storage medium, characterized in that, Including: A computer program is stored on the computer-readable storage medium. When the computer program runs on a computer, it causes the computer to execute the method according to any one of claims 1 to 12, or causes the computer to execute the method according to any one of claims 13 to 24.

Images