Signal transmission method and communication apparatus

Abstract

The present application provides a signal transmission method and a communication apparatus. The method comprises: determining a first sequence {s(k)} on the basis of a modulation symbol sequence {d(n)}, wherein 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 the first sequence {s(k)} is a sequence obtained after performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)}; determining a second sequence {x(k)} on the basis of 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 solution of the present application, CPM is combined with multiplication by masking sequences or cyclic shifts, so that a sent signal has a lower PAPR, thereby enhancing uplink coverage.

Description

Signal transmission method and communication device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on January 2, 2024, with application number 202410014229.4, and priority to the Chinese patent application entitled “Method and Communication Device for Transmitting Signals”, all contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communications, and more particularly, to a method for transmitting a signal and a communication device. Background Art

[0003] The peak-to-average power ratio (PAPR) is the ratio of a signal's peak power to its average power. However, the dynamic range of a power amplifier is limited. When the PAPR is too high, the amplifier enters a nonlinear region, causing nonlinear distortion of the signal after passing through the amplifier. This results in spectrum spread and in-band signal distortion, degrading system performance.

[0004] In order to prevent the power amplifier from entering the nonlinear 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 use of discrete Fourier transform spread OFDM (DFT-s-OFDM) waveform and uses a π / 2 binary phase shift keying (BPSK) modulation method. The DFT-s-OFDM waveform can reduce the PAPR of the signal, but its ability to reduce 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

[0005] The present application provides a method and a communication device for transmitting a signal to reduce the PAPR of a transmitted signal and enhance uplink coverage.

[0006] In a first aspect, a method for transmitting a signal is provided. The method may be executed by a terminal device, or may be executed by a chip or circuit of the terminal device, which is not limited in this application. For ease of description, the following description is based on an example of execution by a terminal device.

[0007] The method includes: determining a first sequence {s(k)} based on a modulation symbol sequence {d(n)}, wherein 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 the first sequence {s(k)} is a sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)}; determining a second sequence {x(k)} based on the first sequence {s(k)} and a discrete Fourier transform (DFT); mapping the second sequence {x(k)} to multiple consecutive subcarriers to generate a first signal; and sending the first signal.

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

[0009] Based on the above scheme, CPM is used to make the phase of the continuous signal output within one cycle continuous, the continuous signal is sampled to determine the first sequence, and then the second sequence is determined based on the first sequence and discrete Fourier transform (DFT). The second sequence determined by the embodiment of the present application can make the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0010] In combination with the first aspect, in certain implementations of the first aspect, the value of any one s(k) in the first sequence {s(k)} is determined by L+1 consecutive d(n), where L is a positive integer.

[0011] In combination with the first aspect, in some implementations of the first aspect, the CPM is a non-recursive CPM, which satisfies the requirement that the output at any moment is determined by L+1 consecutive input values.

[0012] Based on the above solution, the continuous signal outputted by the non-recursive CPM within a cycle is only related to L+1 consecutive bit sequence inputs. After sampling, the first sequence is determined, thus reducing demodulation and decoding error propagation. This ensures that demodulation and decoding error propagation is reduced, improving demodulation and decoding performance while also lowering the PAPR of the first signal, thereby enhancing uplink coverage.

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

[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 Rounded 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 value of the CPM satisfies: d(-1)=d(N-1), d(-2)=d(N-2),…, d(-L)=d(NL), where L is a positive integer.

[0016] Based on the above solution, CPM is initialized using a tail-biting method, ensuring that the phases of the starting and ending positions of the continuous CPM signal are continuous. This ensures phase continuity between the starting and ending positions of the CPM signal without any additional overhead, resulting in a lower PAPR for the first signal and improved uplink coverage.

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

[0018] Optionally, before the non-recursive CPM, the modulation symbol sequence {d(n)} is cyclically extended by a length of L. That is, the non-recursive CPM is performed on the modulation symbol sequence {d(n)} after the cyclic extension by a length of L.

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

[0020] Based on the above scheme, non-recursive CPM is used so that the continuous signal output within a cycle is only related to the L+1 continuous modulation symbol sequence inputs, thereby reducing error propagation during demodulation and decoding. In addition, the non-recursive CPM is initialized with tail biting, which eliminates the need for additional overhead. This ensures that the phases of the starting and ending positions of the continuous signal obtained through the non-recursive CPM are continuous. This allows the first sequence to be determined after sampling, and the second sequence to be determined based on the first sequence and the DFT. This enables the first signal to have a lower PAPR, thereby enhancing uplink coverage.

[0021] In conjunction with the first aspect, in certain implementations of the first aspect, determining the second sequence {x(k)} based on the first sequence {s(k)} and a discrete Fourier transform (DFT) includes:

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

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

[0024] Based on the above solution, the determined first sequence is multiplied by a mask sequence or cyclically shifted to make the determined second sequence more suitable, so that the first signal has a lower PAPR, thereby improving 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, the first sequence {s(k)} is multiplied bit by bit by a mask sequence, and then a K-point DFT is performed on the sequence obtained after multiplication by the mask sequence [1,-1,1,-1,…] or [-1,1,-1,1,…], thereby determining a second sequence {x(k)} of length K.

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

[0028] Optionally, before cyclically shifting the first sequence {s(k)}, a K-point DFT transform is performed on the first sequence {s(k)}. The transformed sequence is then cyclically shifted to determine a second sequence {x(k)} of length K; wherein the number of bits of the cyclic shift is half the length of the second sequence {x(k)}.

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

[0030] Mapping 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, remove the first l elements and the last l elements of the second sequence {x(k)}, that is, intercept the elements in the middle part of the second sequence. For example, intercept [x(l), x(l + 1),..., x(K - l - 1)] in the second sequence {x(k)} = [x(0), x(1), …, x(K - 1)], and map it to multiple subcarriers. That is, map K - 2l terms in the second sequence {x(k)} 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 certain implementations 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 certain implementations 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 also 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 will take the execution by the network device as an example for illustration.

[0040] The method includes: receiving a first signal, where the first signal is generated according to a second sequence {x(k)}, and the second sequence {x(k)} is determined according to the first sequence {s(k)} and a discrete Fourier transform (DFT), wherein the first sequence {s(k)} is determined according to a modulation symbol sequence {d(n)}, 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 the first sequence {s(k)} is a sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)}; and obtaining data carried on the second sequence {x(k)} from the first signal.

[0041] As an example, the process of the network device obtaining the second sequence includes: the network device receives a 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; 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 of the network device obtaining the second sequence {x(k)} includes: the network device receives the output signal on K-2l subcarriers; removes the cyclic prefix of the output signal to obtain a time domain signal; performs K-2l point DFT on the time domain signal to obtain a frequency domain signal; based on the frequency domain signal, performs IDFT transformation on the frequency domain signal to obtain the second sequence {x(k)}.

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

[0044] Based on the above scheme, CPM is used to make the phase of the continuous signal output within one cycle continuous, which can reduce the power of the CPM signal. The continuous signal is sampled to determine the first sequence, and then the second sequence is determined based on the first sequence and discrete Fourier transform DFT. The second sequence determined by the embodiment 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 certain implementations of the second aspect, the value of any one 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 satisfies that the output at any time is determined by L+1 consecutive input values.

[0047] Based on the above solution, the continuous signal outputted by the non-recursive CPM within a cycle is only related to L+1 consecutive bit sequence inputs. After sampling, the first sequence is determined, thus reducing demodulation and decoding error propagation. This ensures that demodulation and decoding error propagation is reduced, improving demodulation and decoding performance while also lowering the PAPR of the first signal, thereby enhancing uplink coverage.

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

[0049] 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 Rounded down, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

[0050] In combination with the second aspect, in some implementations of the second aspect, the initial value of the CPM satisfies: d(-1)=d(N-1), d(-2)=d(N-2),…, d(-L)=d(NL), where L is a positive integer.

[0051] Based on the above solution, CPM is initialized using a tail-biting method, ensuring that the phases of the starting and ending positions of the continuous CPM signal are continuous. This ensures phase continuity between the starting and ending positions of the CPM signal without any additional overhead, resulting in a lower PAPR for the first signal and improved uplink coverage.

[0052] In combination with the second aspect, in certain implementations of the second aspect, before CPM, the method further includes: cyclically extending the modulation symbol sequence {d(n)} to a length of L, where L is a positive integer.

[0053] Optionally, before the non-recursive CPM, the modulation symbol sequence {d(n)} is cyclically extended by a length of L. That is, the non-recursive CPM is performed on the modulation symbol sequence after the cyclic extension by a length of L.

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

[0055] Based on the above scheme, non-recursive CPM is used so that the continuous signal output within a cycle is only related to the continuous L+1 bit sequence inputs, thereby reducing demodulation and decoding error propagation. In addition, the modulation symbol sequence is cyclically extended or the last L elements of the modulation symbol sequence are added to the front of the modulation symbol sequence. This eliminates the need for additional overhead and ensures that the phases of the starting and ending positions of the continuous signal obtained through non-recursive CPM are continuous. Therefore, a first sequence is determined after sampling, and a second sequence is determined based on the first sequence and a discrete Fourier transform (DFT). This enables the first signal to have a lower PAPR, thereby enhancing uplink coverage.

[0056] In conjunction with the second aspect, in certain implementations of the second aspect, determining the second sequence {x(k)} based on the first sequence {s(k)} and a discrete Fourier transform (DFT) includes:

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

[0058] The first sequence {s(k)} is subjected to a K-point DFT and then cyclic shift to determine the second sequence {x(k)} having a length of K.

[0059] Based on the above solution, the determined first sequence is multiplied by a mask sequence or cyclically shifted to make the determined second sequence more suitable, so that the first signal has a lower PAPR, thereby improving coverage performance.

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

[0061] Optionally, the first sequence {s(k)} is multiplied bit by bit by a mask sequence, and then a K-point DFT is performed on the sequence obtained after multiplication by the mask sequence [1,-1,1,-1,…] or [-1,1,-1,1,…], thereby determining a second sequence {x(k)} of length K.

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

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

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

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

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

[0067] 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.

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

[0069] In a third aspect, a communication device is provided, the device includes: a processing unit, 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; [[ID=XX]]

[0070] A transceiver unit, configured to send a first signal.

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

[0072] The transceiver unit may perform the receiving and sending processes in the foregoing first aspect, and the processing unit may perform other processes in the foregoing first aspect except for receiving and sending.

[0073] In a fourth aspect, a communication device is provided, comprising: a transceiver unit, receiving a first signal, the first signal being a signal generated according to a second sequence {x(k)}, the second sequence {x(k)} being determined according to a first sequence {s(k)} and a discrete Fourier transform (DFT), wherein the first sequence {s(k)} is determined according to a modulation symbol sequence {d(n)}, 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 the first sequence {s(k)} is a sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)};

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

[0075] The transceiver unit can perform the reception and transmission processing in the aforementioned second aspect, and the processing unit can perform other processing except reception and transmission in the aforementioned second aspect.

[0076] In a fifth aspect, a communication device is provided, comprising a processor configured to execute a computer program so that the device executes the method of the first aspect to the second aspect and any possible implementation thereof.

[0077] Optionally, there are one or more processors.

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

[0079] Optionally, the memory may be integrated with the processor, or the memory may be set separately from the processor, or the memory may be located within the processor.

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

[0081] In a sixth aspect, a communication system is provided, comprising: a network device and a terminal device, wherein the network is used to execute the method in the possible implementation manner of the above-mentioned first aspect, and the terminal device is used to execute the method in the possible implementation manner of the above-mentioned second aspect.

[0082] In the seventh aspect, a computer-readable storage medium is provided, which stores a computer program or code. When the computer program or code is run on a computer, the computer executes the method in the above-mentioned first aspect to the second aspect and any possible implementation thereof.

[0083] In an eighth aspect, a chip is provided, comprising at least one processor, which is used to run a computer program so that a device equipped with the chip executes the methods in the above-mentioned first to second aspects and any possible implementation thereof.

[0084] 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.

[0085] In a ninth aspect, a computer program product is provided, comprising: a computer program code, which, when executed on the computer, executes the method in the first to second aspects and any possible implementation thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0086] FIG1 is a schematic diagram of a communication system applicable to an embodiment of the present application.

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

[0088] FIG3 is a schematic flowchart of a signal transmission method provided in an embodiment of the present application.

[0089] FIG4 is a schematic flowchart of mapping the second sequence onto subcarriers.

[0090] FIG5 is a schematic flowchart of generating a first signal provided by an embodiment of the present application.

[0091] FIG6 is a schematic flowchart of generating a first signal provided by yet another embodiment of the present application.

[0092] FIG7 is a schematic structural diagram of a communication device provided in an embodiment of the present application.

[0093] FIG8 is a schematic structural diagram of a communication device provided in an embodiment of the present application.

[0094] FIG9 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0095] The technical solution in this application will be described below with reference to the accompanying drawings.

[0096] The technical solutions provided in this application can be applied to various communication systems, such as: fifth generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, wireless local area networks (WLAN) systems, satellite communication systems, future communication systems such as sixth generation mobile communication systems, or a fusion system of multiple systems. The technical solutions provided in 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 Internet of Things (IoT) communication systems or other communication systems.

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

[0098] Figure 1 is a schematic diagram of a communication system 100 applicable to an embodiment of the present application. As shown in Figure 1, the communication system 100 may include a network device 110 and at least one terminal device (such as the terminal device 120 in Figure 1). The terminal device 120 is connected to the network device 110 in a wireless manner. The terminal device can be fixed or movable. Figure 1 is only a schematic diagram, and the communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown 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.

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

[0100] The terminal device can be a device that provides voice / data to users, for example, a handheld device or vehicle-mounted device with a wireless connection function. At present, some examples of terminals are: mobile phones, tablet computers, laptop computers, PDAs, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, wearable devices, terminal devices in 5G networks or future evolved public land mobile communication networks (PLMNs). The terminal equipment in the network (PLMN), etc., is not limited to this in the embodiments of the present application.

[0101] As an example and not a limitation, in the embodiment of the present application, the terminal device may also be a wearable device. Wearable devices may also be called wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not only hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0102] The network device in the embodiments of the present application may be a device for communicating with a terminal device, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects a terminal device to a wireless network. A base station may broadly cover various names as follows, or replace the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, secondary station, multi-standard radio (motor slide retainer, 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. A base station may be a macro base station, a micro base station, a relay node, a donor node, or the like, or a combination thereof. A base station may also refer to a communication module, modem, or chip used to be set in the aforementioned equipment or device. A base station may also be a mobile switching center and a device that performs base station functions in D2D, V2X, and M2M communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. A base station may support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form used by network equipment.

[0103] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.

[0104] In some deployments, the network device mentioned in the embodiments of the present 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 (central unit-control plane, CU-CP)) and a user plane CU node (central unit user plane (central unit-user plane, CU-UP)) and a DU node.

[0105] In different systems, 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 RAN (ORAN) system, CU may also be referred to as O-CU (open CU), DU may also be referred to as O-DU, CU-CP may also be referred to as O-CU-CP, CU-UP may also be referred to as O-CU-UP, and RU may also be referred to as O-RU. Any 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.

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

[0107] The network equipment and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the scenarios in which the network equipment and terminal devices are located.

[0108] Network devices and terminal devices, network devices and network devices, and terminal devices and terminal devices can communicate through authorized spectrum, unauthorized spectrum, or both; can communicate through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz simultaneously. The embodiments of the present application do not limit the spectrum resources used for wireless communications.

[0109] In the embodiments of the present application, the functions of the network device may also be performed by a module (such as a chip) in the network device, or by a control subsystem that includes the network device functions. The control subsystem that includes the network device functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal device may also be performed by a module (such as a chip or a modem) in the terminal device, or by a device that includes the terminal device functions.

[0110] In this application, a network device sends a downlink signal or downlink information to a terminal device, and the downlink information is carried on a downlink channel. A terminal device sends an uplink signal or uplink information to a 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 the cell controlled by the network device. The cell with which the terminal device has established a wireless connection is called the serving cell of the terminal device. When the terminal device communicates with the serving cell, it will also be interfered with by signals from neighboring cells.

[0111] The peak-to-average power ratio (PAPR) is the ratio of the signal's peak power to its average power. When the waveforms corresponding to the modulation symbols have the same or similar phases at a certain time-domain sampling point, the superimposed signal of multiple modulation symbols will generate a larger instantaneous peak power, resulting in a higher PAPR. Since the linear dynamic range of a power amplifier is limited, an excessively high PAPR will cause the power amplifier to enter a nonlinear region, causing nonlinear distortion of the signal after passing through the power amplifier, resulting in spectrum spread and in-band signal distortion, and degrading system performance. To prevent high-PAPR signals from entering the nonlinear region of the power amplifier, terminal equipment can use power backoff technology to reduce 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 the signal will be smaller, resulting in a decrease in the signal's coverage performance.

