CN110971555B - Data transmission method and device - Google Patents
Data transmission method and device Download PDFInfo
- Publication number
- CN110971555B CN110971555B CN201811152698.3A CN201811152698A CN110971555B CN 110971555 B CN110971555 B CN 110971555B CN 201811152698 A CN201811152698 A CN 201811152698A CN 110971555 B CN110971555 B CN 110971555B
- Authority
- CN
- China
- Prior art keywords
- data
- length
- modulated
- modulation
- filter coefficient
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 224
- 230000005540 biological transmission Effects 0.000 title claims abstract description 113
- 238000013507 mapping Methods 0.000 claims abstract description 38
- 238000004891 communication Methods 0.000 claims description 86
- 230000010363 phase shift Effects 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 6
- 238000002360 preparation method Methods 0.000 claims 1
- 238000001914 filtration Methods 0.000 description 90
- 230000000875 corresponding effect Effects 0.000 description 70
- 230000008569 process Effects 0.000 description 65
- 238000013461 design Methods 0.000 description 51
- 238000012545 processing Methods 0.000 description 49
- 238000010586 diagram Methods 0.000 description 38
- 238000007781 pre-processing Methods 0.000 description 36
- 230000011664 signaling Effects 0.000 description 30
- 230000006870 function Effects 0.000 description 25
- 230000014509 gene expression Effects 0.000 description 10
- 238000005070 sampling Methods 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000004044 response Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 239000000758 substrate Substances 0.000 description 3
- 230000021615 conjugation Effects 0.000 description 2
- 238000013480 data collection Methods 0.000 description 2
- 238000000354 decomposition reaction Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 2
- 230000003190 augmentative effect Effects 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005315 distribution function Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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/2614—Peak power aspects
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
The embodiment of the application discloses a data transmission method and a data transmission device, which are used for realizing data transmission with low OOB and low PAPR. The method comprises the following steps: modulation for transmission on time domain symbol lData dl′According to modulated data dl′Get data of length NWherein l' is an integer; according toObtaining data s transmitted on a time domain symbol ll,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) isWherein k1 and offset are integers of 0 or more, k2 is an integer of k1 or more,is composed ofN is an integer ranging from 0 to N-1, C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value of (a); transmitting data sl,0(ii) a Wherein, according to the modulated data dl′Get data of length NThe method comprises the following steps: to modulated data dl′Repeating and rotating the phase to obtain data with length NOr, to the modulated data dl′Performing frequency domain resource mapping and IFFT to obtain data with length of NOr, to the modulated data dl′Repeating to obtain data with length N
Description
Technical Field
The embodiment of the application relates to the technical field of communication, in particular to a data transmission method and device.
Background
Currently, in a communication system, such as a Long Term Evolution (LTE) fourth generation communication system, an internet of things (IoT) scenario is supported. In an IoT scenario, two IoT devices, a network device and a terminal device, may be included. In an IoT scenario, the terminal device and the network device are required to provide wide coverage, and the IoT device is required to have low price and long battery life. In an IoT scenario, the size of data packets transmitted between IoT devices is small. If synchronous transmission is adopted among IoT devices, taking uplink synchronous transmission as an example, a network device may send corresponding Timing Advance (TA) information to each terminal device through a control signaling, and each terminal device adjusts the sending time when sending uplink data according to the TA information, so that the time when the uplink data sent by different terminal devices reach the network device is basically aligned. Because the timing advance information of the terminal device is not always kept unchanged, and the terminal device and the network device need to continuously perform interaction of control signaling to maintain synchronization between the terminal device and the network device, signaling overhead is not negligible when a small data packet is transmitted between the IoT devices, and in addition, the maintenance of synchronization can continuously consume power to reduce the service life of the battery of the IoT devices.
In view of this, the IoT devices may transmit data in an asynchronous transmission manner. When asynchronous transmission is adopted, taking uplink asynchronous transmission as an example, the time for data sent by different terminal devices to reach the network device may be different (i.e. not aligned), so that the network device does not need to send TA information to each terminal device through a control signaling. Because the terminal device and the network device do not need to perform control signaling interaction to maintain synchronization, when a smaller data packet is transmitted between the IoT devices, signaling overhead can be reduced through asynchronous transmission, the system capacity of the IoT devices can be improved, and meanwhile, the asynchronous transmission can save more power and prolong the service life of a battery.
However, in asynchronous transmission, for example, for uplink asynchronous transmission, the time of arrival of data transmitted by different terminal devices at the network device may be different. At this time, when the terminal device uses the frequency domain resource to perform data transmission to the network device, if the frequency domain resources of different terminal devices are frequency-divided and the frequency points corresponding to the frequency domain resources allocated to different terminal devices are relatively close, the following situations easily occur: the energy of the data transmitted by the first terminal device may leak into a bandwidth outside the frequency domain resource of the first terminal device, for example, into the frequency domain resource of the second terminal device adjacent to the first terminal device, and the leaked energy may interfere with data transmission of the second terminal device adjacent to the first terminal device, so that the error rate when the adjacent second terminal device performs data transmission is increased, and thus the rate of data transmission is reduced. The part of the data transmitted by the terminal device where energy leaks out of the frequency domain resource of the terminal device may be referred to as out-of-band (OOB) data or out-of-band (OOB) leakage. Bandwidth data or out-of-band leakage may also be referred to as OOB for short. Therefore, in order to support asynchronous transmission in the IoT scenario, a low OOB waveform conforming to the asynchronous transmission needs to be designed to implement the low OOB data transmission. Further, if a peak to average power ratio (PAPR) of the low OOB waveform is higher, the OOB of the low OOB waveform is boosted after passing through a non-linear Power Amplifier (PA), that is, the low OOB characteristic of the waveform cannot be well maintained. Therefore, in order to support asynchronous transmission, it is necessary to design a low OOB and low PAPR waveform conforming to asynchronous transmission to achieve low OOB and low PAPR data transmission.
Disclosure of Invention
The embodiment of the application provides a data transmission method and device, so as to realize data transmission with low OOB and low PAPR.
In a first aspect, an embodiment of the present application provides a data transmission method, for modulated data d transmitted on a time domain symbol ll′According to modulated data dl′Get data of length NWherein l' is an integer; according toObtaining data s transmitted on a time domain symbol ll,0And transmits the data sl,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) isWherein k1 and offset are integers of 0 or more, k2 is an integer of k1 or more,is composed ofN is an integer ranging from 0 to N-1, C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value of (a); according to modulation data dl′Get data of length NThe method comprises the following steps: to modulated data dl′Repeating and rotating the phase to obtain data with length NOr, to the modulated data dl′Performing frequency domain resource mapping and Inverse Fast Fourier Transform (IFFT) to obtain data with the length of NOr, to the modulated data dl′Repeating to obtain data with length NBased on the data transmission method, the nth time domain data sent on each time domain symbol can be related to the nth time domain data of a plurality of other time domain symbols through filtering, so that the relevance and the continuity of data transmitted on different time domain symbols are ensured, and OOB (out-of-band) is reduced. Meanwhile, compared with the existing method of performing linear convolution (linear convolution) on the time domain data corresponding to the time domain symbol and the filter to reduce OOB, the filtering method provided by the embodiment of the application is adopted to obtain sl,0To middleWhen n data are obtained, multiplication can be reduced, so that the transmission data s obtained by adopting the filtering mode provided by the embodiment of the applicationl,0The PAPR of is lower.
In one possible embodiment, the modulated data d are modulatedl′Repeating and rotating the phase to obtain data with length NThe method comprises the following steps: according to the phase factorTo dl′Performing phase rotation to obtainN-th data, wherein αnWherein N is an integer ranging from 0 to N-1. In this way, modulated data d can be transmittedl′Mapping to the time domain symbol, and adjusting the frequency domain resource position of the data by phase rotation, such as: and adjusting the frequency domain distance between different data according to the requirement, thereby reducing the frequency domain interference between the data.
In one possible design, when the modulated data d is comparedl′Repeating to obtain data with length NWhen it is time to transmit data sl,0The method comprises the following steps: for data sl,0Performing phase rotation to obtain data with length of NSendingBy the method, the frequency domain resource position of the filtered data can be adjusted through phase rotation, such as: and adjusting the frequency domain distance between different data according to the requirement, thereby reducing the frequency domain interference between the data.
In one possible design, the method further includes: according to the toneSystem data dl′Obtaining M-1 modulation data, wherein M-1 is an integer greater than or equal to 1; for M modulated data d in M-1 modulated datal′,mAccording to modulated data dl′,mObtaining the data with the length of the mth path being NWherein M is an integer with a value range of 1 to M-1; according toObtaining the mth output data sl,m,sl,mHas a length of N, sl,mThe nth data sl,m(n) is:
is composed ofN-th data, Cm(N + offset-l' xN) is the mth filter coefficient CmThe N + offset-l' x N value of (a); according to modulation data dl′,mObtaining the data with the length of the mth path being NThe method comprises the following steps: to modulated data dl′,mRepeating and rotating the phase to obtain the data with the length of the mth path being NOr, to the modulated data dl′,mPerforming frequency domain resource mapping and IFFT to obtain the data with the mth path length of NOr, to the modulated data dl′,mRepeating to obtain the data with the length of the mth path being NSaid transmission data sl,0The method comprises the following steps: according to sl,0And sl,mObtaining combined output data s with length NlSending sl,slMiddle nth dataIn this way, the mth transmission data s can be transmittedl,mAnd transmit data sl,0The combined data is sent out, and the multipath combination mode can reduce the amplitude of the data with larger amplitude in the sent data and improve the amplitude of the data with smaller amplitude in the sent data, so that the overall amplitude of the sent data obtained by final combination is slowly changed, the amplitude fluctuation is smaller, and the PAPR of the sent data can be reduced.
In one possible embodiment, the modulated data d are modulatedl′,mRepeating and rotating the phase to obtain the data with the length of the mth path being NThe method comprises the following steps: according to the phase factorTo dl′,mPerforming phase rotation to obtainThe nth data. By the method, the frequency domain resource position where the data is transmitted can be adjusted by the phase factor, such as: and adjusting the frequency domain distance between different data according to the requirement, thereby reducing the frequency domain interference between the data.
In one possible design, when the modulated data d is comparedl′,mRepeating to obtain the data with the length of the mth path being NAccording to sl,0And sl,mObtaining combined output data s with length NlThe method comprises the following steps: to pairsl,0、sl,mPerforming phase rotation to obtain a rotatedAccording to after rotationAnd after rotationObtaining combined output data s with length Nl. By the method, the frequency domain resource position where the sending data is located can be adjusted through phase rotation, and the distance between different data in the frequency domain can be adjusted according to needs, so that the interference between the data in the frequency domain is reduced.
In one possible design, when the modulated data d is comparedl′,mRepeating to obtain the data with the length of the mth path being NThen send slThe method comprises the following steps: for data slPerforming phase rotation to obtain data with length of NSendingThus, data s can be rotated by phaselMapping to a corresponding frequency domain resource location, such as: and adjusting the frequency domain distance between different data according to the requirement, thereby reducing the frequency domain interference between the data.
In one possible design, the modulation data d is usedl′Obtaining M-1 modulated data, including: according to modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -2l′-2Obtaining the 1 st modulation data d in the M-1 modulation datal′,1Wherein M-1 is greater than or equal to 1; and/or according to modulated data dl′When in useModulated data d transmitted on field symbols l' -2l′-2And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 2 nd modulation data d in the M-1 modulation datal′,2Wherein M-1 is greater than or equal to 2; and/or according to modulated data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 3 rd modulation data d in the M-1 modulation datal′,3Wherein M-1 is greater than or equal to 3; wherein the data d is modulatedl′The modulation scheme of (2) is binary phase shift keying BPSK or Pi/2-BPSK. By the method, under the condition that the modulation mode is BPSK or Pi/2-BPSK, M-1 modulation data are obtained according to modulation data transmitted on a plurality of time domain symbols before a time domain symbol l', correlation among each path of modulation data can be ensured, the amplitude of data with larger amplitude in the multi-path data can be well reduced when the multi-path data are combined subsequently, the amplitude of data with smaller amplitude in the multi-path data is improved, the overall amplitude of the combined transmission data is slowly changed, the amplitude fluctuation is smaller, and the PAPR can be reduced.
In one possible design, the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) Filter coefficient C0N +2N value of C0(N +2N) and filter coefficient C0N + N value of C0(N + N) determination; and/or, path 2 filter coefficient C2N-th value of C2(n) according to the filter coefficient C0N-th value of C0(n) Filter coefficient C0N +2N value of C0(N +2N) and filter coefficient C0N +3N value of C0(N +3N) determination; and/or, path 3 filter coefficient C3N-th value of C3(n) according to the filter coefficient C0N-th value of C0(n) Filter coefficient C0N + N value of C0(N + N) and filter coefficient C0N +3N value of C0(N +3N) determination; wherein the data is modulateddl′The modulation scheme of (3) is Pi/2-BPSK or BPSK. By the method, under the condition that the modulation mode is BPSK or Pi/2-BPSK, the coefficient C of the 0 th path filter can be used0Determining filter coefficient C corresponding to other M-1 paths of time domain symbolsmThe filter coefficients of each path are related, and subsequently, when the data after multi-path filtering are combined, the amplitude of the data with larger amplitude in the multi-path data can be reduced, the amplitude of the data with smaller amplitude in the multi-path data is improved, the overall amplitude of the combined data is slowly changed, the amplitude fluctuation is smaller, and the PAPR can be reduced.
In one possible design, the modulation data d is usedl′Obtaining M-1 modulated data, including: according to modulation data dl′And modulated data d transmitted on time domain symbol l' -1l′-1Obtaining the 1 st modulation data in the M-1 modulation data; wherein M-1 is greater than or equal to 1; modulated data dl′The modulation scheme of (1) is quadrature phase shift keying QPSK or Pi/4-QPSK. By the method, M-1 modulation data can be obtained according to modulation data transmitted on a time domain symbol l 'and a time domain symbol l' -1 under the condition that the modulation mode is QPSK or Pi/4-QPSK, so that each path of modulation data is related, the amplitude of data with larger amplitude in the multi-path data can be reduced when the multi-path data are combined subsequently, the amplitude of data with smaller amplitude in the multi-path data is improved, the overall amplitude of the combined transmission data is slowly changed, the amplitude fluctuation is smaller, and the PAPR can be reduced.
In one possible design, the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) Filter coefficient C0N + N value of C0(N + N) determination; wherein the data d is modulatedl′The modulation scheme of (1) is Pi/4-QPSK or QPSK. By this method, the 0 th path filter coefficient C can be used in the case that the modulation mode is QPSK or Pi/4-QPSK0Determining filter coefficient C corresponding to other M-1 paths of time domain symbolsmMaking each filter coefficient be correlated, when subsequently combining multi-channel filtered dataThe amplitude of the data with larger amplitude in the multi-path data can be reduced, the amplitude of the data with smaller amplitude in the multi-path data can be improved, the overall amplitude of the combined sending data is slowly changed, the amplitude fluctuation is smaller, and the PAPR can be reduced.
In one possible design, the filter coefficient C0N-th value of C0(n) according to filter coefficientsN value ofAnd filter coefficientsN value ofDetermining; and/or, the 1 st filter coefficient C1N-th value of C1(n) according to filter coefficientsN + N value ofAnd filter coefficientsN value ofDetermining; and/or, path 2 filter coefficient C2N-th value of C2(n) according to filter coefficientsN value ofAnd filter coefficientsN + N value ofDetermining; wherein the filter coefficientsDetermined by filter coefficients g (N) and N, p being an integer greater than or equal to 0; modulated data dl′The modulation scheme of (1) is Pi/4-QPSK or QPSK.
In one possible design, the modulation data d is usedl′,mObtaining the data with the length of the mth path being NThe method comprises the following steps: to modulated data dl′,mPerforming phase rotation to obtain rotated dl′,mAccording to d after rotationl′,mObtaining the data with the length of the mth path being NWherein the data d is modulatedl′The modulation scheme of (2) is BPSK or QPSK. By this method, modulation data d can be modulated in the case where the modulation scheme is BPSK or QPSKl′The phase rotation is carried out to ensure that the modulation data transmitted on the adjacent symbols have phase difference, thereby being convenient for reducing the probability of the same-direction addition when the filtering operation is carried out, and further reducing the PAPR of the transmitted data.
In a second aspect, an embodiment of the present application provides a communication apparatus, where the communication apparatus may implement the functions of the first aspect, or may implement the functions in each possible design of the first aspect, where the functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software comprises one or more modules corresponding to the functions. Such as: the communication apparatus may include: the system comprises a first data processing unit, a second data processing unit and a sending unit;
a first data processing unit for processing the first data,for modulated data d transmitted on time domain symbol ll′According to modulated data dl′Get data of length NWherein l' is an integer; according to modulation data dl′Get data of length NThe method comprises the following steps: to modulated data dl′Repeating and rotating the phase to obtain data with length NOr, to the modulated data dl′Performing frequency domain resource mapping and Inverse Fast Fourier Transform (IFFT) to obtain data with the length of NOr, to the modulated data dl′Repeating to obtain data with length N
A second data processing unit for processing the data according toObtaining data s transmitted on a time domain symbol ll,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) isWherein k1 and offset are integers of 0 or more, k2 is an integer of k1 or more,is composed ofThe nth data, n is the value range ofAn integer of 0 to N-1, C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value of (a);
a transmission unit for transmitting data sl,0。
In one possible design, the first data processing unit is configured to: according to the phase factorFor d isl′Performing phase rotation to obtainN, where a is the numbernWherein N is an integer ranging from 0 to N-1.
In one possible design, when the first data processing unit is used for modulating the modulated data dl′Repeating to obtain the data with the length of NThe sending unit is configured to: for the data sl,0Performing phase rotation to obtain data with length of NSending out the
In one possible design, the first data processing unit is further configured to modulate the modulated data d according to the first modulation data dl′Obtaining M-1 modulation data, wherein M-1 is an integer greater than or equal to 1; and, for M modulated data d in the M-1 modulated datal′,mAccording to said modulated data dl′,mObtaining the data with the length of the mth path being NWherein M is an integer with a value range of 1 to M-1; the second data processing unit is also used for processing the data according to theObtaining the mth output data sl,mWherein s isl,mHas a length of N, sl,mThe nth data sl,m(n) is Is composed ofN-th data, Cm(N + offset-l' xN) is the mth filter coefficient CmThe N + offset-l' x N value of (a); the sending unit is specifically configured to: according to said sl,0And said sl,mObtaining combined output data s with length NlSending said slS of said slMiddle nth dataWherein the first data processing unit is configured to: for the modulated data dl′,mRepeating and rotating the phase to obtain the data with the length of the mth path being NOr, for the modulated data dl′,mPerforming frequency domain resource mapping and IFFT to obtain the data with the mth path length of NOr, for the modulated data dl′,mRepeating to obtain the data with the length of the mth path being N
In one possible design, the first data processing unit is configured to: according to the phase factorFor d isl′,mPerforming phase rotation to obtainThe nth data.
In one possible design, when the first data processing unit is used for modulating the modulated data dl′,mRepeating to obtain the data with the length of the mth path being NThe sending unit is configured to: for the sl,0S saidl,mPerforming phase rotation to obtain a rotatedAccording to the rotatedAnd after said rotationObtaining combined output data s with length Nl。
In one possible design, when the first data processing unit is used for modulating the modulated data dl′,mRepeating to obtain the data with the length of the mth path being NThe sending unit is configured to: for the data slPerforming phase rotation to obtain data with length of NSending out the
In one possible designThe first data processing unit is configured to: according to the modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -2l′-2Obtaining the 1 st modulation data d in the M-1 modulation datal′,1Wherein said M-1 is greater than or equal to 1; and/or according to said modulated data dl′Modulated data d transmitted on time domain symbols l' -2l′-2And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 2 nd modulation data d in the M-1 modulation datal′,2Wherein said M-1 is greater than or equal to 2; and/or according to said modulated data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 3 rd modulation data d in the M-1 modulation datal′,3Wherein said M-1 is greater than or equal to 3; wherein the modulation data dl′The modulation scheme of (2) is binary phase shift keying BPSK or Pi/2-BPSK.
In one possible design, the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N +2N value of C0(N +2N) and the filter coefficient C0N + N value of C0(N + N) determination; and/or the 2 nd filter coefficient C2N-th value of C2(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N +2N value of C0(N +2N) and the filter coefficient C0N +3N value of C0(N +3N) determination; and/or the 3 rd path filter coefficient C3N-th value of C3(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) and the filter coefficient C0N +3N value of C0(N +3N) determination; it is composed ofThe modulation data dl′The modulation scheme of (3) is Pi/2-BPSK or BPSK. These filter coefficients may be determined by the second data processing unit, for example.
In one possible design, the first data processing unit is configured to: according to the modulation data dl′And modulated data d transmitted on time domain symbol l' -1l′-1Obtaining the 1 st modulation data in the M-1 modulation data; wherein M-1 is greater than or equal to 1; wherein the modulation data dl′The modulation scheme of (1) is QPSK or Pi/4-QPSK.
In one possible design, the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) determination; wherein the modulation data dl′The modulation scheme of (1) is Pi/4-QPSK or QPSK. These filter coefficients may be determined by the second data processing unit, for example.
In one possible design, the first data processing unit is configured to: for the modulated data dl′,mPerforming phase rotation to obtain rotated dl′,mAccording to d after said rotationl′,mObtaining the data with the length of the mth path being NWherein the modulation data dl′The modulation scheme of (2) is BPSK or QPSK.
In a third aspect, a communication device is provided, which may implement the functionality of the first aspect described above, or which may implement the functionality of each possible design in the first aspect. The communication device may include a processor and a communication interface, and may further include a memory; a processor for modulating data d transmitted on time domain symbols ll′According to modulated data dl′Get data of length NWherein l' is an integer; according to modulation data dl′Get data of length NThe method comprises the following steps: to modulated data dl′Repeating and rotating the phase to obtain data with length NOr, to the modulated data dl′Performing frequency domain resource mapping and Inverse Fast Fourier Transform (IFFT) to obtain data with the length of NOr, to the modulated data dl′Repeating to obtain data with length NA processor, further for according toObtaining data s transmitted on a time domain symbol ll,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) isWherein k1 and offset are integers of 0 or more, k2 is an integer of k1 or more,is composed ofN is an integer ranging from 0 to N-1, C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value of (a); a communication interface for transmitting data s obtained by the processorl,0。
In one possible design, the processor is to: according to the phase factorFor d isl′Performing phase rotation to obtainN, where a is the numbernWherein N is an integer ranging from 0 to N-1.
In one possible design, when the processor is used to modulate the data dl′Repeating to obtain the data with the length of NThe communication interface is configured to: for the data sl,0Performing phase rotation to obtain data with length of NSending out the
In one possible design, the processor may be further configured to modulate the data d according to the modulation datal′Obtaining M-1 modulation data, wherein M-1 is an integer greater than or equal to 1; and, for M modulated data d in the M-1 modulated datal′,mAccording to said modulated data dl′,mObtaining the data with the length of the mth path being NWherein M is an integer with a value range of 1 to M-1; the processor is further configured to operate in accordance with theObtaining the mth output data sl,mWherein s isl,mHas a length of N, sl,mThe nth data sl,m(n) is Is composed ofN-th data, Cm(N + offset-l' xN) is the mth filter coefficient CmThe N + offset-l' x N value of (a); the processor is further configured to determine sl,0And said sl,mObtaining combined output data s with length NlSending said s over a communication interfacelS of said slMiddle nth dataWherein the processor is configured to: for the modulated data dl′,mRepeating and rotating the phase to obtain the data with the length of the mth path being NOr, for the modulated data dl′,mPerforming frequency domain resource mapping and IFFT to obtain the data with the mth path length of NOr, for the modulated data dl′,mRepeating to obtain the data with the length of the mth path being N
In one possible design, the processor is to: according to the phase factorFor d isl′,mPerforming phase rotation to obtainThe nth data.
In one possible designWhen said processor is used for modulating said modulated data dl′,mRepeating to obtain the data with the length of the mth path being NThe processor is configured to: for the sl,0S saidl,mPerforming phase rotation to obtain a rotatedAccording to the rotatedAnd after said rotationObtaining combined output data s with length Nl。
In one possible design, when the processor is used to modulate the data dl′,mRepeating to obtain the data with the length of the mth path being NThe processor is specifically configured to: for the data slPerforming phase rotation to obtain data with length of NSending out the
In one possible design, the processor is to: according to the modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -2l′-2Obtaining the 1 st modulation data d in the M-1 modulation datal′,1Wherein said M-1 is greater than or equal to 1; and/or according to said modulated data dl′Modulated data d transmitted on time domain symbols l' -2l′-2And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 2 nd modulation data d in the M-1 modulation datal′,2Wherein said M-1 is greater than or equal to 2; and/or according to said modulated data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 3 rd modulation data d in the M-1 modulation datal′,3Wherein said M-1 is greater than or equal to 3; wherein the modulation data dl′The modulation scheme of (2) is binary phase shift keying BPSK or Pi/2-BPSK.
In one possible design, the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N +2N value of C0(N +2N) and the filter coefficient C0N + N value of C0(N + N) determination; and/or the 2 nd filter coefficient C2N-th value of C2(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N +2N value of C0(N +2N) and the filter coefficient C0N +3N value of C0(N +3N) determination; and/or the 3 rd path filter coefficient C3N-th value of C3(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) and the filter coefficient C0N +3N value of C0(N +3N) determination; wherein the modulation data dl′The modulation scheme of (3) is Pi/2-BPSK or BPSK. Illustratively, these filter coefficients may be determined by a processor.
In one possible design, the processor is to: according to the modulation data dl′And modulated data d transmitted on time domain symbol l' -1l′-1Obtaining the 1 st modulation data in the M-1 modulation data; wherein M-1 is greater than or equal to1; wherein the modulation data dl′The modulation scheme of (1) is quadrature phase shift keying QPSK or Pi/4-QPSK.
In one possible design, the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) determination; wherein the modulation data dl′The modulation scheme of (1) is Pi/4-QPSK or QPSK. Illustratively, these filter coefficients may be determined by a processor.
In one possible design, the processor is to: for the modulated data dl′,mPerforming phase rotation to obtain rotated dl′,mAccording to d after said rotationl′,mObtaining the data with the length of the mth path being NWherein the modulation data dl′The modulation scheme of (2) is BPSK or QPSK.
In a fourth aspect, a communication apparatus is provided, including: a processor and a memory; the memory is configured to store computer-executable instructions, and when the communication apparatus is running, the processor executes the computer-executable instructions stored by the memory to cause the communication apparatus to perform the data transmission method according to the first aspect or any one of the possible designs of the first aspect.
In a fifth aspect, there is provided a computer-readable storage medium having stored therein instructions, which, when run on a computer, cause the computer to perform the data transmission method of the first aspect or any one of the above possible designs of the above aspect.
A sixth aspect provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the data transmission method of the first aspect described above or any one of the possible designs of the above aspects.
In a seventh aspect, a chip system is provided, where the chip system includes a processor and a communication interface, and is configured to implement the method in the first aspect.
In one possible design, the system-on-chip further includes a memory to store program instructions and/or data. The chip system may be constituted by a chip, or may include a chip and other discrete devices.
For technical effects brought by any design manner of the second aspect to the seventh aspect, reference may be made to the technical effects brought by the first aspect or any possible design of the first aspect, and details are not repeated.
In an eighth aspect, a communication system is provided, where the communication system includes a first communication device and a second communication device, and the first communication device transmits data to the second communication device, and the first communication device may implement the method of the first aspect or the method designed in any of the first aspects. For example, the first communication device is a terminal device, and the second communication device is a network device; or, the second communication device is a terminal device, and the first communication device is a network device.
Drawings
FIG. 1 is a simplified diagram of a system architecture according to an embodiment of the present application;
fig. 2 is a schematic diagram illustrating a communication device according to an embodiment of the present disclosure;
fig. 3 is a flowchart of a data transmission method according to an embodiment of the present application;
fig. 3a is a schematic composition diagram of a filter provided in an embodiment of the present application;
fig. 4a is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 4b is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 4c is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 4d is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 4e is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 4f is a schematic block diagram of a data transmission method according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a PAPR provided in an embodiment of the present application;
fig. 6 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
FIG. 6a is a schematic diagram of filter coefficients provided in an embodiment of the present application;
fig. 7 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 8 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 9 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 10 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 11 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 12 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 13 is a schematic block diagram of a data transmission method according to an embodiment of the present application;
fig. 14 is a schematic composition diagram of a communication device according to an embodiment of the present application.
Detailed Description
Embodiments of the present application will be described in detail below with reference to the accompanying drawings.
The data transmission method provided in the embodiment of the present application may be applied to various communication systems, for example, a 5G communication system, a Long Term Evolution (LTE) system, or a future mobile communication system, and the embodiment of the present application is not limited. Among them, the 5G communication system may also be referred to as a New Radio (NR) system. Fig. 1 shows a communication system applicable to the embodiment of the present application, and the communication system may include a terminal device and a network device, and the terminal device and the network device may transmit data to each other. In embodiments of the present application, transmitting data may include sending data or receiving data. For example, the terminal device may send data to the network device, and the network device may receive the data sent by the terminal; or, the network device sends data to the terminal device, and the terminal device receives the data sent by the network device. When the system shown in fig. 1 includes multiple terminal devices, the multiple terminal devices may simultaneously send data processed by the method provided in the embodiment of the present application to the network device. In this embodiment, the data sent by the terminal device may be any form of data sent by the terminal device to the network device, such as: the data may be Radio Resource Control (RRC) layer data, Media Access Control (MAC) layer data, physical layer data, and the like, which is not limited in the present application. For example, in this embodiment of the present application, when the terminal device sends the data processed by the method provided in this embodiment of the present application to the network device, the processed data may be directly sent, or the processed data may be sent after being processed by other processes, for example, after being processed by other baseband and/or radio frequency, and this application is not limited thereto. Similarly, the data sent by the network device may also be any form of data sent by the network device to the terminal device, and is not described in detail.
Further, the method provided by the embodiment of the present application may also be applied to other scenarios supporting asynchronous transmission besides fig. 1, such as: wireless backhaul scenarios, device to device (D2D) or vehicle networking (V2X) scenarios. For example, in a wireless backhaul scenario, a macro base station and a micro base station may perform data transmission by using the method provided in the embodiments of the present application. In a D2D or V2X scenario, data transmission may be performed between terminal devices by using the method provided in the embodiments of the present application.
When the technical scheme provided by the embodiment of the application is applied to a communication system, the technical scheme can be applied to various access technologies. For example, the present invention can be applied to an Orthogonal Multiple Access (OMA) technology or a non-orthogonal multiple access (NOMA) technology. When the method is applied to the orthogonal multiple access technology, the method may be applied to Orthogonal Frequency Division Multiple Access (OFDMA) or single carrier frequency division multiple access (SC-FDMA), and the like, and the embodiments of the present application are not limited thereto. Illustratively, when the technical scheme provided by the embodiment of the application is applied to the OFDMA or SC-FDMA technology, the technical scheme can be used for data transmission in one subcarrier. When the method is applied to the non-orthogonal multiple access technology, the method may be applied to Sparse Code Multiple Access (SCMA), multiple-user shared access (MUSA), Pattern Division Multiple Access (PDMA), Interleaved Grid Multiple Access (IGMA), resource extended multiple access (RSMA), non-orthogonal code multiple access (NCMA), or non-orthogonal code access (NOCA), and the embodiments of the present application are not limited thereto.
The technical scheme provided by the embodiment of the application can be applied to various scheduling types when applied to a communication system. For example, it can be applied to grant-based scheduling or grant-free-based scheduling. When the method is applied to scheduling based on authorization, the network equipment can send scheduling information to the terminal equipment through dynamic signaling, the scheduling information carries transmission parameters, and the network equipment and the terminal equipment perform data transmission based on the transmission parameters. When the method is applied to the authorization-free scheduling, scheduling information can be preconfigured, or the network equipment can send the scheduling information for the terminal equipment through semi-static signaling, the scheduling information carries transmission parameters, and the network equipment and the terminal equipment perform data transmission based on the transmission parameters. The unlicensed scheduling may also be referred to as non-dynamic scheduling (non-dynamic scheduling), non-dynamic grant (non-dynamic grant), or other names, and the embodiments of the present application are not limited thereto.
In the embodiment of the present application, a terminal device may be referred to as a terminal, the terminal device may be a device with a wireless transceiving function, and the terminal device may be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on the water surface (such as a ship and the like); and may also be deployed in the air (e.g., airplanes, balloons, satellites, etc.). The terminal device may be a User Equipment (UE). Wherein the UE comprises a handheld device, an in-vehicle device, a wearable device, or a computing device with wireless communication capabilities. Illustratively, the UE may be a mobile phone (mobile phone), a tablet computer, or a computer with wireless transceiving function. The terminal device may 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, a wireless terminal in smart grid, a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and so on. In the embodiment of the present application, the apparatus for implementing the function of the terminal may be the terminal, or may be an apparatus capable of supporting the terminal to implement the function, such as a chip system. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a 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.
In this embodiment, the network device may include a Base Station (BS), which may be a device deployed in a radio access network and capable of performing wireless communication with a terminal. The base station may have various forms, such as a macro base station, a micro base station, a relay station, an access point, and the like. For example, the base station related to 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. In this embodiment of the present application, the apparatus for implementing the function of the network device may be a network device, or may be an apparatus capable of supporting the network device to implement the function, for example, a chip system. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a network device is a network device, and the network device is a base station, which is taken as an example, to describe the technical solution provided in the embodiment of the present application.
Specifically, in order to implement the data transmission method provided in the embodiment of the present application, fig. 2 is a schematic composition diagram of a communication device 200 provided in the embodiment of the present application. As shown in fig. 2, the communication device 200 includes at least one processor 201, a communication line 202, and at least one communication interface 203; further, a memory 204 may also be included. The processor 201, the memory 204 and the communication interface 203 may be connected by a communication line 202. In the embodiments of the present application, at least one of the two or more may be one, two, three or more, and the embodiments of the present application are not limited.
In the embodiment of the present application, the processor 201 may be a Central Processing Unit (CPU), a Network Processor (NP), a Digital Signal Processor (DSP), a microprocessor, a microcontroller, a Programmable Logic Device (PLD), or any combination thereof. The processor may also be any other means having a processing function such as a circuit, device or software module.
In the present embodiment, the communication line 202 may include a path for communicating information between components included in the communication device.
In this embodiment, the communication interface 203 is used for communicating with other devices or communication networks (e.g., ethernet, Radio Access Network (RAN), Wireless Local Area Networks (WLAN), etc.). The communication interface 203 may be a module, a circuit, a transceiver, or any device capable of enabling communication.
In the present embodiment, the memory 204 may be a read-only memory (ROM) or other types of static storage devices that can store static information and/or instructions, a Random Access Memory (RAM) or other types of dynamic storage devices that can store information and/or instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.
In one possible design, the memory 204 may exist separately from the processor 201, i.e., the memory 204 may be a memory external to the processor 201, in which case the memory 204 may be connected to the processor 201 via the communication line 202 for storing instructions or program code. The processor 201 can implement the data transmission method provided by the following embodiments of the present application when calling and executing the instructions or program codes stored in the memory 204. In yet another possible design, the memory 204 may also be integrated with the processor 201, that is, the memory 204 may be an internal memory of the processor 201, for example, the memory 204 is a cache memory, and may be used for temporarily storing some data and/or instruction information, and the like.
As one implementation, the processor 201 may include one or more CPUs, such as CPU0 and CPU1 of FIG. 2. As another implementation, the communications apparatus 200 may include multiple processors, such as the processor 201 and the processor 207 of fig. 2. As yet another implementable manner, the communications apparatus 200 can further include an output device 205 and an input device 206. Illustratively, the input device 206 may be a keyboard, mouse, microphone, joystick, or the like, and the output device 205 may be a display screen, speaker (spaker), or the like.
It should be noted that the communication apparatus 200 may be a general-purpose device or a special-purpose device. For example, the communication apparatus 200 may be a desktop computer, a portable computer, a web server, a PDA, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a system-on-a-chip, or a device having a similar structure as in fig. 2. The embodiment of the present application does not limit the type of the communication apparatus 200.
The following describes a data transmission method provided in the embodiment of the present application with reference to the communication system shown in fig. 1.
Fig. 3 is a flowchart of a data transmission method provided in an embodiment of the present application, where the method may be executed by the terminal device shown in fig. 1, or may be executed by the network device shown in fig. 1, which is not limited. The method provided by the embodiment of the present application is described below by taking the method shown in fig. 3 as an example, which is executed by the terminal device.
As shown in fig. 3, the method may include steps 301 to 303:
step 301: for modulated data d transmitted on time domain symbol ll′According to modulated data dl′Get data of length NOr may also be described as: according to modulation data dl′Get data of length NWherein d isl′Is modulated data transmitted on a time domain symbol l', dl′And may also be referred to as modulation data corresponding to the time domain symbol l'. Wherein d isl′Contains a modulated data.
The time domain symbol l 'may be any one of one or more time domain symbols used for data transmission by the terminal device, and l' is a sequence number (or referred to as an index) of the time domain symbol, and may be an integer greater than or equal to 0 or an integer less than 0, without limitation. Taking NR system as an example, when a terminal device transmits data, a slot (slot) may include 14 time domain symbols, when the 14 time domain symbols are numbered from 0, indexes of the 14 time domain symbols are from 0 to 13, and the 14 time domain symbols are respectively: time domain symbol 0, time domain symbols 1, … …, and time domain symbol 13, in this case, time domain symbol l' is assumed to be the 1 st time domain symbol of 14 time domain symbols, and may be time domain symbol 0. When the 14 time domain symbols are numbered from 1, the index of the 14 time domain symbols is from 1 to 14, and the 14 time domain symbols are respectively: time domain symbol 1, time domain symbol 2, … …, time domain symbol 14, where time domain symbol l 'is assumed to be the 1 st time domain symbol of the 14 time domain symbols, time domain symbol l' may be time domain symbol 1. When 14 time domain symbols are numbered from-1, the index of the 14 time domain symbols is from-1 to 12, and the 14 time domain symbols are respectively: time domain symbol-1, time domain symbol 0, time domain symbol 1, … …, and time domain symbol 12, where time domain symbol l 'is the 1 st time domain symbol of the 14 time domain symbols, and time domain symbol l' may be time domain symbol-1.
The time domain symbol l 'may also be any one of time domain symbols included in multiple slots or multiple subframes (subframes), that is, the value range of the time domain symbol l' spans multiple slots or multiple subframes. Taking NR system as an example, when the subcarrier interval is 15KHz, 1ms includes 1 timeslot, that is, 14 time domain symbols, and the value range of l 'may be 0 to 13, that is, l' may be any integer value between 0 and 13; when the subcarrier interval is 30kHz, 2 slots, that is, 28 time domain symbols are included in 1ms, and then, the value of l 'may range from 0 to 27, that is, l' may be any integer value between 0 and 27.
Modulated data d transmitted on time domain symbol ll′Can be obtained by the following steps: modulating a bit stream comprising one or more bits by adopting a certain modulation mode to obtain one or more complex symbols, mapping the obtained one or more complex symbols to one or more time domain symbols in a one-to-one way, wherein the complex symbols mapped to the time domain symbols l' are modulation data d transmitted on the time domain symbols ll′. The bit stream may be obtained by various processing methods, such as: the original bit stream may be encoded, interleaved, scrambled, etc. to obtain the bit stream. The original bit stream may be obtained according to a service to be sent by the terminal device, which is not limited in this embodiment of the present application.
In the embodiment of the present application, the modulation scheme may be Binary Phase Shift Keying (BPSK) modulation, Pi/2-BPSK modulation, Quadrature Phase Shift Keying (QPSK) modulation, or Pi/4-QPSK modulation. The modulation scheme may be configured in advance, and when the method shown in fig. 3 is executed by the terminal device, the modulation scheme may also be configured to the terminal device by the network device through signaling. In the embodiment of the present application, data mapped to a time domain symbol after BPSK modulation may be referred to as BPSK modulated data, data mapped to a time domain symbol after Pi/2-BPSK modulation may be referred to as Pi/2-BPSK modulated data, data mapped to a time domain symbol after QPSK modulation may be referred to as QPSK modulated data, and data mapped to a time domain symbol after Pi/4-QPSK modulation may be referred to as Pi/4-QPSK modulated data.
In the embodiment of the present application, 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 Medium Access Control (MAC) Control Elements (CEs). The broadcast message may include a Remaining Minimum System Information (RMSI). The dynamic signaling may be physical layer signaling. The 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 (PDSCH). The physical control channel may be a Physical Downlink Control Channel (PDCCH), an Enhanced Physical Downlink Control Channel (EPDCCH), a Narrowband Physical Downlink Control Channel (NPDCCH), or a machine type communication physical downlink control channel (MTC) MPDCCH. The signaling carried by the PDCCH or EPDCCH may also be referred to as Downlink Control Information (DCI). The physical control channel may also be a physical sidelink control channel (physical sidelink control channel), and signaling carried by the physical sidelink control channel may also be referred to as Sidelink Control Information (SCI).
Since one time domain symbol transmits one modulation data, the modulation scheme may refer to a characteristic that a configured modulation scheme is satisfied between modulation data transmitted by different time domain symbols. For example, in the case of Pi/2-BPSK modulation, it is characterized in that the amplitudes between two adjacent modulation data points are the same, and the phases are different by 90 degrees or 270 degrees, so if the modulation data transmitted on time domain symbol 0 is 1, the modulation data transmitted on time domain symbol 1 may be j or-j, the modulation data transmitted on time domain symbol 2 may be 1 or-1, that is, the phases between the modulation data transmitted on two adjacent time domain symbols in time domain symbol 0, time domain symbol 1, and time domain symbol 2 are different by 90 degrees or 270 degrees, which satisfies Pi/2-BPSK modulation.
In step 301, N is an integer greater than or equal to 1, and a value of N may be determined according to a length of time domain data transmitted on the time domain symbol l', for example: n is equal to the length of the time domain data transmitted on the time domain symbol l'. The length of the time domain data transmitted on the time domain symbol l' may be configured in advance, for example: may be configured as 2048. When performed by the terminal device as shown in fig. 3, the length of the time domain data transmitted on the time domain symbol l' may also be configured to the terminal device by the network device through signaling.
Illustratively, data of length N may be obtained by repetition, or repetition, phase rotationWherein, repetition may refer to: to modulated data dl′Obtaining data with the length of N after N times of repetitionSuch as:middle nth data
When data of length N is obtained by repetitionWhen the temperature of the water is higher than the set temperature,whereinIs composed ofThe nth data of (1).
When data with length of N is obtained through repetition and phase rotationThe phase rotation may mean: data with length NEach data d in (1)l′Multiplied by a phase factorTo a length NOr, may be described as being dependent on a phase factorTo dl′Performing phase rotation to obtainMiddle nth dataSuch as:
Wherein alpha isnWherein N is an integer ranging from 0 to N-1, alphanIs used to obtainThe phase of the nth data.
Alternatively, α can be determined from n and knSuch as: alpha is alpha n2 pi × N × k/N. Wherein k may be preconfigured; when the method shown in fig. 3 is executed by a terminal device, the network device may also configure k to the terminal device through signaling. In the embodiment of the present application, k configured by the network device to different terminal devices may be different or the same. When alpha isnWhen the length is 2 pi × N × k/N, the data with the length of N is storedEach data d in (1)l′Multiplied by a phase factor ej2π×n×k/NEquivalent to modulating data dl′Mapping to a subcarrier with a subcarrier index of k (simply referred to as subcarrier k), where data on other N-1 subcarriers is 0, and then performing IFFT on the data on the N subcarriers:when k is equal to k', the first step is,when k is not equal to k', the first step is carried out,in contrast, as an inverse process of the IFFT transform, if data of length N is to be processedFFT is carried out to convert the data into frequency domain data, and the data with the index k in the obtained frequency domain data is dl′And the data of the remaining indexes is 0. In this way, when k configured by different terminal devices is different, data transmitted by different terminal devices on the same time domain symbol may be mapped to different subcarriers, that is, different terminal devices are frequency-divided in frequency domain resources.
Optionally, α can also be determined according to n, k and the phase offsetnWherein the phase shift amount can be A or AkA is a real number, e.g., A can beFixed constants such as: a may be 1/2 or 1. As another example, a may be preconfigured; when the method shown in fig. 3 is executed by a terminal device, a may also be configured to the terminal device by a network device through signaling, and a assigned by different terminal devices may be the same or different. Exemplarily, AkCan be determined from k, such as: by expression AkDetermining A as A.kkA is as described above and is not described again; a. thekMay also be pre-configured; when the method shown in fig. 3 is performed by a terminal device, akOr A allocated to different terminal equipment by the network equipment configured to the terminal equipment through signalingkMay be the same or different.
Exemplaryly,when A is an integer, data with the length of N is addedEach data d in (1)l′Multiplied by a phase factor ej2π×n×(k+A)/NEquivalent to modulating data dl′And mapping to the subcarrier of the subcarrier k + A for transmission, wherein the data on the remaining N-1 subcarriers is 0. In this way, when k configured by different terminal devices is different, data transmitted by different terminal devices on the same time domain symbol may be mapped to different subcarriers, that is, different terminal devices are frequency-divided in frequency domain resources. Or,
exemplaryly,Akwhen a is an integer, data of length N is addedEach data d in (1)l′Multiplied by a phase factorEquivalent to modulating data dl′Mapping to subcarrier index k + AkThe data on the remaining N-1 subcarriers is 0. Thus, when different terminal devices are configured with AkThe same, different k, the data transmitted by different terminal equipments on the same time domain symbol can be mapped to different subcarriers, i.e. different terminal equipments are frequency-divided in frequency domain resource, and at the same time, because a is differentkThe degree of shifting the sub-carrier k by each terminal device is increased with the increase of k, which is a multiple of k, so that the corresponding A can be adoptedkAnd adjusting the interval between the frequency domain positions mapped by different terminal equipment by taking values, namely adjusting the frequency domain bandwidth size of a guard band of the terminal equipment.
For example: assuming that terminal device 1 assigns k as 1 and terminal device 2 assigns k as 3, a is 1, and if phase factor e is adoptedj2π×n×(k+A)/NRotating the modulated data of each terminal device, so that the modulated data of terminal device 1 can be mapped onto subcarrier 2, and the modulated data of terminal device 2 can be mapped onto subcarrier 4, at this time, terminal device 1 and terminal device 2 are separated by 2 subcarriers; if phase factors are usedRotating the modulated data of each terminal device, AkWhen the modulation data of terminal 1 is mapped to subcarrier 2 and the modulation data of terminal 2 is mapped to subcarrier 6, terminal 1 and terminal 2 may be separated by 4 subcarriers, which increases the separation between the frequency positions mapped by the two.
In the above implementation, the repeating and phase rotating operations are expressed in a discrete manner (i.e., discrete expressions), and alternatively, the output data of each operation, such as the repeating and phase rotating operations, may also be obtained in a continuous manner (i.e., continuous expressions). When the output data of each operation is obtained in a continuous representation mode, a discrete index (such as N) in a discrete expression can be replaced by a continuous index T, and a discrete data length N can be replaced by a time length T, wherein T is N × Ts. In the examples of the present application, TsThe time unit factor can be predefined or configured to the terminal by the network equipment through signalingAn apparatus. For example, when the subcarrier spacing is 15kHz and N is 2048, TsThe value of (1) is 1/(15X 1000X 2048). E.g. repeatedly operated output dataData of the t-th time point ofCan be expressed as:t is more than or equal to 0 and less than T. Output data of phase rotation operationData of the t-th time point ofCan be expressed as:
wherein, optionally, αtMay be alpha t2 pi × T × k/T, or α t2 pi × T × (k + a)/T, or αt=2π×t×(k+Ak)/T。
It can be known thatTo pairAnd alphatWhen discrete sampling is performed, the result obtained is in the form of discrete representation as described aboveAnd alphanAre consistent.
Step 302: according toObtaining data s transmitted on a time domain symbol ll,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) is
Wherein k1 is an integer of 0 or more, and k2 is an integer of k1 or more.
C0Is a filter coefficient (alternatively called filter coefficient C)0) Coefficient of filter C0The total number of coefficient values in (1) may be L0X N, filter coefficient C0Total number L of coefficient values in0Xn can also be referred to as the filter length, where L0Is an integer, L0The terminal device may be pre-configured by the network device. Such as L0Xn 8192 denotes the filter coefficient C0Comprising 8192 coefficient values.
C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value in (1). Optionally, the values of k2-k1 may be related to the filter length L0In x N0The values of (a) are related, such as: k2-k1 ═ L0-1. Optionally, k2 may take the value of L, and k1 ═ L- (L)0-1); alternatively, k1 may take the value L, k2 ═ L + (L)0-1); alternatively, k1 and k2 are not limited to l.
The offset is an offset value, which is pre-configured or may be configured by the network device through signaling for the terminal. The offset may be an integer greater than or equal to 0. Optionally, the offset is l × N or
C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value in (1).Corresponding to the n data of k2-k1+ 1 time domain symbols and corresponding filter coefficientsAnd multiplying and adding the multiplied results to obtain the nth data transmitted on the time domain symbol l.
For example, assume that the offset is L × N, k2 is L, and k1 is L- (L)0-1) thenI.e. the nth data of the time domain symbol L and the L preceding the time domain symbol L0-multiplying the nth data of 1 time domain symbol by the corresponding filter coefficients and adding the multiplied results to obtain the nth data transmitted on the time domain symbol l. Specifically, the process may be implemented by the filter shown in fig. 3 a:
as shown in FIG. 3a, a filter designed for the embodiments of the present application has a length L0X N, filter coefficient C0(n),n=0,1,2,...,L0×N-1,Z-NMainly for delaying the input data by N. Since each time domain symbol is of length N, the symbol, therefore,through a Z-NThe latter data areThrough 2Z -N3, Z-N、…….、l-(L0-1) Z-NThe latter data areWill be provided with Filter coefficient C corresponding thereto0(n)、C0(n+N)、C0(n+2N)、…...…C0(n+(L0-1) N) dot-multiplied, summed and combined to obtain filtered data sl,0(n) of (a). For example, assume a filter length L0L in XN0For a time domain symbol of 4Data corresponding to No. 3The data after being filtered by the filter shown in fig. 3a can be represented as:
similarly, the discrete representation used in the filtering operation of step 302 may be replaced by a continuous representation. E.g. sl,0Data s at the t-th timel,0(t) can be expressed as:
wherein C is0(T + offset-l' x T) is C0The T + offset-l' x T time point. Alternatively, the offset may be l × T orIt can be known thatTo sl,0(t) when discrete sampling is performed, the result is obtained in the discrete representation s as described abovel,0(n) is uniform.
In the embodiment of the present application, when data d is modulatedl′Filter coefficient C for Pi/2-BPSK modulation data0May be derived from the main component (or may also be referred to as the main filter) of the Laurent decomposition. Length L of filter0XN can be expressed as (L +1) XN, i.e., L0L +1, wherein C0(n) is:
where h is a real number, e.g., h-1/2. g (n) may be a linear response, a gaussian response, or other response, and the embodiments of the present application are not limited thereto. For example, when g (n) is a square window response (rectangle pulse), g (n) can be expressed as:
wherein C is0(n) and g (n) are in discrete representations. Alternatively, the filter coefficients C may be represented in a continuous representation0. Exemplarily, the filter coefficient C0The successive representation of (c) is:
g (t) can be expressed as:
wherein T is NXTs,TsIs a time unit factor, TsThe configuration may be predefined or may be configured by the network device to the terminal device by signaling. For example, when the subcarrier spacing is 15kHz and N is 2048, TsThe value of (1) is 1/(15X 1000X 2048). It can be known thatTo C0(t) results obtained in discrete sampling with C0(n) is uniform.
When modulating data dl′For Pi/4-QPSK modulated data, the filter coefficient C0Which may be the Main Component (or Main filter) of the nonmberto Mengali decomposition, the filter coefficient C0Can be formed by filter coefficientsDetermine, p is 0,1, i.e.: filter coefficient C0N-th value of C0(n) according to filter coefficientsN value ofAnd filter coefficientsN value ofDetermining:
h(p)=2ph, h is a real number, h may be a predefined value. Illustratively, h is 1/4. I.e. when the time domain symbol l' correspondsThe filter coefficient C corresponding to the time domain symbol l' when obtained from Pi/4-QPSK modulated data0Can be determined by g (N) and N.
In a similar manner, the first and second substrates are,andor may be represented in a continuous representation. Exemplaryly,andthe successive representation of (c) is:
wherein, the description of T and T can refer to C0(t) description of referenceAnd will not be described herein.
Step 303: transmitting data sl,0。
Transmitting s on a time domain symbol ll,0. Accordingly, the network device receives s on the time domain symbol ll,0。
In the scheme shown in fig. 3, s is sentl,0When the Cyclic Prefix (CP) is not added, the length of each time domain symbol is N. When the filtering mode provided by the embodiment of the application is adopted for filtering operation, the input data of the filtering operationAfter delaying N length, the corresponding N-th data of the previous time domain symbol After delaying N length, the corresponding N-th data of the previous time domain symbolBy analogy, k2-k1+ 1 time domain symbols (i.e., L)0Time domain symbols), the nth data point of k2-k1+ 1 time domain symbols is multiplied by the corresponding filter coefficient and then added and combined to obtain the nth data transmitted on the time domain symbol L, for example, the nth data transmitted on the time domain symbol L and the L0-the nth data correlation of 1 other time domain symbol, which may guarantee the correlation and continuity of the data transmitted on the different time domain symbols. Since OOB performance is mainly related to correlation and continuity between data transmitted on different time domain symbols, the filtering manner for ensuring correlation and continuity between data transmitted on different time domain symbols as described in fig. 3 can reduce OOB of transmitted data. Meanwhile, compared with the existing method of performing linear convolution on the time domain data corresponding to the time domain symbol and the filter to reduce OOB, the filtering method provided by the embodiment of the application is adopted to obtain sl,0The n-th one ofIn the case of data, the number of multiplications used is small, and therefore, the transmission data s obtained by using the filtering method provided in the embodiment of the present application is usedl,0The PAPR of is lower.
Optionally, in order to ensure that the frequency domain resources of different terminal devices are frequency-divided, data with length N is obtained by repeating in step 301In the case of (3), step 303 transmits data sl,0The method can comprise the following steps: for data sl,0Performing phase rotation to obtain data with length of NSending
Wherein, for data sl,0Performing phase rotation to obtain data with length of NThe method can comprise the following steps: data s of length Nl,0Each data s inl,0(n) multiplied by a phase factorTo a length NWherein the phase factorAs described in step 301, further description is omitted.
The method shown in fig. 3 will be described with reference to the block diagrams shown in fig. 4a to 4 c.
Fig. 4a is a schematic block diagram of a data transmission method provided in an embodiment of the present application, and as shown in fig. 4a, the process of sending data includes: modulated data d to be transmitted on a time domain symbol ll′Repeating for N times to obtain the number with the length of NAccording to
transmitting data sl,0。
Alternatively, it can also be described that the modulated data d transmitted on the time domain symbol l' isl′Repeating, phase rotating and filtering to obtain data s with length Nl,0Sending data sl,0。
The repetition, the phase rotation, the filtering, the phase factor, and the like may be described with reference to the embodiment corresponding to fig. 3, and are not described again. The repetition, phase rotation, and filtering operations in fig. 4a may also be represented in a continuous representation manner, and specifically refer to the implementation in the embodiment shown in fig. 3, which is not described herein again. Therefore, the data to be sent can be mapped to Resource Elements (REs) in the time-frequency resource through repetition and phase rotation, and OOB of the data to be sent is reduced through filtering, so that low OOB transmission of the data to be sent is realized.
It should be noted that, in the embodiment of the present application, a constant N may also be multiplied in the repeating operationscaleTo adjust the modulated data dl′Such as:wherein N isscaleIs a real number, NscaleMay be a predefined value or may be configured to the terminal device by the network device through signaling. In particular, N scale1 is equivalent to modulating data dl′No power adjustment is performed.
Since the repetition, phase rotation in fig. 4a above may be equivalent to modulating data dl′Mapping to the kth subcarrier or other subcarriers with a certain offset from the k subcarrier, and performing IFFT on the data on the N subcarriers, where the data on the other N-1 subcarriers is 0. So, alternatively, the modulated data d transmitted on the time domain symbol l' in fig. 4al′Performing repetition, phase rotation, may be equivalent to transmitting modulated data d on time domain symbols ll′And performing frequency domain resource mapping and IFFT. Specifically, the implementation process is shown in fig. 4 b.
FIG. 4b provides an illustration of an embodiment of the present applicationAs shown in fig. 4b, the process of sending data includes: modulated data d to be transmitted on a time domain symbol ll′Performing frequency domain resource mapping to obtain data with length of NWherein the data d is modulatedl′The data mapped on the subcarrier k is 0, and the data on the other N-1 subcarriers except the subcarrier k is:
wherein k' is an index number corresponding to the subcarrier and is an integer with a value range of 0 to N-1.
transmitting data sl,0。
Alternatively, it can also be described that the modulated data d transmitted on the time domain symbol l' isl′Performing frequency domain resource mapping, IFFT and filtering to obtain data s with length Nl,0Sending data sl,0。
The description of k may refer to that in step 301, and is not repeated.
Similar to the way of mapping the modulated data to the subcarriers in step 301, the modulated data d may also be mapped by frequency domain resource mapping in fig. 4bl′Other sub-carriers (e.g., sub-carrier k + A or sub-carrier k + A) that are mapped to offset sub-carrier k by a certain distancek) Wherein A, AkThe related description in step 301 may refer to that in step 301, and is not repeated.
The output data from the IFFT in the implementation of fig. 4b may also be represented in a continuous representation. For example, IFFT-transformed output dataData of the t-th timeCan be expressed as:
wherein T is more than or equal to 0 and less than T.
The output data of the filtering operation may likewise be represented in a continuous representation. E.g. sl,0Data s at the t-th timel,0(t) can be represented asAlternatively, the offset may be l × T orTo be provided withTo pairsl,0(t) when discrete sampling is performed, the results obtained and the results in the form of discrete representationssl,0(n) is uniform.
It should be noted that the IFFT transformation operation may be multiplied by a constant NscaleTo adjust dl'×ej2π×k×n/NSuch as:wherein N isscaleMay be a predefined value or may be configured to the terminal device by the network device through signaling. In particular, N scale1 is equivalent to dl'×ej2π×k×n/NNo power adjustment is performed.
It should be noted that in the embodiment of the present application, IFFT is only an implementation manner of inverse fourier transform, and other possible implementations are not excluded. Illustratively, the IFFT may also be an Inverse Discrete Fourier Transform (IDFT).
Therefore, the data to be sent can be subjected to frequency domain resource mapping and IFFT to obtain time domain data, and the time domain data is filtered to reduce OOB, so that low OOB transmission of the data to be sent is realized.
In the embodiment of the present application, the order of mapping and filtering the frequency domain resources may be as shown in fig. 4a, or filtering may be performed first, and then the position of the frequency domain resources mapped by the modulation data is equivalently adjusted through phase rotation operation, which is not limited. For example, fig. 4c is a schematic block diagram of another data transmission method provided in the embodiment of the present application, and as shown in fig. 4c, the process of sending data includes: modulated data d to be transmitted on a time domain symbol ll′Obtaining data with the length of N after N times of repetition
Alternatively, it can also be described that the modulated data d transmitted on the time domain symbol l' isl′Repeating, filtering and phase rotating to obtain data with length NTransmitting data
The operations of repetition, phase rotation, and the like can be described with reference to the embodiment corresponding to fig. 3, and are not described again. Therefore, the data to be sent can be mapped to the time domain symbol through repeated operation, the data on the time domain symbol is filtered to reduce the OOB of the data, and the filtered data is mapped to the corresponding frequency domain resource position through phase rotation to be sent.
Fig. 4a to 4c may be applicable to various scenarios, such as: the method can be applied to a scenario in which the modulated data is BPSK modulated data or Pi/2-BPSK modulated data or QPSK modulated data or Pi/4-QPSK modulated data. In particular modulated data dl′When the modulated data is applied to the method provided by the embodiment of the application, the probability of the homonymy addition can be reduced when the filtering operation is performed, so that the transmitted data s can be ensuredl,0The PAPR performance is better.
As can be seen from the above, data d is modulatedl′Pi/2-BPSK modulated data or Pi/4-QPSK modulated data can ensure that the transmitted data has good PAPR performance. Therefore, in order to make the transmitted data have good PAPR performance, it is optional when modulating the data dl′When the data is BPSK modulated data, the Pi/2-BPSK modulated data may be obtained by performing modulation data phase rotation on the BPSK modulated data. When modulating data dl′When the data is QPSK modulated, the QPSK modulated data can be subjected to modulation data phase rotation to obtain Pi/4-QPSK modulated data. Repeating, phase rotating and filtering the Pi/2-BPSK modulation number or the Pi/4-QPSK modulation data after the modulation data phase rotation to obtain the transmission numberAccording to sl,0(ii) a Or repeating, filtering and phase rotating the Pi/2-BPSK modulation number or Pi/4-QPSK modulation data after the modulation data phase rotating to obtain the transmission data sl,0(ii) a Or, the transmission data s is obtained by performing frequency domain resource mapping, IFFT and filtering on the Pi/2-BPSK modulation number or the Pi/4-QPSK modulation data after the modulation data phase rotationl,0. Specifically, the implementation process can be illustrated with reference to fig. 4d to 4 f.
Fig. 4d is a schematic block diagram of another data transmission method provided in the embodiment of the present application, and as shown in fig. 4d, the process of sending data includes: modulated data d transmitted on time domain symbol ll′For BPSK or QPSK modulated data, the modulated data d transmitted on the time-domain symbols ll′Performing phase rotation of the modulated data, i.e. dl'Multiplying by a modulation data phase factorTo obtain
Wherein,for rotating modulated data dl′The phase factor of (2). When modulating data dl'When the data is modulated for BPSK,modulating data for Pi/2-BPSK, e.g.OrOrOrWhere mod represents the modulo operation. When modulating data dl'In the case of modulating data for QPSK,for Pi/4-QPSK modulating data, e.g.OrOrOrOrOrIt should be noted that, in the embodiment of the present application, the phase factorOther possible implementations are not excluded.
The process of repeating, phase rotating, and filtering shown in fig. 4d is the same as that in fig. 4a, and is not repeated.
Fig. 4e is a schematic block diagram of another data transmission method provided in the embodiment of the present application,as shown in fig. 4e, the process of sending data includes: modulated data d transmitted on time domain symbol ll′For BPSK or QPSK modulated data, the modulated data d transmitted on the time-domain symbols ll′Performing phase rotation on the modulated data to obtain
To pairCarrying out frequency domain resource mapping, IFFT and filtering to obtain sending data sl,0Sending data sl,0。
The process of modulating data phase rotation shown in fig. 4e can refer to the process of modulating data phase rotation in fig. 4d, and is not described again. The frequency domain resource mapping, IFFT, and filtering shown in fig. 4e are the same as those in fig. 4b, and are not described again.
Fig. 4f is a schematic block diagram of another data transmission method provided in the embodiment of the present application, and as shown in fig. 4f, the process of sending data includes: modulated data d transmitted on time domain symbol ll′For BPSK or QPSK modulated data, the modulated data d transmitted on the time-domain symbols ll′Performing phase rotation on the modulated data to obtain
The process of modulating data phase rotation shown in fig. 4f can refer to the process of modulating data phase rotation in fig. 4d, and is not described again. The repetition, filtering, and phase rotation shown in fig. 4f are the same as those in fig. 4c, and are not described again.
In practical applications, a communication device (e.g., a terminal device or a network device) may amplify a data signal via a power amplifier and transmit the amplified data signal. Since the performance of Power Amplifiers (PAs) of different communication apparatuses is different, in a case where the linear relationship between the input and the output of the PAs of the communication apparatuses is not so good, the higher the PAPR of data transmitted by the communication apparatuses, the more severe the distortion received when the data passes through the PAs, and the greater the influence on the OOB performance of the transmitted data. Therefore, in order to ensure low OOB performance of the data after passing through the PA, the data sent in the embodiment of the present application may also have low PAPR performance. In order to achieve low PAPR performance of transmitted data, the scheme shown in fig. 3 may further include:
according to modulation data dl′Obtaining M-1 modulation data, wherein M-1 is an integer greater than or equal to 1;
for M modulated data d in M-1 modulated datal′,mAccording to modulated data dl′,mObtaining the data with the length of the mth path being NWherein M is an integer with a value range of 1 to M-1;
according toObtaining the mth output data sl,mWherein s isl,mHas a length of N, sl,mThe nth data sl,m(n) is Is composed ofN-th data, Cm(N + offset-l' xN) is the mth filter coefficient CmThe N + offset-l' x N value of (a);
according to sl,0And sl,mObtaining combined output data s with length NlSending sl. Such as:wherein s isl(n) is slThe nth data. I.e. output data s for the 0 th pathl,0With other multiplexed output data sl,mAre combined together to obtain output data sl。
According to modulation data dl′,mObtaining the data with the length of the mth path being NReference may be made to the above-mentioned modulated data dl′,0Get data of length NSuch as: will modulate data dl′,mObtaining the data with the length N of the mth path through repetition or repetition and phase rotationTo modulated data dl′,mThe process of phase rotation and the modulation data d in step 301l′The process of performing phase rotation is the same, and may be: according to the phase factorTo dl′,mPerforming phase rotation to obtainThe nth data is not described again.
It should be noted that, in the above implementation, the mth output data s is outputl,mOr may be represented in a continuous representation. E.g. sl,mData s at the t-th timel,m(t) isWherein, Cm(T + offset-l' x T) is the mth filter coefficient CmThe T + offset-l' x T time point.
According to sl,0And sl,mObtain merged output data sl,slData s at the t-th timel(t) may beIllustratively, toTo sl,m(t) and sl(t) when discrete sampling is performed, the results obtained are respectively compared with the result s in the form of discrete representationl,m(n) and sl(n) is uniform.
When to modulated data dl′,mRepeating to obtain the data with the length of the mth path being NAccording to sl,0And sl,mObtaining combined output data s with length NlThe method can comprise the following steps: to sl,0、sl,mPerforming phase rotation to obtain a rotatedAccording to after rotationAnd after rotationObtaining combined output data s with length Nl(ii) a Or, for data slPerforming phase rotation to obtain data with length of NSendingWherein the phase rotation process can refer to s in step 303l,0The process of phase rotation is not described in detail.
According toObtaining the mth output data sl,mCan refer to the above step 302 according toObtaining data sl,0The process of (2) is not described in detail.
Optionally, the value of M may be a predefined value; when the method shown in the embodiment of the present application is executed by a terminal device, the value of M may also be configured to the terminal device by a network device through signaling; or, the terminal device performs setting according to needs, without limitation. Optionally, M is 1, or 2, or 3.
Optionally, in this embodiment of the present application, the modulation data d is used as the basisl′The process of obtaining M-1 modulated data may be referred to as modulated data preprocessing. Exemplarily, the m-th modulated data dl′,mCan be based on modulated data d transmitted on time domain symbols ll'And modulated data transmitted on one or more time domain symbols preceding the time domain symbol l'. Such as: when modulating data dl′When the corresponding modulation mode is BPSK modulation or Pi/2-BPSK modulation, the modulation data d is usedl′Obtaining M-1 modulated data, which may include:
according to modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -2l′-2Obtaining the 1 st modulation data d in the M-1 modulation datal′,1Wherein M-1 is greater than or equal to 1; and/or the presence of a gas in the gas,
according to modulation data dl′Modulated data d transmitted on time domain symbols l' -2l′-2And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 2 nd modulation data d in the M-1 modulation datal′,2Wherein M-1 is greater than or equal to 2; and/or the presence of a gas in the gas,
according to modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 3 rd modulation data d in the M-1 modulation datal′,3Wherein M-1 is greater than or equal to 3.
Optionally, when modulating data dl′When the corresponding modulation method is QPSK modulation or Pi/4-QPSK modulation, the modulation method is based on the modulation data dl′Obtaining M-1 modulated data, which may include:
according to modulation data dl′And modulated data d transmitted on time domain symbol l' -1l′-1And obtaining the 1 st modulation data in the M-1 modulation data, wherein M-1 is greater than or equal to 1.
Optionally, the mth filter coefficient CmFrom C0Some of which are determined. Illustratively, when modulating data dl′When the corresponding modulation mode is Pi/2-BPSK modulation or BPSK modulation, the 1 st path filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) Filter coefficient C0N +2N value of C0(N +2N) and filter coefficient C0N + N value of C0(N + N) determination; and/or the presence of a gas in the gas,
When modulating data dl′When the corresponding modulation mode is Pi/4-QPSK modulation or QPSK modulation, the 1 st path filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) Filter coefficient C0N + N value of C0(n+N) determining. Or,
when modulating data dl′When the modulation method of (1) is Pi/4-QPSK or QPSK, the filter coefficient C0N-th value of C0(n) according to filter coefficientsN value ofAnd filter coefficientsN value ofDetermining; and/or the presence of a gas in the gas,
Thus, the data sent by the time domain symbol can be obtained by combining the multiple paths of data. Because the modulation data and the filter coefficient corresponding to the mth path are respectively generated by the modulation data and the filter coefficient corresponding to the 0 th path, the time domain data corresponding to the mth path after the multi-path data are combined can depress the higher peak point of the time domain data corresponding to the 0 th path, improve the lower peak point of the time domain data corresponding to the 0 th path, and make the fluctuation of the amplitude of each data point of the combined time domain data tend to be stable, so the data obtained after the multi-path data are combined has the performance of low PAPR. It should be noted that, in the embodiment of the present application, the larger the value of M is, the lower the PAPR of the merged data may be, that is, the larger the number of paths of the merged data is, the lower the PAPR of the merged data may be.
For example, as shown in fig. 5, a PAPR diagram of data obtained by combining multiple paths of data is shown, wherein an ordinate axis in fig. 5 represents a Complementary Cumulative Distribution Function (CCDF), an abscissa axis represents a PAPR, and (i) corresponds to Pi/2-BPSK modulation, and one path of generated data is used as transmission data; correspondingly, Pi/2-BPSK modulation is adopted, and 2 paths of data are combined to obtain sending data; corresponding to the Pi/4-QPSK modulation, taking the generated path of data as sending data; and fourthly, combining the 3 paths of data correspondingly by adopting Pi/4-QPSK modulation to obtain the sending data. As can be seen from fig. 5, when Pi/2-BPSK modulation is adopted, the PAPR of the transmitted data obtained by combining 2 channels of data has a gain of 1dB as compared with the PAPR of the transmitted data obtained by using one channel of data; when Pi/4-QPSK modulation is adopted, the PAPR of the transmitted data obtained by combining 3 paths of data has 2dB gain compared with the PAPR of the transmitted data which is one path of data.
The following describes the above-described scheme with reference to fig. 6 to 13, taking an example of obtaining transmission data by combining 4-path data. Note that, the process of obtaining the transmission data by combining the multiple paths of data except for 4 paths may be described with reference to fig. 6 to 13.
Fig. 6 is a schematic block diagram of a data transmission method according to an embodiment of the present application, where as shown in fig. 6, the processing includes:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain 0 th path data sl,0;
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain the 1 st path data sl,1(ii) a Wherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain 2 nd data sl,2(ii) a Wherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain 3 rd path data sl,3(ii) a Wherein s isl,3Middle nth data Is composed ofThe n-th one ofData, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging to obtain output data slI.e. slNth data:
sl(n)=sl,0(n)+sl,1(n)+sl,2(n)+sl,3(n);
it should be noted that k is adopted in each data filtering2、k1May be different or the same, and is not limited. K for each path of data during filtering2To k1The value range of (a) is related to the length of the filter coefficient of the local path, such as: the 1 st data is k during filtering2-k1Equal to the 1 st filter coefficient C1Length L of1-1。
The specific implementation process of the repetition, the phase rotation, and the filtering in fig. 6 can be shown in fig. 4a, and is not described again.
The filtered output data from lanes 1 to 3 of fig. 6 may be represented in a continuous representation. E.g. for the 1 st data sl,1(ii) a Wherein s isl,1The data at the tth moment are:
wherein C is1(T + offset-l' x T) is C1The T + offset-l' x T time point.
For 2 nd data sl,2(ii) a Wherein s isl,2The data at the tth moment are:
For data s of way 3l,3(ii) a Wherein s isl,3To middlethe data at t moments are:
wherein C is3(T + offset-l' x T) is C3The T + offset-l' x T time point.
Will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging to obtain output data sl,slThe data at the tth moment are:
sl(t)=sl,0(t)+sl,1(t)+sl,2(t)+sl,3(t);
to be provided withTo sl,0(t),sl,1(t),sl,2(t),sl,3(t) and sl(t) when discrete sampling is performed, the results obtained are respectively compared with the result s in the discrete representation forml,0(n),sl,1(n),sl,2(n),sl,3(n) and sl(n) is uniform.
When modulating data dl'When data is modulated for Pi/2-BPSK, in one possible design, data d is modulatedl′Modulated data d is obtained through modulated data preprocessingl′,1Comprises the following steps:
dl',1=-dl'×dl'-1/dl'-2
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Comprises the following steps:
dl',2=-dl'×dl'-2/dl'-3
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Comprises the following steps:
dl',3=-dl'×dl'-1/dl'-3
in yet another possible design, data d may be modulatedl′Modulated data d is obtained through modulated data preprocessingl′,1Comprises the following steps:
dl',1=dl'×dl'-2/dl'-1
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Comprises the following steps:
dl',2=dl'×dl'-3/dl'-2
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Comprises the following steps:
dl',3=dl'×dl'-3/dl'-1。
when modulating data dl'When Pi/2-BPSK modulates data, data d is modulatedl′,1、dl′,2、dl′,3Is modulated data d transmitted on a time domain symbol ll'And modulated data transmitted on a number of time domain symbols preceding the time domain symbol l'. It should be noted that the modulation data d is determinedl′,1、dl′,2、dl′,3Including but not limited to the two possible designs, for example, the expression obtained from the equivalence of the two implementations is also within the protection scope of the embodiments of the present application.
When modulating data dl'When Pi/4-QPSK modulated data is generated, the modulated data d corresponding to each path of datal′,1、dl′,2From dl'And dl'-1And (4) determining. Next, the following description will be given taking an example of specifying modulation data corresponding to the 1 st data and the 2 nd data. For example, modulation data d of the 1 st datal′,1Can be expressed as dl',1=dl'·βl',1Modulation data d of 2 nd datal',2Can be expressed as dl',2=dl'·βl',2Wherein, βl',1、βl',2From dl'/dl'-1Determination of dl'/dl'-1There are 4 possible values.
In one possible design, βl',1、βl',2And dl'/dl'-1There is a correspondence between them. As shown in Table 1 as betal',1、βl',2And dl'/dl'-1The corresponding relation between d can be determined by looking up table 1l'/dl'-1Is taken to correspond to betal',1And betal',2From the determined betal',1And betal',2Determination of dl′,1、dl′,2。
TABLE 1
In yet another possible design, βl',1、βl',2Can be expressed by the following formula:
wherein (d)l'/dl'-1)*Represents a pair dl'/dl'-1And (6) solving conjugation operation.
Optionally, when modulating data dl'For Pi/2-BPSK modulated data, the 1 st filter coefficient C1The nth value of (a) is:
optionally, filter coefficient C1Has a length of (L)0-2) x N, filter coefficient C2(n) has a length of (L)0-3) xN, filter coefficient C3(n) has a length of (L)0-3)×N。
When modulating data dl'For Pi/4-QPSK modulated data, the 1 st filter coefficient C1The nth value of (a) is:
optionally, filter coefficient C1Has a length of (L)0-1) xN, filter coefficient C2Has a length of (L)0-1). times.N. Filter coefficient C3Has a length of (L)0-2) xN, wherein C is as defined above0、As described in step 302, the description is omitted.
If it is notAndthe calculation results of the two formulas are relatively close, when the data d is modulatedl'Filter coefficient C of 1 st path data and 2 nd path data in Pi/4-QPSK modulated data1、C2The same filter coefficients can be approximated. For example, as shown in fig. 6a, a schematic diagram of filter coefficients is shown, where a corresponds to a solid line of the filter coefficients of the 0 th path data, and B corresponds to a solid line of the filter coefficients C of the 1 st path data1The solid line corresponding to C is the filter coefficient C of the 2 nd data2As can be seen from FIG. 6a, the filter coefficient C of the 1 st data1Filter coefficient C with 2 nd data2Relatively close, it can be approximated as corresponding to the same filter. Therefore, in the embodiment of the present application, in order to reduce the computation complexity, the 1 st path and the 2 nd path may be merged into one path of modulation data, and the merged modulation data may be subjected to operations such as repetition, phase rotation, filtering, and the like, so that the original 4 paths of data are reduced to 3 paths of data, thereby reducing the computation complexity.
For example, the path 1 modulated data d can be expressed by the following formula l′,12 nd path of modulated data dl′,2Modulation data d combined into one path of datal′,1:
dl',1=dl'·(βl',1+βl',2) Either the first or the second substrate is, alternatively,
where, | | represents a modulo operation.
For example, the filter coefficient corresponding to the combined 1 st path and 2 nd path may be C1Wherein, C1The nth value of (a) may be:
when modulating data dl'For Pi/2-BPSK modulated data, the 1 st path to the 1 st pathThe 3-way filter coefficients can be represented in a continuous representation. For example: path 1 filter coefficient C1The value at the t-th time in (2) is:
correspondingly, the filter coefficients C are represented in a continuous representation0(t) has a length L0X T, filter coefficient C1(t) has a length of (L)0-1) × T, filter coefficients C2(t) has a length of (L)0-1) × T, filter coefficients C3(t) has a length of (L)0-2)×T。
When modulating data dl'For Pi/4-QPSK modulated data, the filter coefficients of the 1 st to 3 rd paths can also be expressed in a continuous manner. For example, the 1 st filter coefficient C1The values at t instants in (a) are:
correspondingly, the filter coefficients C are represented in a continuous representation0(t) has a length L0X T, filter coefficient C1(t) has a length of (L)0-2) T, filter coefficients C2(t) has a length of (L)0-3) T, filter coefficients C3(t) has a length of (L)0-3)T。
When the 1 st path and the 2 nd path are combined, the corresponding filter coefficient is taken as C1In which C is1The values of t times in (a) may be:
to be provided withTo C1(t),C2(t), and C3(t) when discrete sampling is performed, the obtained results are respectively compared with a result C in a discrete representation form1(n),C2(n), and C1(n) is uniform.
In the method shown in fig. 6, multiple paths of data may be repeated, phase-rotated, filtered, added, combined, and transmitted. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 7 is a schematic block diagram of another data transmission method provided in an embodiment of the present application, and as shown in fig. 7, the processing procedure may include:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain 0 th path data sl,0;
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain the 1 st path data sl,1(ii) a Wherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain 2 nd data sl,2(ii) a Wherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain 3 rd path data sl,3(ii) a Wherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging to obtain output data slI.e. slNth data:
sl(n)=sl,0(n)+sl,1(n)+sl,2(n)+sl,3(n);
the specific implementation process of frequency domain resource mapping, IFFT, and filtering in fig. 7 may refer to that shown in the corresponding embodiment of fig. 4b, and is not described again. Determination of modulated data d in fig. 7l′,1、dl′,2、dl′,3And filter coefficient C1、C2、C3The process of (a) can be described with reference to the embodiment corresponding to fig. 6, and is not described again.
In fig. 7, the filtered output data of the 1 st to 3 rd paths and the output data of the merging process may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In the method shown in fig. 7, the multiple paths of data may be subjected to frequency domain resource mapping, IFFT, filtering, and then added, combined, and transmitted. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 8 is a schematic block diagram of another data transmission method provided in an embodiment of the present application, and as shown in fig. 8, the process may include:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Repeating to obtain data with length NTo pairFiltering to obtain 0 th path data sl,0For the 0 th data sl,0Performing phase rotation to obtain 0 th path data
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Repeating to obtain data with length NTo pairFiltering to obtain the 1 st path data sl,1For the 1 st data sl,1Phase rotation is carried out to obtain the 1 st path dataWherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Repeating to obtain data with length NTo pairFiltering to obtain 2 nd data sl,2For the 2 nd data sl,2Performing phase rotation to obtain 2 nd path dataWherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Repeating to obtain data with length NTo pairFiltering to obtain 3 rd path data sl,3For the 3 rd data sl,3Phase rotation is carried out to obtain 3 rd path dataWherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will 0 th data 1 st path data 2 nd data 3 rd path dataMerging to obtain output data slI.e. slNth data:
the specific implementation process of the repetition, the filtering, and the phase rotation in fig. 8 can be shown in the embodiment corresponding to fig. 4c, and is not described again. Determination of modulated data d in fig. 8l′,1、dl′,2、dl′,3And filter coefficient C1、C2、C3The process of (a) can be described with reference to the embodiment corresponding to fig. 6, and is not described again.
In fig. 8, the filtered output data of the 1 st to 3 rd paths and the output data of the merging process may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In the method shown in fig. 8, multiple paths of data may be repeated, filtered, phase-rotated, added, combined, and transmitted. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 9 is a schematic block diagram of a data transmission method according to an embodiment of the present application, where as shown in fig. 9, the method may include:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Repeating to obtain data with length NTo pairFiltering to obtain 0 th path data sl,0;
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Repeating to obtain data with length NTo pairFiltering to obtain the 1 st path data sl,1(ii) a Wherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Repeating to obtain data with length NTo pairFiltering to obtain 2 nd data sl,2(ii) a Wherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Repeating to obtain data with length NTo pairFiltering to obtain 3 rd path data sl,3(ii) a Wherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging the data to obtain data slI.e. slNth data:
sl(n)=sl,0(n)+sl,1(n)+sl,2(n)+sl,3(n);
The specific implementation process of the repetition and the filtering in fig. 9 may refer to the repetition and the filtering process shown in the embodiment corresponding to fig. 3, and is not described again. The process of phase rotating the data after the addition combining in fig. 9 can refer to the data s in step 303l,0The process of phase rotation is not described in detail. Determination of modulated data d in fig. 9l′,1、dl′,2、dl′,3And filter coefficient C1、C2、C3The process of (a) can be described with reference to the embodiment corresponding to fig. 6, and is not described again.
The filtered output data of the 1 st to 3 rd paths and the output data of the merging process in fig. 9 may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In the method shown in fig. 9, the multiple paths of data may be repeated, filtered, added and combined, and the added and combined data may be transmitted through phase rotation. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 6-9 may be applicable to various scenarios, such as: the method can be applied to a scenario in which the modulated data is BPSK modulated data or Pi/2-BPSK modulated data or QPSK modulated data or Pi/4-QPSK modulated data. In particular modulated data dl′When the modulated data is Pi/2-BPSK modulated data or Pi/4-QPSK modulated data, the PAPR performance of each path of data can be ensured to be better, for the reason mentioned above, which is not described again. Therefore, in order to make each path of data have good PAPR performance, alternatively, when the modulated data is BPSK modulated data, the BPSK modulated data may be subjected to modulation data phase rotation to obtain Pi/2-BPSK modulated data. When the modulated data is QPSK modulated data, the QPSK modulated data may be subjected to modulation data phase rotation to obtain Pi/4-QPSK modulated data. Then, other corresponding operations are performed on the Pi/2-BPSK modulated data or the Pi/4-QPSK modulated data after the modulation data phase rotation. Specifically, as shown in fig. 10 to 13.
Fig. 10 is a schematic block diagram of a data transmission method according to an embodiment of the present application, and as shown in fig. 10, the method may include:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Obtaining rotated modulation data d through modulation data phase rotationl′D after rotationl′Repeating and rotating the phase to obtain data with length NTo pairFiltering to obtain 0 th path data sl,0;
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Obtaining rotated modulation data d through modulation data phase rotationl′,1Modulating data d after rotationl′,1Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain the 1 st path data sl,1(ii) a Wherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Obtaining rotated modulation data d through modulation data phase rotationl′,2Modulating data d after rotationl′,2Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain 2 nd data sl,2(ii) a Wherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Obtaining rotated modulation data d through modulation data phase rotationl′,3Modulating data d after rotationl′,3Obtaining data with length N through repetition and phase rotationTo pairFiltering to obtain 3 rd path data sl,3(ii) a Wherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging to obtain output data slI.e. slNth data:
sl(n)=sl,0(n)+sl,1(n)+sl,2(n)+sl,3(n)。
the implementation process of obtaining the rotated modulation data through phase rotation of the modulation data in each path may refer to the embodiment corresponding to fig. 4d, and is not described again. The specific implementation process of the repetition, the phase rotation, and the filtering in fig. 10 can be shown in the embodiment corresponding to fig. 4a, and is not described again.
The filtered output data of the 1 st to 3 rd paths and the output data of the merging process in fig. 10 may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In fig. 6, each path of modulated data may be according to modulated data dl'And modulation data transmitted on other time domain symbols. Illustratively, when modulating data dl'When the data is modulated for BPSK, in one possible design, the data d will be modulatedl′Modulated data d is obtained through modulated data preprocessingl′,1Comprises the following steps:
dl',1=-dl'×dl'-1×dl'-2×j
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Comprises the following steps:
dl',2=-dl'×dl'-2×dl'-3×j
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Comprises the following steps:
dl',3=-dl'×dl'-1×dl'-3
in the embodiment of the present application, j is an imaginary unit.
As can be seen from the above, data d is modulatedl′,1、dl′,2、dl′,3May be modulated data d transmitted from a time domain symbol ll'And modulated data of several time domain symbols preceding the time domain symbol l'. It should be noted that the modulation data d is determinedl′,1、dl′,2、dl′,3Including but not limited toIn the above possible design manners, for example, expressions obtained by equivalence of the above two implementation manners are also within the protection scope of the embodiment of the present application.
Illustratively, when modulating data dl'When QPSK modulated data is generated, modulated data d corresponding to each path of datal′,1、dl′,2Can be formed byl'And dl'-1And (4) determining. The following description will take an example of specifying modulation data corresponding to the 1 st data and modulation data corresponding to the 2 nd data. For example, modulation data d of the 1 st datal′,1Can be expressed as dl',1=dl'·βl',1Modulation data d of 2 nd datal',2Can be expressed as dl',2=dl'·βl',2Wherein, βl',1、βl',2From dl'/dl'-1Determination of dl'/dl'-1There are 4 possible values.
In one possible design, βl',1、βl',2And dl'/dl'-1There is a corresponding relationship between them, and the corresponding relationship may be preconfigured or configured for the terminal device by the network device through signaling. As shown in Table 2, is betal',1、βl',2And dl'/dl'-1The corresponding relation table between d can be determined by table 1l'/dl'-1Is taken to correspond to betal',1And betal',2From the determined betal',1And betal',2Determination of dl′,1、dl′,2。
TABLE 2
In yet another possible design, βl',1、βl',2Can be expressed by the following formula:
wherein (d)l'/dl'-1×ejπ/4)*Represents a pair dl'/dl'-1×ejπ/4And (6) solving conjugation operation.
The process of determining the filter coefficients in fig. 10 can be described with reference to fig. 6, where: when modulating data dl'For QPSK modulated data, the 1 st filter coefficient C1The nth value of (a) is:
if it is notAndthe calculation results of the two formulas are relatively close when modulating data dl'When the data is QPSK modulated, the filter coefficient C of the 1 st path data and the 2 nd path data1、C2Can be approximated by the same filter coefficient C1Wherein, C1The nth value of (a) may be:
filter coefficient C of 1 st path data and 2 nd path data1、C2Can be approximated by the same filter coefficient C1Therefore, in the embodiment of the present application, in order to reduce the complexity of the operationAnd meanwhile, the 1 st path and the 2 nd path can be combined into one path of modulation data, and the combined modulation data is subjected to operations such as repetition, phase rotation, filtering and the like, so that the original 4 paths of data are reduced into 3 paths of data, and the calculation complexity is reduced. For example, the path 1 modulated data d can be expressed by the following formula l′,12 nd path of modulated data dl′,2Modulation data d combined into one path of datal′,1:
dl',1=dl'·(βl',1+βl',2) Either the first or the second substrate is, alternatively,
where, | | represents a modulo operation.
In the method shown in fig. 10, after the phase rotation of the modulated data is performed on the multi-path modulated data, the rotated modulated data may be subjected to repetition, phase rotation, filtering, and then added and transmitted. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 11 is a schematic block diagram of another data transmission method provided in an embodiment of the present application, and as shown in fig. 11, the method may include:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Rotated d by phase rotation of modulated datal′D after rotationl′The length of the obtained product isData of NTo pairFiltering to obtain 0 th path data sl,0;
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Rotated d by phase rotation of modulated datal′,1Modulating data d after rotationl′,1Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain the 1 st path data sl,1(ii) a Wherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Rotated d by phase rotation of modulated datal′,2Modulating data d after rotationl′,2Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain 2 nd data sl,2(ii) a Wherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Rotated d by phase rotation of modulated datal′,3Modulating data d after rotationl′,3Obtaining data with length of N through frequency domain resource mapping and IFFTTo pairFiltering to obtain 3 rd path data sl,3(ii) a Wherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging to obtain output data slI.e. slNth data:
sl(n)=sl,0(n)+sl,1(n)+sl,2(n)+sl,3(n)。
the specific implementation process of frequency domain resource mapping, IFFT, and filtering in fig. 11 may refer to that shown in the embodiment corresponding to fig. 4b, and is not described again. Determination of modulated data d in FIG. 11l′,1、dl′,2、dl′,3And filter coefficient C1、C2、C3The process of (a) can be described with reference to the embodiment corresponding to fig. 10, and is not described again. The process of modulating the data phase rotation in fig. 11 can be described with reference to fig. 10, and is not repeated.
In fig. 11, the filtered output data of the 1 st to 3 rd paths and the output data of the merging process may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In the method shown in fig. 11, after the phase of the modulated data is rotated, the rotated modulated data may be subjected to frequency domain resource mapping, IFFT, filtering, and then added and transmitted. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 12 is a schematic block diagram of another data transmission method provided in an embodiment of the present application, as shown in fig. 12, including:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Rotated d by phase rotation of modulated datal′D after rotationl′Repeating to obtain data with length NTo pairFiltering to obtain 0 th path data sl,0For the 0 th data sl,0Performing phase rotation to obtain 0 th path data
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will modulate data dl′,1Rotated d by phase rotation of modulated datal′,1Modulating data d after rotationl′,1Repeating to obtain data with length NTo pairFiltering to obtain the 1 st path data sl,1For the 1 st data sl,1Phase rotation is carried out to obtain the 1 st path dataWherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1In (1)The N + offset-l' x N value;
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Rotated d by phase rotation of modulated datal′,2Modulating data d after rotationl′,2Repeating to obtain data with length NTo pairFiltering to obtain 2 nd data sl,2For the 2 nd data sl,2Performing phase rotation to obtain 2 nd path dataWherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Rotated d by phase rotation of modulated datal′,3Modulating data d after rotationl′,3Repeating to obtain data with length NTo pairFiltering to obtain 3 rd path data sl,3For the 3 rd data sl,3Phase rotation is carried out to obtain 3 rd path dataWherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will 0 th data 1 st path data 2 nd data 3 rd path dataMerging to obtain output data slI.e. slNth data:
the specific implementation process of the repetition, the filtering, and the phase rotation in fig. 12 can be shown in the embodiment corresponding to fig. 4c, and is not described again. Modulation data preprocessing determination modulation data d in fig. 12l′,1、dl′,2、dl′,3And filter coefficient C1、C2、C3Can be made as shown in FIG. 6The descriptions of the embodiments are omitted. The process of modulating the data phase rotation in fig. 12 can be described with reference to fig. 10, and is not repeated.
The filtered output data of the 1 st to 3 rd paths and the output data of the merging process in fig. 12 may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In the method shown in fig. 12, after the phase rotation of the modulated data is performed on the multi-path modulated data, the rotated modulated data may be repeated, filtered, phase-rotated, added, combined, and transmitted. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
Fig. 13 is a schematic block diagram of a data transmission method according to an embodiment of the present application, and as shown in fig. 13, the method may include:
for modulated data d transmitted on time domain symbol ll′Will modulate data dl′Rotated d by phase rotation of modulated datal′D after rotationl′Repeating to obtain data with length NTo pairFiltering to obtain 0 th path data sl,0;
Will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,1Will beModulated data dl′,1Rotated d by phase rotation of modulated datal′,1Modulating data d after rotationl′,1Repeating to obtain data with length NTo pairFiltering to obtain the 1 st path data sl,1(ii) a Wherein s isl,1Middle nth data Is composed ofN-th data, C1(N + offset-l' xN) is the 1 st filter coefficient C1The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,2Will modulate data dl′,2Rotated d by phase rotation of modulated datal′,2Modulating data d after rotationl′,2Repeating to obtain data with length NTo pairFiltering to obtain 2 nd data sl,2(ii) a Wherein s isl,2Middle nth data Is composed ofN-th data, C2(N + offset-l' xN) is the 2 nd filter coefficient C2The N + offset-l' x N value of (a);
will modulate data dl′Modulated data d is obtained through modulated data preprocessingl′,3Will modulate data dl′,3Rotated d by phase rotation of modulated datal′,3Modulating data d after rotationl′,3Repeating to obtain data with length NTo pairFiltering to obtain 3 rd path data sl,3(ii) a Wherein s isl,3Middle nth data Is composed ofN-th data, C3(N + offset-l' xN) is the 3 rd filter coefficient C3The N + offset-l' x N value of (a);
will be the 0 th data sl,01 st data sl,12 nd data sl,23 rd data sl,3Merging the data to obtain data slI.e. slNth data:
sl(n)=sl,0(n)+sl,1(n)+sl,2(n)+sl,3(n);
The specific implementation process of the repetition and the filtering in fig. 13 may refer to the process of the repetition and the filtering in the embodiment corresponding to fig. 3, and is not described again. The process of phase rotating the data after the addition combining in fig. 13 can refer to the data s in step 303lThe process of phase rotation is not described in detail. Modulation data preprocessing determination of modulation data d in fig. 13l′,1、dl′,2、dl′,3And filter coefficient C1、C2、C3The process of (a) can be described with reference to the embodiment corresponding to fig. 6, and is not described again. The process of modulating the data phase rotation in fig. 13 can be described with reference to fig. 10, and is not repeated.
The filtered output data of the 1 st to 3 rd paths and the output data of the merging process in fig. 12 may also be represented in a continuous representation manner, which specifically refers to the implementation in fig. 6, and is not described herein again.
In the method shown in fig. 13, after the phase rotation of the modulated data is performed on the multi-path modulated data, the rotated modulated data is repeated, filtered, added and combined, and the added and combined data is transmitted through the phase rotation. Each path of data may not be added with a CP in the processing process, each time domain symbol has a length of N, and when each path of data is filtered by using the filtering method provided in the embodiment of the present application, nth data points of k2-k1+ 1 time domain symbols may be multiplied by corresponding filter coefficients and then added and combined to obtain nth data in the path of data to be transmitted, that is, nth data in the path of data to be transmitted is related to nth data of other time domain symbols, thereby reducing OOB of the data. Meanwhile, the higher peak point of the data can be suppressed by combining the multi-path data, the lower peak point of the data is improved, the peak area of each point of the data is stable, and the low PAPR performance of the data is ensured.
It should be noted that the output data obtained by repeating, phase rotating, IFFT, filtering, and other operations according to the embodiments of the present application is time domain data, and may be separated as described aboveThe discrete expression (i.e. discrete expression) obtains the output data of each operation, or the continuous expression can obtain the output data of each operation. When the output data of each operation is obtained in a continuous representation mode, a discrete index (such as N) in a discrete expression can be replaced by a continuous index T, and a discrete data length N can be replaced by a time length T, wherein T is N × Ts。
The above main whole data transmission process introduces the scheme provided by the embodiment of the present application. It is understood that the terminal device or the network device includes a hardware structure and/or a software module for performing the respective functions in order to implement the above functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the various illustrative algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the embodiments of the present application.
In the embodiment of the present application, functional modules of a communication apparatus executing the method may be divided according to the method example, for example, each functional module may be divided according to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and there may be another division manner in actual implementation.
Fig. 14 shows a schematic diagram of a possible composition of a communication apparatus, which may be a terminal device or a functional module in the terminal device or a chip or a system on a chip in the terminal device; but also a network device or a functional module in a network device or a chip or system on chip in a network device. As shown in fig. 14, the communication apparatus may include: a first data processing unit 140, a second data processing unit 141, a transmitting unit 142;
a first data processing unit 140 for processing the modulated data d transmitted on the time domain symbol ll′According to modulated data dl′Get data of length NWherein l' is an integer; according to modulation data dl′Get data of length NThe method comprises the following steps: to modulated data dl′Repeating and rotating the phase to obtain data with length NOr, to the modulated data dl′Performing frequency domain resource mapping and IFFT to obtain data with length of NOr, to the modulated data dl′Repeating to obtain data with length NFor example, the first data processing unit 140 is configured to support the communication device to perform step 301.
A second data processing unit 141 for processing data according toObtaining data s transmitted on a time domain symbol ll,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) isWherein k1 and offset are integers of 0 or more, k2 is an integer of k1 or more,is composed ofN is an integer ranging from 0 to N-1, C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value in (1). For example, the second data processing unit 141 is configured to support the communication device to perform step 302.
A transmission unit 142 for transmitting data sl,0. For example, the sending unit 142 is configured to support the communication apparatus to perform step 303.
It should be noted that all relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again. The communication device provided by the embodiment of the application is used for executing the data collection method, so that the same effect as the data collection method can be achieved.
In yet another possible configuration, the communication device may be a communication device including a processing module and a communication module, wherein the communication device exists in a product form of a chip, the processing module may integrate functions of the first data processing unit 140 and the second data processing unit 141, and the communication module may integrate a function of the transmitting unit 142. For example, the processing module is used to support the apparatus in performing step 301, step 302, and other processes for the techniques described herein. The communication module is used to support communication between the apparatus and other network entities, for example, the functional modules or network entities shown in fig. 1. The apparatus may also include a storage module to store the program code and data for the apparatus.
The processing module may be a processor or a controller. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. A processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, a DSP and a microprocessor, or the like. The communication module may be a transceiver circuit or a communication interface, etc. The storage module may be a memory. When the processing module is a processor, the communication module is a communication interface, and the storage module is a memory, the apparatus according to the embodiment of the present application may be the communication apparatus shown in fig. 2.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical functional division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another device, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may be one physical unit or a plurality of physical units, that is, may be located in one place, or may be distributed in a plurality of different places. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The method provided by the embodiment of the present application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, 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. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, a network appliance, a user device, or other programmable apparatus. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disk (DVD)), or a semiconductor medium (e.g., an SSD), among others.
The above description is only a specific implementation of the embodiments of the present application, but the scope of the embodiments of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present application should be covered by the scope of the embodiments of the present application. Therefore, the protection scope of the embodiments of the present application shall be subject to the protection scope of the claims.
Claims (16)
1. A method of data transmission, the method comprising:
for modulated data d transmitted on time domain symbol ll′According to said modulated data dl′To obtain the lengthData of NWherein l' is an integer;
according to the aboveObtaining data s transmitted on a time domain symbol ll,0Wherein s isl,0Has a length of N, sl,0The nth data sl,0(n) isWherein k1 and offset are integers of 0 or more, k2 is an integer of k1 or more,is composed ofN is an integer ranging from 0 to N-1, C0(N + offset-l' xN) is the filter coefficient C0The N + offset-l' x N value of (a);
transmitting said data sl,0;
for the modulated data dl′Repeating and rotating the phase to obtain the data with the length of NOr,
for the modulated data dl′Performing frequency domain resource mapping and Inverse Fast Fourier Transform (IFFT) to obtain the data with the length of NOr,
2. The data transmission method according to claim 1, wherein the pair of modulated data dl′Repeating and rotating the phase to obtain the data with the length of NThe method comprises the following steps:
4. The data transmission method of claim 1, further comprising:
according to the modulation data dl′Obtaining M-1 modulation data, wherein M-1 is an integer greater than or equal to 1;
for M modulated data d in M-1 modulated datal′,mAccording to said modulated data dl′,mObtaining the data with the length of the mth path being NWherein M is an integer with a value range of 1 to M-1;
according to the aboveObtaining the mth output data sl,mWherein s isl,mHas a length of N, sl,mThe nth data sl,m(n) is Is composed ofN-th data, Cm(N + offset-l' xN) is the mth filter coefficient CmThe N + offset-l' x N value of (a);
said transmission data sl,0The method comprises the following steps: according to said sl,0And said sl,mObtaining combined output data s with length NlSending said slS of said slMiddle nth data
Wherein the modulation data dl′,mObtaining the data with the length of the mth path being NThe method comprises the following steps:
for the modulated data dl′,mRepeating and rotating the phase to obtain the data with the length of the mth path being NOr,
for the modulated data dl′,mPerforming frequency domain resource mapping and IFFT to obtain the data with the mth path length of NOr,
5. The data transmission method according to claim 4, wherein the pair of modulated data dl′,mRepeating and rotating the phase to obtain the data with the length of the mth path being NThe method comprises the following steps:
6. The data transmission method according to claim 4, wherein d is the modulation datal′,mRepeating to obtain the data with the length of the mth path being NAccording to said sl,0And said sl,mObtaining combined output data s with length NlThe method comprises the following steps:
7. The data transmission method according to claim 4, wherein d is the modulation datal′,mRepeating to obtain the data with the length of the mth path being NThen sends said slThe method comprises the following steps:
8. The data transmission method according to any of claims 4 to 7, characterized in that according to the modulated data dl′Obtaining M-1 modulated data, including:
according to the modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -2l′-2Obtaining the 1 st modulation data d in the M-1 modulation datal′,1Wherein said M-1 is greater than or equal to 1; and/or
According to the modulation data dl′Modulated data d transmitted on time domain symbols l' -2l′-2And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 2 nd modulation data d in the M-1 modulation datal′,2Wherein said M-1 is greater than or equal to 2; and/or
According to the modulation data dl′Modulated data d transmitted on time domain symbols l' -1l′-1And modulated data d transmitted on time domain symbols l' -3l′-3Obtaining the 3 rd modulation data d in the M-1 modulation datal′,3Wherein said M-1 is greater than or equal to 3;
wherein the modulation data dl′The modulation scheme of (2) is binary phase shift keying BPSK or Pi/2-BPSK.
9. The data transmission method according to any one of claims 4 to 7,
the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N +2N value of C0(N +2N) and the filter coefficient C0N + N value of C0(N + N) determination; and/or
The 2 nd filter coefficient C2N value ofC2(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N +2N value of C0(N +2N) and the filter coefficient C0N +3N value of C0(N +3N) determination; and/or
The 3 rd filter coefficient C3N-th value of C3(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) and the filter coefficient C0N +3N value of C0(N +3N) determination;
wherein the modulation data dl′The modulation scheme of (3) is Pi/2-BPSK or BPSK.
10. The data transmission method according to any of claims 4 to 7, characterized in that according to the modulated data dl′Obtaining M-1 modulated data, including:
according to the modulation data dl′And modulated data d transmitted on time domain symbol l' -1l′-1Obtaining the 1 st modulation data in the M-1 modulation data; wherein M-1 is greater than or equal to 1;
wherein the modulation data dl′The modulation scheme of (1) is quadrature phase shift keying QPSK or Pi/4-QPSK.
11. The data transmission method according to claim 10,
the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) determination;
wherein the modulation data dl′The modulation scheme of (1) is Pi/4-QPSK or QPSK.
12. The data transmission method according to any one of claims 4, 5, 6, 7,
the 1 st filter coefficient C1N-th value of C1(n) according to the filter coefficient C0N-th value of C0(n) the filter coefficient C0N + N value of C0(N + N) determination;
wherein the modulation data dl′The modulation scheme of (1) is Pi/4-QPSK or QPSK.
13. The data transmission method according to any of claims 4 to 7, characterized in that said data is based on modulated data dl′,mObtaining the data with the length of the mth path being NThe method comprises the following steps:
14. A communication apparatus, characterized in that the communication apparatus is configured to implement the data transmission method according to any one of claims 1-13.
15. A communication device, comprising: at least one processor, and a memory; it is characterized in that the preparation method is characterized in that,
the memory is for storing a computer program such that the computer program when executed by the at least one processor implements the data transmission method of any one of claims 1-13.
16. A computer storage medium on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the data transmission method according to any one of claims 1 to 13.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811152698.3A CN110971555B (en) | 2018-09-29 | 2018-09-29 | Data transmission method and device |
PCT/CN2019/105608 WO2020063364A1 (en) | 2018-09-29 | 2019-09-12 | Data transmission method and apparatus |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811152698.3A CN110971555B (en) | 2018-09-29 | 2018-09-29 | Data transmission method and device |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110971555A CN110971555A (en) | 2020-04-07 |
CN110971555B true CN110971555B (en) | 2021-04-20 |
Family
ID=69953298
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811152698.3A Active CN110971555B (en) | 2018-09-29 | 2018-09-29 | Data transmission method and device |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN110971555B (en) |
WO (1) | WO2020063364A1 (en) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101984616A (en) * | 2010-11-19 | 2011-03-09 | 京信通信系统(中国)有限公司 | Device for adaptively reducing peak-to-average power ratio and method and application thereof |
CN102474488A (en) * | 2009-07-17 | 2012-05-23 | 高通股份有限公司 | Constructing very high throughput long training field sequences |
CN104639281A (en) * | 2013-11-12 | 2015-05-20 | 华为技术有限公司 | Method, device and system for data transmission control |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8208522B2 (en) * | 2008-03-07 | 2012-06-26 | Nokia Corporation | System and methods for receiving OFDM symbols having timing and frequency offsets |
KR20130142932A (en) * | 2012-06-19 | 2013-12-30 | 한국전자통신연구원 | Method and apparatus for ofdm transmission in wireless lan |
WO2016021357A1 (en) * | 2014-08-07 | 2016-02-11 | 三菱電機株式会社 | Transmission apparatus, reception apparatus, communication system, transmission method, and reception method |
EP3193481B1 (en) * | 2016-01-14 | 2020-03-11 | Huawei Technologies Co., Ltd. | Asymmetric filtering at edges of band consisting of overlapped sub-bands |
-
2018
- 2018-09-29 CN CN201811152698.3A patent/CN110971555B/en active Active
-
2019
- 2019-09-12 WO PCT/CN2019/105608 patent/WO2020063364A1/en active Application Filing
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102474488A (en) * | 2009-07-17 | 2012-05-23 | 高通股份有限公司 | Constructing very high throughput long training field sequences |
CN101984616A (en) * | 2010-11-19 | 2011-03-09 | 京信通信系统(中国)有限公司 | Device for adaptively reducing peak-to-average power ratio and method and application thereof |
CN104639281A (en) * | 2013-11-12 | 2015-05-20 | 华为技术有限公司 | Method, device and system for data transmission control |
Also Published As
Publication number | Publication date |
---|---|
CN110971555A (en) | 2020-04-07 |
WO2020063364A1 (en) | 2020-04-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN111937331B (en) | Method and apparatus for decoding data in a wireless communication system | |
JP7102417B2 (en) | Methods and devices for transmitting reference signals | |
US11070329B2 (en) | Multiple access using orthogonal time frequency space modulation | |
CN108781160B (en) | Quadrature time frequency space modulation technique | |
US8670298B2 (en) | Method, system and apparatus for signal generation and message transmission in broadband wireless communications | |
US9819529B2 (en) | Method and apparatus for repeated transmission in multicarrier wireless communication system | |
CN111200571B (en) | Signal transmission method and device | |
EP3595223B1 (en) | Method and device for sending demodulation reference signal, demodulation method and device | |
CN111770041A (en) | Data compression method and device | |
WO2020187132A1 (en) | Data channel transmission method and device | |
WO2018228460A1 (en) | Phase tracking reference signal processing method and apparatus | |
US10999108B2 (en) | Wireless communication method, apparatus, and system | |
EP4391468A1 (en) | Communication method and related apparatus | |
CN110971555B (en) | Data transmission method and device | |
CN110971554B (en) | Data transmission method and device | |
CN115918041B (en) | Multi-user interleaved frequency division multiplexing for block transmission | |
JP7544772B2 (en) | OFDM Modulator, OFDM Demodulator, Method of Operating an OFDM Modulator, and Method of Operating an OFDM Demodulator - Patent application | |
WO2023169302A1 (en) | Communication method and apparatus | |
Shreesh et al. | A Review on Methods of FBMC and other Techniques of Massive MIMO | |
Noliya et al. | Performance Analysis of 5G NR Modulation Techniques. | |
Kamruzzaman et al. | Performance analysis of FBMC and UFMC technology in 5G mobile cellular communication systems | |
WO2023084538A1 (en) | Transform-precoding of a selective set of data for transmission over a wireless communication network | |
CN117880974A (en) | Spectral spreading of transmitted signals | |
CN116545596A (en) | Data processing method and device and related equipment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |