WO2020063260A1 - 数据传输方法及装置 - Google Patents

数据传输方法及装置 Download PDF

Info

Publication number
WO2020063260A1
WO2020063260A1 PCT/CN2019/103885 CN2019103885W WO2020063260A1 WO 2020063260 A1 WO2020063260 A1 WO 2020063260A1 CN 2019103885 W CN2019103885 W CN 2019103885W WO 2020063260 A1 WO2020063260 A1 WO 2020063260A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
modulation
modulation data
fourier transform
domain symbol
Prior art date
Application number
PCT/CN2019/103885
Other languages
English (en)
French (fr)
Inventor
胡远洲
汪凡
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2020063260A1 publication Critical patent/WO2020063260A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H04L27/2627—Modulators
    • H04L27/2639—Modulators using other transforms, e.g. discrete cosine transforms, Orthogonal Time Frequency and Space [OTFS] or hermetic transforms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]

Definitions

  • Embodiments of the present application relate to the field of communications technologies, and in particular, to a method and an apparatus for transmitting data.
  • IoT Internet of Things
  • LTE long term evolution
  • 5G fifth generation
  • IoT may include machine-to-machine (M2M) communication or machine-type communication (MTC).
  • M2M or MTC can allow communication between terminal devices, or can allow terminal devices to communicate with network devices without human intervention.
  • the application scenarios of M2M or MTC can include: smart grid, industrial automation control, wireless sensor network, smart home appliances, smart water meters, shared bicycles and other scenarios.
  • the embodiments of the present application provide a data transmission method, device, and system, which are intended to provide transmission data with low out-of-band leakage (OOB transmission), so that the interference between the transmission data can be reduced, which can improve The data transfer rate in the system.
  • OOB emission may also be simply referred to as OOB.
  • a data transmission method including: for the modulation data d l ′ transmitted on a time domain symbol l ′, performing a first pre-processing on the modulation data d l ′ to obtain data of length N Wherein N is a positive integer and l ′ is an integer greater than or equal to 0, performing the first pre-processing on the modulation data includes: sequentially performing Fourier transform, inverse Fourier transform, and first filtering on the modulation data.
  • the modulated data is sequentially subjected to Fourier transform, cyclic extension, inverse Fourier transform, and first filtering, and the modulated data is sequentially subjected to Fourier transform, first filtering, and inverse Fourier transform, to the modulation
  • the data is sequentially subjected to a Fourier transform, cyclic extension, first filtering, and inverse Fourier transform, and the modulation data is sequentially subjected to zero padding, Fourier transform, inverse Fourier transform, and first filtering, to the modulation.
  • the data is sequentially zero-filled, Fourier transformed, cyclic extended, inverse Fourier transformed, and first filtered, and the modulated data is sequentially zero-added, Fourier transformed, first filtered, and inverse Fourier transformed, Performing zero padding, Fourier transform, cyclic extension, first filtering, and inverse Fourier transform on the modulated data in sequence;
  • k1 and offset are integers greater than or equal to
  • k2 is an integer greater than or equal to k1, for
  • the nth data in the table n is an integer ranging from 0 to N-1, and C 0 (n + offset-l ′ ⁇ N) is the n + offset-l ′ ⁇ in the second filter coefficient C 0 N coefficients; the data s l,
  • n-th data of k2-k1 + 1 time-domain symbols are multiplied by the corresponding filter coefficients and added and combined to obtain the n-th data sent on time-domain symbol l. Relevance and continuity of data sent on different time-domain symbols are guaranteed. Since the performance of OOB is mainly related to the correlation and continuity between data sent on different time-domain symbols, the method provided in this embodiment of the present application can reduce the OOB of sent data.
  • the filtering method provided by this method uses fewer multiplication operations, so the obtained transmission data is The peak-to-average power ratio (PAPR) is lower, so the transmitted data can still have low OOB when it is transmitted after PA.
  • PAPR peak-to-average power ratio
  • the method further includes: obtaining modulation data of the K-1 channel according to the modulation data d l ′ , where K-1 is an integer greater than or equal to 1; for the K-1 channel K-th modulation data d l ′, k in the modulation data , and performing the first pre-processing on the modulation data d l ′, k to obtain data of k-th length N Where k is an integer ranging from 1 to K-1; according to the To obtain a first output data k s l, k, where, s l, k is the length of N, s l, k in the n-th data for In the n-th data, C k (n + offset-l ′ ⁇ N) is the n + offset-l ′ ⁇ N values in the k- th second filter coefficient C k ; it is sent on the time domain symbol l
  • the data s l, 0 includes: obtaining the combined output data s l of
  • the K-channel output data s l, k is combined to obtain the transmission data s l on the time-domain symbol l , which can reduce the amplitude of the larger data in the multi-channel data and increase the smaller amplitude in the multi-channel data.
  • the amplitude of the data can therefore stabilize the amplitude of the transmitted data after the merge, and reduce the fluctuation range between the transmitted data, thereby reducing the PAPR of the transmitted data. Therefore, when the transmission data obtained by this method is transmitted after passing through the PA, it can still have a low OOB.
  • zero-padding the modulation data includes: adding M 0 and head 0s before the start data in the modulation data; and adding M 0 after the last data in the modulation data tail 0; or, add M 0, head 0 before the start data in the modulation data, and add M 0, tail 0 after the end data in the modulation data; where M 0, head and M 0, tail are positive integers.
  • the value of a part of the start data and / or a part of the end data in the transmitted data can be 0, so the interference caused by the multipath delay extension can be better resisted during the data transmission process, thereby improving the system performance.
  • Data transfer rate the value of a part of the start data and / or a part of the end data in the transmitted data.
  • the modulation data d l ′ includes M data; the phase of the m-th data in the M data is determined according to the index l ′ of the time domain symbol l ′, Alternatively, it is determined according to the index l ′ and m of the time domain symbol l ′, where m is an integer ranging from 0 to M-1.
  • the modulation mode of the modulation data is Pi / 2-BPSK
  • the phase difference between the m-th data in the modulation data d l ′ and the m-th data in the modulation data d l′-1 is ⁇ / 2 or - ⁇ / 2
  • the modulation method is Pi / 4-QPSK, between the m-th data in the modulation data d l ′ and the m-th data in the modulation data d l′-1
  • the phase difference is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4; where d l′-1 represents the modulation data sent on the time domain symbol l′-1, l '-1 is an integer greater than or equal to 0.
  • modulation data comprising: modulating said data according to d l', a time domain modulated data symbols transmitted on l'-1 d l ' -1 and the modulation data d l′-2 sent on the time-domain symbol l′-2 to obtain the first modulation data d l ′, 1 of the K-1 modulation data, where the K- 1 is greater than or equal to 1; and / or, according to the modulation data d l ′ , the modulation data d l′-2 sent on the time-domain symbol l′-2, and the modulation data sent on the time-domain sign l′-3 d l′-3 to obtain the second modulation data d l ′, 2 of the K-1 modulation data, where the K-1 is greater than or equal to 2; and / or, according to the modulation data d l ′ , the modulation data d l′-1 sent on the time-domain symbol
  • the modulation data of the 1st channel to the K-1th channel are determined according to the modulation data of the 0th channel, so that the data in the data processing of the K channel is related. Therefore, when the output data K s l, k s l were combined to give a data transmission on the time-domain symbol L, may further reduce the large amplitude data in the amplitude of multiplexed data, the multiplexed data can be further increased in amplitude than The small data amplitude can therefore stabilize the amplitude change of the transmitted data after the merge, and reduce the fluctuation range between the transmitted data, thereby reducing the PAPR of the transmitted data. When the transmission data obtained by this method is transmitted after passing through the PA, it can still have a low OOB.
  • the first path of the second filter coefficients C 1 in the i-th value of C 1 (i) is based on the filter coefficients C 0 in the i-th value of C 0 (i ), the i + 2N values C 0 (i + 2N) in the filter coefficients C 0 and C 0 are the filter coefficients of the i + N values C 0 (i + N) is determined
  • the n-th value C 2 (i) in the second-path second filter coefficient C 2 is based on the i-th value C 0 (i) in the filter coefficient C 0 , so said first i + 2N values C 0 (i + 2N) in the filter coefficients C 0, i + 3N and second values C 0 (i + 3N) to determine the filter coefficients C 0 in; and / or, in the third path of the second filter coefficient C 3 C 3 i-th value (i) is based on the filter coefficients C 0 in the i-th value of C
  • the second filter coefficients of the first to K-1 channels are determined according to the second filter coefficient of the 0th channel, so that the data in the data processing of the K channel is correlated. Therefore, when the output data K s l, k s l were combined to give a data transmission on the time-domain symbol L, may further reduce the large amplitude data in the amplitude of multiplexed data, the multiplexed data can be further increased in amplitude than The small data amplitude can therefore stabilize the amplitude change of the merged data and reduce the fluctuation range between the data, thereby reducing the PAPR of the transmitted data.
  • the transmission data obtained by this method is transmitted after passing through the PA, it can still have a low OOB.
  • modulation data comprising: modulating said data according to d l' and the time domain modulated data symbols transmitted on l'-1 d l ' -1 obtains the first modulation data of the K-1 modulation data; wherein the K-1 is greater than or equal to 1; wherein the modulation method of the modulation data is quadrature phase shift keying QPSK or Pi / 4 -QPSK.
  • the modulation data of the 1st channel to the K-1th channel are determined according to the modulation data of the 0th channel, so that the data in the data processing of the K channel is related. Therefore, when the output data K s l, k s l were combined to give a data transmission on the time-domain symbol L, may further reduce the large amplitude data in the amplitude of multiplexed data, the multiplexed data can be further increased in amplitude than The small data amplitude can therefore stabilize the amplitude change of the merged data and reduce the fluctuation range between the data, thereby reducing the PAPR of the transmitted data.
  • the transmission data obtained by this method is transmitted after passing through the PA, it can still have a low OOB.
  • the i-th value C 1 (i) in the first second filter coefficient C 1 is based on the i-th value C 0 in the second filter coefficient C 0 (i) and the i + Nth value C 0 (i + N) in the second filter coefficient C 0 ; wherein the modulation method of the modulation data d l ′ is Pi / 4-QPSK Or QPSK, where i is an integer.
  • the second filter coefficients of the first to K-1 channels are determined according to the second filter coefficient of the 0th channel, so that the data in the data processing of the K channel is correlated. Therefore, when the output data K s l, k s l were combined to give a data transmission on the time-domain symbol L, may further reduce the large amplitude data in the amplitude of multiplexed data, the multiplexed data can be further increased in amplitude than The small data amplitude can therefore stabilize the amplitude change of the merged data and reduce the fluctuation range between the data, thereby reducing the PAPR of the transmitted data.
  • the transmission data obtained by this method is transmitted after passing through the PA, it can still have a low OOB.
  • an apparatus for implementing the method described in the first aspect or any possible design of the first aspect.
  • the device can be implemented in the form of hardware, software, or hardware plus software.
  • the hardware or software includes one or more modules corresponding to the above method.
  • the apparatus includes: a first pre-processing module, a second filtering module, and a communication module; and for the modulation data d l ′ sent on the time-domain symbol l ′ , the first pre-processing module is configured to Perform the first preprocessing on the modulation data d l ′ to obtain data of length N Wherein N is a positive integer and l ′ is an integer greater than or equal to 0, performing the first pre-processing on the modulation data includes: sequentially performing Fourier transform, inverse Fourier transform, and first filtering on the modulation data.
  • the modulated data is sequentially subjected to Fourier transform, cyclic extension, inverse Fourier transform, and first filtering, and the modulated data is sequentially subjected to Fourier transform, first filtering, and inverse Fourier transform, to the modulation
  • the data is sequentially subjected to a Fourier transform, cyclic extension, first filtering, and inverse Fourier transform, and the modulation data is sequentially subjected to zero padding, Fourier transform, inverse Fourier transform, and first filtering, to the modulation
  • the data is sequentially zero-filled, Fourier transformed, cyclic extended, inverse Fourier transformed, and first filtered, and the modulated data is sequentially zero-added, Fourier transformed, first filtered, and inverse Fourier transformed, or Performing zero padding, Fourier transform, cyclic extension, first filtering, and inverse Fourier transform on the modulated data in sequence;
  • the second filtering module is configured to Get the data s l, 0 sent on the time domain symbol l, where l is
  • the first pre-processing module is further configured to obtain K-1 modulation data according to the modulation data d l ′ , where K-1 is an integer greater than or equal to 1;
  • the k-th modulation data d l ′, k of the K-1 modulation data is described , and the first pre-processing is performed on the modulation data d l ′, k to obtain data of the k-th length of N Where k is an integer ranging from 1 to K-1;
  • the second filtering module is further configured to To obtain a first output data k s l, k, where, s l, k is the length of N, s l, k in the n-th data for The nth data, C k (n + offset-l ′ ⁇ N) is the n + offset-l ′ ⁇ N values in the k- th second filter coefficient C k ;
  • the communication module is used for Sending the data s l, 0 on the time domain
  • an apparatus for implementing the method described in the first aspect or any possible design of the first aspect.
  • the device can be implemented in the form of hardware, software, or hardware plus software.
  • the hardware or software includes one or more modules corresponding to the above method.
  • the apparatus includes a processor, a memory, and a communication interface.
  • the memory is coupled to the processor, and the processor executes instructions stored in the memory; the processor is coupled to the communication interface, and the processor sends and / or receives data through the communication interface.
  • the apparatus includes a processor and a memory.
  • the memory is coupled to the processor, and the processor executes instructions stored in the memory; the processor generates and sends data, and / or receives and processes data.
  • the device includes a processor and a communication interface; for the modulation data d l ′ sent on the time domain symbol l ′ , the processor is configured to perform first preprocessing on the modulation data d l ′ to obtain Data of length N Wherein N is a positive integer and l ′ is an integer greater than or equal to 0, performing the first pre-processing on the modulation data includes: sequentially performing Fourier transform, inverse Fourier transform, and first filtering on the modulation data.
  • the modulated data is sequentially subjected to Fourier transform, cyclic extension, inverse Fourier transform, and first filtering, and the modulated data is sequentially subjected to Fourier transform, first filtering, and inverse Fourier transform, to the modulation
  • the data is sequentially subjected to a Fourier transform, cyclic extension, first filtering, and inverse Fourier transform, and the modulation data is sequentially subjected to zero padding, Fourier transform, inverse Fourier transform, and first filtering, to the modulation.
  • the data is sequentially zero-filled, Fourier transformed, cyclic extended, inverse Fourier transformed, and first filtered, and the modulated data is sequentially zero-added, Fourier transformed, first filtered, and inverse Fourier transformed, or Performing zero padding, Fourier transform, cyclic extension, first filtering, and inverse Fourier transform on the modulated data in sequence;
  • the processor is configured to Get the data s l, 0 sent on the time domain symbol l, where l is an integer greater than or equal to 0 , the length of s l, 0 is N, and the nth data in s l, 0 Where k1 and offset are integers greater than or equal to 0, k2 is an integer greater than or equal to k1, for The nth data in the table, n is an integer ranging from 0 to N-1, and C 0 (n + offset-l ′ ⁇ N) is the n + offset-l ′ ⁇ in the second filter coefficient C 0 N coefficients; the processor send
  • the processor is further configured to obtain K-1 modulation data according to the modulation data d l ′ , where K-1 is an integer greater than or equal to 1; for the K-1 modulation K-th modulation data d l ′, k in the data , and performing the first pre-processing on the modulation data d l ′, k to obtain data of k-th length N Where k is an integer ranging from 1 to K-1; the processor is further configured to To obtain a first output data k s l, k, where, s l, k is the length of N, s l, k in the n-th data for In the nth data, C k (n + offset-l ′ ⁇ N) is the n + offset-l ′ ⁇ N values in the k- th second filter coefficient C k ; the processor uses the communication interface at Sending the data s l, 0 on the domain symbol l includes: the processor is configured to obtain the combined
  • an embodiment of the present application provides a computer program product containing instructions, which when executed on a computer, causes the computer to execute the method described in the first aspect or any possible design of the first aspect.
  • an embodiment of the present application provides a computer-readable storage medium including instructions that, when run on a computer, cause the computer to execute the method described in the first aspect or any possible design in the first aspect .
  • an embodiment of the present application provides a chip system.
  • the chip system includes a processor, and may further include a memory, for implementing the method described in the first aspect or any possible design in the first aspect.
  • an embodiment of the present application provides a communication system.
  • the communication system includes any device described in the second aspect and a receiving device, and the receiving device is configured to receive any one of the devices described in the second aspect.
  • Data sent by the device; or the communication system includes any device described in the third aspect and a receiving device, and the receiving device is configured to receive data sent by any device described in the third aspect.
  • FIG. 1 is a schematic diagram of OOB provided by an embodiment of the present application.
  • FIG. 2 is a schematic diagram of a data sending method according to an embodiment of the present application.
  • FIG. 3 is a schematic diagram of an index of a time domain symbol according to an embodiment of the present application.
  • FIG. 4 is a schematic diagram of a second filter according to an embodiment of the present application.
  • FIG. 5 is a schematic diagram of a cyclic prefix CP according to an embodiment of the present application.
  • 6 to 9 are schematic diagrams of performance comparison of a single carrier frequency division multiple access SC-FDMA method and a data sending method according to embodiments of the present application;
  • FIG. 10 is a schematic diagram of a first pretreatment provided in an embodiment of the present application.
  • FIG. 11 is a schematic diagram of an amplitude of a second filter coefficient according to an embodiment of the present application.
  • 12 to 14 are schematic structural diagrams of a device according to an embodiment of the present application.
  • the technical solutions provided in the embodiments of the present application can be applied to various communication systems.
  • the technical solutions provided in the embodiments of the present application may be applied to a communication system capable of supporting IoT, or may be applied to a communication system capable of supporting asynchronous transmission.
  • the technical solutions provided in the embodiments of the present application may be applied to, but not limited to, 5G, LTE, or future communication systems.
  • 5G can also be called new radio (NR).
  • the technical solutions provided in the embodiments of the present application can be applied to wireless communication between communication devices.
  • the communication device may include a network device and a terminal device.
  • Wireless communication between communication devices may include: wireless communication between network devices and terminal devices, wireless communication between network devices and network devices, and wireless communication between terminal devices and terminal devices.
  • the term “wireless communication” may also be simply referred to as “communication”, and the term “communication” may also be described as “data transmission”, “signal transmission”, “information transmission” or “transmission” and the like.
  • transmission may include sending or receiving.
  • the transmission may be an uplink transmission, for example, the terminal device may send a signal to a network device; the transmission may also be a downlink transmission, for example, the network device may send a signal to the terminal device.
  • the technical solutions provided in the embodiments of the present application are applied in a communication system, they can be applied to various access technologies. For example, it can be applied to orthogonal multiple access (OMA) technology or non-orthogonal multiple access (NOMA) technology. When applied to orthogonal multiple access technology, it can be applied to orthogonal frequency division multiple access (OFDMA) or single carrier frequency division multiple access (single carrier frequency division multiple access (SC-FDMA)) The embodiments of the present application are not limited.
  • SCMA sparse code multiple access
  • MUSA multi-user shared access
  • pattern division multiple access Access pattern, division, multiple access, PDMA
  • interleaved-grid multiple access IGMA
  • resource extended multiple access resource, spread multiple access, RSMA
  • non-orthogonal coding multiple access non-orthogonal coded multiple access (NCMA)
  • NOCA non-orthogonal coded access
  • the technical solutions provided in the embodiments of the present application can be applied to various scheduling types. For example, it can be applied to authorization-based scheduling or authorization-free scheduling.
  • network equipment can send scheduling information to terminal equipment through dynamic signaling.
  • the scheduling information carries transmission parameters, and network equipment and terminal equipment perform data transmission based on the transmission parameters.
  • license-free scheduling scheduling information can be pre-configured, or network equipment can send scheduling information to terminal equipment using semi-static signaling.
  • the scheduling information carries transmission parameters, and network equipment and terminal equipment perform data transmission based on the transmission parameters.
  • the authorization-free scheduling can also be called without dynamic scheduling, without dynamic grant, or other names, which are not limited in the embodiments of the present application.
  • the terminal equipment involved in the embodiments of the present application may also be referred to as a terminal, which may be a device with a wireless transceiver function.
  • the terminal may be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; it may also be deployed on water (Such as ships, etc.); can also be deployed in the air (such as aircraft, balloons and satellites, etc.).
  • the terminal device may be a user equipment (UE).
  • the UE includes a handheld device, a vehicle-mounted device, a wearable device, or a computing device with a wireless communication function.
  • the UE may be a mobile phone, a tablet computer, or a computer with a wireless transceiver function.
  • the terminal device can also be a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, or intelligent Wireless terminals in the power grid, wireless terminals in smart cities, wireless terminals in smart homes, and so on.
  • the device used to implement the function of the terminal may be a terminal or a device capable of supporting the terminal to implement the function, such as a chip system.
  • the chip system may be composed of a chip, and may also include a chip and other discrete devices.
  • the device for implementing the functions of the terminal is a terminal, and the terminal is a UE as an example, the technical solution provided in the embodiment of the present application is described.
  • the network equipment involved in this embodiment of the present application includes a base station (BS).
  • the base station may be a device that is deployed in a wireless access network and is capable of performing wireless communication with a terminal.
  • Base stations may take many forms, such as macro base stations, micro base stations, relay stations, and access points.
  • the base station involved in the embodiment of the present application may be a base station in 5G or a base station in LTE, where the base station in 5G may also be referred to as a transmission reception point (TRP) or a gNB (gNodeB).
  • TRP transmission reception point
  • gNodeB gNodeB
  • the device for implementing the function of the network device may be a network device or a device capable of supporting the network device to implement the function, such as a chip system.
  • the technical solution provided in the embodiment of the present application will be described by taking the device for realizing the functions of the network device as a network device and taking the network device as a base station as an example.
  • signal transmission may include synchronous transmission and asynchronous transmission.
  • the uplink transmission is taken as an example.
  • the signals sent by different UEs in the cell to the base station can be required to ensure the orthogonality between the signals of different UEs in order to reduce interference between UEs, thereby ensuring that each UE Signals are correctly received at the base station side.
  • the transmission time of the signal on the air interface is proportional to the distance. Therefore, to ensure that the signals sent by different UEs reach the base station at the same time, the base station can send timing advance , TA), so that UEs can send signals in advance according to their respective TAs.
  • TA timing advance
  • the signalling interaction between the base station and the UE can ensure the orthogonality between the signals of different UEs, so that the signals sent by the UE can be correctly received at the base station side.
  • the position of the UE relative to the base station frequently changes, so that the base station and the UE need to frequently exchange TAs through signaling to maintain uplink synchronization.
  • the UE uses a lower-priced crystal oscillator, due to the accumulation of the deviation of the crystal oscillator, etc., it may also make the base station and the UE need to frequently exchange TA through signaling to maintain uplink synchronization. Based on this feature, when the synchronous transmission is applied to the IoT scenario or other small packet service scenarios, performance loss may be caused.
  • communication devices are required to have characteristics such as low price and long battery life. Further, because the amount of data transmitted between communication devices is small, less signaling interactions between communication devices are required to reduce signaling overhead. These characteristics may cause performance loss when synchronous transmission is applied to IoT scenarios, or may make synchronous transmission not applicable to IoT scenarios. Therefore, an asynchronous transmission scheme is proposed for the IoT scenario.
  • the signals sent by different UEs in the cell to the base station may not be required to be the same, that is, the signals sent by different UEs in the cell may not be required to be orthogonal, so there is no need for the base station and the UE to exchange TA through signaling.
  • signal transmission between different UEs can be frequency division, and frequency domain resources allocated to different UEs can be adjacent of.
  • OOB emission out-of-band leakage
  • the reception error rate of the signal at the receiving end is high, which may reduce the data transmission rate in the system.
  • OOB emission can also be referred to as OOB for short.
  • Figure 1 shows a schematic diagram of OOB.
  • the signal transmission between UE1 and UE2 is frequency division.
  • the signal of UE1 is transmitted in frequency domain resource 1.
  • the signal of UE2 is transmitted in frequency domain resource 2.
  • the signal of UE1 may leak.
  • the OOB of the signal of UE1 in frequency domain resource 2 is the interference of the signal of UE2.
  • the signal of UE 2 may leak to frequency domain resource 1, and in the frequency domain resource 1, the OOB of the signal of UE 2 is the interference of the signal of UE 1.
  • frequency resource 1 and frequency resource 2 may each include a positive integer number of resource blocks (resource blocks, RBs) or subcarriers.
  • the sizes of the resources included in frequency resource 1 and frequency resource 2 may be the same or different, and this application does not Make restrictions. Based on the above analysis, in order to support asynchronous transmission, for example, to support asynchronous transmission in IoT or other scenarios, it is necessary to design a low OOB transmission waveform for transmitting signals during asynchronous transmission to reduce the signal between different UEs. Interference, which is used to increase the system transmission rate.
  • the transmitting end sends data or signals to the receiving end.
  • the transmitting end may be a base station or a UE; the receiving end may be a base station or a UE.
  • the transmitting end may be a base station or a UE; the receiving end may be a base station or a UE.
  • DL downlink
  • UL uplink
  • the sender is a UE and the receiver is a base station; when the data is transmitted
  • the sender is a macro base station and the receiver is a micro base station;
  • the data transmission is UL for wireless backhaul the sender is a micro base station and the receiver is a macro base station;
  • the transmitting end is the first UE and the receiving end is the second UE.
  • words such as “first” and “second” are used for distinguishing purposes, and
  • FIG. 2 is a schematic diagram of a signal sending method according to an embodiment of the present application. This method can be applied to the sending end sending data to the receiving end on the channel; correspondingly, the receiving end can receive data sent by the sending end on the channel.
  • the channel may be various possible channels or signals, such as: a physical channel (PBCH), a primary synchronization signal (PSS), a secondary synchronization signal (SSS), and physical downlink Shared channel (physical downlink shared channel (PDSCH), physical downlink control channel (PDCCH), physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH), Various types of uplink reference signals (RSs), various types of downlink RSs, or other possible physical channels are not limited in this application.
  • PBCH physical channel
  • PSS primary synchronization signal
  • SSS secondary synchronization signal
  • PDSCH physical downlink Shared channel
  • PDCCH physical downlink control channel
  • PUSCH physical uplink shared channel
  • PUCCH physical uplink control channel
  • the sender sends data on the channel to the receiver.
  • the data to be sent on the channel can be used as the input data of the method shown in FIG. 2.
  • the sender can use the input data and the data shown in FIG.
  • the method shown in the figure performs data processing to obtain corresponding output data, and sends the output data to the receiving end on the channel.
  • the data type of the data to be transmitted may be modulated data.
  • the transmitting end may perform 1-channel data processing on the input modulation data, for example, the 0-channel data processing shown in FIG. 2 to obtain output data.
  • the transmitting end performs the first preprocessing 202 on the modulation data d l ′ to obtain data of length N.
  • the first preprocessing includes a first filtering, N is a positive integer, and l ′ is an integer greater than or equal to 0.
  • Sender pair Perform the second filtering 204 to obtain data s l, 0 of length N, and send the data s l, 0 on the time domain symbol l, where l is an integer greater than or equal to zero.
  • the receiving end can receive data s l, 0 on the time domain symbol l. Further, the receiving terminal may further demodulate and decode the s l, 0.
  • an integer greater than or equal to 0 may be an integer of 0, 1, 2, 3, 4, or greater, and a positive integer may be an integer of 1, 2, 3, 4, or greater. Make restrictions.
  • the same reference numerals may describe the same variables.
  • the time domain symbol is a time unit, and the time domain symbol may be included in a transmission time interval (TTI), a time slot, a micro time slot, a subframe, and / or a radio frame.
  • TTI transmission time interval
  • the sending end may send data to the receiving end in units of TTI.
  • the length of the TTI can be absolute time, such as 0.5ms, 1ms, 2ms, or 10ms; the length of the TTI can also be positive integer time domain symbols, positive integer subframes, positive integer slots, positive integer microslots, or positive Integer number of radio frames, etc.
  • the positive integer may be an integer of 1, 2, 3, 4, or greater (for example, 7 or 14), which is not limited in the present application.
  • the length of a radio frame can be an absolute time, such as 10 ms, or a positive integer number of subframes.
  • the length of the subframe can be an absolute time, such as 0.5 ms, or 1 ms, and can also be a positive integer number of time slots, microslots, or time domain symbols.
  • the length of the time slot can be an absolute time, such as 0.5 ms, or 1 ms; it can also be a positive integer time domain symbol, such as 7 or 14 time domain symbols; it can also be a positive integer micro time slot.
  • the length of a mini-slot can be an absolute time, such as 0.5 ms, or a positive integer number of time domain symbols, such as two or four.
  • the time-domain symbols may be various types of time-domain symbols, such as single-carrier time-domain symbols, orthogonal frequency division multiplexing (OFDM) symbols, and SC-FDMA symbols.
  • a time unit including several time domain symbols such as TTI, subframe or time slot
  • the time domain symbols can be numbered to obtain an index of each time domain symbol.
  • a sub-frame or a time slot includes L time-domain symbols.
  • the indexes of the L time-domain symbols are integers, which are 0 to L-1, and the L time-domain symbols can be recorded as symbols 0 to Symbol L-1, where L is an integer greater than or equal to 1, for example, L is 7 or 14.
  • the w1th symbol after the time domain symbol l ′ may be recorded as the symbol l ′ + w1, where w1 is a positive integer, for example, w1 is 1, 2, or 3, and so on.
  • the symbol l ′ + w1 can also be described as the symbol mod (l ′ + w1, L), where mod (l ′ + w1, L) indicates that l ′ + w1 is modulo L.
  • the w2-th symbol before the time-domain symbol l ′ can be described as the symbol l′-w2, where w2 is a positive integer.
  • the symbol l′-w2 can also be written as the symbol l′-w2 + x ⁇ L, where l′-w2 + x ⁇ L is greater than or equal to 0 and less than or equal to L-1, and x represents a positive integer.
  • FIG. 3 shows an example of an index of each time domain symbol in two adjacent time slots. For example, in FIG.
  • the transmitting end may also perform multi-channel data processing on the input modulation data, for example, the 0th to the K-1th channels of the K-channel data processing shown in FIG. 2 are combined to obtain the output data.
  • K is an integer greater than or equal to 2, for example, 2, 3, 4, 5, or 6, etc., which is not limited in this application.
  • the value of K may be predefined or may be notified by the base station to the UE through signaling.
  • the data processing method of the 0th channel in the K-channel data processing is the same as the method of obtaining the data s l, 0 described in the above-mentioned 1-channel data processing, which is not repeated here.
  • the transmitting end can obtain the K-channel modulation data according to d l ′ .
  • the transmitting end obtains the k-th modulation data d l ′, k according to d l ′ , where k is an integer ranging from 0 to K-1, and the 0-th modulation data d l ′, 0 is modulation data.
  • d l ′ is an integer ranging from 0 to K-1
  • K modulation data When modulated data d l 0-th passage ', 0 modulated data d l', according to d l 'obtained K modulation data may also be described as follows: The modulated data d l' to obtain a first passage through K-1 channel A total of K-1 channels of modulation data.
  • the transmitting end For the k-th modulation data d l ′, k in the K-channel modulation data, the transmitting end performs the first pre-processing 202 on the modulation data d l ′, k to obtain data of the k-th length of N Sender pair Perform the second filtering 204 to obtain the k-th output data sl, k , where the length of sl , k is N.
  • the transmitting end may add K channels s l, k and combine 206 to obtain data s l of length N, and send the data s l on the time domain symbol l .
  • s l n-th data or Wherein, n being an integer in the range of 0 to N-1
  • s l, k (n) represents a s l, k n-th data
  • s l, 0 (n) represents a s l, 0 n th data.
  • the receiving end can receive the data s l and can also demodulate and decode s l to obtain the data sent by the transmitting end.
  • the sending end sends data, such as sending data s 1, 0 or sending data s l , either the sending end sends the data directly on the air interface or the sending end sends the data indirectly on the air interface.
  • data such as sending data s 1, 0 or sending data s l
  • the sending end may send the data on the air interface after performing data processing on the data, for example, after resource mapping and / or MF modulation.
  • FIG. 4 is a schematic diagram of a filter corresponding to the second filter 204 according to an embodiment of the present application.
  • the filter may be referred to as a second filter.
  • Z- N indicates that the data stream is delayed by N data.
  • the k-th data processing shown in FIG. 2 since the input of the second filter is the data of the k-th length of N And Is N, so delaying N data is equivalent to delaying one time domain symbol.
  • the k-th output data s l, k can be obtained through the second filtering. For s l, k in the n-th data s l, k (n),
  • C k (n + offset-l ′ ⁇ N) represents the n + offset-l ′ ⁇ N filter coefficients in the filter coefficients of the k-th second filter, where the length of the filter coefficients of the second filter is L k ⁇ N, that is, the filter coefficients of the second filter include L k ⁇ N filter coefficients, which are respectively the 0th filter coefficient to the L k ⁇ N-1 filter coefficients, and L k is a positive integer.
  • the filter coefficients of the second filters of each channel may be the same or different, which is not limited in this application.
  • k1 and offset are integers greater than or equal to 0, and k2 is an integer greater than or equal to k1.
  • offset can be equal to 0, l ⁇ N, or equal to When offset is equal to 0, among them, Rounds down.
  • k1 is equal to l- (L k -1) and k2 is equal to l; or k1 is equal to l and k2 is equal to l + (L k -1).
  • the filter coefficient of the second filter may also be simply referred to as a second filter coefficient or a second filter coefficient.
  • the output data in the second filtering operation is a discrete representation.
  • the second filtering operation shown in FIG. 4 may adopt a continuous representation form.
  • the k-th output data s l, k can be obtained.
  • k (t) For data s l s l, k in the t-th time, k (t), which may be expressed as:
  • C k (t + offset-l ′ ⁇ T) represents the coefficient at the t + offset-l ′ ⁇ T times in the filter coefficients of the k-th second filter.
  • T s is a time unit factor, which may be pre-configured or may be notified by the network device to the UE through signaling.
  • T s may be a time interval between two adjacent data in the discrete data, and the discrete data is data obtained by discretely sampling s l, k (t).
  • the subcarrier interval is 15 kHz and N is 2048
  • T s 1 / (30.72 ⁇ 10 6 ).
  • the offset can be l ⁇ T or Where L 0 is an integer.
  • Figure 5 shows the CP schematic.
  • the data sent on a time domain symbol may include a CP part and a pure data part, and the CP part is the same as part of the pure data.
  • a delay operation is introduced in the second filtering, and the n-th data of k2-k1 + 1 time-domain symbols are multiplied by the corresponding filter coefficients and added and combined to obtain the time-domain symbols.
  • This method can ensure the correlation and continuity of the data transmitted on different time domain symbols. Since the performance of OOB is mainly related to the correlation and continuity between data sent on different time-domain symbols, the method provided in this embodiment of the present application can reduce the OOB of sent data.
  • PA power amplifier
  • the method provided in the embodiment of the present application may further enable the transmitted data to have a low PAPR, thereby further ensuring that the transmitted data has a low OOB.
  • the filtering method provided in the embodiment of the present application uses fewer multiplication operations, so the PAPR of the transmitted data is obtained Lower, so the transmitted data can still have low OOB when it is transmitted after passing through the PA.
  • FIG. 6 shows a comparison of PAPR performance between a single-channel data processing method and a conventional low-OOB transmission method SC-FDMA provided by an embodiment of the present application.
  • the abscissa represents the PAPR of the transmitted data
  • the ordinate represents the complementary cumulative distribution function (CCDF) of the PAPR of the transmitted data.
  • CCDF complementary cumulative distribution function
  • the modulation type of the data is Pi / 4-QPSK modulation
  • the CCDF of the PAPR of the transmitted data obtained by SC-FDMA is used
  • the curve (2) is the modulation type of the data: Pi / 2 -When using BPSK modulation, use SCPRFDMA to obtain the PAPR CCDF of the transmitted data
  • curve (3) is the data modulation type is Pi / 4-QPSK modulation, using the method provided in this embodiment of the application and performing 1-way data processing (Channel 0 data processing) CCPR of the PAPR of the transmitted data obtained in curve
  • the modulation type of the data is Pi / 2-BPSK, using the method provided in the embodiment of the present application and performing 1 channel data processing (channel 0 Data processing) to obtain the CCPR of the PAPR of the transmitted data.
  • FIG. 7 shows a comparison of the OOB performance between the single-channel data processing method and the conventional low-OBB transmission method SC-FDMA provided by the embodiment of the present application.
  • FIG. 7 shows a spectral power density (PSD) curve of transmitted data, where the abscissa represents a resource location and the ordinate represents a power spectrum corresponding to each resource location.
  • the allocated resources for transmitting data are 48 subcarriers, corresponding to -24 to 24 on the abscissa. Therefore, the power spectrum corresponding to resources with abscissas less than -24 and greater than 24 in FIG. 7 can be considered as transmission. Data leaked to OOB outside allocated bandwidth.
  • curve (1) is the PSD of the transmitted data obtained by SC-FDMA when the modulation type of the data is Pi / 4-QPSK modulation or Pi / 2-BPSK modulation
  • curve (2) is the data modulation When the type is Pi / 4-QPSK modulation, the PSD of the transmitted data obtained by using the method provided in the embodiment of the present application and performing 1-channel data processing (0-channel data processing)
  • curve (3) is the modulation type of the data is Pi / 2-BPSK, which is the PSD of the transmission data obtained when the method provided in the embodiment of the present application is used and 1-channel data processing (0-channel data processing) is performed.
  • the curve shown in FIG. 7 relative to SC-FDMA, when using the single-channel data processing method provided in the embodiment of the present application, low OOB transmission data can be obtained.
  • FIG. 8 shows a comparison of PAPR performance between the multi-channel data processing method and the conventional low-OOB transmission method SC-FDMA provided in the embodiment of the present application.
  • the abscissa indicates the PAPR of the transmission data
  • the ordinate indicates the CCDF of the PAPR of the transmission data.
  • curve (1) is the modulation type of the data is Pi / 4-QPSK modulation
  • the CCDF of the PAPR of the transmitted data obtained by SC-FDMA is used
  • curve (2) is the data modulation type is Pi / 2 -When using BPSK modulation, the SCDF FDMA is used to send the PAPR CCDF of the transmitted data
  • curve (3) is the data modulation type is Pi / 4-QPSK modulation, using the method provided in the embodiment of this application and performing two-way data processing (The 0th channel data processing and the 1st channel data processing) PAPR CCDF of the transmitted data obtained
  • curve (4) the modulation type of the data is Pi / 2-BPSK, using the method provided in the embodiment of the application and performing 2 channels PAPR CCDF of the transmitted data obtained during data processing (0th channel data processing and 1st channel data processing).
  • the multi-channel data processing method can further reduce the PAPR of the transmitted data compared to the single-channel data processing method, and thus can better maintain the low OOB of the transmitted data.
  • FIG. 9 shows a comparison of OOB performance between the multi-channel data processing method provided in the embodiment of the present application and the conventional low-OBB transmission method SC-FDMA.
  • the PSD curve of the transmitted data is shown in FIG. 9, where the abscissa represents the resource location and the ordinate represents the power spectrum corresponding to each resource location.
  • the allocated resources for transmitting data are 48 subcarriers, corresponding to -24 to 24 on the abscissa. Therefore, the power spectrum corresponding to resources with abscissas less than -24 and greater than 24 in FIG. 9 can be considered as transmission. Data leaked to OOB outside allocated bandwidth.
  • curve (1) is the PSD of the transmitted data obtained by SC-FDMA when the modulation type of the data is Pi / 4-QPSK modulation or Pi / 2-BPSK modulation
  • curve (2) is the data modulation When the type is Pi / 4-QPSK modulation, the PSD of the transmitted data obtained by using the method provided in the embodiment of the present application and performing 2 channels of data processing (0th channel data processing and 1st channel data processing);
  • curve (3) is The modulation type of the data is Pi / 2-BPSK.
  • the value of K may be pre-configured, or may be notified by the base station to the UE through signaling.
  • the signaling may be semi-static signaling and / or dynamic signaling.
  • the semi-static signaling may be radio resource control (RRC) signaling, broadcast messages, system messages, or media access control (MAC) control elements (control elements, CE).
  • RRC radio resource control
  • MAC media access control
  • CE control elements
  • the broadcast message may include a remaining minimum system message (RMSI).
  • the dynamic signaling may be physical layer signaling.
  • Physical layer signaling may be signaling carried by a physical control channel or signaling carried by a physical data channel.
  • the physical data channel may be a downlink channel, such as a physical downlink shared channel (physical downlink shared channel (PDSCH)).
  • the physical control channel can be a physical downlink control channel (PDCCH), an enhanced physical downlink control channel (EPDCCH), a narrowband physical downlink control channel (NPDCCH), or a machine class Communication physical downlink control channel (MTC) physical downlink control channel (MPDCCH).
  • the signaling carried by the PDCCH or EPDCCH may also be referred to as downlink control information (downlink control information).
  • the physical control channel may also be a physical secondary link control channel (physical sidelink control channel), and the signaling carried by the physical secondary link control channel may also be called sidelink control information (sidelink control information) (SCI).
  • SCI sidelink control information
  • the first pre-processing 202 may be any process shown in FIG. 10 (a) to FIG. 10 (h), which is not limited in this application.
  • performing the first pre-processing on the modulation data may include: sequentially performing Fourier transform, first filtering, and inverse Fourier transform on the modulation data.
  • performing the first pre-processing on the modulation data may include: sequentially performing Fourier transform, cyclic extension, first filtering, and inverse Fourier transform on the modulation data.
  • performing the first pre-processing on the modulation data may include sequentially performing Fourier transform, inverse Fourier transform, and first filtering on the modulation data.
  • performing the first pre-processing on the modulation data may include sequentially performing Fourier transform, cyclic extension, inverse Fourier transform, and first filtering on the modulation data.
  • performing the first pre-processing on the modulation data may include: performing zero padding, Fourier transform, first filtering, and inverse Fourier transform on the modulation data in order.
  • performing the first pre-processing on the modulation data may include: sequentially performing zero padding, Fourier transform, cyclic extension, first filtering, and inverse Fourier transform on the modulation data.
  • performing the first pre-processing on the modulation data may include: performing zero padding, Fourier transform, inverse Fourier transform, and first filtering on the modulation data in order.
  • performing the first pre-processing on the modulation data may include: sequentially performing zero padding, Fourier transform, cyclic extension, inverse Fourier transform, and first filtering on the modulation data.
  • zero-padding the modulation data includes: adding M 0, head 0s before the start data in the modulation data; after the last data in the modulation data Add M 0, tail 0s; or, add M 0, head 0s before the start data in the modulation data, and add M 0, tail 0s after the end data in the modulation data.
  • M 0, head and M 0, tail are positive integers.
  • the data to be sent can be represented as a binary bit stream, which includes a positive integer number of bits, and the value of one bit can be 0 or 1.
  • bits in the bit stream can be modulated to obtain modulated data; bits in the bit stream can also be subjected to bit-level operations and modulated to obtain modulated data.
  • the obtained modulation data can be used as the input modulation data in the embodiment of the present application, for example, the input modulation data shown in FIG. 2.
  • the bit-level operations may include one or more operations of segmentation, cyclic redundancy check (CRC), channel coding, interleaving, and scrambling.
  • CRC cyclic redundancy check
  • bit-level operations may include segmentation, CRC, channel coding, and scrambling; or, bit-level operations may include segmentation, CRC, channel coding, interleaving, and scrambling; or, bit-level operations may include adding CRC, Channel coding, interleaving and scrambling.
  • quadrature amplitude modulation When the input modulation data is obtained, when the bits are modulated, quadrature amplitude modulation (QAM) can be used.
  • the QAM modulation may include at least one modulation method of binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), 16QAM, 64QAM, 256QAM, and 1024QAM.
  • BPSK binary phase shift keying
  • QPSK quadrature phase shift keying
  • 16QAM 64QAM
  • 256QAM 256QAM
  • 1024QAM 1024QAM
  • the Pi / 2-BPSK or Pi / 4-QPSK modulation method can also be used.
  • the phase of the m-th data in the M data is determined according to the index l ′ of the time domain symbol l ′, or according to the time
  • the index l 'and m of the domain symbol l' are determined or determined according to m, where m is an integer ranging from 0 to M-1.
  • any of the following designs A1 to A3 can be used.
  • the modulation data is Pi / 2-BPSK
  • the modulation data includes M data
  • the M data The phase difference between two adjacent data in the data is ⁇ / 2 or - ⁇ / 2, or the phase difference between two adjacent data in the M data is ⁇ / 2 or 3 ⁇ ⁇ / 2.
  • d l 'M data in the m-th data d l' (m) can be expressed as Where m is an integer ranging from 0 to M-1.
  • a l ', m can be considered as the amplitude of d l' (m)
  • a l ', m is the output obtained based on the BPSK modulation method.
  • the corresponding relationship between the input bit and the output (symbol) may be as shown in Table 1 (a) or Table 1 (b). or Can be considered as the phase of d l ' (m).
  • I a value in the set [0, ⁇ / 2, ⁇ , 3 ⁇ ⁇ / 2], and the phase difference between two adjacent data among the M data of d l ′ is ⁇ / 2 or - ⁇ / 2, Or, the phase difference between two adjacent data in the M data of d l ′ is ⁇ / 2 or 3 ⁇ / 2.
  • the value of A l ', m is an output obtained based on the BPSK modulation method, Is determined based on m.
  • Is determined based on m E.g It can be expressed as: or With this design, the phase difference between two adjacent data can be satisfied as ⁇ / 2 or - ⁇ / 2.
  • a l ', m is the output symbol obtained according to the m-th bit in the input bit stream and Table 1 (a).
  • the value of m is specifically 0 to 11.
  • d l ′ includes 12 data in total, and the 12 data can be expressed as [1, j, 1, -j, -1, -j, -1, j, 1, -j, 1, -j].
  • modulation data d l′-1 , d l ′, and d l′-1 includes M data.
  • the phase difference between two adjacent data in the M data is ⁇ / 2 or - ⁇ / 2, or two adjacent data in the M data
  • the phase difference between the data is ⁇ / 2 or 3 ⁇ / 2.
  • the representation of the data in d l ′ is similar to the description in the above-mentioned design A1, and is not repeated here.
  • the m-th data d l′-1 (m) of the d l′-1 M data can be expressed as Among them, m is an integer ranging from 0 to M-1; A l'-1, m can be considered as the amplitude of d l'-1 (m) , and the value of A l'-1, m is based on BPSK modulation Way to get the output; It can be considered as a phase of d l'-1 (m).
  • phase difference between two adjacent data of the same time domain symbol is ⁇ / 2 or - ⁇ / 2
  • phase difference between two data of the same index of adjacent time domain symbols It is ⁇ / 2 or - ⁇ / 2.
  • the input bit stream on the time domain symbol is [0,0,0,1,1,1,1,0,0,1,0,1], and the bit stream The CCP includes 12 bits.
  • the modulation data d 0 of symbol 0 and the modulation data d 1 of symbol 1 each include 12 data, and d 0 and d 1 can be expressed as [1, j, 1,- j, -1, -j, -1, j, 1, -j, 1, -j], [-j, 1, -j, 1, -j, 1, -j, 1, j, -1, -j, 1].
  • phase difference between any two adjacent modulation data in the 12 modulation data corresponding to the symbol 0 or 1 is ⁇ / 2 or - ⁇ / 2
  • mth ( m 0,1,2, ..., 11)
  • the phase difference between the modulation data and the m-th modulation data among the 12 modulation data of symbol 1 is ⁇ / 2 or - ⁇ / 2.
  • modulation data is Pi / 2-BPSK
  • modulation data d l ′ transmitted on the time-domain symbol l ' and time-domain symbol l'-1
  • Each of modulation data d l′-1 , d l ′, and d l′-1 includes M data.
  • the difference between the M data is the output obtained based on the BPSK modulation mode.
  • the phase difference between the m-th data d l ' (m) in d l'-1 and d l'-1 (m) in d l′-1 is ⁇ / 2 or - ⁇ / 2, that is,
  • the input bit stream on the time domain symbol is [0,0,0,1,1,1,1,0,0,1,0,1], and the bit stream The CCP includes 12 bits.
  • a l ', m is the output symbol obtained from the mth bit in the input bitstream and Table 1 (a)
  • the modulation data d 0 of the symbol 0 and the modulation data d 1 of the symbol 1 each include 12 data, and d 0 and d 1 can be respectively expressed as [1,1,1, -1, -1, -1, -1, -1 , 1,1, -1,1, -1], [-j, j, -j, j, -j, j, -j, j, j, -j, j].
  • phase difference between any two adjacent modulation data of the 12 modulation data corresponding to symbol 0 or symbol 1 is 0 or ⁇ , that is, the modulation data in one symbol is BPSK modulation, and the symbol 0
  • any of the following designs B1 to B3 can be used.
  • the modulation data is Pi / 4-QPSK
  • the modulation data includes M data
  • the M data The phase difference between two adjacent data in the data is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4, or the phase between two adjacent data in the M data
  • the difference is ⁇ / 4, 3 ⁇ ⁇ / 4, 5.
  • d l 'M data in the m-th data d l' (m) can be expressed as Among them, m is an integer ranging from 0 to M-1; A l ', m can be regarded as the amplitude of d l' (m), and the value of A l ', m is the output obtained based on the QPSK modulation method; Can be considered as the phase of d l ' (m).
  • the corresponding relationship between the input bit and the output (symbol) is shown in Table 2 (a).
  • mapping relationship in Table 2 (a) is only an example, and other possible mapping relationships are also applicable, such as Table 2 (b), Table 2 (c), Table 2 (d), or other similar transformations. .
  • phase difference between two adjacent data is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4, or d l ′
  • the phase difference between two adjacent data is ⁇ / 4, 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4.
  • d l ′ includes a total of 12 data, and the 12 data can be expressed as It can be seen that the phase difference between any two adjacent modulation data in the 12 modulations corresponding to the symbol 0 is ⁇ / 4 or 3 ⁇ ⁇ / 4 or -3 ⁇ ⁇ / 4 (that is, 5 ⁇ ⁇ / 4) or - ⁇ / 4 (that is, 7 ⁇ ⁇ / 4).
  • modulation data shown in FIG. 2 is Pi / 4-QPSK
  • modulation data d l ′ and time domain symbol l transmitted on time domain symbol l ′ includes M data.
  • the phase difference between two adjacent data in the M data is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or- ⁇ / 4, or the phase difference between two adjacent data in the M data is ⁇ / 4, 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4.
  • the phase difference is ⁇ / 4, 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4.
  • the representation of the data in d l ′ is similar to the description in the above-mentioned design B1, and is not repeated here.
  • the m-th data d l′-1 (m) of the d l′-1 M data can be expressed as Among them, m is an integer ranging from 0 to M-1; A l'-1, m can be considered as the amplitude of d l'-1 (m) , and the value of A l'-1, m is based on QPSK modulation Way to get the output; It can be considered as a phase of d l'-1 (m).
  • phase difference between two adjacent data is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4, or d l ′
  • the phase difference between two adjacent data of M data is ⁇ / 4, 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4;
  • the phase difference between two adjacent data is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4, or d
  • the phase difference between two adjacent data in the M data of l′-1 is ⁇ / 4, 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4; the m-th data in d l ′
  • the phase difference between two adjacent data of the same time domain symbol can be ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4, or the same
  • the phase difference between two adjacent data in time domain symbols is ⁇ / 4, 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4, and two data with the same index of adjacent time domain symbols
  • the phase difference between ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4, or - ⁇ / 4, or the phase difference between two data with the same index of adjacent time domain symbols is ⁇ / 4 , 3 ⁇ ⁇ / 4, 5 ⁇ ⁇ / 4, or 7 ⁇ ⁇ / 4.
  • the bit stream on the time domain symbol is [0,0,0,1,1,1,1,0,0,1,0,1,0,0,0, 0,1,1,1,1,0,0,1,0,1]
  • the bit stream includes a total of 24 bits
  • the bit stream includes a total of 24 bits
  • the modulation data d 0 of symbol 0 and the modulation data d 1 of symbol 1 each include 12 data, and d 0 and d 1 can be expressed as It can be seen that the phase difference between any two adjacent modulation data in the 12 modulations corresponding to the symbol 0 is ⁇ / 4 or 3 ⁇ ⁇ / 4 or -3 ⁇ ⁇ / 4 (that is, 5 ⁇ ⁇ / 4) or - ⁇ / 4 (that is, 7 ⁇ ⁇ / 4); the phase difference between any two adjacent modulation data in the 12 modulations corresponding to symbol 1 is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4 (that is, 5 ⁇ ⁇ / 4), or -
  • modulation data d l ′ transmitted on the time-domain symbol l ' and time-domain symbol l'-1
  • modulation data d l′-1 , d l ′, and d l′-1 includes M data.
  • the difference between the M data is the output obtained based on the QPSK modulation mode, that is, the phase difference between two adjacent data of the M data is 0 , ⁇ / 2, ⁇ , or - ⁇ / 2.
  • the phase difference between adjacent two of the M data of d l ′ is 0, ⁇ / 2, ⁇ , or - ⁇ / 2;
  • M data d l'-1 of the phase difference between two adjacent data in Table 2 is 0, ⁇ / 2, ⁇ or - ⁇ / 2;
  • the bit stream on the time domain symbol is [0,0,0,1,1,1,1,0,0,1,0,1,0,0,0, 0,1,1,1,1,0,0,1,0,1]
  • the bit stream includes a total of 24 bits
  • the bit stream includes a total of 24 bits
  • a l ', m is the output symbol obtained from the 2mth and 2m + 1th bits in the input bitstream and Table 2 (a), Then when l 'is 0 or 1, the modulation data d 0 of symbol 0 and the modulation data d 1 of symbol 1 each include 12 data, and d 0 and d 1 can be expressed as , [-1, -1, -1, -1,1, -1, -1, -1, -1,1, -1].
  • phase difference between any two adjacent modulation data in the 12 modulations corresponding to the symbol 0 is 0, ⁇ / 2, ⁇ , or - ⁇ / 2; at the same time, any two of the 12 modulations corresponding to the symbol 1
  • the phase difference between the modulation data and the m-th modulation data of the 12 modulations of symbol 1 is ⁇ / 4, 3 ⁇ ⁇ / 4, -3 ⁇ ⁇ / 4 (that is, 5 ⁇ ⁇ / 4), or - ⁇ / 4 (that is, 7 ⁇ ⁇ / 4).
  • the modulation method described in the embodiment of the present application for example, design A1, design A2, design A3, design B1, design B2, or design B3 may be independently protected without depending on the method involved in FIG. 2.
  • the transmitting end can modulate the input bits and send the modulated output to the receiving end on the corresponding time-domain symbols.
  • the method provided in the embodiment of the present application is used to obtain the 0 th to K-1 th modulation data according to the input modulation data d l ′ .
  • This method can also be applied to other time-domain symbols, such as time-domain symbols l'-1, l'-2, or l'-3. Where l 'is an integer.
  • the 0th modulation data is input modulation data.
  • the corresponding 0th channel modulation data is d l ′ , where d l ′ includes M data, and the m-th data in d l ′ is d l ' (m).
  • m is an integer ranging from 0 to M-1, and d l ' (m) is a complex number.
  • the k-th modulation data d l ′, k of the first to K-1 th modulation data can be obtained, where k is an integer ranging from 1 to K-1.
  • K-1 channel modulation data can be obtained in total.
  • the modulated data d l ', modulated data modulated transmission data l'-1 time-domain symbol d l'-1, l'-2 and the time-domain transmission symbols d l'-2, can be obtained time domain symbol l
  • the time-domain modulated data symbols transmitted on l'-2 d l'-2, and the time domain symbol l'-3 according to the modulated data in a modulated data transmission l D d l'-3, l can be obtained time domain symbol
  • the modulation mode of the modulation data is BPSK or Pi / 2-BPSK:
  • the mth data in d l′-2 can be obtained from the first modulation data d l ′, 1 of the K-1 modulation data of the time domain symbol l ′, where the K -1 is greater than or equal to 1; and / or
  • the mth data in d l′-3 can be obtained from the second modulation data d l ′, 2 of the K-1 modulation data of the time domain symbol l ′, where K-1 Greater than or equal to 2; and / or
  • the m-th data in d l′-3 can be obtained as the m-th data of the third modulation data d l ′, 3 in the K-1 modulation data of the time domain symbol l ′, where the K -1 is greater than or equal to 3;
  • n is an integer ranging from 0 to M-1.
  • the 4-way modulation data of the time domain symbol l ′ may be:
  • d l ', 0 (m) d l' (m), where d l ' (m) is the m-th data in the modulation data d l' transmitted on the time domain symbol l ', d l', 0 (m) is the mth data in the 0th modulation data d l ', 0 , and the length of d l', 0 is M;
  • d l ', 1 (m) -d l' (m) ⁇ d l'-1 (m) / d l'-2 (m), where d l ', 1 (m) is the time domain symbol l 'The first modulation data d l', the m-th data in 1 , d l'-1 (m) is the m-th data in the modulation data d l'-1 transmitted on the time domain symbol l'-1 , D l'-2 (m) is the mth data in the modulation data d l'-2 transmitted on the time domain symbol l'-2, d l ', 1 , d l'-1 and d l'-2 Has a length of M;
  • d l ', 2 (m) -d l' (m) ⁇ d l'-2 (m) / d l'-3 (m), where d l ', 2 (m) is the time domain symbol l
  • the second modulation data d l 'of the', the m-th data in 2, d l'-3 (m) is the m-th data in the modulation data d l'-3 transmitted on the time domain symbol l'-3
  • the length of d l ', 2 and d l'-3 is M;
  • d l ', 3 (m) -d l' (m) ⁇ d l'-1 (m) / d l'-3 (m), where d l ', 3 (m) is the time domain symbol l
  • the third modulation data d l 'of'' is the m-th data in 3 , and the length of d l', 3 is M.
  • the modulation data transmitted on the time domain symbol may also be referred to as input modulation data on the time domain symbol, or modulation data input on the time domain symbol.
  • the 4-way modulation data of the time domain symbol l ′ may also be:
  • d l ', 1 (m) d l' (m) ⁇ d l'-2 (m) / d l'-1 (m);
  • d l ', 2 (m) d l' (m) ⁇ d l'-3 (m) / d l'-2 (m);
  • d l ', 3 (m) d l' (m) ⁇ d l'-3 (m) / d l'-1 (m).
  • the values of d l'-1 , d l'-2, and d l'-3 can be initialized.
  • the length of the modulation data is 1
  • the modulation method is Pi / 2-BPSK
  • the modulation data transmitted on the 0th time domain symbol d 0 1, d l'-1 , d l'-2, and d l'-
  • the initialization values of 3 are -j, 1, j, respectively.
  • the K-1 channel modulation data can be obtained. Modulation data of the first channel; wherein K-1 is an integer greater than or equal to 1.
  • the modulation mode of the modulation data is QPSK or Pi / 4-QPSK: according to the mth data in the modulation data d l ′ and the modulation data d l′-1 transmitted on the time domain symbol l′-1
  • the mth data in can be obtained from the mth data of the first modulation data in the K-1 modulation data; where K-1 is an integer greater than or equal to 1, and m is a value ranging from 0 to M-1 integer.
  • the three-channel modulation data of the time domain symbol l ′ may be:
  • d l ', 0 (m) d l' (m), where d l ' (m) is the m-th data in the modulation data d l' transmitted on the time domain symbol l ', d l', 0 (m) is the mth data in the 0th modulation data d l ', 0 , and the length of d l', 0 is M;
  • d l ', 1 (m) d l' (m) ⁇ ⁇ l ', 1 (m), where d l', 1 (m) is the m-th of the first modulation data d l ', 1 Data
  • d l ', 2 (m) d l' (m) ⁇ ⁇ l ', 2 (m), where d l', 2 (m) is the m-th in the first modulation data d l ', 2 Data.
  • ⁇ l ', 1 (m) and ⁇ l', 2 (m) can be expressed as:
  • (d l ' (m) / d l'-1 (m)) * is a conjugate of d l' (m) / d l'-1 (m).
  • d l ', 1 (m) d l' (m) ⁇ ( ⁇ l ', 1 (m) + ⁇ l', 2 (m)), or Among them,
  • the k-th modulation data d l ′, k may be subjected to M-point Fourier transform, Get frequency-domain data of length M Among them, the length of d l ', k is M.
  • the Fourier transform may be a discrete Fourier transform (DFT) or a fast Fourier transform (FFT), or may be another Fourier transform form. There are no restrictions on the application.
  • DFT discrete Fourier transform
  • FFT fast Fourier transform
  • the k-th modulation data d l ′, k may be zero-added to obtain a length of Data of M padzero And Perform Fourier transform of the M padzero point to obtain frequency domain data of length M padzero Among them, M padzero is an integer greater than M, and M is a length of d l ', k .
  • Is the coefficient used to adjust the output data power Is a real number, such as Yes In the r-th data, r is an integer ranging from 0 to M padzero -1.
  • M 0, head is an integer greater than or equal to 1. That is, for Rth data
  • M 0, tail is an integer greater than or equal to 1. That is, for Rth data
  • the frequency domain data obtained after Fourier transform may be used.
  • the length is M; in the method shown in Figure 10 (f) and Figure 10 (h), The length is M padzero .
  • M length is M or M padzero .
  • Q offset is an offset value
  • Q offset is a positive integer.
  • the value of Q offset may be pre-configured, and the value of Q offset may also be notified by the network device to the UE through signaling.
  • the data to be processed can be treated first
  • the first filtering is performed first, and then the inverse Fourier transform is performed.
  • the first to-be-processed data may be frequency-domain data obtained after Fourier transform.
  • the first data to be processed may also be extended data obtained after cyclic expansion This is shown in Figures 10 (b) and 10 (f).
  • the first filter is a frequency domain filter, and the filter corresponding to the first filter is a frequency domain filter.
  • the first filter may also be referred to as a first frequency domain filter, and a coefficient of the first filter may be referred to as a first filter coefficient or a first filter coefficient.
  • the first filter when the first filter is a frequency domain filter, it may be a raised raised cosine (RRC) filter, a raised rooted cosine (SRRC) filter, or another frequency Domain filter, this application is not limited.
  • RRC raised raised cosine
  • SRRC raised rooted cosine
  • ⁇ the value of the roll-off factor
  • the network device notifies the terminal device through signaling.
  • q re, offset is an offset factor, and the values of q re, offset may be pre-configured, and the values of q re, offset may also be notified to the UE by the network device through signaling.
  • Filter data Data in the index of the starting position of the frequency domain resource Filter data Data in the map to the end index of the frequency domain resource, E.g,
  • the index of the start position and the end position of the frequency domain resource may be the start position and end position of the subcarrier corresponding to the allocated bandwidth, where resources in the allocated bandwidth, such as subcarriers, are used to send send data.
  • the length N of the inverse Fourier transform is 2048, that is, a maximum of 2048 subcarriers can be mapped to data, and the indexes corresponding to these 2048 subcarriers can be expressed as 0,1,2, ..., 2047.
  • the index of the indicated Q subcarriers can be expressed as:
  • performing the inverse Fourier transform may be performing inverse discrete Fourier transform or continuous inverse Fourier transform and sampling.
  • the above inverse Fourier transform formula is a discrete representation.
  • a continuous representation can be used to describe the inverse Fourier transform formula.
  • inverse Fourier transform continuous expression (ie Continuous form )It can be expressed as:
  • T s is a time unit factor, which may be pre-configured or may be notified by the network device to the UE through signaling.
  • T s may be a time interval between two adjacent discrete data in the discrete data, where the discrete data is a pair Discrete data obtained by discrete sampling.
  • the subcarrier interval ⁇ f 15 kHz and N is 2048
  • T s 1 / (30.72 ⁇ 10 6 ).
  • the first data to be processed is frequency domain data obtained after Fourier transform
  • First filtering is performed to obtain first filtered data having a length of M length
  • Current frequency domain data Is the frequency-domain data of length M described in the embodiment of the present application When M length is equal to M.
  • Current frequency domain data Is the frequency domain data of the length M padzero described in the embodiment of the present application When M length is equal to M padzero .
  • time-domain data of length N can be obtained Nth data in
  • n 0,1, ..., N-1.
  • I a real number.
  • m ′ re, offset is an offset factor
  • m ′ re, offset is a real number, for example, m ′ re, offset is equal to 0.
  • the value of m ′ re, offset may be pre-configured, and the value of m ′ re, offset may also be notified by the network device to the UE through signaling.
  • Filter data Data in the index of the starting position of the frequency domain resource Filter data Data in the map to the end index of the frequency domain resource, with Is an integer, E.g,
  • the inverse Fourier transform of the data to be processed may be performed first, and then the first filtering .
  • the data to be processed may be frequency-domain data obtained after Fourier transform.
  • Figures 10 (c) and 10 (g); the data to be processed can also be extended data obtained after cyclic expansion This is shown in Figures 10 (d) and 10 (h).
  • the first filter is a time-domain filter, and the filter corresponding to the first filter is a time-domain filter.
  • the first filtering may also be referred to as a first time-domain filtering, and a coefficient of the first filter may be referred to as a first filter coefficient or a first filtering coefficient.
  • n 0,1, ..., N-1.
  • Is the inverse Fourier transform coefficient that adjusts the output data power Is a real number.
  • the first filter when it is a time domain filter, it may be an RRC filter, an SRRC filter, or another time domain filter, which is not limited in this application.
  • the first time domain filter is an RRC filter or an SRRC filter
  • the value of the roll-off factor ⁇ may be pre-configured, or the network device notifies the terminal device through signaling.
  • n-th data is represented as:
  • n 0,1, ..., N-1
  • Q time is an integer greater than or equal to 1
  • C timefilter1 (q time ) is the q time filter coefficient in C timefilter1
  • Q time ⁇ N is an integer greater than or equal to 1
  • the first data to be processed is frequency domain data obtained after Fourier transform
  • Perform inverse Fourier transform to obtain time-domain data of length N Correct Perform filtering to obtain first filtered data of length N
  • n 0,1, ..., N-1.
  • Is the inverse Fourier transform coefficient that adjusts the output data power Is a real number.
  • E.g Frequency domain data Data in the index of the starting position of the frequency domain resource, Frequency domain data Data in the map to the end index of the frequency domain resource, with Is an integer, E.g, Where M length is length.
  • Current frequency domain data Is the frequency-domain data of length M described in the embodiment of the present application When M length is equal to M.
  • Current frequency domain data Is the frequency domain data of the length M padzero described in the embodiment of the present application When M length is equal to M padzero .
  • n 0,1, ..., N-1
  • Q time is an integer greater than or equal to 1
  • C timefilter1 (q time ) is the q time filter coefficient in C timefilter1
  • Q time ⁇ N is an integer greater than or equal to 1
  • a second filtering can be performed based on the first filtered data to obtain the time domain symbol
  • the k-th output data of l is s l, k .
  • the first filtered data may be the first filtered data having a length of N.
  • a second filtering may be performed based on the inverse Fourier transformed data,
  • the k-th output data s l, k of the time domain symbol l is obtained, and the length of s l, k is N.
  • the inverse Fourier transformed data may be the above-mentioned time-domain data of length N.
  • the difference is that the second filtering is used still is to simplify the description, when the second filtering is described in the embodiments of the present application, Describe as an example.
  • the k-th output data s l, k of the time-domain symbol l can be obtained by the filter coefficient C k of the k-th second filter.
  • the length of C k may be L k ⁇ N-1, where L k is a positive integer.
  • the ith value C 1 (i) of the second filter coefficient C 1 of the first channel is based on the value of the second filter coefficient C 0 of the first channel the i-th value of C 0 (i), 0-th path in the second filter coefficient C 0 of i + 2N values C 0 (i + 2N), and a second path of the second filter coefficients 0 C 0 of The i + N values C 0 (i + N) are determined.
  • this method is applied to the method shown in FIG. 2, it can be applied to a scenario with K ⁇ 2.
  • the second filter, the i-th value of C 2 in the second path of the second filter coefficient C 2 (i) is a path of the second filter coefficients 0 C 0 of the i-th value of C 0 (i), 0-th path in the second filter coefficient C 0 of i + 2N values C 0 (i + 2N), and a second path of the second filter coefficients 0 C 0 of The i + 3N values C 0 (i + 3N) are determined.
  • the method is applied to the method shown in FIG. 2, it can be applied to a scenario with K ⁇ 3.
  • the third path of the second filter coefficients C 3 C 3 i-th value (i) is a path of the second filter coefficients 0 C 0 of the i-th value of C 0 (i), the first path of the second filter coefficients 0 C 0 i + N of values of C 0 (i + N), and a second path of the second filter coefficients 0 C 0 of The i + 3N values C 0 (i + 3N) are determined.
  • this method is applied to the method shown in FIG. 2, it can be applied to a scenario with K ⁇ 4.
  • the above possible implementations C1, C2 and C3 can also be combined.
  • the above-mentioned possible implementations C1 and C2 are used in combination
  • the above-mentioned possible implementations C1 and C3 are used in combination
  • the above-mentioned possible implementations C2 and C3 are used in combination
  • the above-mentioned possible implementations C1, C2, and C3 are used in combination.
  • the above-mentioned possible implementations C1, C2, and C3 can be applied to various scenarios, and especially can be applied to scenarios where the modulation mode is BPSK or Pi / 2-BPSK.
  • the i-th value C 1 (i) in the second filter coefficient C 1 of the first channel may be expressed as:
  • the i-th value C 2 (i) in the second filter coefficient C 2 of the second channel can be expressed as:
  • the i-th value C 3 (i) in the third-path second filter coefficient C 3 can be expressed as:
  • the length of C 0 is L 0 ⁇ N
  • the length of C 1 (n) is (L 0 -1) ⁇ N
  • the length of C 2 (n) is (L 0 -2) ⁇ N
  • the length of C 3 (n) is (L 0 -2) ⁇ N.
  • L 0 is a positive integer.
  • the filter coefficients can also be expressed in a continuous manner.
  • the index i is replaced by the time t
  • the length N is replaced by the time length T.
  • the value C 1 (t) at time t in the second filter coefficient C 1 of the first channel can be expressed as:
  • the value C 2 (t) at the t-th moment in the second filter coefficient C 2 of the second channel can be expressed as:
  • the value C 3 (t) of the second filter coefficient C 3 of the third channel at the time t can be expressed as:
  • the length of C 0 (t) is L 0 ⁇ T
  • the length of C 1 (t) is (L 0 -1) ⁇ T
  • the length of C 2 (t) is (L 0 -2) ⁇ T
  • the length of C 3 (t) is (L 0 -2) ⁇ T.
  • C 0 may be a filter coefficient obtained according to a main component of Laurent decomposition, where the main component may also be referred to as a main filter.
  • g (i) may be a linear response, a Gaussian response, or other responses, which are not limited in this application.
  • g (i) when g (i) is a rectangular response, g (i) can be expressed as:
  • C 0 (i) and g (i) are discrete representations. It is also possible to sample continuous forms corresponding to C 0 (i) and g (i) to obtain discrete representations of C 0 (i) and g (i).
  • T N ⁇ T s .
  • the i-th value C 0 (i) in the 0-th second filter coefficient C 0 is based on the 0-th base filter The i-th value in And the first base filter The i-th value in definite.
  • the i-th value C 1 (i) in the first filter coefficient C 1 is based on the 0-th base filter I + Nth value in And the first base filter The i-th value in definite.
  • the i-th value C 2 (i) in the second-path second filter coefficient C 2 is based on the 0-th base filter The i-th value in And the first base filter I + Nth value in definite.
  • the foregoing possible implementations D1, D2, and D3 can also be combined.
  • the foregoing possible implementations D1 and D2 are used in combination
  • the foregoing possible implementations D1 and D3 are used in combination
  • the foregoing possible implementations D1, D2, and D3 are used in combination, and this application is not limited.
  • the above-mentioned possible implementations D1, D2, and D3 can be applied to various scenarios, especially to scenarios where the modulation mode is QPSK or Pi / 4-QPSK.
  • the i-th value C 0 (i) in the 0- th second filter coefficient C 0 can be expressed as:
  • the ith value C 1 (i) in the second filter coefficient C 1 of the first channel can be expressed as:
  • the i-th value C 2 (i) in the second filter coefficient C 2 of the second channel can be expressed as:
  • the length of C 0 (i) is L 0 ⁇ N
  • the length of C 1 (i) is (L 0 -1) ⁇ N
  • the length of C 2 (i) is (L 0 -1) ⁇ N
  • L 0 is a positive integer.
  • 0th base filter And the 1st base filter It can be the main component of Umberto Mengali decomposition.
  • the main component can also be called the main filter.
  • 0th base filter And the 1st base filter The discretized expression is as follows:
  • the filter coefficients may also be expressed in a continuous manner.
  • the index i is replaced by time t
  • the length N is replaced by time length T.
  • the t-th value C 0 (t) in the 0- th second filter coefficient C 0 can be expressed as:
  • the t-th value C 1 (t) in the second filter coefficient C 1 of the first channel can be expressed as:
  • the t-th value C 2 (t) in the second filter coefficient C 2 of the second channel can be expressed as:
  • the length of C 0 (t) is L 0 ⁇ T
  • the length of C 1 (t) is (L 0 -1) ⁇ T
  • the length of C 2 (t) is (L 0 -1) ⁇ T.
  • the curve corresponding to A in the figure is the amplitude of the second filter coefficient C 0 of the 0th channel
  • the curve corresponding to B is the amplitude of the second filter coefficient C 1 of the first channel
  • C corresponds The curve of is the magnitude of the second filter coefficient C 2 of the second channel. It can be seen from FIG. 11 that the second filter coefficient C 1 of the first channel is relatively close to the second filter coefficient C 2 of the second channel.
  • the ith value C 1 (i) of the second filter coefficient C 1 of the first channel is based on the value of the second filter coefficient C 0 of the first channel.
  • the i-th value C 0 (i) and the i + N-th value C 0 (i + N) in the 0- th second filter coefficient C 0 are determined.
  • the filter coefficients can also be expressed in a continuous manner.
  • the index i is replaced by the time t
  • the length N is replaced by the time length T, where the determination of t and T is the same as the corresponding content in the previous C1, C2, and C3, and is not repeated here.
  • the i-th value C 1 (i) in the second filter coefficient C 1 of the first channel can be expressed as:
  • the t-th value C 1 (t) in the second filter coefficient C 1 of the first channel can be expressed as:
  • the second filter coefficient of the 0th channel may be the same as that described in the implementation of D1, or other filter designs may be used, which will not be repeated here.
  • the transmitting end such as a base station or a UE, may include a hardware structure and / or a software module, and implements the foregoing in the form of a hardware structure, a software module, or a hardware structure plus a software module.
  • a hardware structure such as a base station or a UE
  • the transmitting end may include a hardware structure and / or a software module, and implements the foregoing in the form of a hardware structure, a software module, or a hardware structure plus a software module.
  • Each function Whether one of the above functions is executed by a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application of the technical solution and design constraints.
  • FIG. 12 is a schematic structural diagram of a device 1200 according to an embodiment of the present application.
  • the device 1200 may be a UE or a base station and can implement the data transmission method provided in the embodiment of the present application; the device 1200 may also be a device capable of supporting the UE or the base station to implement the data transmission method provided in the embodiment of the application.
  • the device 1200 may be a hardware structure, a software module, or a hardware structure plus a software module.
  • the device 1200 may be implemented by a chip system.
  • the apparatus 1200 includes a first pre-processing module 1202, a second filtering module 1204, and a communication module 1208.
  • the second filtering module 1204 is coupled to the first pre-processing module 1202 and the communication module 1208, respectively.
  • the apparatus 1200 includes a first pre-processing module 1202, a second filtering module 1204, a merging module 1206, and a communication module 1208.
  • the second filtering module 1204 may be coupled with the first pre-processing module 1202 and the merging module 1206, and the communication module 1208 may be coupled with the merging module 1206.
  • the first pre-processing module 1202 is configured to implement the first pre-processing method provided in the embodiment of the present application, for example, each of the first pre-processing methods shown in FIG. 10.
  • the device 1200 may include a first pre-processing module 1202 for implementing the first pre-processing in the 0th to Kth data processing in the method shown in FIG. 2.
  • the device 1200 may further include K first preprocessing modules 1202, and the K first preprocessing modules 1202 are respectively used to implement the 0th to Kth data processing in the method shown in FIG. 2 First preprocessing.
  • the device 1200 may further include a first pre-processing module 1202 with another data amount, which is not limited in this application.
  • FIG. 13 is a schematic structural diagram of a first pre-processing module 1202.
  • the first pre-processing module 1202 includes a Fourier transform module 1301, a first filtering module 1302, and an inverse Fourier transform module 1303.
  • the Fourier transform module 1301, the first filtering module 1302, and the inverse Fourier transform module 1303 can be respectively used to implement the Fourier transform processing involved in any one of FIGS. 10 (a) to 10 (h), First filtering process and inverse Fourier transform process.
  • the first pre-processing module 1202 may further include a cyclic extension module 1304.
  • the cyclic extension module 1304 may be used to implement the cyclic extension process involved in any one of FIG. 10 (b), FIG. 10 (d), FIG. 10 (f), and FIG. 10 (h).
  • the first pre-processing module 1202 may further include a zero-padding module 1305.
  • the zero padding module 1305 may be used to implement the zero padding process involved in any one of FIG. 10 (e) to FIG. 10 (h).
  • the second filtering module 1204 is configured to perform a second filtering operation on the first pre-processed data.
  • the device 1200 may include a second filtering module 1204 for implementing the second filtering in the 0th to Kth data processing in the method shown in FIG. 2.
  • the device 1200 may further include K second filtering modules 1204, and the K second filtering modules 1204 are respectively used to implement the 0th to the Kth data processing in the method shown in FIG. 2 Second filtering.
  • the device 1200 may further include a second filtering module 1204 of another data amount, which is not limited in this application.
  • the merging module 1206 is used for merging the data obtained through the second filtering in the data processing of the 0th channel to the Kth channel to obtain the transmitted data.
  • the communication module 1208 is configured to send transmission data.
  • FIG. 14 is a schematic structural diagram of a device 1400 according to an embodiment of the present application.
  • the device 1400 may be a UE or a base station and can implement the data transmission method provided in the embodiment of the present application; the device 1400 may also be a device capable of supporting the UE or the base station to implement the data transmission method provided in the embodiment of the present application.
  • the device 1400 includes a processing system 1402, which is configured to implement or support a UE or a base station to implement the data sending method provided in the embodiment of the present application.
  • the processing system 1402 may be a circuit, and the circuit may be implemented by a chip system.
  • the processing system 1402 includes one or more processors 1422, which may be used to implement or be used to support a UE or a base station to implement the method provided in the embodiment of the present application.
  • the processor 1422 may also be used to manage other devices included in the processing system 1402.
  • the other devices may be the following memory 1424, the bus 1426, and One or more of the bus interfaces 1428.
  • the processor 1422 may be used to manage the memory 1424, or the processor 1422 may be used to manage the memory 1424, the bus 1426, and the bus interface 1428.
  • the processing system 1402 may further include one or more memories 1424 for storing instructions and / or data. Further, the memory 1424 may also be included in the processor 1422. If the processing system 1402 includes a memory 1424, the processor 1422 may be coupled to the memory 1424. The processor 1422 may operate in cooperation with the memory 1424. The processor 1422 may execute instructions stored in the memory 1424. When the processor 1422 executes the instructions stored in the memory 1424, it may implement or support the UE or the base station to implement the method provided in the embodiment of the present application. The processor 1422 may also read data stored in the memory 1424. The memory 1424 may also store data obtained when the processor 1422 executes an instruction.
  • the memory includes a volatile memory (such as a random-access memory (RAM); the memory may also include a non-volatile memory (non-volatile memory), such as a fast memory Flash memory (hard memory, hard disk drive (HDD) or solid-state drive (SSD); memory can also include a combination of the above types of memory; memory can also include any other device with a storage function, Examples are circuits, devices, or software modules.
  • RAM random-access memory
  • non-volatile memory such as a fast memory Flash memory (hard memory, hard disk drive (HDD) or solid-state drive (SSD); memory can also include a combination of the above types of memory; memory can also include any other device with a storage function, Examples are circuits, devices, or software modules.
  • the processing system 1402 may further include a bus interface 1428 for providing an interface between the bus 1426 and other devices.
  • the bus interface can also be called a communication interface.
  • the communication interface may be a circuit, a module, a transceiver, or another form of interface, which is not limited in this application.
  • the device 1400 may further include a transceiver 1406 for communicating with other communication devices through a transmission medium, so that other devices used in the device 1400 can communicate with other communication devices.
  • the other device may be the processing system 1402.
  • other devices in the device 1400 may use the transceiver 1406 to communicate with other communication devices, receive and / or send corresponding information.
  • other devices in the device 1400 may receive corresponding information, wherein the corresponding information is received by the transceiver 1406 through the transmission medium, and the corresponding information may be transmitted through the bus interface 1428 or the bus interface 1428 and the bus 1426 Interact between the transceiver 1406 and other devices in the device 1400; and / or, other devices in the device 1400 may send corresponding information, wherein the corresponding information is sent by the transceiver 1406 through a transmission medium, and the corresponding The information can be exchanged between the transceiver 1406 and other devices in the device 1400 through the bus interface 1428 or through the bus interface 1428 and the bus 1426.
  • the device 1400 may further include a user interface 1404.
  • the user interface 1404 is an interface between the user and the device 1400, and may be used for information interaction between the user and the device 1400.
  • the user interface 1404 may be at least one of a keyboard, a mouse, a display, a speaker, a microphone, and a joystick.
  • the processing system 1402 includes a processor 1422, and may further include one or more of a memory 1424, a bus 1426, and a bus interface 1428, which are used to implement the data sending method provided in the embodiment of the present application.
  • the processing system 1402 is also within the scope of the present application.
  • the module division of the device is a logical function division, and there may be another division manner in actual implementation.
  • each functional module of the device may be integrated into one module, or each functional module may exist separately, or two or more functional modules may be integrated into one module.
  • An embodiment of the present application provides a communication system, and the communication system includes a device for implementing the method provided by the embodiment of the present application.
  • the communication system may further include a receiving device.
  • the communication system includes a base station and a UE, where the base station can implement the sending method provided in the embodiment of the present application, and the UE can receive data sent by the base station.
  • the communication system includes a base station and a UE, where the UE can implement the sending method provided in the embodiment of the present application, and the base station can receive data sent by the UE.
  • the methods provided in the embodiments of the present application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software When implemented in software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions When the computer program instructions are loaded and executed on a computer, the processes or functions according to the embodiments of the present invention are wholly or partially generated.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a terminal, or another programmable device.
  • the computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be from a website site, computer, server, or data center Transmission by wire (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) to another website site, computer, server, or data center.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, a data center, and the like that includes one or more available medium integration.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a digital video disc (DVD)), or a semiconductor medium (for example, an SSD).
  • the various embodiments may be mutually referenced, for example, the methods and / or terms between method embodiments may be mutually referenced, such as the functions between the device embodiments and / Or terms may be referred to each other, for example, functions and / or terms between device embodiments and method embodiments may be referred to each other.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

本申请提供了一种数据发送方法，包括：对于在时域符号l'上发送的调制数据d l'，对所述调制数据d l'进行第一预处理得到长度为N的数据其中，l'为大于或等于0的整数；根据所述得到在时域符号l上发送的数据s l,0，其中，s l,0的长度为N，s l,0中第n个数据其中k1和offset为大于等于0的整数，k2为大于等于k1的整数，中第n个数据，n是取值范围为0至N-1的整数，C 0(n+offset-l'×N)是第二滤波器系数C 0中的第n+offset-l'×N个系数；在时域符号l上发送所述数据s l,0。通过该方法，可以使得发送数据具有低带外泄露OOB，因此可以降低通信系统中数据间的干扰，从而可以提高数据传输速率。

Description

数据传输方法及装置
本申请要求于2018年9月29日提交国家知识产权局、申请号为201811149474.7、申请名称为“数据传输方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及通信技术领域，尤其涉及数据的传输方法及装置。
背景技术
基于市场需求，无线通信系统中，例如长期演进(long term evolution，LTE)或第五代(fifth generation，5G)移动通信系统中，提出了物联网(internet of things，IoT)通信。IoT可以包括机器与机器(machine to machine，M2M)通信或机器类型通信(machine type communication，MTC)。M2M或MTC可以允许终端设备间进行通信，或者可以在无需人为干预的条件下允许终端设备与网络设备进行通信。例如，M2M或MTC的应用场景可以包括：智能电网、工业自动化控制、无线传感器网络、智能家电、智能水表、共享单车等场景。
发明内容
本申请实施例提供了数据发送方法、装置和系统，旨在提供具有低带外泄露(out-of-band emission，OOB emission)的发送数据，因此可以使得发送数据间的干扰降低，从而可以提高系统中的数据传输速率。在本申请实施例中，OOB emission还可以简称为OOB。
第一方面，提供了一种数据发送方法，包括：对于在时域符号l'上发送的调制数据d l′，对所述调制数据d l′进行第一预处理得到长度为N的数据
Figure PCTCN2019103885-appb-000001
其中，N为正整数，l'为大于或等于0的整数，对调制数据进行第一预处理包括：对所述调制数据依次进行傅里叶变换、傅里叶反变换和第一滤波，对所述调制数据依次进行傅里叶变换、循环扩展、傅里叶反变换和第一滤波，对所述调制数据依次进行傅里叶变换、第一滤波和傅里叶反变换，对所述调制数据依次进行傅里叶变换、循环扩展、第一滤波和傅里叶反变换，对所述调制数据依次进行补零、傅里叶变换、傅里叶反变换和第一滤波，对所述调制数据依次进行补零、傅里叶变换、循环扩展、傅里叶反变换和第一滤波，对所述调制数据依次进行补零、傅里叶变换、第一滤波和傅里叶反变换，或者对所述调制数据依次进行补零、傅里叶变换、循环扩展、第一滤波和傅里叶反变换；根据所述
Figure PCTCN2019103885-appb-000002
得到在时域符号l上发送的数据s l,0，其中，l为大于或等于0的整数，s l,0的长度为N，s l,0中第n个数据
Figure PCTCN2019103885-appb-000003
其中k1和offset为大于等于0的整数，k2为大于等于k1的整数，
Figure PCTCN2019103885-appb-000004
为
Figure PCTCN2019103885-appb-000005
中第n个数据，n是取值范围为0至N-1的整数，C 0(n+offset-l′×N)是第二滤波器系数C 0中的第n+offset-l′×N个系数；在时域符号l上发送所述数据s l,0。
通过该方法，引入了延迟操作，将k2-k1+1个时域符号的第n个数据分别乘以对应的滤波器系数后相加合并得到时域符号l上发送的第n个数据，可以保证不同时域符号上发送的数据的相关性和连续性。由于OOB的性能主要和不同时域符号上发送的数据之间的相关性和连续性有关，因此本申请实施例提供的方法可以降低发送数据的OOB。进一步地，相比现有技术中将时域符号对应的时域数据与滤波器系数进行线性卷积的滤波方式，该方法所提供的滤波方式采用的乘法运算较少，因此得到的发送数据的峰均功率比(peak to average power ratio，PAPR)更低，因此该发送数据经过PA后被发送时，依然可以具有低OOB。
在一种可能的设计中，所述方法还包括：根据所述调制数据d l′得到K-1路调制数据，其中，K-1为大于或等于1的整数；对于所述K-1路调制数据中的第k路调制数据d l′,k，对所述调制数据d l′,k进行所述第一预处理，得到第k路长度为N的数据
Figure PCTCN2019103885-appb-000006
其中，k是取值范围为1至K-1的整数；根据所述
Figure PCTCN2019103885-appb-000007
得到第k路输出数据s l,k，其中，s l,k的长度为N，s l,k中第n个数据
Figure PCTCN2019103885-appb-000008
为
Figure PCTCN2019103885-appb-000009
中第n个数据，C k(n+offset-l′×N)是第k路第二滤波器系数C k中的第n+offset-l′×N个值；在时域符号l上发送所述数据s l,0包括：根据所述s l,0和所述s l,k得到长度为N的合并输出数据s l，在时域符号l上发送所述合并输出数据s l，其中所述s l中第n个数据
Figure PCTCN2019103885-appb-000010
其中，n是取值范围为0至N-1的整数。
通过该方法，将K路输出数据s l,k合并得到时域符号l上的发送数据s l，可以减小多路数据中幅度较大的数据的幅度，可以增大多路数据中幅度较小的数据的幅度，因此可以使得合并后的发送数据的幅度变化趋于稳定，发送数据间的波动范围减小，从而可以降低发送数据的PAPR。因此，通过该方法得到的发送数据经过PA后被发送时，依然可以具有低OOB。
在一种可能的设计中，对所述调制数据进行补零包括：在所述调制数据中的起始数据前添加M 0,head个0；在所述调制数据中的末尾数据后添加M 0,tail个0；或者，在所述调制数据中的起始数据前添加M 0,head个0，且在所述调制数据中的末尾数据后添加M 0,tail个0；其中，M 0,head和M 0,tail为正整数。
通过该方法，可以使得发送数据中一部分起始数据和/或一部分末尾数据的值为0，因此在数据传输过程中可以更好地抵抗多径时延扩展带来的干扰，从而可以提高系统中的数据传输速率。
在一种可能的设计中，所述调制数据d l′中包括M个数据；所述M个数据中的第m个数据的相位是根据所述时域符号l'的索引l'确定的，或者是根据所述时域符号l'的索引l'和m确定的，m是取值范围为0至M-1的整数。示例性地，所述调制数据的调制方式是Pi/2-BPSK，调制数据d l′中的第m个数据和调制数据d l′-1中的第m个数据之间的相位差为π/2或-π/2；或所述调制数据的调制方式是Pi/4-QPSK，调制数据d l′中的第m 个数据和调制数据d l′-1中的第m个数据之间的相位差为π/4、3×π/4、-3×π/4或-π/4；其中，其中，d l′-1表示时域符号l'-1上发送的调制数据，l'-1为大于或等于0的整数。
通过该方法，可以使相邻符号上传输的调制数据间具有相位差，可以在进行滤波操作时减小同向相加的概率，从而可以降低发送数据的PAPR。因此，通过该方法得到的发送数据经过PA后被发送时，依然可以具有低OOB。
在一种可能的设计中，根据所述调制数据d l′得到K-1路调制数据，包括：根据所述调制数据d l′、时域符号l′-1上发送的调制数据d l′-1、以及时域符号l′-2上发送的调制数据d l′-2，得到所述K-1路调制数据中的第1路调制数据d l′,1，其中，所述K-1大于或等于1；和/或，根据所述调制数据d l′、时域符号l′-2上发送的调制数据d l′-2、以及时域符号l′-3上发送的调制数据d l′-3，得到所述K-1路调制数据中的第2路调制数据d l′,2，其中，所述K-1大于或等于2；和/或，根据所述调制数据d l′、时域符号l′-1上发送的调制数据d l′-1、以及时域符号l′-3上发送的调制数据d l′-3，得到所述K-1路调制数据中的第3路调制数据d l′,3，其中，所述K-1大于或等于3；其中，调制数据的调制方式是二进制相移键控BPSK或Pi/2-BPSK。
通过该方法，第1路至第K-1路调制数据是根据第0路调制数据确定的，使得K路数据处理中的数据是相关的。因此在将K路输出数据s l,k合并得到时域符号l上的发送数据s l时，可以进一步减小多路数据中幅度较大的数据的幅度，可以进一步增大多路数据中幅度较小的数据的幅度，因此可以使得合并后的发送数据的幅度变化趋于稳定，发送数据间的波动范围减小，从而可以降低发送数据的PAPR。通过该方法得到的发送数据经过PA后被发送时，依然可以具有低OOB。
在一种可能的设计中，所述第1路第二滤波器系数C 1中的第i个值C 1(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及所述滤波器系数C 0中的第i+N个值C 0(i+N)确定的；和/或，所述第2路第二滤波器系数C 2中的第n个值C 2(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及所述滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的；和/或，所述第3路第二滤波器系数C 3中的第i个值C 3(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+N个值C 0(i+N)、以及所述滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的；其中，调制数据的调制方式是BPSK或Pi/2-BPSK，i为整数。
通过该方法，第1路至第K-1路第二滤波器系数是根据第0路第二滤波器系数确定的，使得K路数据处理中的数据是相关的。因此在将K路输出数据s l,k合并得到时域符号l上的发送数据s l时，可以进一步减小多路数据中幅度较大的数据的幅度，可以进一 步增大多路数据中幅度较小的数据的幅度，因此可以使得合并后的数据的幅度变化趋于稳定，数据间的波动范围减小，从而可以降低发送数据的PAPR。通过该方法得到的发送数据经过PA后被发送时，依然可以具有低OOB。
在一种可能的设计中，根据所述调制数据d l′得到K-1路调制数据，包括：根据所述调制数据d l′以及时域符号l′-1上发送的调制数据d l′-1得到所述K-1路调制数据中的第1路调制数据；其中，所述K-1大于或等于1；其中，调制数据的调制方式是正交相移键控QPSK或者Pi/4-QPSK。
通过该方法，第1路至第K-1路调制数据是根据第0路调制数据确定的，使得K路数据处理中的数据是相关的。因此在将K路输出数据s l,k合并得到时域符号l上的发送数据s l时，可以进一步减小多路数据中幅度较大的数据的幅度，可以进一步增大多路数据中幅度较小的数据的幅度，因此可以使得合并后的数据的幅度变化趋于稳定，数据间的波动范围减小，从而可以降低发送数据的PAPR。通过该方法得到的发送数据经过PA后被发送时，依然可以具有低OOB。
在一种可能的设计中，所述第1路第二滤波器系数C 1中的第i个值C 1(i)是根据所述第二滤波器系数C 0中的第i个值C 0(i)、以及所述第二滤波器系数C 0中的第i+N个值C 0(i+N)确定的；其中，所述调制数据d l′的调制方式是Pi/4-QPSK或者QPSK，i为整数。
通过该方法，第1路至第K-1路第二滤波器系数是根据第0路第二滤波器系数确定的，使得K路数据处理中的数据是相关的。因此在将K路输出数据s l,k合并得到时域符号l上的发送数据s l时，可以进一步减小多路数据中幅度较大的数据的幅度，可以进一步增大多路数据中幅度较小的数据的幅度，因此可以使得合并后的数据的幅度变化趋于稳定，数据间的波动范围减小，从而可以降低发送数据的PAPR。通过该方法得到的发送数据经过PA后被发送时，依然可以具有低OOB。
第二方面，提供了一种装置，用于实现第一方面或第一方面中任一种可能的设计所描述的方法。该装置可以通过硬件、软件或硬件加软件的形式实现。该硬件或软件包括一个或多个与上述方法相对应的模块。
在一个示例中，该装置包括：第一预处理模块、第二滤波模块和通信模块；对于在时域符号l'上发送的调制数据d l′，所述第一预处理模块用于对所述调制数据d l′进行第一预处理得到长度为N的数据
Figure PCTCN2019103885-appb-000011
其中，N为正整数，l'为大于或等于0的整数，对调制数据进行第一预处理包括：对所述调制数据依次进行傅里叶变换、傅里叶反变换和第一滤波，对所述调制数据依次进行傅里叶变换、循环扩展、傅里叶反变换和第一滤波，对所述调制数据依次进行傅里叶变换、第一滤波和傅里叶反变换，对所述调制数据依次进行傅里叶变换、循环扩展、第一滤波和傅里叶反变换，对所述调制数据依次进行补零、傅里叶变换、傅里叶反变换和第一滤波，对所述调制数据依次进行补零、傅里叶变换、循环扩展、傅里叶反变换和第一滤波，对所述调制数据依次进行补零、傅里叶变换、第一滤波和傅里叶反变换，或者对所述调制数据依次进行补零、傅里叶变换、循环扩展、第一滤波和傅里叶反变换；所述第二滤波模块用于根据所述
Figure PCTCN2019103885-appb-000012
得到在时域符号l上发送的数据s l,0，其中，l为大于或等于0的整数，s l,0的长度为N，s l,0中第n个数据
Figure PCTCN2019103885-appb-000013
其中k1和offset为大于等于0的整数，k2为大于等于k1的整数，
Figure PCTCN2019103885-appb-000014
为
Figure PCTCN2019103885-appb-000015
中第n个数据，n是取值范围为0至N-1的整数，C 0(n+offset-l′×N)是第二滤波器系数C 0中的第n+offset-l′×N个系数；所述通信模块用于在时域符号l上发送所述数据s l,0。
在一种可能的设计中，所述第一预处理模块还用于：根据所述调制数据d l′得到K-1路调制数据，其中，K-1为大于或等于1的整数；对于所述K-1路调制数据中的第k路调制数据d l′,k，对所述调制数据d l′,k进行所述第一预处理，得到第k路长度为N的数据
Figure PCTCN2019103885-appb-000016
其中，k是取值范围为1至K-1的整数；所述第二滤波模块还用于根据所述
Figure PCTCN2019103885-appb-000017
得到第k路输出数据s l,k，其中，s l,k的长度为N，s l,k中第n个数据
Figure PCTCN2019103885-appb-000018
为
Figure PCTCN2019103885-appb-000019
中第n个数据，C k(n+offset-l′×N)是第k路第二滤波器系数C k中的第n+offset-l′×N个值；所述通信模块用于在时域符号l上发送所述数据s l,0包括：所述装置还包括合并模块，所述合并模块用于根据所述s l,0和所述s l,k得到长度为N的合并输出数据s l，所述通信模块用于在时域符号l上发送所述合并输出数据s l，其中所述s l中第n个数据
Figure PCTCN2019103885-appb-000020
其中，n是取值范围为0至N-1的整数。
对于补零、调制数据和第二滤波器系数的介绍同第一方面中相应的描述，这里不再赘述。
第三方面，提供了一种装置，用于实现第一方面或第一方面中任一种可能的设计所描述的方法。该装置可以通过硬件、软件或硬件加软件的形式实现。该硬件或软件包括一个或多个与上述方法相对应的模块。在一个示例中，该装置包括：处理器、存储器和通信接口。其中，存储器和处理器耦合，处理器执行存储器存储的指令；处理器和通信接口耦合，处理器通过通信接口发送和/或接收数据。在另一个示例中，该装置包括：处理器和存储器。其中，存储器和处理器耦合，处理器执行存储器存储的指令；处理器生成和发送数据，和/或接收和处理数据。
在一种可能的设计中，该装置包括处理器和通信接口；对于在时域符号l'上发送的调制数据d l′，处理器用于对所述调制数据d l′进行第一预处理得到长度为N的数据
Figure PCTCN2019103885-appb-000021
其中，N为正整数，l'为大于或等于0的整数，对调制数据进行第一预处理包括：对所述调制数据依次进行傅里叶变换、傅里叶反变换和第一滤波，对所述调制数据依次进行傅里叶变换、循环扩展、傅里叶反变换和第一滤波，对所述调制数据依次进行傅里叶变换、第一滤波和傅里叶反变换，对所述调制数据依次进行傅里叶变换、循环扩展、第一滤波和傅里叶反变换，对所述调制数据依次进行补零、傅里叶变换、傅里叶反变换和第一滤波，对所述调制数据依次进行补零、傅里叶变换、循环扩展、傅里叶反变换和第一滤波，对所述调制数据依次进行补零、傅里叶变换、第一滤波和傅里叶反变换，或者对所述调制数据依次进行补零、傅里叶变换、循环扩展、第一滤 波和傅里叶反变换；处理器用于根据所述
Figure PCTCN2019103885-appb-000022
得到在时域符号l上发送的数据s l,0，其中，l为大于或等于0的整数，s l,0的长度为N，s l,0中第n个数据
Figure PCTCN2019103885-appb-000023
其中k1和offset为大于等于0的整数，k2为大于等于k1的整数，
Figure PCTCN2019103885-appb-000024
为
Figure PCTCN2019103885-appb-000025
中第n个数据，n是取值范围为0至N-1的整数，C 0(n+offset-l′×N)是第二滤波器系数C 0中的第n+offset-l′×N个系数；处理器利用通信接口在时域符号l上发送所述数据s l,0。
在一种可能的设计中，处理器还用于根据所述调制数据d l′得到K-1路调制数据，其中，K-1为大于或等于1的整数；对于所述K-1路调制数据中的第k路调制数据d l′,k，对所述调制数据d l′,k进行所述第一预处理，得到第k路长度为N的数据
Figure PCTCN2019103885-appb-000026
其中，k是取值范围为1至K-1的整数；处理器还用于根据所述
Figure PCTCN2019103885-appb-000027
得到第k路输出数据s l,k，其中，s l,k的长度为N，s l,k中第n个数据
Figure PCTCN2019103885-appb-000028
Figure PCTCN2019103885-appb-000029
为
Figure PCTCN2019103885-appb-000030
中第n个数据，C k(n+offset-l′×N)是第k路第二滤波器系数C k中的第n+offset-l′×N个值；处理器利用通信接口在时域符号l上发送所述数据s l,0包括：处理器用于根据所述s l,0和所述s l,k得到长度为N的合并输出数据s l，处理器利用通信接口在时域符号l上发送所述合并输出数据s l，其中所述s l中第n个数据
Figure PCTCN2019103885-appb-000031
其中，n是取值范围为0至N-1的整数。
对于补零、调制数据和第二滤波器系数的介绍同第一方面中相应的描述，这里不再赘述。
第四方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行第一方面或第一方面中任一种可能的设计所描述的方法。
第五方面，本申请实施例提供了一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行第一方面或第一方面中任一种可能的设计所描述的方法。
第六方面，本申请实施例提供了一种芯片系统，该芯片系统中包括处理器，还可以包括存储器，用于实现第一方面或第一方面中任一种可能的设计所描述的方法。
第七方面，本申请实施例提供了一种通信系统，该通信系统中包括第二方面描述的任一种装置和接收装置，所述接收装置用于接收所述第二方面描述的任一种装置所发送的数据；或者该通信系统中包括第三方面描述的任一种装置和接收装置，所述接收装置用于接收所述第三方面描述的任一种装置发送的数据。
附图说明
图1为本申请实施例提供的OOB的示意图；
图2为本申请实施例提供的数据发送方法的示意图；
图3为本申请实施例提供的时域符号的索引的示意图；
图4为本申请实施例提供的第二滤波器的示意图；
图5为本申请实施例提供的循环前缀CP示意图；
图6至图9为本申请实施例提供的方法和数据发送方法单载波频分多址SC-FDMA的性能对比示意图；
图10为本申请实施例提供的第一预处理的示意图；
图11所示为本申请实施例提供的第二滤波器系数的幅度的示意图；
图12至图14为本申请实施例提供的装置的结构示意图。
具体实施方式
本申请实施例提供的技术方案可以应用于各种通信系统。示例性地，本申请实施例提供的技术方案可以应用于能够支持IoT的通信系统，或者可以应用于能够支持异步传输的通信系统。例如，本申请实施例提供的技术方案可以应用但不限于：5G、LTE或未来通信系统中。其中，5G还可以称为新无线(new radio，NR)。
本申请实施例提供的技术方案可以应用于通信设备间的无线通信。其中，通信设备可以包括网络设备和终端设备。通信设备间的无线通信可以包括：网络设备和终端设备间的无线通信、网络设备和网络设备间的无线通信、以及终端设备和终端设备间的无线通信。在本申请实施例中，术语“无线通信”还可以简称为“通信”，术语“通信”还可以描述为“数据传输”、“信号传输”、“信息传输”或“传输”等。在本申请实施例中，传输可以包括发送或接收。示例性地，传输可以是上行传输，例如可以是终端设备向网络设备发送信号；传输也可以是下行传输，例如可以是网络设备向终端设备发送信号。
本申请实施例提供的技术方案在通信系统中应用时，可以应用于各种接入技术。例如，可以应用于正交多址接入(orthogonal multiple access，OMA)技术或非正交多址接入(non-orthogonal multiple access，NOMA)技术。应用于正交多址接入技术时，可以应用于正交频分多址(orthogonal frequency division multiple access，OFDMA)或单载波频分多址(single carrier frequency division multiple access，SC-FDMA)等技术，本申请实施例不做限制。应用于非正交多址接入技术时，可以应用于稀疏码多址接入(sparse code multiple access，SCMA)、多用户共享接入(multi-user shared access，MUSA)、图样分割多址接入(pattern division multiple access，PDMA)、交织格栅多址接入(interleave-grid multiple access，IGMA)、资源扩展多址接入(resource spreading multiple access，RSMA)、非正交编码多址接入(non-orthogonal coded multiple access,NCMA)或非正交编码接入(non-orthogonal coded access，NOCA)等技术，本申请实施例不做限制。
本申请实施例提供的技术方案在通信系统中应用时，可以应用于各种调度类型。例如，可以应用于基于授权的调度或者基于免授权的调度。应用于基于授权的调度时，网络设备可以通过动态信令为终端设备发送调度信息，该调度信息中携带传输参数，网络设备和终端设备基于该传输参数进行数据传输。应用于免授权的调度时，可以预配置调度信息，或者网络设备可以半静态信令为终端设备发送调度信息，该调度信息中携带传输参数，网络设备和终端设备基于该传输参数进行数据传输。其中，免授权 的调度还可以称为非动态调度(without dynamic scheduling)、非动态授权(without dynamic grant)或其它名称，本申请实施例不做限制。
本申请实施例涉及的终端设备还可以称为终端，可以是一种具有无线收发功能的设备，终端可以被部署在陆地上，包括室内或室外、手持或车载；也可以被部署在水面上(如轮船等)；还可以被部署在空中(例如飞机、气球和卫星上等)。终端设备可以是用户设备(user equipment，UE)。其中，UE包括具有无线通信功能的手持式设备、车载设备、可穿戴设备或计算设备。示例性地，UE可以是手机(mobile phone)、平板电脑或带无线收发功能的电脑。终端设备还可以是虚拟现实(virtual reality，VR)终端设备、增强现实(augmented reality，AR)终端设备、工业控制中的无线终端、无人驾驶中的无线终端、远程医疗中的无线终端、智能电网中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端等等。本申请实施例中，用于实现终端的功能的装置可以是终端，也可以是能够支持终端实现该功能的装置，例如芯片系统。本申请实施例中，芯片系统可以由芯片构成，也可以包括芯片和其他分立器件。本申请实施例提供的技术方案中，以用于实现终端的功能的装置是终端，以终端是UE为例，描述本申请实施例提供的技术方案。
本申请实施例涉及的网络设备包括基站(base station，BS)，基站可以是一种部署在无线接入网中能够和终端进行无线通信的设备。基站可能有多种形式，比如宏基站、微基站、中继站和接入点等。示例性地，本申请实施例涉及到的基站可以是5G中的基站或LTE中的基站，其中，5G中的基站还可以称为传输接收点(transmission reception point，TRP)或gNB(gNodeB)。本申请实施例中，用于实现网络设备的功能的装置可以是网络设备，也可以是能够支持网络设备实现该功能的装置，例如芯片系统。在本申请实施例提供的技术方案中，以用于实现网络设备的功能的装置是网络设备，以网络设备是基站为例，描述本申请实施例提供的技术方案。
在通信系统中，信号传输可以包括同步传输和异步传输。以上行传输为例，对于上行同步传输，可以要求小区中不同UE发送的信号到达基站的时间相同，用于确保不同UE的信号间的正交性以降低UE间的干扰，从而可以确保各UE的信号在基站侧的正确接收。然而，由于小区中不同UE和基站间的距离可能不同，信号在空口的传输时间和距离成正比，因此为了确保不同UE发送的信号到达基站的时间相同，基站可以向UE发送定时提前(timing advance，TA)，使得UE可以根据各自的TA分别提前相应的时间发送信号。因此，在上行同步传输中，可以通过基站和UE间的信令交互来确保不同UE的信号间的正交性，从而可以确保UE发送的信号在基站侧的正确接收。然而，UE进行高速移动时，或者UE在建筑物密集的城市中运动时，UE相对基站的位置频繁变化，使得基站和UE间需要频繁地通过信令交互TA，以保持上行同步。或者当UE使用价格较低的晶振时，由于晶振的偏差累积等原因，也可能使得基站和UE间需要经常通过信令交互TA，以保持上行同步。基于该特点，同步传输应用于IoT场景或者其它小包业务场景时，可能会带来性能损失。
IoT场景中，要求通信设备具有价格低、电池寿命长等特性。进一步地，由于通信设备间传输的数据量较少，要求通信设备间信令交互少，以降低信令开销。这些特征使得同步传输应用于IoT场景时可能会带来性能损失，或者使得同步传输可能不适 用于IoT场景。因此，针对IoT场景提出了采用异步传输的方案。对于上行异步传输，可以不要求小区中不同UE发送的信号到达基站的时间相同，即可以不要求小区中不同UE发送的信号是正交的，因此也无需基站和UE间通过信令交互TA。
在利用频域资源进行信号传输的通信系统中，例如LTE或NR中，应用异步传输的IoT时，不同UE间的信号传输可以是频分的，且分配给不同UE的频域资源可以是邻近的。此时，由于不同UE间的信号传输是非正交的，一个UE的信号的带外泄露(out-of-band emission，OOB emission)可能会是另一个UE的信号的干扰，因此可能导致UE的信号在接收端的接收错误率较高，从而可能会降低系统中的数据传输速率。其中，OOB emission还可以简称为OOB。例如，图1所示为OOB的示意图。如图1所示，UE 1和UE 2间的信号传输是频分的，UE 1的信号在频域资源1中传输，UE 2的信号在频域资源2中传输，UE 1的信号可能泄露至频域资源2，在频域资源2中UE1的信号的OOB是UE 2的信号的干扰。类似地，UE 2的信号可能泄露至频域资源1，在频域资源1中UE 2的信号的OOB是UE 1的信号的干扰。其中，频率资源1和频率资源2中可以各自包括正整数个资源块(resource block，RB)或子载波，频率资源1和频率资源2中包括的资源大小可以相同，也可以不同，本申请不做限制。基于上述分析，为了支持异步传输，例如为了支持IoT中的异步传输或者其它场景中的异步传输，需要设计低OOB的发送波形，用于在异步传输时发送信号，以降低不同UE的信号间的干扰，从而用于提高系统传输速率。
在本申请实施例中，发送端向接收端发送数据或者信号。发送端可以是基站，也可以是UE；接收端可以是基站，也可以是UE。例如，当数据传输为下行(downlink，DL)时，发送端是基站，接收端是UE；当数据传输的为上行(uplink，UL)时，发送端是UE，接收端是基站；当数据传输为无线回传的DL时，发送端是宏基站，接收端是微基站；当数据传输为无线回传的UL时，发送端是微基站，接收端是宏基站；当数据传输为设备到设备(device to device，D2D)通信或者是车辆外联(vehicle to everything，V2X)通信时，发送端是第一UE，接收端是第二UE。在本申请实施例中，“第一”、“第二”等词汇是用于区分的目的，而不能理解为指示或暗示相对重要性，也不能理解为指示或暗示顺序。
图2为本申请实施例提供的信号发送方法的示意图。该方法可以应用于发送端在信道上向接收端发送数据；相应地，接收端可以在该信道上接收发送端所发送的数据。其中，该信道可以是各种可能的信道或者信号，例如：广播信道(physical broadcast channel，PBCH)、主同步信号(primary synchronization signal，PSS)、辅同步信号(secondary synchronization signal，SSS)、物理下行共享信道(physical downlink shared channel，PDSCH)、物理下行控制信道(physical downlink control channel，PDCCH)、物理上行共享信道(physical uplink shared channel，PUSCH)、物理上行控制信道(physical uplink control channel，PUCCH)、各种类型的上行参考信号(reference signal，RS)、各种类型的下行RS、或者其它可能的物理信道等，本申请不做限制。图2所示的方法应用于发送端在信道上向接收端发送数据时，该信道上的待发送数据可以作为图2所示的方法的输入数据，发送端可以根据该输入数据以及图2所示的方法进行数据处理，得到相应的输出数据，并将该输出数据在该信道上发送至接收端。其中， 该待发送数据的数据类型可以是调制数据。
在图2所示的方法中，发送端可以对输入的调制数据进行1路数据处理，例如图2所示的第0路数据处理，得到输出数据。例如，对于在时域符号l'上传输的调制数据d l′，发送端对所述调制数据d l′进行第一预处理202得到长度为N的数据
Figure PCTCN2019103885-appb-000032
其中，第一预处理中包括第一滤波，N为正整数，l′为大于或等于0的整数。发送端对
Figure PCTCN2019103885-appb-000033
进行第二滤波204，得到长度为N的数据s l,0，并在时域符号l上发送数据s l,0，其中l为大于或等于0的整数。相应地，接收端可以在时域符号l上接收数据s l,0。进一步地，接收端还可以对s l,0进行解调和译码。在本申请实施例中，大于或等于0的整数可以是0、1、2、3、4或更大的整数，正整数可以是1、2、3、4或更大的整数，本申请不做限制。为了便于理解，在本申请实施例中，相同的标记可以描述相同的变量。
在本申请实施例中，时域符号为时间单位，时域符号可以包括于传输时间间隔(transmission time interval，TTI)、时隙、微时隙、子帧和/或无线帧中。示例性地，发送端可以以TTI为单位向接收端发送数据。TTI的长度可以是绝对时间，例如0.5ms、1ms、2ms或10ms等；TTI的长度也可以是正整数个时域符号、正整数个子帧、正整数个时隙、正整数个微时隙或正整数个无线帧等。其中，正整数可以是1、2、3、4或更大的整数(例如7或14)，本申请不做限制。无线帧的长度可以是绝对时间，例如10ms，也可以是正整数个子帧。子帧的长度可以是绝对时间，例如0.5ms、或1ms，也可以是正整数个时隙、微时隙或时域符号。时隙的长度可以是绝对时间，例如0.5ms、或1ms；也可以是正整数个时域符号，例如7个或14个时域符号；还可以是正整数个微时隙。微时隙的长度可以是绝对时间，例如0.5ms，也可以是正整数个时域符号，例如2个或4个。
在本申请实施例中，时域符号可以是各种类型的时域符号，例如单载波时域符号、正交频分复用(orthogonal frequency division multiplexing，OFDM)符号、SC-FDMA符号。在包含若干个时域符号的时间单位中，如TTI、子帧或时隙等中，可以对时域符号进行编号，得到各时域符号的索引。例如，一个子帧中或者一个时隙中包括L个时域符号，该L个时域符号的索引为整数，分别为0至L-1，该L个时域符号可以分别记为符号0至符号L-1，其中L为大于或等于1的整数，例如L为7或14。对于任一个时域符号，例如时域符号l′，时域符号l′后第w1个符号可以记为符号l′+w1，其中w1为正整数，例如w1为1、2或3等。当l′+w1大于或等于L时，由于符号的索引的取值范围为0至L-1，因此符号l′+w1还可以记为符号mod(l′+w1,L)，其中，mod(l′+w1,L)表示l′+w1对L取模。时域符号l′前第w2个符号可以记为符号l′-w2，其中w2为正整数。当l′-w2小于0时，由于符号的索引的取值范围为0至L-1，因此符号l′-w2还可以记为符号l′-w2+x×L，其中，l′-w2+x×L大于或等于0且小于或等于L-1，x表示正整数。以一个时隙中包括14个时域符号为例，图3所示为两个相邻时隙中各时域符号的索引的示例图。例如，图3中，在第1个时隙中，如果l′为3，则l′-1为2，l′-2为1。再例如，如果时域符号l′是第2个时隙中的时域符号0，则该时 域符号l′前第1个时域符号l′-1为第1个时隙中的时域符号13，该时域符号l′前第2个时域符号l′-2为第1个时隙中的时域符号12。
在图2所示的方法中，发送端也可以对输入的调制数据进行多路数据处理，例如图2所示的第0路至第K-1路共K路数据处理，并合并得到输出数据。其中，K为大于或等于2的整数，例如2、3、4、5或6等，本申请不做限制。K的值可以是预定义的，也可以是基站通过信令通知UE的。K路数据处理中的第0路数据处理的方法同上述1路数据处理中描述的得到数据s l,0的方法，这里不再赘述。在K路数据处理过程中，对于在时域符号l'上传输的调制数据d l′，发送端可以根据d l′得到K路调制数据。例如，发送端根据d l′得到第k路调制数据d l′,k，其中，k是取值范围为0至K-1的整数，第0路的调制数据d l′,0为调制数据d l′。当第0路的调制数据d l′,0为调制数据d l′时，根据d l′得到K路调制数据还可以描述为：根据调制数据d l′得到第1路至第K-1路共K-1路调制数据。对于K路调制数据中的第k路调制数据d l′,k，发送端对调制数据d l′,k进行第一预处理202，得到第k路长度为N的数据
Figure PCTCN2019103885-appb-000034
发送端对
Figure PCTCN2019103885-appb-000035
进行第二滤波204，得到第k路输出数据s l,k，其中，s l,k的长度为N。发送端可以将K路s l,k进行相加合并206，得到长度为N的数据s l，并在在时域符号l上发送数据s l。例如，s l中第n个数据
Figure PCTCN2019103885-appb-000036
或者
Figure PCTCN2019103885-appb-000037
其中，n是取值范围为0至N-1的整数，s l,k(n)表示s l,k中第n个数据，s l,0(n)表示s l,0中第n个数据。相应地，接收端可以接收数据s l，还可以对s l进行解调译码，得到发送端所发送的数据。
在本申请实施例中，发送端发送数据，比如发送数据s l,0或发送数据s l，既可以是发送端直接在空口发送该数据，也可以指发送端间接在空口发送该数据，本申请不做限制。发送端间接在空口发送数据时，可以是发送端对该数据进行数据处理后，例如资源映射和/或中射频调制后，在空口发送该数据。
图4所示为本申请实施例提供的第二滤波204对应的滤波器示意图，该滤波器可以称为第二滤波器。其中，Z -N表示对数据流延迟N个数据。在图2所示的第k路数据处理中，由于第二滤波器的输入为第k路长度为N的数据
Figure PCTCN2019103885-appb-000038
且
Figure PCTCN2019103885-appb-000039
的长度为N，因此延迟N个数据相当于延迟一个时域符号的
Figure PCTCN2019103885-appb-000040
基于图4所示的滤波器，在图2所示的第k路数据处理中，通过第二滤波可以得到第k路输出数据s l,k。对于s l,k中的第n个数据s l,k(n)，
Figure PCTCN2019103885-appb-000041
其中，
Figure PCTCN2019103885-appb-000042
表示
Figure PCTCN2019103885-appb-000043
中第n个数据。C k(n+offset-l′×N)表示第k路第二滤波器的滤波系数中的第n+offset-l′×N个滤波系数，其中，第二滤波器的滤波系数的长度为L k×N，即第二滤波器的滤波系数中包括L k×N个滤波系数，分别为第0个滤波系数至第L k×N-1个滤波系数，L k为正整数。对于K路数据处理，各路第二滤波器的滤波系数可以相同，也可以不同，本申请不做限制。k1和offset为大于等于0的整数，k2为大于等于k1的整数。示例性地，offset可以等于0、l×N或者等于
Figure PCTCN2019103885-appb-000044
offset等于0时，
Figure PCTCN2019103885-appb-000045
其中，
Figure PCTCN2019103885-appb-000046
表示向下取整。示例 性地，k1等于l-(L k-1)，k2等于l；或者k1等于l，k2等于l+(L k-1)。在本申请实施例中，第二滤波器的滤波系数还可以简称为第二滤波器系数或者第二滤波系数。
上述第二滤波的操作中输出数据为离散的表示形式。可选地，图4所示的第二滤波的操作可以采用连续的表示形式。例如，通过第二滤波可以得到第k路输出数据s l,k。对于s l,k中的第t个时刻的数据s l,k(t)，其可以表示为：
Figure PCTCN2019103885-appb-000047
其中C k(t+offset-l′×T)表示第k路第二滤波器的滤波系数中的第t+offset-l′×T个时刻的系数。t start≤t＜t end，其中，t start、t和t end为实数，T＝N·T s。例如：t start＝0，t end＝N·T s。Δf为子载波间隔，例如Δf＝1/(N·T s)。本申请实施例中，T s为时间单位因子，可以是预配置的，也可以是网络设备通过信令通知UE的。可选地，T s可以为离散数据中相邻两个数据之间的时间间隔，该离散数据为将s l,k(t)进行离散采样得到的数据。示例性地，子载波间隔为15kHz，N为2048时，T s＝1/(30.72×10 6)。可选的，offset可以为l×T或者
Figure PCTCN2019103885-appb-000048
其中，L 0为整数。
示例性地，当t start＝0，t end＝N·T s，Δf＝1/(N·T s)时，以
Figure PCTCN2019103885-appb-000049
对s l,0(t)进行离散采样时，得到的离散表示形式：
Figure PCTCN2019103885-appb-000050
该
Figure PCTCN2019103885-appb-000051
分别与前文所述的
Figure PCTCN2019103885-appb-000052
C k(n+offset-l′×N)是相同的，
Figure PCTCN2019103885-appb-000053
与前文所述的s l,k(n)是相同的。
可选地，在图2涉及的方法中，在时域符号l上发送数据s l,0或发送数据s l时，可以不需要添加循环前缀(cyclic prefix，CP)。图5所示为CP示意图。如图5所示，在一些需要添加循环前缀的发送方法中，在一个时域符号上发送的数据中可以包括CP部分和纯数据部分，该CP部分和该纯数据中的部分数据相同。
通过本申请实施例提供的方法，在第二滤波中引入了延迟操作，将k2-k1+1个时域符号的第n个数据分别乘以对应的滤波器系数后相加合并得到时域符号l上传输的第n个数据，通过该方法可以保证不同时域符号上发送的数据的相关性和连续性。由于OOB的性能主要和不同时域符号上发送的数据之间的相关性和连续性有关，因此本申请实施例提供的方法可以降低发送数据的OOB。数据被发送时，一般会通过功率放大器(power amplifier，PA)进行放大后被发送。数据通过PA被放大时，可能会被进行非线性放大，此时，如果数据的峰均功率比(peak to average power ratio，PAPR)较高，经过非线性放大后可能会使得数据的OOB变高，即经过非线性放大后无法保持发送数据的低OOB。为了解决该技术问题，本申请实施例提供的方法还可以使得发送数据具有低PAPR，从而进一步保证发送数据具有低OOB。相比现有技术中将时域符号对应的时域数据与滤波器系数进行线性卷积的滤波方式，本申请实施例提供的滤波方式所采用的乘法运算较少，因此得到的发送数据的PAPR更低，因此该发送数据经过PA后被发送时，依然可以具有低OOB。
图6所示为本申请实施例提供的单路数据处理方法与传统的低OOB发送方法SC-FDMA之间的PAPR性能的对比。图6中横坐标表示发送数据的PAPR，纵坐标表示发送数据的PAPR的互补累积分布函数(complementary cumulative distribution function，CCDF)。如图6所示：曲线(1)为数据的调制类型是Pi/4-QPSK调制时，采用SC-FDMA得到的发送数据的PAPR的CCDF；曲线(2)为数据的调制类型是Pi/2-BPSK调制时，采用SC-FDMA得到的发送数据的PAPR的CCDF；曲线(3)为数据的调制类型是Pi/4-QPSK调制时，采用本申请实施例提供的方法且进行1路数据处理(第0路数据处理)时得到的发送数据的PAPR的CCDF；曲线(4)数据的调制类型是Pi/2-BPSK，采用本申请实施例提供的方法且进行1路数据处理(第0路数据处理)时得到的发送数据的PAPR的CCDF。根据图6所示的曲线可以得到，针对Pi/4-QPSK调制方式，相对SC-FDMA，使用本申请实施例提供的方法时可以使得发送数据的PAPR降低1.8dB左右；针对Pi/2-BPSK调制方式，相对SC-FDMA，使用本申请实施例提供的方法时可以使得发送数据PAPR降低2.8dB左右。下文中将详细介绍Pi/2-BPSK和Pi/4-QPSK，这里不再赘述。
图7所示为本申请实施例提供的单路数据处理方法与传统的低OOB发送方法SC-FDMA之间的OOB性能的对比。图7中示出了发送数据的频谱功率密度(power spectral density，PSD)曲线，其中，横坐标表示资源位置，纵坐标表示各资源位置对应的功率谱。图7中，所分配的用于发送数据的资源为48个子载波，对应于横坐标的-24至24，因此图7中横坐标小于-24和大于24的资源对应的功率谱可以认为是发送数据泄露到分配带宽以外的OOB。如图7所示：曲线(1)为数据的调制类型是Pi/4-QPSK调制或Pi/2-BPSK调制时，采用SC-FDMA得到的发送数据的PSD；曲线(2)为数据的调制类型是Pi/4-QPSK调制时，采用本申请实施例提供的方法且进行1路数据处理(第0路数据处理)时得到的发送数据的PSD；曲线(3)为数据的调制类型是Pi/2-BPSK，采用本申请实施例提供的方法且进行1路数据处理(第0路数据处理)时得到的发送数据的PSD。根据图7所示的曲线可以得到，相对SC-FDMA，使用本申请实施例提供的单路数据处理方法时可以得到低OOB的发送数据。
图8所示为本申请实施例提供的多路数据处理方法与传统的低OOB发送方法SC-FDMA之间的PAPR性能的对比。图8中横坐标表示发送数据的PAPR，纵坐标表示发送数据的PAPR的CCDF。如图8所示：曲线(1)为数据的调制类型是Pi/4-QPSK调制时，采用SC-FDMA得到的发送数据的PAPR的CCDF；曲线(2)为数据的调制类型是Pi/2-BPSK调制时，采用SC-FDMA得到的发送数据的PAPR的CCDF；曲线(3)为数据的调制类型是Pi/4-QPSK调制时，采用本申请实施例提供的方法且进行2路数据处理(第0路数据处理和第1路数据处理)时得到的发送数据的PAPR的CCDF；曲线(4)数据的调制类型是Pi/2-BPSK，采用本申请实施例提供的方法且进行2路数据处理(第0路数据处理和第1路数据处理)时得到的发送数据的PAPR的CCDF。 根据图8所示的曲线可以得到，针对Pi/4-QPSK调制方式，相对SC-FDMA，使用本申请实施例提供的多路数据处理方法时可以使得发送数据的PAPR降低3.2dB左右；针对Pi/2-BPSK调制方式，相对SC-FDMA，使用本申请实施例提供的多路数据处理方法时可以使得发送数据PAPR降低3.6dB左右。下文中将详细介绍Pi/2-BPSK和Pi/4-QPSK，这里不再赘述。进一步地，对比图6和图8可以得到，本申请实施例中，多路数据处理方法相对单路数据处理方法可以进一步降低发送数据的PAPR，从而可以更好地保持发送数据的低OOB。
图9所示为本申请实施例提供的多路数据处理方法与传统的低OOB发送方法SC-FDMA之间的OOB性能的对比。图9中示出了发送数据的PSD曲线，其中，横坐标表示资源位置，纵坐标表示各资源位置对应的功率谱。图9中，所分配的用于发送数据的资源为48个子载波，对应于横坐标的-24至24，因此图9中横坐标小于-24和大于24的资源对应的功率谱可以认为是发送数据泄露到分配带宽以外的OOB。如图9所示：曲线(1)为数据的调制类型是Pi/4-QPSK调制或Pi/2-BPSK调制时，采用SC-FDMA得到的发送数据的PSD；曲线(2)为数据的调制类型是Pi/4-QPSK调制时，采用本申请实施例提供的方法且进行2路数据处理(第0路数据处理和第1路数据处理)时得到的发送数据的PSD；曲线(3)为数据的调制类型是Pi/2-BPSK，采用本申请实施例提供的方法且进行2路数据处理(第0路数据处理和第1路数据处理)时得到的发送数据的PSD。根据图9所示的曲线可以得到，相对SC-FDMA，使用本申请实施例提供的多路数据处理方法时可以得到低OOB的发送数据。
可选地，在图2涉及的方法中，K的值可以是预配置的，也可以是基站通过信令通知UE的。在本申请实施例中，信令可以是半静态信令和/或动态信令。
在本申请实施例中，半静态信令可以是无线资源控制(radio resource control，RRC)信令、广播消息、系统消息、或媒体接入控制(medium access control，MAC)控制元素(control element，CE)。其中，广播消息可以包括剩余最小系统消息(remaining minimum system information，RMSI)。
在本申请实施例中，动态信令可以是物理层信令。物理层信令可以是物理控制信道携带的信令或者物理数据信道携带的信令。其中，物理数据信道可以是下行信道，例如物理下行共享信道(physical downlink shared channel，PDSCH)。物理控制信道可以是物理下行控制信道(physical downlink control channel，PDCCH)、增强物理下行控制信道(enhanced physical downlink control channel,EPDCCH)、窄带物理下行控制信道(narrowband physical downlink control channel,NPDCCH)或机器类通信物理下行控制信道(machine type communication(MTC)physical downlink control channel，MPDCCH)。其中，PDCCH或EPDCCH携带的信令还可以称为下行控制信息(downlink control information，DCI)。物理控制信道还可以是物理副链路控制信道(physical sidelink control channel)，物理副链路控制信道携带的信令还可以称为副链路控制信息(sidelink control information，SCI)。
可选地，下面将针对图2涉及的方法中的第一预处理和第二滤波进行详细介绍。
在本申请实施例中，第一预处理202可以是图10(a)至图10(h)中的任一种处理，本申请不做限制。
如图10(a)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行傅里叶变换、第一滤波和傅里叶反变换。
如图10(b)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行傅里叶变换、循环扩展、第一滤波和傅里叶反变换。
如图10(c)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行傅里叶变换、傅里叶反变换和第一滤波。
如图10(d)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行傅里叶变换、循环扩展、傅里叶反变换和第一滤波。
如图10(e)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行补零、傅里叶变换、第一滤波和傅里叶反变换。
如图10(f)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行补零、傅里叶变换、循环扩展、第一滤波和傅里叶反变换。
如图10(g)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行补零、傅里叶变换、傅里叶反变换和第一滤波。
如图10(h)所示，对调制数据进行第一预处理可以包括：对调制数据依次进行补零、傅里叶变换、循环扩展、傅里叶反变换和第一滤波。
在图10(e)至图3(h)涉及的方法中，对调制数据进行补零包括：在调制数据中的起始数据前添加M 0,head个0；在调制数据中的末尾数据后添加M 0,tail个0；或者，在调制数据中的起始数据前添加M 0,head个0，并在调制数据中的末尾数据后添加M 0,tail个0。其中，M 0,head和M 0,tail为正整数。
下面，将分别对本申请实施例提供的方法中的各处理模块进行详细描述。
本申请实施例提供的方法中的调制数据
在本申请实施例中，对于一个时域符号上传输的调制数据，例如时域符号l'上传输的调制数据d l′，或者对于根据该调制数据得到的调制数据，例如根据调制数据d l′得到的K路调制数据中的第k路调制数据d l′,k，d l′或d l′,k中可以包括M个数据，该M个数据可以为M个复数。其中，k是取值范围为0至K-1的整数。
首先，针对本申请实施例中的输入的调制数据进行介绍。
发送端通过信道向接收端发送数据时，待发送的数据可以被表示成二进制的比特流，该比特流中包括正整数个比特，一个比特的值可以为0或1。在发送端，该比特流中的比特可以经过调制，得到调制数据；该比特流中的比特也可以经过比特级操作，并经过调制，得到调制数据。所得到的调制数据可以作为本申请实施例中的输入的调制数据，例如图2所示的输入的调制数据。其中比特级操作可以包括分段、添加循环 冗余校验(cyclic redundancy check，CRC)、信道编码、交织和加扰中一种或多种操作。例如，比特级操作可以包括分段、添加CRC、信道编码和加扰；或者，比特级操作可以包括分段、添加CRC、信道编码、交织和加扰；或者，比特级操作可以包括添加CRC、信道编码、交织和加扰。
在得到输入的调制数据时，对比特进行调制时，可以使用正交振幅调制(quadrature amplitude modulation，QAM)。QAM调制可以包括二相移键控(binary phase shift keying，BPSK)、正交相移键控(quadrature phase shift keying，QPSK)、16QAM、64QAM、256QAM和1024QAM中至少一种调制方式。
在得到输入的调制数据时，对比特进行调制时，也可以使用Pi/2-BPSK或者Pi/4-QPSK调制方法。
对于时域符号l'上传输的调制数据d l′，所述M个数据中的第m个数据的相位是根据所述时域符号l'的索引l'确定的，或者是根据所述时域符号l'的索引l'和m确定的，或者是根据m确定的，m是取值范围为0至M-1的整数。
针对Pi/2-BPSK，可以使用以下设计A1至设计A3中任一种设计。
设计A1：
当调制数据为Pi/2-BPSK时，对于一个时域符号上传输的调制数据，例如对于时域符号l'上传输的调制数据d l′，该调制数据中包括M个数据，该M个数据中相邻两个数据之间的相位差为π/2或-π/2，或者该M个数据中相邻两个数据之间的相位差为π/2或3·π/2。
d l′的M个数据中第m个数据d l'(m)可以表示为
Figure PCTCN2019103885-appb-000054
其中，m是取值范围为0至M-1的整数。A l',m可以被认为是d l'(m)的幅度，A l',m为基于BPSK调制方式得到的输出。在本申请实施例中，基于BPSK调制方式，输入比特和输出(符号)之间的对应关系可以如表1(a)或表1(b)所示。
Figure PCTCN2019103885-appb-000055
或
Figure PCTCN2019103885-appb-000056
可以被认为是d l'(m)的相位。
表1(a)
输入比特 输出
0 1
1 -1
表1(b)
输入比特 输出
0 -1
1 1
在一种可能的设计中，
Figure PCTCN2019103885-appb-000057
为集合[0,π/2,π,3·π/2]中的一个值，d l′的M个数据中相邻两个数据之间的相位差为π/2或-π/2，或者d l′的M个数据中相邻两个数据之间 的相位差为π/2或3π/2。
示例性地，A l',m的值为基于BPSK调制方式得到的输出，
Figure PCTCN2019103885-appb-000058
是根据m确定的。例如
Figure PCTCN2019103885-appb-000059
可以表示为：
Figure PCTCN2019103885-appb-000060
或
Figure PCTCN2019103885-appb-000061
通过该设计，可以满足相邻两个数据之间的相位差为π/2或-π/2。
示例性地，对于时域符号l'，假设该时域符号上的输入比特流为[0,0,0,1,1,1,1,0,0,1,0,1]，该比特流中共包括12个比特，根据该比特流得到的调制数据d l′的长度为M＝12。对于d l′中第m个数据d l'(m)，
Figure PCTCN2019103885-appb-000062
A l',m是根据输入比特流中第m个比特以及表1(a)得到的输出符号，此时m的取值具体为0至11，
Figure PCTCN2019103885-appb-000063
则d l′中共包括12个数据，该12个数据可以表示为[1,j,1,-j,-1,-j,-1,j,1,-j,1,-j]。
设计A2：
当调制数据为Pi/2-BPSK时，对于两个相邻时域符号上传输的调制数据，例如对于时域符号l'上传输的调制数据d l′和时域符号l'-1上传输的调制数据d l′-1，d l′和d l′-1中各自包括M个数据。对于d l′或d l′-1中的M个数据，该M个数据中相邻两个数据之间的相位差为π/2或-π/2，或者该M个数据中相邻两个数据之间的相位差为π/2或3π/2。进一步地，d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/2或-π/2，或者d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/2或3π/2。
d l′中的数据的表示类似上述设计A1中的描述，这里不再赘述。d l′-1的M个数据中第m个数据d l'-1(m)可以表示为
Figure PCTCN2019103885-appb-000064
其中，m是取值范围为0至M-1的整数；A l'-1,m可以认为是d l'-1(m)的幅度，A l'-1,m的值为基于BPSK调制方式得到的输出；
Figure PCTCN2019103885-appb-000065
可以认为是d l'-1(m)的相位。
在一种可能的设计中，
Figure PCTCN2019103885-appb-000066
为集合[0,π/2,π,3·π/2]中的一个值，d l′的M个数据中相邻两个数据之间的相位差为π/2或-π/2；
Figure PCTCN2019103885-appb-000067
为集合[0,π/2,π,3·π/2]中的一个值，d l′-1的M个数据中相邻两个数据之间的相位差为π/2或-π/2；d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/2或-π/2，即
Figure PCTCN2019103885-appb-000068
示例性地，对于时域符号l'上传输的调制数据d l′，
Figure PCTCN2019103885-appb-000069
是根据l'和m确定的。例如
Figure PCTCN2019103885-appb-000070
可以表示为：
Figure PCTCN2019103885-appb-000071
或
Figure PCTCN2019103885-appb-000072
通过该设计，可以满足同一个时域符号的相邻两个数据之间的相位差为π/2或-π/2，且相邻时域符号的相同索引的两个数据之间的相位差为π/2或-π/2。
示例性地，对于时域符号0，假设该时域符号上的输入比特流为[0,0,0,1,1,1,1,0,0,1,0,1]，该比特流中共包括12个比特，根据该比特流得到的调制数据d 0的长度为M＝12；对于时域符号1，假设该时域符号上的输入比特流为[1,0,1,0,1,0,1,0,0,1,1,0]，该比特流中共包括12个比特，根据该比特流得到的调制数据d 1的长度为M＝12。对于时域符号l'，对于d l′中第 m个数据d l'(m)，
Figure PCTCN2019103885-appb-000073
A l',m是根据输入比特流中第m个比特以及表1(a)得到的输出符号，
Figure PCTCN2019103885-appb-000074
则当l'分别等于0和1时，符号0的调制数据d 0与符号1的调制数据d 1中各自包括12个数据，d 0与d 1可以分别表示为[1,j,1,-j,-1,-j,-1,j,1,-j,1,-j]，[-j,1,-j,1,-j,1,-j,1,j,-1,-j,1]。可以得到，符号0或者符号1对应的12个调制数据中任意2个相邻的调制数据之间相位相差为π/2或者-π/2，同时符号0的12个调制数据中的第m(m＝0,1,2,...,11)个调制数据与符号1的12个调制数据中的第m个调制数据之间相位相差为π/2或者-π/2。
设计A3：
当调制数据为Pi/2-BPSK时，对于两个相邻时域符号上传输的调制数据，例如对于时域符号l'上传输的调制数据d l′和时域符号l'-1上传输的调制数据d l′-1，d l′和d l′-1中各自包括M个数据。对于d l′或d l′-1中的M个数据，该M个数据之间的差异为基于BPSK调制方式得到的输出。进一步地，d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/2或-π/2。
对于d l′的表示同设计A1中相应的描述，对于d l′-1的表示同设计A2中相应的描述，这里不再赘述。
在一种可能的设计中，
Figure PCTCN2019103885-appb-000075
为集合[0,π/2,π,3·π/2]中的一个值，d l′的M个数据中相邻两个数据之间的相位差为0或π；
Figure PCTCN2019103885-appb-000076
为集合[0,π/2,π,3·π/2]中的一个值，d l′-1的M个数据中相邻两个数据之间的相位差为0或π；d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/2或-π/2，即
Figure PCTCN2019103885-appb-000077
示例性地，对于时域符号l'上传输的调制数据d l′，
Figure PCTCN2019103885-appb-000078
是根据l'确定的。例如
Figure PCTCN2019103885-appb-000079
可以表示为：
Figure PCTCN2019103885-appb-000080
或
Figure PCTCN2019103885-appb-000081
示例性地，对于时域符号0，假设该时域符号上的输入比特流为[0,0,0,1,1,1,1,0,0,1,0,1]，该比特流中共包括12个比特，根据该比特流得到的调制数据d 0的长度为M＝12；对于时域符号1，假设该时域符号上的输入比特流为[1,0,1,0,1,0,1,0,0,1,1,0]，该比特流中共包括12个比特，根据该比特流得到的调制数据d 1的长度为M＝12。对于d l′中第m个数据d l'(m)，
Figure PCTCN2019103885-appb-000082
A l',m是根据输入比特流中第m个比特以及表1(a)得到的输出符号，
Figure PCTCN2019103885-appb-000083
则符号0的调制数据d 0与符号1的调制数据d 1中各自包括12个数据，d 0与d 1可以分别表示为[1,1,1,-1,-1,-1,-1,1,1,-1,1,-1]，[-j,j,-j,j,-j,j,-j,j,j,-j,-j,j]。可以看出，符号0或者符号1对应的12个调制数据中任意2个相邻的调制数据之间相位差为0或者π，也就是一个符号内的调制数据之间为BPSK调制，同时符号0的12个调制数据中的第m(m＝0,1,2,...,11)个调制数据与符号1的12个调制数据中的第m个调制数据之间相位差为π/2或者-π/2。
针对Pi/4-QPSK，可以使用以下设计B1至设计B3中任一种设计。
设计B1：
当调制数据为Pi/4-QPSK时，对于一个时域符号上传输的调制数据，例如对于时域符号l'上传输的调制数据d l′，该调制数据中包括M个数据，该M个数据中相邻两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者该M个数据中相邻两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4。
d l′的M个数据中第m个数据d l'(m)可以表示为
Figure PCTCN2019103885-appb-000084
其中，m是取值范围为0至M-1的整数；A l',m可以被认为是d l'(m)的幅度，A l',m的值为基于QPSK调制方式得到的输出；
Figure PCTCN2019103885-appb-000085
可以被认为是d l'(m)的相位。在本申请实施例中，基于QPSK调制方式，输入比特和输出(符号)之间的对应关系如表2(a)所示。
需要说明的是，表2(a)中的映射关系只是一种示例，其他可能的映射关系也适用，例如表2(b)、表2(c)、表2(d)或者其它类似的变换。
表2(a)
Figure PCTCN2019103885-appb-000086
表2(b)
Figure PCTCN2019103885-appb-000087
表2(c)
Figure PCTCN2019103885-appb-000088
Figure PCTCN2019103885-appb-000089
表2(d)
Figure PCTCN2019103885-appb-000090
在一种可能的设计中，
Figure PCTCN2019103885-appb-000091
为集合
Figure PCTCN2019103885-appb-000092
中的一个值，d l′的M个数据中相邻两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者d l′的M个数据中相邻两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4。
示例性地，对于时域符号l'上传输的调制数据d l′，
Figure PCTCN2019103885-appb-000093
是根据m确定的。例如
Figure PCTCN2019103885-appb-000094
可以表示为：
Figure PCTCN2019103885-appb-000095
Figure PCTCN2019103885-appb-000096
或者
Figure PCTCN2019103885-appb-000097
示例性地，对于时域符号l'，假设该时域符号上的输入比特流为[0,0,0,1,1,1,1,0,0,1,0,1,0,0,0,1,1,1,1,0,0,1,0,1]，该比特流中共包括24个比特，根据该比特流得到的调制数据d l′的长度为M＝12。对于d l′中第m个数据d l'(m)，
Figure PCTCN2019103885-appb-000098
A l',m是根据输入比特流中第2m个和第2m+1个比特以及表2(a)得到的输出符号，
Figure PCTCN2019103885-appb-000099
则d l′中共包括12个数据，该12个数据可以表示为
Figure PCTCN2019103885-appb-000100
可以看出，符号0对应的12个调制中任意2个相邻的调制数据之间相位差为π/4或者3·π/4或者-3·π/4(即5·π/4)或者-π/4(即7·π/4)。
设计B2：
当图2所示的调制数据为Pi/4-QPSK时，对于两个相邻时域符号上传输的调制数据，例如对于时域符号l'上传输的调制数据d l′和时域符号l'-1上传输的调制数据d l′-1，d l′和d l′-1中各自包括M个数据。对于d l′或d l′-1中的M个数据，该M个数据中相邻两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者该M个数据中相邻两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4。进一步地，d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/4、3·π/4、5·π/4或 7·π/4。
d l′中的数据的表示类似上述设计B1中的描述，这里不再赘述。d l′-1的M个数据中第m个数据d l'-1(m)可以表示为
Figure PCTCN2019103885-appb-000101
其中，m是取值范围为0至M-1的整数；A l'-1,m可以认为是d l'-1(m)的幅度，A l'-1,m的值为基于QPSK调制方式得到的输出；
Figure PCTCN2019103885-appb-000102
可以认为是d l'-1(m)的相位。
在一种可能的设计中，
Figure PCTCN2019103885-appb-000103
为集合
Figure PCTCN2019103885-appb-000104
中的一个值，d l′的M个数据中相邻两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者d l′的M个数据中相邻两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4；
Figure PCTCN2019103885-appb-000105
为集合
Figure PCTCN2019103885-appb-000106
中的一个值，d l′-1的M个数据中相邻两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者d l′-1的M个数据中相邻两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4；d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/4、3·π/4、5·π/4或7·π/4。例如，
Figure PCTCN2019103885-appb-000107
或
Figure PCTCN2019103885-appb-000108
示例性地，对于时域符号l'上传输的调制数据d l′，
Figure PCTCN2019103885-appb-000109
是根据l'和m确定的。例如
Figure PCTCN2019103885-appb-000110
可以表示为：
Figure PCTCN2019103885-appb-000111
Figure PCTCN2019103885-appb-000112
Figure PCTCN2019103885-appb-000113
Figure PCTCN2019103885-appb-000114
或者
Figure PCTCN2019103885-appb-000115
通过该设计，可以满足同一个时域符号的相邻两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者可以满足同一个时域符号的相邻两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4，且相邻时域符号的相同索引的两个数据之间的相位差为π/4、3·π/4、-3·π/4或-π/4，或者相邻时域符号的相同索引的两个数据之间的相位差为π/4、3·π/4、5·π/4或7·π/4。
示例性地，对于时域符号0，假设该时域符号上的输入比特流为[0,0,0,1,1,1,1,0,0,1,0,1,0,0,0,1,1,1,1,0,0,1,0,1]，该比特流中共包括24个比特，根据该比特流得到的调制数据d 0的长度为M＝12；对于时域符号1，假设该时域符号上的输入比特流为[1,0,1,0,1,0,1,0,0,1,1,0,1,0,1,0,1,0,1,0,0,1,1,0]，该比特流中共包括24个比特，根据该比特流得到的调制数据d 1的长度为M＝12。对于d l′中第m个数据d l'(m)，
Figure PCTCN2019103885-appb-000116
A l',m是根据输入比特流中第2m个和第2m+1个比特以及表2(a)得到的输出符号，
Figure PCTCN2019103885-appb-000117
则当l'为0或1时，符号0的调制数据d 0与符号1的调制数据d 1中各自包括12个数据，d 0与d 1可以分别表示为
Figure PCTCN2019103885-appb-000118
Figure PCTCN2019103885-appb-000119
可以看出，符号0对应的12个调制中任意2个相邻的调制数据之间相位差为π/4或者3·π/4 或者-3·π/4(即5·π/4)或者-π/4(即7·π/4)；同时符号1对应的12个调制中任意2个相邻的调制数据之间相位差为π/4、3·π/4、-3·π/4(即5·π/4)、或者-π/4(即7·π/4)；同时符号0的12个调制中的第m(m＝0,1,2,...,11)个调制数据与符号1的12个调制中的第m个调制数据之间相位差为π/4、3·π/4、-3·π/4(即5·π/4)、或者-π/4(即7·π/4)。
设计B3：
当调制数据为Pi/4-BPSK时，对于两个相邻时域符号上传输的调制数据，例如对于时域符号l'上传输的调制数据d l′和时域符号l'-1上传输的调制数据d l′-1，d l′和d l′-1中各自包括M个数据。对于d l′或d l′-1中的M个数据，该M个数据之间的差异为基于QPSK调制方式得到的输出，即该M个数据相邻两个数据之间的相位差为0、π/2、π或者-π/2。进一步地，d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/4、3·π/4、-3·π/4(即5·π/4)、或者-π/4(即7·π/4)。
对于d l′的表示同设计B1中相应的描述，对于d l′-1的表示同设计B2中相应的描述，这里不再赘述。
在一种可能的设计中，
Figure PCTCN2019103885-appb-000120
为集合
Figure PCTCN2019103885-appb-000121
中的一个值，如表2所示，d l′的M个数据中相邻两个数据之间的相位差为0、π/2、π或者-π/2；
Figure PCTCN2019103885-appb-000122
为集合
Figure PCTCN2019103885-appb-000123
中的一个值，如表2所示，d l′-1的M个数据中相邻两个数据之间的相位差为0、π/2、π或者-π/2；d l′中第m个数据d l'(m)和d l′-1中第m个数据d l'-1(m)之间的相位差为π/4、3·π/4、-3·π/4(即5·π/4)、或者-π/4(即7·π/4)。
示例性地，对于时域符号l'上传输的调制数据d l′，
Figure PCTCN2019103885-appb-000124
是根据l'确定的。例如
Figure PCTCN2019103885-appb-000125
可以表示为：
Figure PCTCN2019103885-appb-000126
Figure PCTCN2019103885-appb-000127
或者
Figure PCTCN2019103885-appb-000128
示例性地，对于时域符号0，假设该时域符号上的输入比特流为[0,0,0,1,1,1,1,0,0,1,0,1,0,0,0,1,1,1,1,0,0,1,0,1]，该比特流中共包括24个比特，根据该比特流得到的调制数据d 0的长度为M＝12；对于时域符号1，假设该时域符号上的输入比特流为[1,0,1,0,1,0,1,0,0,1,1,0,1,0,1,0,1,0,1,0,0,1,1,0]，该比特流中共包括24个比特，根据该比特流得到的调制数据d 1的长度为M＝12。对于d l′中第m个数据d l'(m)，
Figure PCTCN2019103885-appb-000129
A l',m是根据输入比特流中第2m个和第2m+1个比特以及表2(a)得到的输出符号，
Figure PCTCN2019103885-appb-000130
则当l'为0或1时，符号0的调制数据d 0与符号1的调制数据d 1中各自包括12个数据，d 0与d 1可以分别表示为
Figure PCTCN2019103885-appb-000131
，[-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1]。可以看出，符号0对应的12个调制中任意2个相邻的调制数据之间相位差为0、π/2、π或者-π/2；同时符号1对应的12个调制中任意2个相邻的调制数据之间相位差为0、π/2、π或者-π/2；同时符号0的12个调制中的第m(m＝0,1,2,...,11)个调制数据与符号1的12个调制 中的第m个调制数据之间相位相差为π/4、3·π/4、-3·π/4(即5·π/4)、或者-π/4(即7·π/4)。
在本申请实施例中所描述的调制方法，例如设计A1、设计A2、设计A3、设计B1、设计B2或设计B3可以不依赖于图2涉及的方法被独立保护。通过该方法，发送端可以对输入比特进行调制，并在相应的的时域符号上将调制后得到的输出发送至接收端。
接下来，以在时域符号l'上传输的调制数据d l′为例，介绍本申请实施例提供的方法中的根据输入调制数据d l′获得第0路至第K-1路调制数据的方法。该方法同样可以应用于其它时域符号，例如时域符号l'-1、l'-2或l'-3。其中，l'为整数。
第0路调制数据即输入调制数据。例如针对在时域符号l'上传输的调制数据d l′，其对应的第0路调制数据即d l′，d l′中包括M个数据，d l′中第m个数据是d l'(m)。其中，m是取值为0至M-1的整数，d l'(m)为复数。
根据d l′可以得到第1路至第K-1路调制数据中第k路调制数据d l′,k，其中，k是取值范围为1至K-1的整数。根据调制数据d l′共可以得到K-1路调制数据。
当调制数据的调制方式为BPSK或Pi/2-BPSK时：
根据调制数据d l′、时域符号l′-1上传输的调制数据d l′-1、以及时域符号l′-2上传输的调制数据d l′-2，可以得到时域符号l'的K-1路调制数据中的第1路调制数据d l′,1，其中，所述K-1大于或等于1；和/或
根据调制数据d l′、时域符号l′-2上传输的调制数据d l′-2、以及时域符号l′-3上传输的调制数据d l′-3，可以得到时域符号l'的K-1路调制数据中的第2路调制数据d l′,2，其中，K-1大于或等于2；和/或
根据调制数据d l′、时域符号l′-1上传输的调制数据d l′-1、以及时域符号l′-3上传输的调制数据d l′-3，可以得到时域符号l'的K-1路调制数据中的第3路调制数据d l′,3，其中，所述K-1大于或等于3。
可选地，当调制数据的调制方式为BPSK或Pi/2-BPSK时：
根据调制数据d l′中的第m个数据、时域符号l′-1上传输的调制数据d l′-1中的第m个数据、以及时域符号l′-2上传输的调制数据d l′-2中的第m个数据，可以得到时域符号l'的K-1路调制数据中的第1路调制数据d l′,1中的第m个数据，其中，所述K-1大于或等于1；和/或
根据调制数据d l′中的第m个数据、时域符号l′-2上传输的调制数据d l′-2中的第m个数据、以及时域符号l′-3上传输的调制数据d l′-3中的第m个数据，可以得到时域符号l'的K-1路调制数据中的第2路调制数据d l′,2中的第m个数据，其中，K-1大于或等于2；和/或
根据调制数据d l′中的第m个数据、时域符号l′-1上传输的调制数据d l′-1中的第m个数据、以及时域符号l′-3上传输的调制数据d l′-3中的第m个数据，可以得到时域符 号l'的K-1路调制数据中的第3路调制数据d l′,3中的第m个数据，其中，所述K-1大于或等于3；
其中，m是取值范围为0至M-1的整数。
示例性地，以K＝4为例，时域符号l'的4路调制数据可以是：
d l',0(m)＝d l'(m)，其中，d l'(m)为时域符号l'上传输的调制数据d l'中的第m个数据，d l',0(m)为第0路调制数据d l',0中的第m个数据，d l',0的长度为M；
d l',1(m)＝-d l'(m)×d l'-1(m)/d l'-2(m)，其中，d l',1(m)为时域符号l'的第1路调制数据d l',1中的第m个数据，d l'-1(m)为时域符号l'-1上传输的调制数据d l'-1中第m个数据，d l'-2(m)为时域符号l'-2上传输的调制数据d l'-2中第m个数据，d l',1、d l'-1和d l'-2的长度为M；
d l',2(m)＝-d l'(m)×d l'-2(m)/d l'-3(m)，其中，d l',2(m)为时域符号l'的第2路调制数据d l',2中的第m个数据，d l'-3(m)为时域符号l'-3上传输的调制数据d l'-3中第m个数据，d l',2和d l'-3的长度为M；
d l',3(m)＝-d l'(m)×d l'-1(m)/d l'-3(m)，其中，d l',3(m)为时域符号l'的第3路调制数据d l',3中的第m个数据，d l',3的长度为M。
在本申请实施例中，对于一个时域符号l'，该时域符号上传输的调制数据还可以称为该时域符号上的输入调制数据，或该时域符号上输入的调制数据。
再示例性地，以K＝4为例，时域符号l'的4路调制数据还可以是：
d l',0(m)＝d l'(m)；
d l',1(m)＝d l'(m)×d l'-2(m)/d l'-1(m)；
d l',2(m)＝d l'(m)×d l'-3(m)/d l'-2(m)；
d l',3(m)＝d l'(m)×d l'-3(m)/d l'-1(m)。
当l'为0时，为了得到第0个时域符号的各路调制数据，可以初始化d l'-1、d l'-2和d l'-3的值。例如，调制数据的长度为1，调制方式为Pi/2-BPSK，第0个时域符号上传输的调制数据d 0＝1，d l'-1、d l'-2和d l'-3的初始化值分别为-j,1,j，则根据d 0得到的第0个时域符号的4路调制数据为：d 0,0＝1，d 0,1＝j，d 0,2＝j，d 0,3＝-1。
当调制数据的调制方式为QPSK或者Pi/4-QPSK时：根据调制数据d l′以及时域符号l′-1上传输的调制数据d l′-1，可以得到K-1路调制数据中的第1路调制数据；其中，K-1为大于或等于1的整数。
可选地，当调制数据的调制方式为QPSK或者Pi/4-QPSK时：根据调制数据d l′中的第m个数据以及时域符号l′-1上传输的调制数据d l′-1中的第m个数据，可以得到K-1路调制数据中的第1路调制数据中的第m个数据；其中，K-1为大于或等于1的整数，m是取值范围为0至M-1的整数。
示例性地，以K＝3为例，当调制数据的调制方式为QPSK或者Pi/4-QPSK时，时域符号l'的3路调制数据可以是：
d l',0(m)＝d l'(m)，其中，d l'(m)为时域符号l'上传输的调制数据d l'中的第m个数据，d l',0(m)为第0路调制数据d l',0中的第m个数据，d l',0的长度为M；
d l',1(m)＝d l'(m)·β l',1(m)，其中，d l',1(m)为第1路调制数据d l',1中的第m个数据；
d l',2(m)＝d l'(m)·β l',2(m)，其中，d l',2(m)为第1路调制数据d l',2中的第m个数据。
其中，对于β l',1(m)和β l',2(m)的介绍如表3中所示，其中，d l'-1(m)为时域符号l'-1上传输的调制数据d l'-1中第m个数据。
表3
Figure PCTCN2019103885-appb-000132
或者，β l',1(m)和β l',2(m)可以表示为：
Figure PCTCN2019103885-appb-000133
Figure PCTCN2019103885-appb-000134
其中，(d l'(m)/d l'-1(m))*是d l'(m)/d l'-1(m)的共轭。
对于该K＝3的示例，当第1路处理流程中和第2路处理流程中的第二滤波器系数比较接近时，可以将第一路调制数据和第2路调制数据合并为1路，并在1路处理流程中进行处理，使用相同的第二滤波器系数进行处理。此时，该K＝3的示例可以转化为K＝2的示例，该示例中，时域符号l'的2路调制数据可以是：
d l',0(m)＝d l'(m)；
d l',1(m)＝d l'(m)×(β l',1(m)+β l',2(m))，或者
Figure PCTCN2019103885-appb-000135
其中，||表示取模运算。
本申请实施例提供的方法中的傅里叶变换，或者补零和傅里叶变换
在一种可能的实现中，如图10(a)至图10(d)所示，对于时域符号l'，可以对第k路调制数据d l',k进行M点傅里叶变换，得到长度为M的频域数据
Figure PCTCN2019103885-appb-000136
其中，d l',k的长度为M。
在本申请实施例中，傅里叶变换可以是离散傅里叶变换(discrete fourier transform，DFT)或者快速傅里叶变换(fast fourier transform，FFT)，还可以是其它傅里叶变换形式，本申请不做限制。
示例性地，
Figure PCTCN2019103885-appb-000137
其中，
Figure PCTCN2019103885-appb-000138
是用于调整经过傅里叶变换得到的输出数据的功率的系数，
Figure PCTCN2019103885-appb-000139
为实数，例如
Figure PCTCN2019103885-appb-000140
为
Figure PCTCN2019103885-appb-000141
中第p个数据，d l',k(m)为d l',k中第m个数据。
在另一种可能的实现中，如图10(e)至图10(h)所示，对于时域符号l'，可以对第k路调制数据d l',k进行补零，得到长度为M padzero的数据
Figure PCTCN2019103885-appb-000142
并对
Figure PCTCN2019103885-appb-000143
进行M padzero点傅里叶变换，得到长度为M padzero的频域数据
Figure PCTCN2019103885-appb-000144
其中，M padzero为大于M的 整数，M为d l',k的长度。
示例性地，
Figure PCTCN2019103885-appb-000145
其中，
Figure PCTCN2019103885-appb-000146
是用于调整输出数据功率的系数，
Figure PCTCN2019103885-appb-000147
为实数，例如
Figure PCTCN2019103885-appb-000148
Figure PCTCN2019103885-appb-000149
是
Figure PCTCN2019103885-appb-000150
中第r个数据，r是取值为0至M padzero-1的整数。
对第k路调制数据d l',k进行补零，得到长度为M padzero的数据
Figure PCTCN2019103885-appb-000151
时，可以在调制数据d l',k的起始数据前添加M 0,head个0，得到长度为M padzero的数据
Figure PCTCN2019103885-appb-000152
其中，M 0,head为大于或等于1的整数。即，对于
Figure PCTCN2019103885-appb-000153
中第r个数据
Figure PCTCN2019103885-appb-000154
Figure PCTCN2019103885-appb-000155
对第k路调制数据d l',k进行补零，得到长度为M padzero的数据
Figure PCTCN2019103885-appb-000156
时，也可以在调制数据d l',k的末尾数据后添加M 0,tail个0，得到长度为M padzero的数据
Figure PCTCN2019103885-appb-000157
其中，M 0,tail为大于或等于1的整数。即，对于
Figure PCTCN2019103885-appb-000158
中第r个数据
Figure PCTCN2019103885-appb-000159
Figure PCTCN2019103885-appb-000160
对第k路调制数据d l',k进行补零，得到长度为M padzero的数据
Figure PCTCN2019103885-appb-000161
时，还可以在调制数据d l',k的起始数据前添加M 0,head个0，在所述调制数据d l',k的末尾数据后添加M 0,tail个0，其中，M 0,head和M 0,tail为大于或等于1的整数。即，对于
Figure PCTCN2019103885-appb-000162
中第r个数据
Figure PCTCN2019103885-appb-000163
Figure PCTCN2019103885-appb-000164
本申请实施例提供的方法中的循环扩展
可选地，如图10(b)、10(d)、10(f)和10(h)所示，可以对傅里叶变换后得到的频域数据
Figure PCTCN2019103885-appb-000165
进行循环扩展，得到长度为Q的扩展数据
Figure PCTCN2019103885-appb-000166
其中，Q大于或等于
Figure PCTCN2019103885-appb-000167
的长度。示例性地，如上述对于傅里叶变换，或者补零和傅里叶变换的描述，如图10(b)和图10(d)所示的方法中，
Figure PCTCN2019103885-appb-000168
的长度为M；如图10(f)和图10(h)所示的方法中，
Figure PCTCN2019103885-appb-000169
的长度为M padzero。本申请实施例中，为了便于描述，可以将
Figure PCTCN2019103885-appb-000170
的长度统一记为M length，M length为M或M padzero。
对于通过循环扩展得到的长度为Q的扩展数据
Figure PCTCN2019103885-appb-000171
中第q个数据
Figure PCTCN2019103885-appb-000172
可以表示为：
Figure PCTCN2019103885-appb-000173
或者
Figure PCTCN2019103885-appb-000174
其中，Q offset为偏移值，Q offset为正整数。Q offset的值可以是预配置的，Q offset的值也可 以是由网络设备通过信令通知UE的。
本申请实施例提供的方法中的第一滤波和傅里叶反变换
在一种可能的实现中，如图10(a)、10(b)、10(e)和10(f)所示，对于时域符号l'的第k路处理，可以第一对待处理数据先进行第一滤波，再进行傅里叶反变换。其中，第一待处理数据可以是傅里叶变换后得到的频域数据
Figure PCTCN2019103885-appb-000175
如图10(a)和10(e)所示；第一待处理数据也可以是循环扩展后得到的扩展数据
Figure PCTCN2019103885-appb-000176
如图10(b)和10(f)所示。其中，第一滤波为频域滤波，第一滤波对应的滤波器为频域滤波器。此时，第一滤波还可以称为第一频域滤波，第一滤波器的系数可以称为第一滤波器系数或者第一滤波系数。
当第一待处理数据是循环扩展后得到的扩展数据
Figure PCTCN2019103885-appb-000177
时，对
Figure PCTCN2019103885-appb-000178
进行第一滤波，得到长度为Q的第一滤波数据
Figure PCTCN2019103885-appb-000179
对
Figure PCTCN2019103885-appb-000180
进行傅里叶反变换，得到长度为N的输出数据
Figure PCTCN2019103885-appb-000181
对
Figure PCTCN2019103885-appb-000182
进行第一滤波时，
Figure PCTCN2019103885-appb-000183
中第q个数据
Figure PCTCN2019103885-appb-000184
等于
Figure PCTCN2019103885-appb-000185
其中，
Figure PCTCN2019103885-appb-000186
为
Figure PCTCN2019103885-appb-000187
中第q个数据，C filter1(q)为第一滤波器系数C filter1中的第q个系数，q＝0,1,2,...,Q-1。
在本申请实施例中，第一滤波器为频域滤波器时，其可以是升余弦(root raised cosine，RRC)滤波器、跟升余弦(square root raised cosine，SRRC)滤波器、或者其它频域滤波器，本申请不做限制。当第一滤波器为RRC滤波器或者SRRC滤波器时，滚降因子(Roll-off factor)β的值可以是预配置的，或者是网络设备通过信令通知终端设备的。例如，滚降因子的值可以预配置为1，或者β＝Q/M-1。
对
Figure PCTCN2019103885-appb-000188
进行傅里叶反变换，可以得到长度为N的时域数据
Figure PCTCN2019103885-appb-000189
中第n个数据
Figure PCTCN2019103885-appb-000190
其中，n＝0,1,2,...,N-1，
Figure PCTCN2019103885-appb-000191
可以认为是傅里叶反变换调整输出数据功率的系数，
Figure PCTCN2019103885-appb-000192
为实数。q re,offset为偏移因子，q re,offset的值可以是预配置的，q re,offset的值也可以是由网络设备通过信令通知UE的。例如
Figure PCTCN2019103885-appb-000193
为滤波数据
Figure PCTCN2019103885-appb-000194
中的数据映射至频域资源的起始位置的索引，
Figure PCTCN2019103885-appb-000195
为滤波数据
Figure PCTCN2019103885-appb-000196
中的数据映射至频域资源的结束位置的索引，
Figure PCTCN2019103885-appb-000197
例如，
Figure PCTCN2019103885-appb-000198
其中，频域资源的起始位置的索引和结束位置的索引可以分别是分配带宽对应的子载波起始位置和结束位置，其中，分配带宽中的资源，例如子载波，用于发送所生成的发送数据。例如，分配带宽中包括48个子载波时，也就是Q＝48，
Figure PCTCN2019103885-appb-000199
假设傅里叶反变换的长度N为2048，也就是说最多有2048个子载波可以映射数据，这2048个子载波对应的索引可以表示为0,1,2,…,2047。则由
Figure PCTCN2019103885-appb-000200
和
Figure PCTCN2019103885-appb-000201
指示的Q个子载波的索引可以表示为：
Figure PCTCN2019103885-appb-000202
需要说明的是，在本申请实施例中，进行傅里叶反变换既可以是进行离散傅里叶反变换，也可以是进行连续傅里叶反变换和采样。示例性地，上述傅里叶反变换公式 为离散的表示形式。可选地，可以采用连续的表示形式来描述傅里叶反变换公式。示例性的，傅里叶反变换的连续表达式(即
Figure PCTCN2019103885-appb-000203
的连续形式
Figure PCTCN2019103885-appb-000204
)可以表示为：
Figure PCTCN2019103885-appb-000205
其中
Figure PCTCN2019103885-appb-000206
为
Figure PCTCN2019103885-appb-000207
中第t个时刻的数据，t start≤t＜t end，t start、t和t end为实数，例如：t start＝0，t end＝N·T s。Δf为子载波间隔，例如Δf＝1/(N·T s)。t offset为时延偏移，t offset的值可以是预配置的，例如t offset＝0；t offset的值也可以是由网络设备通过信令通知UE的。本申请实施例中，T s为时间单位因子，可以是预配置的，也可以是网络设备通过信令通知UE的。可选地，T s可以为离散数据中相邻两个离散数据之间的时间间隔，其中，该离散数据为对
Figure PCTCN2019103885-appb-000208
进行离散采样得到的离散数据。示例性地，子载波间隔Δf为15kHz，N为2048时，T s＝1/(30.72×10 6)。
示例性地，当t start＝0，t end＝N·T s，t offset＝0，Δf＝1/(N·T s)时，以
Figure PCTCN2019103885-appb-000209
对t进行离散采样，则上述傅里叶反变换的连续表达式经过离散采样后，可以得到离散的表示形式：
Figure PCTCN2019103885-appb-000210
该离散采样的结果
Figure PCTCN2019103885-appb-000211
与前文描述的傅里叶变换的离散形式的输出
Figure PCTCN2019103885-appb-000212
是相同的。
当第一待处理数据是傅里叶变换后得到的频域数据
Figure PCTCN2019103885-appb-000213
时，对
Figure PCTCN2019103885-appb-000214
进行第一滤波，得到长度为M length的第一滤波数据
Figure PCTCN2019103885-appb-000215
对
Figure PCTCN2019103885-appb-000216
进行傅里叶反变换，得到长度为N的输出数据
Figure PCTCN2019103885-appb-000217
当频域数据
Figure PCTCN2019103885-appb-000218
为上述本申请实施例中描述的长度为M的频域数据
Figure PCTCN2019103885-appb-000219
时，M length等于M。当频域数据
Figure PCTCN2019103885-appb-000220
为上述本申请实施例中描述的长度为M padzero的频域数据
Figure PCTCN2019103885-appb-000221
时，M length等于M padzero。
对
Figure PCTCN2019103885-appb-000222
进行第一滤波时，
Figure PCTCN2019103885-appb-000223
中第m′个数据
Figure PCTCN2019103885-appb-000224
等于
Figure PCTCN2019103885-appb-000225
其中，
Figure PCTCN2019103885-appb-000226
为
Figure PCTCN2019103885-appb-000227
中第m′个数据，C filter1(m′)为第一滤波器系数C filter1中的第m′个系数，m′＝0,1,2,...,M length-1。
对
Figure PCTCN2019103885-appb-000228
进行傅里叶反变换后，可以得到长度为N的时域数据
Figure PCTCN2019103885-appb-000229
中第n个数据
Figure PCTCN2019103885-appb-000230
其中，n＝0,1,...,N-1。
Figure PCTCN2019103885-appb-000231
可以认为是傅里叶反变换调整输出数据功率的系数，
Figure PCTCN2019103885-appb-000232
为实数。例如
Figure PCTCN2019103885-appb-000233
m′ re,offset为偏移因子，m′ re,offset为实数，例如m′ re,offset等于0。m′ re,offset的值可以是预配置的，m′ re,offset的值也可以是由网络设备通过信令通知UE的。
Figure PCTCN2019103885-appb-000234
为滤波数据
Figure PCTCN2019103885-appb-000235
中的数据映射至频域资源的起始位置的索引，
Figure PCTCN2019103885-appb-000236
为滤波数据
Figure PCTCN2019103885-appb-000237
中的数据映射至频域资源的结束位置的索引，
Figure PCTCN2019103885-appb-000238
和
Figure PCTCN2019103885-appb-000239
为整数，
Figure PCTCN2019103885-appb-000240
例如，
Figure PCTCN2019103885-appb-000241
上述描述了对
Figure PCTCN2019103885-appb-000242
进行离散傅里叶反变换的结果。类似前文介绍，也可以对
Figure PCTCN2019103885-appb-000243
进行连续傅里叶反变换和采样，得到
Figure PCTCN2019103885-appb-000244
中的离散值
Figure PCTCN2019103885-appb-000245
这里不再赘述。
在一种可能的实现中，如图10(c)、10(d)、10(g)和10(h)所示，也可以对待处理数据先进行傅里叶反变换，再进行第一滤波。其中，待处理数据可以是傅里叶变换后得到的频域数据
Figure PCTCN2019103885-appb-000246
如图10(c)和10(g)；待处理数据也可以是循环扩展后得到的扩展数据
Figure PCTCN2019103885-appb-000247
如图10(d)和10(h)所示。其中，第一滤波为时域滤波，第一滤波对应的滤波器为时域滤波器。此时，第一滤波还可以称为第一时域滤波，第一滤波器的系数可以称为第一滤波器系数或者第一滤波系数。
当第一待处理数据是循环扩展后得到的扩展数据
Figure PCTCN2019103885-appb-000248
时，对
Figure PCTCN2019103885-appb-000249
进行傅里叶反变换，得到长度为N的时域数据
Figure PCTCN2019103885-appb-000250
对
Figure PCTCN2019103885-appb-000251
进行滤波，得到长度为N的第一滤波数据
Figure PCTCN2019103885-appb-000252
Figure PCTCN2019103885-appb-000253
中第n个数据
Figure PCTCN2019103885-appb-000254
其中，n＝0,1,...,N-1。
Figure PCTCN2019103885-appb-000255
是傅里叶反变换调整输出数据功率的系数，
Figure PCTCN2019103885-appb-000256
为实数。例如
Figure PCTCN2019103885-appb-000257
为扩展数据
Figure PCTCN2019103885-appb-000258
中的数据映射至频域资源的起始位置的索引，
Figure PCTCN2019103885-appb-000259
为扩展数据
Figure PCTCN2019103885-appb-000260
中的数据映射至频域资源的结束位置的索引，
Figure PCTCN2019103885-appb-000261
和
Figure PCTCN2019103885-appb-000262
为整数，
Figure PCTCN2019103885-appb-000263
例如，
Figure PCTCN2019103885-appb-000264
上述描述了对
Figure PCTCN2019103885-appb-000265
进行离散傅里叶反变换的结果。也可以对
Figure PCTCN2019103885-appb-000266
进行连续傅里叶反变换和采样，得到
Figure PCTCN2019103885-appb-000267
中的离散值
Figure PCTCN2019103885-appb-000268
这里不再赘述。
在本申请实施例中，第一滤波器为时域滤波器时，其可以是RRC滤波器、SRRC滤波器、或者其它时域滤波器，本申请不做限制。当第一时域滤波器为RRC滤波器或者SRRC滤波器时，滚降因子(Roll-off factor)β的值可以是预配置的，或者是网络设备通过信令通知终端设备的。
对
Figure PCTCN2019103885-appb-000269
进行第一时域滤波，可以得到长度为N的第一滤波数据
Figure PCTCN2019103885-appb-000270
例如，将
Figure PCTCN2019103885-appb-000271
和第一滤波器系数
Figure PCTCN2019103885-appb-000272
进行循环卷积(circular convolution)，可以得到
Figure PCTCN2019103885-appb-000273
示例性地，
Figure PCTCN2019103885-appb-000274
中第n个数据表示为：
Figure PCTCN2019103885-appb-000275
其中，n＝0,1,...,N-1，Q time为大于或等于1的整数，C timefilter1(q time)是C timefilter1中第q time个滤波系数，且Q time≤N。
当第一待处理数据是傅里叶变换后得到的频域数据
Figure PCTCN2019103885-appb-000276
时，对
Figure PCTCN2019103885-appb-000277
进行傅里叶反变 换，得到长度为N的时域数据
Figure PCTCN2019103885-appb-000278
对
Figure PCTCN2019103885-appb-000279
进行滤波，得到长度为N的第一滤波数据
Figure PCTCN2019103885-appb-000280
Figure PCTCN2019103885-appb-000281
中第n个数据
Figure PCTCN2019103885-appb-000282
其中，n＝0,1,...,N-1。
Figure PCTCN2019103885-appb-000283
是傅里叶反变换调整输出数据功率的系数，
Figure PCTCN2019103885-appb-000284
为实数。例如
Figure PCTCN2019103885-appb-000285
为频域数据
Figure PCTCN2019103885-appb-000286
中的数据映射至频域资源的起始位置的索引，
Figure PCTCN2019103885-appb-000287
为频域数据
Figure PCTCN2019103885-appb-000288
中的数据映射至频域资源的结束位置的索引，
Figure PCTCN2019103885-appb-000289
和
Figure PCTCN2019103885-appb-000290
为整数，
Figure PCTCN2019103885-appb-000291
例如，
Figure PCTCN2019103885-appb-000292
其中，M length为
Figure PCTCN2019103885-appb-000293
的长度。当频域数据
Figure PCTCN2019103885-appb-000294
为上述本申请实施例中描述的长度为M的频域数据
Figure PCTCN2019103885-appb-000295
时，M length等于M。当频域数据
Figure PCTCN2019103885-appb-000296
为上述本申请实施例中描述的长度为M padzero的频域数据
Figure PCTCN2019103885-appb-000297
时，M length等于M padzero。
上述描述了对
Figure PCTCN2019103885-appb-000298
进行离散傅里叶反变换的结果。也可以对
Figure PCTCN2019103885-appb-000299
进行连续傅里叶反变换和采样，得到
Figure PCTCN2019103885-appb-000300
中的离散值
Figure PCTCN2019103885-appb-000301
这里不再赘述。
对
Figure PCTCN2019103885-appb-000302
进行第一时域滤波，可以得到长度为N的第一滤波数据
Figure PCTCN2019103885-appb-000303
例如，将
Figure PCTCN2019103885-appb-000304
和第一滤波器系数C timefilter1进行循环卷积，可以得到
Figure PCTCN2019103885-appb-000305
则，
Figure PCTCN2019103885-appb-000306
中第n个数据
Figure PCTCN2019103885-appb-000307
其中，n＝0,1,...,N-1，Q time为大于或等于1的整数，C timefilter1(q time)是C timefilter1中第q time个滤波系数，且Q time≤N。
本申请实施例提供的方法中的第二滤波
如图2以及图10(c)、10(d)、10(g)和10(h)所示，对于第k路处理，可以基于经过第一滤波的数据进行第二滤波，得到时域符号l的第k路输出数据s l,k。其中，该经过第一滤波的数据可以是上述长度为N的第一滤波数据
Figure PCTCN2019103885-appb-000308
或者，如图2以及图10(a)、10(b)、10(e)和10(f)所示，对于第k路处理，可以基于经过傅里叶反变换的数据进行第二滤波，得到时域符号l的第k路输出数据s l,k，s l,k的长度为N。其中，该经过傅里叶反变换的数据可以是上述长度为N的时域数据
Figure PCTCN2019103885-appb-000309
在本申请实施例中，根据
Figure PCTCN2019103885-appb-000310
和
Figure PCTCN2019103885-appb-000311
进行第二滤波的方法是相同的，其区别在于进行第二滤波时使用的是
Figure PCTCN2019103885-appb-000312
还是
Figure PCTCN2019103885-appb-000313
为了简化描述，本申请实施例中描述第二滤波时，以
Figure PCTCN2019103885-appb-000314
为例进行描述。
如上述对图4所示的第二滤波过程的介绍，可以通过第k路第二滤波器的滤波系数C k得到时域符号l的第k路输出数据s l,k。C k的长度可以为L k×N-1，其中，L k为正整数。
在一种可能的实现C1中，对于第二滤波器，第1路第二滤波器系数C 1中的第i个值C 1(i)是根据第0路第二滤波器系数C 0中的第i个值C 0(i)、第0路第二滤波器系数C 0 中的第i+2N个值C 0(i+2N)、以及第0路第二滤波器系数C 0中的第i+N个值C 0(i+N)确定的。该方法应用于图2涉及的方法时，可以适用于K≥2的场景。
在一种可能的实现C2中，对于第二滤波器，第2路第二滤波器系数C 2中的第i个值C 2(i)是根据第0路第二滤波器系数C 0中的第i个值C 0(i)、第0路第二滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及第0路第二滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的。该方法应用于图2涉及的方法时，可以适用于K≥3的场景。
在一种可能的实现C3中，对于第二滤波器，第3路第二滤波器系数C 3中的第i个值C 3(i)是根据第0路第二滤波器系数C 0中的第i个值C 0(i)、第0路第二滤波器系数C 0中的第i+N个值C 0(i+N)、以及第0路第二滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的。该方法应用于图2涉及的方法时，可以适用于K≥4的场景。
上述可能的实现C1、C2和C3还可以进行结合。例如上述可能的实现C1和C2结合使用，上述可能的实现C1和C3结合使用，上述可能的实现C2和C3结合使用，或者上述可能的实现C1、C2和C3结合使用，本申请不做限制。上述可能的实现C1、C2和C3可以应用于各种场景，尤其可以应用于调制方式是BPSK或Pi/2-BPSK的场景。
示例性地，当图2涉及的方法中的K＝4时，第1路第二滤波器系数C 1中的第i个值C 1(i)可以表示为：
Figure PCTCN2019103885-appb-000315
第2路第二滤波器系数C 2中的第i个值C 2(i)可以表示为：
Figure PCTCN2019103885-appb-000316
第3路第二滤波器系数C 3中的第i个值C 3(i)可以表示为：
Figure PCTCN2019103885-appb-000317
其中，可选地，C 0的长度为L 0×N，C 1(n)的长度为(L 0-1)×N，C 2(n)的长度为(L 0-2)×N，C 3(n)的长度为(L 0-2)×N。其中，L 0为正整数。
上述可能的实现C1、C2和C3中，滤波器系数也可以采用连续的表示方式来表示。采用连续的表示方式时，将索引i替换为时刻t，将长度N替换为时间长度T。
示例性地，考虑连续的表示方式，当图2涉及的方法中的K＝4时，第1路第二滤波器系数C 1中的第t个时刻的值C 1(t)可以表示为：
Figure PCTCN2019103885-appb-000318
第2路第二滤波器系数C 2中的第t个时刻的值C 2(t)可以表示为：
Figure PCTCN2019103885-appb-000319
第3路第二滤波器系数C 3中的第t个时刻的值C 3(t)可以表示为：
Figure PCTCN2019103885-appb-000320
其中，可选地，C 0(t)的长度为L 0×T，C 1(t)的长度为(L 0-1)×T，C 2(t)的长度为(L 0-2)×T，C 3(t)的长度为(L 0-2)×T。此时，相对C1、C2和C3的离散表示，索引i由t进行替换，长度N由T替换，其中，t为实数，T为T＝N×T s。
考虑离散形式，C 0可以为根据Laurent分解的主部分(main component)得到的滤波系数，其中，主部分还可以称为主滤波器。C 0的长度L 0×N可以表示为(L+1)×N，即L 0＝L+1，其中L为整数。对于C 0中第i个值C 0(i)
Figure PCTCN2019103885-appb-000321
Figure PCTCN2019103885-appb-000322
Figure PCTCN2019103885-appb-000323
其中，h为实数，例如h＝1/2。g(i)可以是线性响应、高斯响应或其它响应，本申请不做限制。例如g(i)是方窗响应(rectangular Pulse)时，g(i)可以表示为：
Figure PCTCN2019103885-appb-000324
其中C 0(i)和g(i)为离散的表示形式。还可以对C 0(i)和g(i)对应的连续形式进行采样，得到C 0(i)和g(i)的离散表示形式。
C 0(i)的连续表示形式为
Figure PCTCN2019103885-appb-000325
Figure PCTCN2019103885-appb-000326
Figure PCTCN2019103885-appb-000327
g(i)的连续表示形式为：
Figure PCTCN2019103885-appb-000328
其中，T＝N×T s。可以得到，以
Figure PCTCN2019103885-appb-000329
对C 0(t)和g(t)进行离散采样时，得到的结果与C 0(i)和g(i)是一致的。
在一种可能的实现D1中，对于第二滤波器，第0路第二滤波器系数C 0中的第i个值C 0(i)是根据第0个基滤波器
Figure PCTCN2019103885-appb-000330
中的第i个值
Figure PCTCN2019103885-appb-000331
以及第1个基滤波器
Figure PCTCN2019103885-appb-000332
中的第i个值
Figure PCTCN2019103885-appb-000333
确定的。该方法应用于图2涉及的方法时，可以适用于K≥1的场景。
在一种可能的实现D2中，对于第二滤波器，第1路第二滤波器系数C 1中的第i个值C 1(i)是根据第0个基滤波器
Figure PCTCN2019103885-appb-000334
中的第i+N个值
Figure PCTCN2019103885-appb-000335
以及第1个基滤波器
Figure PCTCN2019103885-appb-000336
中的第i个值
Figure PCTCN2019103885-appb-000337
确定的。该方法应用于图2涉及的方法时，可以适用于K≥2的 场景。
在一种可能的实现D3中，对于第二滤波器，第2路第二滤波器系数C 2中的第i个值C 2(i)是根据第0个基滤波器
Figure PCTCN2019103885-appb-000338
中的第i个值
Figure PCTCN2019103885-appb-000339
以及第1个基滤波器
Figure PCTCN2019103885-appb-000340
中的第i+N个值
Figure PCTCN2019103885-appb-000341
确定的。该方法应用于图2涉及的方法时，可以适用于K≥3的场景。
上述可能的实现D1、D2和D3还可以进行结合。例如上述可能的实现D1和D2结合使用，上述可能的实现D1和D3结合使用，或者上述可能的实现D1、D2和D3结合使用，本申请不做限制。上述可能的实现D1、D2和D3可以应用于各种场景，尤其可以应用于调制方式是QPSK或Pi/4-QPSK的场景。
示例性地，当图2涉及的方法中的K＝3时，考虑离散表达形式：第0路第二滤波器系数C 0中的第i个值C 0(i)可以表示为：
Figure PCTCN2019103885-appb-000342
第1路第二滤波器系数C 1中的第i个值C 1(i)可以表示为：
Figure PCTCN2019103885-appb-000343
第2路第二滤波器系数C 2中的第i个值C 2(i)可以表示为：
Figure PCTCN2019103885-appb-000344
其中，可选地，C 0(i)的长度为L 0×N，C 1(i)的长度为(L 0-1)×N，C 2(i)的长度为(L 0-1)×N，L 0为正整数。
第0个基滤波器
Figure PCTCN2019103885-appb-000345
和第1个基滤波器
Figure PCTCN2019103885-appb-000346
可以为Umberto Mengali分解的主部分(main component)，其中，主部分还可以称为主滤波器。第0个基滤波器
Figure PCTCN2019103885-appb-000347
和第1个基滤波器
Figure PCTCN2019103885-appb-000348
离散化的表达式如下：
Figure PCTCN2019103885-appb-000349
Figure PCTCN2019103885-appb-000350
Figure PCTCN2019103885-appb-000351
其中，p＝0,1，h (p)＝2 p·h，h＝1/4。
上述可能的实现D1、D1和D2中，滤波器系数也可以采用连续的表示方式来表示。采用连续的表示方式时，索引i替换为时刻t，长度N替换为时间长度T。
示例性地，第0个基滤波器
Figure PCTCN2019103885-appb-000352
和第1个基滤波器
Figure PCTCN2019103885-appb-000353
的连续表达形式为：
Figure PCTCN2019103885-appb-000354
Figure PCTCN2019103885-appb-000355
Figure PCTCN2019103885-appb-000356
其中，t与T的确定与前面C1、C2和C3中的相应的内容相同，这里不再赘述。
考虑连续表达形式，示例性地：第0路第二滤波器系数C 0中的第t个值C 0(t)可以表示为：
Figure PCTCN2019103885-appb-000357
第1路第二滤波器系数C 1中的第t个值C 1(t)可以表示为：
Figure PCTCN2019103885-appb-000358
第2路第二滤波器系数C 2中的第t个值C 2(t)可以表示为：
Figure PCTCN2019103885-appb-000359
其中，可选地，C 0(t)的长度为L 0×T，C 1(t)的长度为(L 0-1)×T，C 2(t)的长度为(L 0-1)×T。此时，相对D0、D1和D2中的离散表示，索引i由t进行替换，长度N由T替换。
如前文所述，对于QPSK或者Pi/4-QPSK调制，当第1路第二滤波器系数与第2路第二滤波器系数比较接近，可以将第1路调制数据与第2路调制数据进行相加合并，于是K＝3路数据变成K＝2路数据。示例性的，如图11所示，图中A对应的曲线为第0路第二滤波器系数C 0的幅度，B对应的曲线为第1路第二滤波器系数C 1的幅度，C对应的曲线为第2路第二滤波器系数C 2的幅度。从图11中可以看出，第1路第二滤波器系数C 1与第2路第二滤波器系数C 2比较接近。
考虑第1路第二滤波器系数与第2路第二滤波器系数近似认为是一个滤波器，则有：
在一种可能的实现E1中，对于第二滤波器，第1路第二滤波器系数C 1中的第i个值C 1(i)是根据第0路第二滤波器系数C 0中的第i个值C 0(i)以及第0路第二滤波器系数C 0中的第i+N个值C 0(i+N)确定的。该方法应用于图2涉及的方法时，可以适用于K≥2的场景。
上述可能的实现E1中，滤波器系数也可以采用连续的表示方式来表示。采用连续的表示方式时，索引i替换为时刻t，长度N替换为时间长度T，其中，t与T的确定与前面C1、C2和C3中的相应的内容相同，这里不再赘述。
示例性地，当图2涉及的方法中的K＝2时，考虑离散表达形式：第1路第二滤波器系数C 1中的第i个值C 1(i)可以表示为：
Figure PCTCN2019103885-appb-000360
考虑连续表达形式：第1路第二滤波器系数C 1中的第t个值C 1(t)可以表示为：
Figure PCTCN2019103885-appb-000361
对于实现E1，第0路第二滤波器系数可以同实现D1中相应的介绍，也可以采用其他的滤波器设计，这里不再赘述。
为了实现本申请实施例提供的方法中的各功能，发送端，例如基站或UE，可以包 括硬件结构和/或软件模块，以硬件结构、软件模块、或硬件结构加软件模块的形式来实现上述各功能。上述各功能中的某个功能以硬件结构、软件模块、还是硬件结构加软件模块的方式来执行，取决于技术方案的特定应用和设计约束条件。
图12是本申请实施例提供的装置1200的结构示意图。其中，装置1200可以是UE或基站，能够实现本申请实施例提供的数据发送方法；装置1200也可以是能够支持UE或基站实现本申请实施例提供的数据发送方法的装置。装置1200可以是硬件结构、软件模块、或硬件结构加软件模块。装置1200可以由芯片系统实现。
在一种可能的实现中，装置1200中包括第一预处理模块1202、第二滤波模块1204和通信模块1208。第二滤波模块1204分别和第一预处理模块1202以及通信模块1208耦合。
在一种可能的实现中，装置1200中包括第一预处理模块1202、第二滤波模块1204、合并模块1206和通信模块1208。第二滤波模块1204可以和第一预处理模块1202以及合并模块1206耦合，通信模块1208可以和合并模块1206耦合。
第一预处理模块1202用于实现本申请实施例中提供的第一预处理方法，例如图10所示的各第一预处理方法。可选地，装置1200中可以包括一个第一预处理模块1202，用于实现图2所示的方法中的第0路至第K路数据处理中的第一预处理。可选地，装置1200中还可以包括K个第一预处理模块1202，该K个第一预处理模块1202分别用于实现图2所示的方法中的第0路至第K路数据处理中的第一预处理。可选地，装置1200中还可以包括其它数据量的第一预处理模块1202，本申请不做限制。
图13所示为第一预处理模块1202的一种可能的结构示意图。
可选地，如图13所示，第一预处理模块1202中包括傅里叶变换模块1301、第一滤波模块1302和傅里叶反变换模块1303。其中，傅里叶变换模块1301、第一滤波模块1302和傅里叶反变换模块1303可以分别用于实现图10(a)至图10(h)中任一个所涉及的傅里叶变换处理、第一滤波处理和傅里叶反变换处理。
可选地，如图13所示，第一预处理模块1202中还可以包括循环扩展模块1304。循环扩展模块1304可以用于实现图10(b)、图10(d)、图10(f)和图10(h)中任一个所涉及的循环扩展处理。
可选地，如图13所示，第一预处理模块1202中还可以包括补零模块1305。补零模块1305可以用于实现图10(e)至图10(h)中任一个所涉及的补零处理。
第二滤波模块1204用于对经过第一预处理的数据进行第二滤波操作。可选地，装置1200中可以包括一个第二滤波模块1204，用于实现图2所示的方法中的第0路至第K路数据处理中的第二滤波。可选地，装置1200中还可以包括K个第二滤波模块1204，该K个第二滤波模块1204分别用于实现图2所示的方法中的第0路至第K路数据处理中的第二滤波。可选地，装置1200中还可以包括其它数据量的第二滤波模块 1204，本申请不做限制。
合并模块1206用于对第0路至第K路数据处理中经过第二滤波得到的数据进行合并，得到发送数据。
通信模块1208用于发送发送数据。
图14是本申请实施例提供的装置1400的结构示意图。其中，装置1400可以是UE或基站，能够实现本申请实施例提供的数据发送方法；装置1400也可以是能够支持UE或基站实现本申请实施例提供的数据发送方法的装置。
如图14中所示，装置1400中包括处理系统1402，用于实现或者用于支持UE或基站实现本申请实施例提供的数据发送方法。处理系统1402可以是一种电路，该电路可以由芯片系统实现。处理系统1402中包括一个或多个处理器1422，可以用于实现或者用于支持UE或基站实现本申请实施例提供的方法。当处理系统1402中包括除处理器1422以外的其它装置时，处理器1422还可以用于管理处理系统1402中包括的其它装置，示例性地，该其它装置可能为下述存储器1424、总线1426和总线接口1428中一个或多个。例如，处理器1422可以用于管理存储器1424，或者处理器1422可以用于管理存储器1424、总线1426和总线接口1428。
处理系统1402中还可以包括一个或多个存储器1424，用于存储指令和/或数据。进一步地，存储器1424还可以包括于处理器1422中。如果处理系统1402中包括存储器1424，处理器1422可以和存储器1424耦合。处理器1422可以和存储器1424协同操作。处理器1422可以执行存储器1424中存储的指令。当处理器1422执行存储器1424中存储的指令时，可以实现或者支持UE或基站实现本申请实施例提供的方法。处理器1422还可能读取存储器1424中存储的数据。存储器1424还可能存储处理器1422执行指令时得到的数据。
在本申请实施例中，存储器包括易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)；存储器也可以包括非易失性存储器(non-volatile memory)，例如快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器还可以包括上述种类的存储器的组合；存储器还可以包括其它任何具有存储功能的装置，例如电路、器件或软件模块。
处理系统1402还可以包括总线接口1428，用于提供总线1426和其它装置之间的接口。其中，总线接口还可以称为通信接口。通信接口可以是电路、模块、收发器或者其它形式的接口，本申请不做限制。
装置1400还可能包括收发器1406，用于通过传输介质和其它通信设备进行通信，从而用于装置1400中的其它装置可以和其它通信设备进行通信。其中，该其它装置可能是处理系统1402。示例性地，装置1400中的其它装置可能利用收发器1406和其它通信设备进行通信，接收和/或发送相应的信息。还可以描述为，装置1400中的其它装置可能接收相应的信息，其中，该相应的信息由收发器1406通过传输介质进行接收，该相应的信息可以通过总线接口1428或者通过总线接口1428和总线1426在收发器1406和装置1400中的其它装置之间进行交互；和/或，装置1400中的其它装置可能发 送相应的信息，其中，该相应的信息由收发器1406通过传输介质进行发送，该相应的信息可以通过总线接口1428或者通过总线接口1428和总线1426在收发器1406和装置1400中的其它装置之间进行交互。
装置1400还可能包括用户接口1404，用户接口1404是用户和装置1400之间的接口，可能用于用户和装置1400进行信息交互。示例性地，用户接口1404可能是键盘、鼠标、显示器、扬声器(speaker)、麦克风和操作杆中至少一个。
上述主要从装置1400的角度描述了本申请实施例提供的一种装置结构。在该装置中，处理系统1402中包括处理器1422，还可以包括存储器1424、总线1426和总线接口1428中一个或多个，用于实现本申请实施例提供的数据发送方法。处理系统1402也在本申请的保护范围。
本申请的装置实施例中，装置的模块划分是一种逻辑功能划分，实际实现时可以有另外的划分方式。例如，装置的各功能模块可以集成于一个模块中，也可以是各个功能模块单独存在，也可以两个或两个以上功能模块集成在一个模块中。
本申请实施例提供了一种通信系统，该通信系统中包括用于实现本申请实施例提供的方法的装置。该通信系统中还可以包括接收设备。例如，该通信系统中包括基站和UE，其中基站可以实现本申请实施例提供的发送方法，UE可以接收基站所发送的数据。再例如，该通信系统中包括基站和UE，其中UE可以实现本申请实施例提供的发送方法，基站可以接收UE所发送的数据。
本申请实施例提供的方法中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本发明实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、网络设备、终端或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机可以存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，数字视频光盘(digital video disc，DVD))、或者半导体介质(例如,SSD)等。
在本申请实施例中，在无逻辑矛盾的前提下，各实施例之间可以相互引用，例如方法实施例之间的方法和/或术语可以相互引用，例如装置实施例之间的功能和/或术语可以相互引用，例如装置实施例和方法实施例之间的功能和/或术语可以相互引用。
以上各实施例仅用以说明本申请的技术方案，并不用于限定其保护范围。凡在本申请的技术方案的基础上所做的修改、等同替换、改进等，均应包括在本申请的保护范围之内。

Claims (21)

  1. 一种数据发送方法，其特征在于，包括：
    对于在时域符号l'上发送的调制数据d l′，对所述调制数据d l′进行第一预处理得到长度为N的数据
    Figure PCTCN2019103885-appb-100001
    其中，N为正整数，l'为大于或等于0的整数，对调制数据进行第一预处理包括：
    对所述调制数据依次进行傅里叶变换、傅里叶反变换和第一滤波，
    对所述调制数据依次进行傅里叶变换、循环扩展、傅里叶反变换和第一滤波，
    对所述调制数据依次进行傅里叶变换、第一滤波和傅里叶反变换，
    对所述调制数据依次进行傅里叶变换、循环扩展、第一滤波和傅里叶反变换，
    对所述调制数据依次进行补零、傅里叶变换、傅里叶反变换和第一滤波，
    对所述调制数据依次进行补零、傅里叶变换、循环扩展、傅里叶反变换和第一滤波，
    对所述调制数据依次进行补零、傅里叶变换、第一滤波和傅里叶反变换，或者
    对所述调制数据依次进行补零、傅里叶变换、循环扩展、第一滤波和傅里叶反变换；
    根据所述
    Figure PCTCN2019103885-appb-100002
    得到在时域符号l上发送的数据s l,0，其中，l为大于或等于0的整数，s l,0的长度为N，s l,0中第n个数据
    Figure PCTCN2019103885-appb-100003
    其中k1和offset为大于等于0的整数，k2为大于等于k1的整数，
    Figure PCTCN2019103885-appb-100004
    为
    Figure PCTCN2019103885-appb-100005
    中第n个数据，n是取值范围为0至N-1的整数，C 0(n+offset-l′×N)是第二滤波器系数C 0中的第n+offset-l′×N个系数；
    在时域符号l上发送所述数据s l,0。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    根据所述调制数据d l′得到K-1路调制数据，其中，K-1为大于或等于1的整数；
    对于所述K-1路调制数据中的第k路调制数据d l′,k，对所述调制数据d l′,k进行所述第一预处理，得到第k路长度为N的数据
    Figure PCTCN2019103885-appb-100006
    其中，k是取值范围为1至K-1的整数；
    根据所述
    Figure PCTCN2019103885-appb-100007
    得到第k路输出数据s l,k，其中，s l,k的长度为N，s l,k中第n个数据
    Figure PCTCN2019103885-appb-100008
    为
    Figure PCTCN2019103885-appb-100009
    中第n个数据，C k(n+offset-l′×N)是第k路第二滤波器系数C k中的第n+offset-l′×N个值；
    在时域符号l上发送所述数据s l,0包括：根据所述s l,0和所述s l,k得到长度为N的合并输出数据s l，在时域符号l上发送所述合并输出数据s l，其中所述s l中第n个数据
    Figure PCTCN2019103885-appb-100010
    其中，n是取值范围为0至N-1的整数。
  3. 根据权利要求1或2所述的方法，其特征在于，对所述调制数据进行补零包括：
    在所述调制数据中的起始数据前添加M 0,head个0；
    在所述调制数据中的末尾数据后添加M 0,tail个0；或者，
    在所述调制数据中的起始数据前添加M 0,head个0，且在所述调制数据中的末尾数据后添加M 0,tail个0；
    其中，M 0,head和M 0,tail为正整数。
  4. 根据权利要求1-3中任一项所述的方法，其特征在于，
    所述调制数据d l′中包括M个数据；
    所述M个数据中的第m个数据的相位是根据所述时域符号l'的索引l'确定的，或者是根据所述时域符号l'的索引l'和m确定的，m是取值范围为0至M-1的整数。
  5. 根据权利4所述的方法，其特征在于，
    所述调制数据的调制方式是Pi/2二进制相移键控Pi/2-BPSK，调制数据d l′中的第m个数据和调制数据d l′-1中的第m个数据之间的相位差为π/2或-π/2；或
    所述调制数据的调制方式是Pi/4正交相移键控Pi/4-QPSK，调制数据d l′中的第m个数据和调制数据d l′-1中的第m个数据之间的相位差为π/4、3×π/4、-3×π/4或-π/4；
    其中，其中，d l′-1表示时域符号l'-1上发送的调制数据，l'-1为大于或等于0的整数。
  6. 根据权利要求2至5中任一项所述的方法，其特征在于，根据所述调制数据d l′得到K-1路调制数据，包括：
    根据所述调制数据d l′、时域符号l′-1上发送的调制数据d l′-1、以及时域符号l′-2上发送的调制数据d l′-2，得到所述K-1路调制数据中的第1路调制数据d l′,1，其中，所述K-1大于或等于1；和/或
    根据所述调制数据d l′、时域符号l′-2上发送的调制数据d l′-2、以及时域符号l′-3上发送的调制数据d l′-3，得到所述K-1路调制数据中的第2路调制数据d l′,2，其中，所述K-1大于或等于2；和/或
    根据所述调制数据d l′、时域符号l′-1上发送的调制数据d l′-1、以及时域符号l′-3上发送的调制数据d l′-3，得到所述K-1路调制数据中的第3路调制数据d l′,3，其中，所述K-1大于或等于3；
    其中，调制数据的调制方式是BPSK或Pi/2-BPSK。
  7. 根据权利要求2至6任一项所述的方法，其特征在于，
    所述第1路第二滤波器系数C 1中的第i个值C 1(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及所述滤波器系数C 0中的第i+N个值C 0(i+N)确定的；和/或
    所述第2路第二滤波器系数C 2中的第n个值C 2(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及所述滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的；和/或
    所述第3路第二滤波器系数C 3中的第i个值C 3(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+N个值C 0(i+N)、以及所述滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的；
    其中，调制数据的调制方式是BPSK或Pi/2-BPSK，i为整数。
  8. 根据权利要求2至5中任一项所述的方法，其特征在于，根据所述调制数据d l′得到K-1路调制数据，包括：
    根据所述调制数据d l′以及时域符号l′-1上发送的调制数据d l′-1得到所述K-1路调制数据中的第1路调制数据；其中，所述K-1大于或等于1；
    其中，调制数据的调制方式是QPSK或者Pi/4-QPSK。
  9. 根据权利要求2、3、4、5和8任一项所述的方法，其特征在于，
    所述第1路第二滤波器系数C 1中的第i个值C 1(i)是根据所述第二滤波器系数C 0中的第i个值C 0(i)、以及所述第二滤波器系数C 0中的第i+N个值C 0(i+N)确定的；
    其中，调制数据的调制方式是Pi/4-QPSK或者QPSK，i为整数。
  10. 一种通信装置，用于实现权利要求1至9任一项所述的方法。
  11. 一种通信装置，包括处理器和存储器，所述存储器中存储有指令，所述处理器调用所述指令时，使所述装置执行权利要求1至9任一项所述的方法。
  12. 一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行权利要求1至9任一项所述的方法。
  13. 一种通信装置，包括处理器和通信接口，
    对于在时域符号l'上发送的调制数据d l′，处理器用于对所述调制数据d l′进行第一预处理得到长度为N的数据
    Figure PCTCN2019103885-appb-100011
    其中，N为正整数，l'为大于或等于0的整数，对调制数据进行第一预处理包括：
    对所述调制数据依次进行傅里叶变换、傅里叶反变换和第一滤波，
    对所述调制数据依次进行傅里叶变换、循环扩展、傅里叶反变换和第一滤波，
    对所述调制数据依次进行傅里叶变换、第一滤波和傅里叶反变换，
    对所述调制数据依次进行傅里叶变换、循环扩展、第一滤波和傅里叶反变换，
    对所述调制数据依次进行补零、傅里叶变换、傅里叶反变换和第一滤波，
    对所述调制数据依次进行补零、傅里叶变换、循环扩展、傅里叶反变换和第一滤波，
    对所述调制数据依次进行补零、傅里叶变换、第一滤波和傅里叶反变换，或者
    对所述调制数据依次进行补零、傅里叶变换、循环扩展、第一滤波和傅里叶反变换；
    处理器用于根据所述
    Figure PCTCN2019103885-appb-100012
    得到在时域符号l上发送的数据s l,0，其中，l为大于或等于0的整数，s l,0的长度为N，s l,0中第n个数据
    Figure PCTCN2019103885-appb-100013
    其中k1和offset为大于等于0的整数，k2为大于等于k1的整数，
    Figure PCTCN2019103885-appb-100014
    为
    Figure PCTCN2019103885-appb-100015
    中第n个数据，n是取值范围为0至N-1的整数，C 0(n+offset-l′×N)是第二滤波器系数C 0中的第n+offset-l′×N个系数；
    处理器利用通信接口在时域符号l上发送所述数据s l,0。
  14. 根据权利要求13所述的通信装置，其特征在于，
    所述处理器用于根据所述调制数据d l′得到K-1路调制数据，其中，K-1为大于或等于1的整数；
    对于所述K-1路调制数据中的第k路调制数据d l′,k，所述处理器用于对所述调制数据d l′,k进行所述第一预处理，得到第k路长度为N的数据
    Figure PCTCN2019103885-appb-100016
    其中，k是取值范围为1至K-1的整数；
    所述处理器用于根据所述
    Figure PCTCN2019103885-appb-100017
    得到第k路输出数据s l,k，其中，s l,k的长度为N，s l,k中第n个数据
    Figure PCTCN2019103885-appb-100018
    为
    Figure PCTCN2019103885-appb-100019
    中第n个数据，C k(n+offset-l′×N)是第k路第二滤波器系数C k中的第n+offset-l′×N个值；
    所述处理器利用所述通信接口：根据所述s l,0和所述s l,k得到长度为N的合并输出数据s l，在时域符号l上发送所述合并输出数据s l，其中所述s l中第n个数据
    Figure PCTCN2019103885-appb-100020
    其中，n是取值范围为0至N-1的整数。
  15. 根据权利要求13或14所述的通信装置，其特征在于，对所述调制数据进行补零包括：
    在所述调制数据中的起始数据前添加M 0,head个0；
    在所述调制数据中的末尾数据后添加M 0,tail个0；或者，
    在所述调制数据中的起始数据前添加M 0,head个0，且在所述调制数据中的末尾数据后添加M 0,tail个0；
    其中，M 0,head和M 0,tail为正整数。
  16. 根据权利要求13-15中任一项所述的通信装置，其特征在于，
    所述调制数据d l′中包括M个数据；
    所述M个数据中的第m个数据的相位是根据所述时域符号l'的索引l'确定的，或者是根据所述时域符号l'的索引l'和m确定的，m是取值范围为0至M-1的整数。
  17. 根据权利16所述的通信装置，其特征在于，
    所述调制数据的调制方式是Pi/2二进制相移键控Pi/2-BPSK，调制数据d l′中的第m个数据和调制数据d l′-1中的第m个数据之间的相位差为π/2或-π/2；或
    所述调制数据的调制方式是Pi/4正交相移键控Pi/4-QPSK，调制数据d l′中的第m个数据和调制数据d l′-1中的第m个数据之间的相位差为π/4、3×π/4、-3×π/4或-π/4；
    其中，其中，d l′-1表示时域符号l'-1上发送的调制数据，l'-1为大于或等于0的整数。
  18. 根据权利要求14至17中任一项所述的装置，其特征在于，所述处理器用于：
    根据所述调制数据d l′、时域符号l′-1上发送的调制数据d l′-1、以及时域符号l′-2上发送的调制数据d l′-2，得到所述K-1路调制数据中的第1路调制数据d l′,1，其中，所述K-1大于或等于1；和/或
    根据所述调制数据d l′、时域符号l′-2上发送的调制数据d l′-2、以及时域符号l′-3上发送的调制数据d l′-3，得到所述K-1路调制数据中的第2路调制数据d l′,2，其中，所述K-1大于或等于2；和/或
    根据所述调制数据d l′、时域符号l′-1上发送的调制数据d l′-1、以及时域符号l′-3上发送的调制数据d l′-3，得到所述K-1路调制数据中的第3路调制数据d l′,3，其中，所述K-1大于或等于3；
    其中，调制数据的调制方式是BPSK或Pi/2-BPSK。
  19. 根据权利要求14至18任一项所述的通信装置，其特征在于，
    所述第1路第二滤波器系数C 1中的第i个值C 1(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及所述滤波器系数C 0中的第i+N个值C 0(i+N)确定的；和/或
    所述第2路第二滤波器系数C 2中的第n个值C 2(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+2N个值C 0(i+2N)、以及所述滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的；和/或
    所述第3路第二滤波器系数C 3中的第i个值C 3(i)是根据所述滤波器系数C 0中的第i个值C 0(i)、所述滤波器系数C 0中的第i+N个值C 0(i+N)、以及所述滤波器系数C 0中的第i+3N个值C 0(i+3N)确定的；
    其中，调制数据的调制方式是BPSK或Pi/2-BPSK，i为整数。
  20. 根据权利要求14至17中任一项所述的通信装置，其特征在于，所述处理器用于：
    根据所述调制数据d l′以及时域符号l′-1上发送的调制数据d l′-1得到所述K-1路调制数据中的第1路调制数据；其中，所述K-1大于或等于1；
    其中，调制数据的调制方式是QPSK或者Pi/4-QPSK。
  21. 根据权利要求14、15、16、17和20任一项所述的通信装置，其特征在于，
    所述第1路第二滤波器系数C 1中的第i个值C 1(i)是根据所述第二滤波器系数C 0中的第i个值C 0(i)、以及所述第二滤波器系数C 0中的第i+N个值C 0(i+N)确定的；
    其中，调制数据的调制方式是Pi/4-QPSK或者QPSK，i为整数。
PCT/CN2019/103885 2018-09-29 2019-08-31 数据传输方法及装置 WO2020063260A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811149474.7A CN110971554B (zh) 2018-09-29 2018-09-29 数据传输方法及装置
CN201811149474.7 2018-09-29

Publications (1)

Publication Number Publication Date
WO2020063260A1 true WO2020063260A1 (zh) 2020-04-02

Family

ID=69951062

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/103885 WO2020063260A1 (zh) 2018-09-29 2019-08-31 数据传输方法及装置

Country Status (2)

Country Link
CN (1) CN110971554B (zh)
WO (1) WO2020063260A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107154907A (zh) * 2016-03-03 2017-09-12 北京三星通信技术研究有限公司 基于滤波的信号发送、接收方法及相应的发射机与接收机
WO2018031708A1 (en) * 2016-08-10 2018-02-15 Idac Holdings, Inc. Methods for flexible reference signal transmission with single carrier frequency domain multiple access (sc-fdma) and ofdma
US20180054218A1 (en) * 2016-08-19 2018-02-22 Samsung Electronics Co., Ltd. Method and apparatus for grid mapping in a wireless communication system
WO2018063855A1 (en) * 2016-09-28 2018-04-05 Idac Holdings, Inc. Reference signal-free transmission for wireless systems
CN107888533A (zh) * 2016-09-30 2018-04-06 华为技术有限公司 一种数据处理方法、装置和系统

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016154911A1 (zh) * 2015-03-31 2016-10-06 重庆邮电大学 一种多载波时分复用调制/解调方法及系统
CN105553909B (zh) * 2015-12-08 2019-05-24 北京遥测技术研究所 一种迭代限幅滤波降低ofdm信号峰均比的方法
CN106027441B (zh) * 2016-04-28 2019-10-18 上海华为技术有限公司 一种调制信号的方法、设备
CN108270713B (zh) * 2018-01-18 2021-03-02 重庆邮电大学 一种多应用场景信号多址接入方法及系统
CN108599864B (zh) * 2018-03-06 2024-04-12 东南大学 一种基于宽子带滤波器组的非相干光通信多址接入系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107154907A (zh) * 2016-03-03 2017-09-12 北京三星通信技术研究有限公司 基于滤波的信号发送、接收方法及相应的发射机与接收机
WO2018031708A1 (en) * 2016-08-10 2018-02-15 Idac Holdings, Inc. Methods for flexible reference signal transmission with single carrier frequency domain multiple access (sc-fdma) and ofdma
US20180054218A1 (en) * 2016-08-19 2018-02-22 Samsung Electronics Co., Ltd. Method and apparatus for grid mapping in a wireless communication system
WO2018063855A1 (en) * 2016-09-28 2018-04-05 Idac Holdings, Inc. Reference signal-free transmission for wireless systems
CN107888533A (zh) * 2016-09-30 2018-04-06 华为技术有限公司 一种数据处理方法、装置和系统

Also Published As

Publication number Publication date
CN110971554A (zh) 2020-04-07
CN110971554B (zh) 2021-09-07

Similar Documents

Publication Publication Date Title
RU2436252C2 (ru) Способ передачи управляющих сигналов в системе беспроводной связи
US9094158B2 (en) Radio access method for reduced PAPR
CN109391576B (zh) 基于序列的信号处理方法、通信设备及通信系统
EP2168269A2 (en) Method of transmitting control information in wireless communication system
WO2019144812A1 (zh) 基于加扰的数据传输方法
US11546193B2 (en) Data compression method and apparatus
CN109802908B (zh) 基于序列的信号处理方法、信号处理装置及计算机可读存储介质
WO2020103687A9 (zh) 一种信号传输方法及装置
JP7463477B2 (ja) 系列に基づく信号処理方法および装置
WO2017133635A1 (zh) 信号处理方法及装置
WO2020187132A1 (zh) 数据信道的传输方法及装置
US10999108B2 (en) Wireless communication method, apparatus, and system
WO2021000712A1 (zh) 符号处理的方法与装置
WO2020063260A1 (zh) 数据传输方法及装置
WO2018019104A1 (zh) 一种无线传输中的方法和装置
WO2020143649A1 (zh) 基于序列的信号处理方法与装置
CN109873783B (zh) 信息的发送方法及装置
EP3598710A1 (en) Signal processing method and apparatus based on sequence
US10680783B2 (en) Method and apparatus for transmitting uplink control signal
WO2018126968A1 (zh) 一种信号发送、接收方法及装置
WO2021000711A1 (zh) 符号处理的方法与装置
WO2020063364A1 (zh) 一种数据传输方法及装置
WO2023169302A1 (zh) 一种通信方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19867960

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19867960

Country of ref document: EP

Kind code of ref document: A1