[0112] Figure 2 is a schematic diagram of a π / 2 BPSK modulated DFT-s-OFDM waveform. As shown in Figure 2, for example, taking the number of subcarriers as M, the source bits are encoded and interleaved to obtain bits b(i). The interleaved bits are modulated by π / 2 BPSK to obtain M modulation symbols d(i). The modulation formula is:

[0113] These M modulation symbols undergo an M-point discrete Fourier transform (DFT) to obtain a frequency domain signal. This frequency domain signal is then windowed and filtered to obtain a filtered frequency domain signal. This frequency domain signal is then mapped onto M subcarriers to generate an output signal, which is then transmitted. This is known as a π / 2 BPSK+DFT-s-OFDM signal. The output signal is generated using an inverse fast Fourier transform (IFFT). Specifically, an N-point IFFT transform is performed on the signal mapped onto the subcarriers to obtain a time domain signal, where N is determined by the system bandwidth and is greater than M. When multiple transmit antennas are present, the frequency domain signal can also be multiplied by a precoding matrix before subcarrier mapping. A cyclic prefix (CP) is then added to the time domain signal, followed by digital-to-analog conversion to obtain the output signal, which is then transmitted via the antennas. However, the PAPR value of the signal obtained with this scheme is affected by the frequency domain windowing coefficient. The PAPR of the output signal obtained with this scheme is relatively high, for example, reaching 2-3 dB.

[0114] In view of this, the present application proposes a method and a communication device for transmitting a signal, by performing continuous phase modulation (CPM) on a coded and interleaved bit sequence so that the phase of a continuous signal output within one cycle is continuous, sampling the continuous signal to determine a first sequence, and then determining a second sequence based on the first sequence and DFT, mapping the second sequence to multiple continuous subcarriers to generate a first signal, and sending the first signal; by multiplying the sequence after CPM sampling by a mask sequence or cyclic shift, the PAPR of the output signal is reduced, thereby enhancing the uplink coverage.

[0115] Figure 3 is a schematic flowchart of a signal transmission method 300 provided in accordance with an embodiment of the present application. As shown in Figure 3 , method 300 may include the following steps. It should be understood that the process can be executed by both a network device and a terminal device, with the terminal device being used to send signals to the network device. For ease of description, the following description uses the network device and the terminal device as the execution entities.

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

[0117] 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 a sequence obtained by performing continuous phase modulation (CPM) and sampling on the modulation symbol sequence {d(n)};

[0118] Optionally, before step S310 , method 300 further includes encoding and interleaving processes, which are not shown in FIG. 3 .

[0119] Exemplarily, the source bits are encoded to obtain encoded bits, wherein the encoding method may be low density parity check code (LDPC) encoding, polar code encoding, or turbo encoding.

[0120] 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), b(n) is the nth element in the bit sequence {b(n)}, n=1,2,…,mN-1, where m=log2M.

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

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

[0123] For example, 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:

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

[0125] in, represents the phase of the continuous signal s(t), which can be expressed as follows:

[0126] Wherein, L is a positive integer, which can be the response length, for example, 2, 3, 4, etc.; h is the modulation index, which can be a fraction, for example, 1 / 2, 1 / 4; T is the signal period; Express Round down; q(t) is the phase response function, which can be expressed as follows:

[0127] For example, F(t) can be a rectangular pulse function or a cosine pulse function, which is not limited here. The embodiment of the present application takes the raised cosine pulse function as an example for explanation, which can be expressed as:

[0128] Substituting formula (4) into formula (3), we can obtain the following formula:

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

[0130] For example, 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:

[0131] It should be noted that, in the embodiment of the present application, some steps of generating the first signal can also be equivalently implemented using one step, and the embodiment of the present application is not limited to 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:

[0132] Where h is the modulation index, M is the modulation order, For Rounded down, R is the sampling rate, q(t) is the response function, j is the imaginary unit, and d(n) is the modulation symbol.

[0133] It should be noted that in the embodiment of the present application, the index of the modulation symbol sequence {d(n)} or the index of the bit sequence {b(n)} is only for indicating the order relationship of the sequence elements, and may start from 0 or 1, or from other numbers, and the embodiment of the present application does not limit this.

[0134] 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.

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

[0136] When the modulation order M = 4, the two bits b(n) are modulated into one modulation symbol d(n). The modulated modulation symbol d(n) can be d(n) = 0, d(n) = 1, d(n) = 2, or d(n) = 3. Specifically, the bit sequences [0, 0], [0, 1], [1, 0], and [1, 1] are modulated into 0, 1, 2, and 3, respectively. When the modulation order M = 8 or 16, the modulation process of the bit sequence b(n) is the same as described above and is not further described here.

[0137] It should be noted that the modulation method in the embodiment of the present application is only an example, and the relationship between the bit sequence {b(n)} and the modulation symbol sequence {d(n)} may also be a corresponding relationship defined elsewhere. For example, the bit sequences [0,0], [0,1], [1,0], [1,1] may also be modulated to 0, 2, 1, 3, respectively. The embodiment of the present application is not limited to this.

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

[0139] Optionally, the value of any one 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 a response length, and can be 2, 3, 4, etc.

[0140] Optionally, the CPM may be a non-recursive CPM, which satisfies the requirement that the output at any moment is determined by L+1 consecutive input values.

[0141] For example, assuming R=4, L=2, then formula (7) can be expressed as:

[0142] 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, s(0) is related to L+1=3 modulation symbols. It should be noted that when k=0, the 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.

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

[0144] It should be noted that during the non-recursive CPM process, the continuous signal s(t), t∈[(Q-1)T, QT] output in the Qth cycle is only related to the input of L+1 consecutive modulation symbols. In this way, when a decoding error or demodulation error occurs in a bit, 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 demodulation or decoding performance.

[0145] In this embodiment of the present application, the continuous signal outputted during a non-recursive CPM cycle is only related to L+1 consecutive bit sequence inputs. After sampling, the first sequence is determined, thereby reducing demodulation and decoding error propagation. This ensures that demodulation and decoding error propagation is reduced, improves demodulation and decoding performance, and thus enhances uplink coverage.

[0146] Optionally, the CPM is initialized in a tail-biting manner.

[0147] When performing CPM, if k=0, the values ​​of d(-1), d(-2), ..., d(-L) need to be initialized due to their existence. Traditional CPM sets the values ​​of d(-1), d(-2), ..., d(-L) to 0, but this cannot ensure the phase continuity of the starting and ending positions of the CPM signal. Therefore, in the embodiment of the present application, initialization is performed through a tail biting method. The specific implementation method can be as follows:

[0148] Cyclic expansion of the modulation symbol sequence {d(n)} to a length of L before CPM; or,

[0149] 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.

[0150] In an embodiment of the present application, initialization is performed by a tail-biting method so that the values ​​of the modulation symbols d(-1), d(-2),…, d(-L) are related to the L elements of the modulation symbol sequence {d(n)}. This ensures that the phase continuity of the starting position and the ending position of the CPM signal is achieved without increasing the overhead, thereby enabling the first signal to have a lower PAPR.

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

[0152] For example, assuming N=4, R=4, and L=2, formula (7) can be expressed as:

[0153] 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, s(0) is related to L+1=3 modulation symbols. It should be noted that when k=0, the CPM is initialized for tail biting, 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 circulated for 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)}.

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

[0155] In this embodiment of the present application, by initializing the CPM signal using a tail-biting method, the values ​​of the modulation symbols d(-1), d(-2), ..., d(-L) are correlated with the L elements of the modulation symbol sequence {d(n)}, eliminating the need for additional zero padding at the end of the modulation symbols. This also ensures that the phases of the starting and ending positions of the continuous signal are continuous. This ensures phase continuity between the starting and ending positions of the CPM signal without requiring additional overhead, resulting in a lower PAPR for the first signal and improved uplink coverage.

[0156] Optionally, the CPM is non-recursive CPM, and the initialization method of the non-recursive CPM is tail-biting initialization. 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 the requirement that the output at any time is determined by L+1 consecutive input values.

[0157] The tail biting initialization is to cyclically extend the modulation symbol sequence {d(n)} by L length and then perform CPM; or, to add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM.

[0158] For example, assuming N=4, R=4, L=2, k=0, At this time, s(0) is related to the modulation symbols d(-2), d(-1), and d(0), that is, s(0) is related to L+1=3 modulation symbols. It should be noted that when k=0, the non-recursive CPM is tail-biting initialized, that is, the values ​​of the modulation symbols d(-2) and 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 cycled for 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)}.

[0159] In an embodiment of the present application, non-recursive CPM is used so that the continuous signal output within a cycle is only related to the continuous L+1 modulation symbol sequence inputs, thereby reducing error propagation in demodulation and decoding. In addition, the non-recursive CPM is initialized with tail biting, which eliminates the need for additional overhead. This ensures that the phases of the starting and ending positions of the continuous signal obtained through CPM are continuous, thereby determining a first sequence after sampling, and then determining a second sequence based on the first sequence and DFT. This enables the first signal to have a lower PAPR, thereby enhancing uplink coverage.

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

[0161] Method 1:

[0162] Exemplarily, the first sequence {s(k)} determined in step S310 is multiplied by a mask sequence, which may be [1, -1, 1, -1, ...] or [-1, 1, -1, 1, ...]. Specifically, the first sequence {s(k)} is multiplied bit by bit with the mask sequence. Assuming that the first sequence {s(k)} is: [s(0), s(1), …, s(K-1)], when K is an even number, the result of its multiplication with 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 an odd number, the result of its multiplication with 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)].

[0163] Further, perform a K-point DFT on the sequence after multiplying by the mask sequence to obtain a 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.

[0164] Method 2:

[0165] Exemplarily, perform a K-point DFT on the first sequence {s(k)} to obtain a 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 on the first sequence {s(k)}.

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

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

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

[0169] In another example, intercept a partial term of the second sequence {x(k)}, for example, intercept k' terms, where k' < K and is a positive integer, and map it to k' consecutive subcarriers to generate a first signal.

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

[0171] S340. Transmit the first signal to the network device. Correspondingly, the network device receives the first signal from the terminal device.

[0172] Specifically, the terminal device transmits a first signal via radio frequency, i.e., the terminal device transmits a first signal carrying the second sequence {x(k)} on the plurality of subcarriers. The network device receives the first signal transmitted by the terminal device via radio frequency, i.e., the network device receives the first signal carried on the plurality of subcarriers.

[0173] Optionally, the process of the network device receiving the first signal carried on multiple subcarriers is: obtaining a time domain signal and removing a cyclic prefix; and then performing DFT on the signal without the cyclic prefix to obtain a frequency domain signal.

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

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

[0176] It should be noted that equalization can be used to compensate for the effects of signal transmission, or signal transmission and filtering. For example, in multi-antenna reception, this equalization can be multi-antenna reception equalization. Due to channel influences, signal distortion may occur during transmission, and equalization can compensate for this distortion.

[0177] 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 may be equalized to obtain the data carried by the second sequence {x(k)}; or the first signal may be obtained by other equivalent implementation methods to obtain the data carried by the second sequence {x(k)}, and the embodiments of the present application are not limited to such.

[0178] As an example, the process of a network device obtaining data carried on a second sequence {x(k)} includes: the network device receives a 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, and then performs an inverse discrete Fourier transformation (IDFT) on the frequency domain signal, and then demodulates the signal after the IDFT to obtain the data carried on the second sequence {x(k)}.

[0179] As another example, the process of the network device obtaining 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 K-2l point DFT on the time domain signal to obtain a frequency domain signal; based on the frequency domain signal, performs IDFT transformation on the frequency domain signal to obtain the data carried on the second sequence {x(k)}.

[0180] 4 , the mapping of the second sequence {x(k)} to a plurality of consecutive subcarriers in the above step S330 to generate the first signal will be described in detail below.

[0181] FIG4 is a schematic flow chart of mapping the second sequence {x(k)} onto multiple subcarriers. Step S330 in FIG4 is described below.

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

[0183] In one example, the terminal device maps all K items in the entire second sequence {x(n)} to K consecutive subcarriers to obtain a frequency domain signal of K points.

[0184] The embodiment of the present application does not specifically limit the manner in which the terminal device maps all K items in the entire second sequence {x(k)} to K consecutive subcarriers.

[0185] Optionally, the terminal device maps all K items in the second sequence {x(k)} to K consecutive subcarriers. For example, the terminal device may map the K items in the second sequence {x(k)} to K consecutive subcarriers in order from small to large (or from large to small) of the subcarriers. One item is mapped to one subcarrier.

[0186] Optionally, the terminal device may further map the K items in the second sequence {x(k)} to K equally spaced subcarriers, where the interval may be greater than or equal to one subcarrier. For example, the terminal device may map the K items in the second sequence {x(k)} to K equally spaced subcarriers in order from small to large (or from large to small). One item is mapped to one subcarrier.

[0187] It should be noted that mapping an item in the entire second sequence {x(k)} to a subcarrier means that the item is carried on the subcarrier.

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

[0189] 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 to say, K - 2l terms in the second sequence are mapped to K - 2l subcarriers to obtain a frequency-domain signal of K - 2l points.

[0190] 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 equally spaced subcarriers respectively. The specific process is as described above and will not be elaborated here.

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

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

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

[0194] Based on the above solution, through non-recursive CPM, the continuous signal output by non-recursive CPM within one period is only related to the continuous input of L + 1 modulation symbol sequences, which reduces the error propagation in demodulation and decoding; in addition, the non-recursive CPM is initialized with tail biting, which requires no additional overhead, making the phases at the start and end positions of the continuous signal obtained through CPM continuous. Then, the first sequence is determined after sampling, and the second sequence is determined according to the first sequence and DFT, which can make the first signal have a lower PAPR, thereby enhancing the uplink coverage.

[0195] FIG. 5 is a schematic flowchart of a method 500 for transmitting a signal provided by an embodiment of the present application. As shown in FIG. 5, the method includes the following steps. It should be understood that the relevant descriptions in the embodiments shown in FIGS. 3 to 4 above also apply to this implementation manner, and the content already described in the embodiments shown in FIGS. 3 to 4 will not be elaborated here.

[0196] S510: Encode the source bits.

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

[0198] S511. Perform interleaving processing on the encoded bit sequence.

[0199] 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), b(n) is the nth element in the bit sequence {b(n)}, n=1,2,…,mN-1, where m=log2M.

[0200] S512: Perform amplitude modulation on the interleaved bit sequence and then perform CPM sampling to determine a first sequence {s(k)}.

[0201] Amplitude modulate the interleaved bit sequence {b(n)} to obtain the modulation symbol sequence {d(n)}. Here, d(n) is the nth element in the modulation symbol sequence {d(n)}, where n = 1, 2, …, N-1. CPM sampling is then performed on the modulation symbol sequence {d(n)}.

[0202] Optionally, non-recursive CPM sampling is performed on the modulation symbol sequence {d(n)} to determine a first sequence {s(k)}, wherein 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.

[0203] Optionally, CPM sampling may be performed on the modulation symbol sequence {d(n)} to determine the first sequence {s(k)}. The CPM initialization method is tail-biting initialization, which involves cyclically extending the modulation symbol sequence {d(n)} by a length of L before performing CPM; or, alternatively, appending the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} before performing CPM.

[0204] 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; wherein, 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 extend the modulation symbol sequence {d(n)} by L length and then perform CPM; or, to add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM.

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

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

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

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

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

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

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

[0212] Optionally, the terminal device can also map the K items in the second sequence {x(k)} to K equally-spaced subcarriers. The interval can be greater than or equal to one subcarrier. For example, the terminal device can map the K items in the second sequence {x(k)} to K equally-spaced subcarriers in ascending (or descending) order of subcarriers. One item is mapped to one subcarrier.

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

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

[0215] Exemplarily, the first l elements of the second sequence {x(k)} 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(Kl-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 items in the second sequence are mapped to K-2l subcarriers to obtain frequency domain signals of K-2l points.

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

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

[0218] Optionally, the frequency domain signal is subjected to IDFT transformation to obtain a corresponding time domain signal, and then CP is added to the time domain signal.

[0219] Optionally, the frequency domain signal may be multiplied by a precoding matrix before subcarrier mapping, and then the time domain signal is added with a CP to generate a first signal and send it.

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

[0221] FIG6 is a schematic flow chart of a method 600 for transmitting a signal according to an embodiment of the present application. As shown in FIG6 , the method includes the following steps. It should be understood that the descriptions of the embodiments shown in FIG3 and FIG4 above are also applicable to this implementation, and the details already described in the embodiments shown in FIG3 and FIG4 will not be repeated here.

[0222] S610: Encode source bits.

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

[0224] S611. Perform interleaving processing on the encoded bit sequence.

[0225] 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), b(n) is the nth element in the bit sequence {b(n)}, n=1,2,…,mN-1, where m=log2M.

[0226] S612: Perform amplitude modulation on the interleaved bit sequence and then perform CPM sampling to determine a first sequence {s(k)}.

[0227] Amplitude modulate the interleaved bit sequence {b(n)} to obtain the modulation symbol sequence {d(n)}. Here, d(n) is the nth element in the modulation symbol sequence {d(n)}, where n = 1, 2, …, N-1. CPM sampling is then performed on the modulation symbol sequence {d(n)}.

[0228] Optionally, non-recursive CPM sampling is performed on the modulation symbol sequence {d(n)} to determine a first sequence {s(k)}, wherein 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.

[0229] Optionally, CPM sampling may be performed on the modulation symbol sequence {d(n)} to determine the first sequence {s(k)}. The CPM initialization method is tail-biting initialization, which involves cyclically extending the modulation symbol sequence {d(n)} by a length of L before performing CPM; or, alternatively, appending the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} before performing CPM.

[0230] 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; wherein, 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 extend the modulation symbol sequence {d(n)} by L length and then perform CPM; or, to add the last L elements of the modulation symbol sequence to the front of the modulation symbol sequence {d(n)} and then perform CPM.

[0231] The specific implementation of the above step S612 can refer to the relevant description of the above step S310.

[0232] S613: Perform DFT transformation on the first sequence {s(k)}, perform cyclic shift on the transformed sequence, and determine a second sequence {x(k)}.

[0233] The first sequence undergoes a DFT of K points, and then the sequence after the DFT transformation is circularly shifted to determine the second sequence {x(k)}. Among them, the number of shifted bits is half of the length of the second sequence {x(k)}.

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

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

[0236] The embodiments of this 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.

[0237] 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.

[0238] Optionally, the terminal device can also map the K terms in the second sequence {x(k)} to K equally-spaced subcarriers. 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 equally-spaced subcarriers in ascending (or descending) order of subcarriers. One term is mapped to one subcarrier.

[0239] 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.

[0240] In another example, the terminal device maps some terms of the intercepted 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.

[0241] Exemplarily, remove the first l elements and the last l elements of the second sequence {x(k)}, that is, intercept the elements in the middle part of the second sequence. For example, intercept [x(l), x(l + 1),..., x(K - l - 1)] in the second sequence {x(k)} = [x(0), x(1),…, x(K - 1)], and map it to multiple subcarriers. That is, map K - 2l terms in the second sequence to K - 2l subcarriers to obtain a frequency-domain signal of K - 2l points.

[0242] Optionally, the terminal device may map the K-21 items in the second sequence {x(k)} to consecutive K-21 subcarriers respectively; or the terminal device may map the K-21 items in the second sequence to equally spaced K-21 subcarriers respectively. The specific process is as described above and will not be repeated here.

[0243] S615 . Perform IDFT transformation on the frequency domain signal to obtain a time domain signal, and add a CP to the time domain signal to generate a first signal.

[0244] Optionally, the frequency domain signal is subjected to IDFT transformation to obtain a corresponding time domain signal, and then CP is added to the time domain signal.

[0245] Optionally, the frequency domain signal may be multiplied by a precoding matrix before subcarrier mapping, and then the time domain signal is added with a CP to generate a first signal and send it.

[0246] In an embodiment of the present application, a first sequence is determined through CPM and sampling, and then a second sequence is determined by performing cyclic shift and DFT on the first sequence. The second sequence determined by the embodiment of the present application can enable the first signal to have a lower PAPR and good demodulation and decoding performance, thereby enhancing uplink coverage.

[0247] The following describes the device embodiments of the present application in conjunction with Figures 7 to 9. 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, and can also be a module (such as a chip) applied to the terminal device or the network device.

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

[0249] In one possible design, the device 1000 can implement steps or processes corresponding to those executed by the terminal device in the above method embodiment, wherein the processing unit 1010 is used to execute processing-related operations of the terminal device in the above method embodiment, and the transceiver unit 1020 is used to execute transceiver-related operations of the network device in the above method embodiment.

[0250] Exemplarily, the processing unit 1010 is used to determine a first sequence {s(k)} based on the modulation symbol sequence {d(n)}, wherein 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 the first sequence {s(k)} is the sequence after continuous phase modulation CPM and sampling of the modulation symbol sequence {d(n)}; and determine a second sequence {x(k)} based on the first sequence {s(k)} and discrete Fourier transform DFT.

[0251] Exemplarily, the transceiver unit 1020 is configured to send a first signal.

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

[0253] In another possible design, the device 1000 can implement steps or processes corresponding to those performed by the network device in the above method embodiment, wherein the processing unit 1010 is used to perform processing-related operations of the network device in the above method embodiment, and the transceiver unit 1020 is used to perform transceiver-related operations of the network device in the above method embodiment.

[0254] Exemplarily, the transceiver unit 1020 is used to receive a first signal, which is a signal generated according to a second sequence {x(k)}, and the second sequence {x(k)} is determined according to the first sequence {s(k)} and the discrete Fourier transform DFT, wherein the first sequence {s(k)} is determined according to the modulation symbol sequence {d(n)}, 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 the first sequence {s(k)} is the sequence after continuous phase modulation CPM and sampling of the modulation symbol sequence {d(n)}.

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

[0256] It should be understood that the device 1000 here is embodied in the form of a functional unit. 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 processor, etc.) and a memory for executing one or more software or firmware programs, a merging logic circuit and / or other suitable components that support the described functions. In an optional example, those skilled in the art will understand that the device 1000 can be specifically the transmitting end in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the transmitting end in the above-mentioned method embodiment, or the device 1000 can be specifically the receiving end in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the receiving end in the above-mentioned method embodiment. To avoid repetition, it will not be described here.

[0257] The apparatus 1000 of each of the above-mentioned solutions has the function of implementing the corresponding steps performed by the transmitting end in the above-mentioned method, or the apparatus 1000 of each of the above-mentioned solutions has the function of implementing the corresponding steps performed by the receiving end in the above-mentioned method. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions; for example, the transceiver unit can be replaced by a transceiver (for example, the transmitting unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as the processing unit, can be replaced by a processor to respectively perform the transceiver operations and related processing operations in each method embodiment.

[0258] In addition, the above-mentioned transceiver unit can also be a transceiver circuit (for example, it can include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit. In an embodiment of the present application, the device 1000 can be a receiving device or a transmitting device in the aforementioned embodiment, or it can be a chip or chip system in a receiving device or a transmitting device, such as a system on chip (SoC). Among them, the transceiver unit can be an input and output circuit or a communication interface. The processing unit is a processor or microprocessor or integrated circuit integrated on the chip. This is not limited here.

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

[0260] Optionally, the apparatus 2000 may further include a memory 2030, which communicates with the processor 2010 and the transceiver 2020 via 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.

[0261] It should be understood that the device 2000 can be specifically the transmitting end or receiving end in the above-mentioned embodiments, or can also be a chip or chip system. Correspondingly, the transceiver 2020 can be the transceiver circuit of the chip, which is not limited here. Specifically, the device 2000 can be used to perform the various steps and / or processes corresponding to the transmitting end or receiving end in the above-mentioned method embodiments.

[0262] Optionally, the memory 2030 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include non-volatile random access memory. For example, the memory may also store device type information. The processor 2010 may be configured to execute instructions stored in the memory. When the processor 2010 executes the instructions stored in the memory, the processor 2010 is configured to perform the various steps and / or processes of the above-described method embodiments corresponding to the transmitting end or the receiving end.

[0263] Figure 9 is a schematic block diagram of a communication device provided in another embodiment of the present application. As shown in Figure 9, 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 is understood that the interface circuit 3020 can be a transceiver or an input / output interface. Optionally, the communication device 3000 may also include a memory 3030 for storing instructions executed by the processor 3010, or storing input data required by the processor 3010 to execute instructions, or storing data generated after the processor 3010 executes instructions.

[0264] 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 .

[0265] When the communication device is a chip used in 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 antenna) in the terminal device, where the 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 antenna) in the terminal device, where the information is sent by the terminal device to other network elements.

[0266] In addition, an embodiment of the present application also provides a communication device, which includes at least one processor and at least one memory, wherein the at least one processor is coupled to the at least one memory, and the at least one processor is used to execute a computer program or instruction stored in the at least one memory so that the communication device executes the method in the above-mentioned method embodiments.

[0267] During implementation, each step of the above method can be completed by an integrated logic circuit of the hardware in the processor or an instruction in the form of software. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor. The software module can be located in a storage medium mature 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. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it will not be described in detail here.

[0268] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-mentioned method embodiment can be completed by hardware integrated logic circuits in the processor or by software instructions. The above-mentioned 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 device, a discrete gate or transistor logic device, or a discrete hardware component. 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 any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-mentioned method.

[0269] It will be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may 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 may 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 linked 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.

[0270] In an embodiment 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, chip system or circuit can be installed in the network device and the terminal device.

[0271] An embodiment of the present application further provides a computer-readable storage medium on which computer instructions for implementing the methods executed by a network device or a terminal device in the above-mentioned method embodiments are stored.

[0272] An embodiment of the present application also provides a computer program product, comprising instructions, which, when executed by a computer, implement the methods performed by the network device or the terminal device in the above-mentioned method embodiments.

[0273] An embodiment of the present application further provides a communication system, which includes the network device or terminal device in the above embodiments.

[0274] The explanation of the relevant contents and beneficial effects of any of the above-mentioned devices can be referred to the corresponding method embodiments provided above, which will not be repeated here.

[0275] To facilitate understanding of the above embodiments provided in this application, the following points are explained:

[0276] 1) In this application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0277] 2) In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b and c can mean: 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.

[0278] 3) Throughout this application, the terms "first," "second," and various numerical references (e.g., #1, #2, etc.) are used to distinguish between different messages for ease of description and are not intended to limit the scope of the embodiments of this application. For example, they are used to distinguish between different messages, rather than to describe a specific order or precedence. It should be understood that such references are interchangeable, where appropriate, to allow for the description of scenarios beyond the embodiments of this application.

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

[0280] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0281] Those skilled in the art will 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 aforementioned method embodiments and will not be repeated here.

[0282] In the 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 schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as 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 mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

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

[0285] If the 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 the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk, or an optical disk.

[0286] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection 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)} onto 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, wherein The CPM is non-recursive CPM, and the non-recursive CPM satisfies that the output at any moment 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, the To pair Taking the floor, where q(t) is a response function, j is the imaginary unit, and d(n) is a 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)} by 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, wherein 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)} onto a plurality of consecutive subcarriers to generate a first signal includes: Mapping K terms of the second sequence {x(k)} onto K consecutive subcarriers; or, Mapping k′ terms of the second sequence {x(k)} onto 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, characterized in that, 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.

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, the To Take the floor. 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: cyclically 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 the DFT, including: 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, 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, characterized in that 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 modulating 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 used to execute the method according to any one of claims 13 to 24.

27. A computer-readable storage medium, characterized in that, Comprising: 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