WO2021000712A1 - 符号处理的方法与装置 - Google Patents

符号处理的方法与装置 Download PDF

Info

Publication number
WO2021000712A1
WO2021000712A1 PCT/CN2020/095632 CN2020095632W WO2021000712A1 WO 2021000712 A1 WO2021000712 A1 WO 2021000712A1 CN 2020095632 W CN2020095632 W CN 2020095632W WO 2021000712 A1 WO2021000712 A1 WO 2021000712A1
Authority
WO
WIPO (PCT)
Prior art keywords
symbol
subset
transmission symbol
reference point
transmission
Prior art date
Application number
PCT/CN2020/095632
Other languages
English (en)
French (fr)
Inventor
刘凤威
黄煌
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP20835506.5A priority Critical patent/EP3962009B1/en
Publication of WO2021000712A1 publication Critical patent/WO2021000712A1/zh
Priority to US17/565,669 priority patent/US11991112B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2602—Signal structure
    • H04L27/2605—Symbol extensions, e.g. Zero Tail, Unique Word [UW]
    • H04L27/2607—Cyclic extensions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H04L5/0051—Allocation of pilot signals, i.e. of signals known to the receiver of dedicated pilots, i.e. pilots destined for a single user or terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03012—Arrangements for removing intersymbol interference operating in the time domain
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03343—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H04L27/2627—Modulators
    • H04L27/2628—Inverse Fourier transform modulators, e.g. inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators

Definitions

  • This application relates to the field of communications, and in particular to a method and device for symbol processing.
  • the guard interval can remove the inter-symbol interference (ISI) between adjacent symbols;
  • the guard interval converts the linear convolution of the channel and the transmitted symbol into a cycle of the channel and the transmitted symbol Convolution, which allows the symbol receiver to use frequency domain equalization to eliminate channel multipath effects.
  • ISI inter-symbol interference
  • a cyclic prefix is used as a guard interval between symbols.
  • the cyclic prefix is a cyclic structure formed by copying a piece of data after a data symbol (or called the tail) to the front (or called the head) of the symbol.
  • a stable frame structure In order to perform flexible multi-user multiplexing, a stable frame structure needs to be maintained. In order to maintain a stable frame structure, the length of the cyclic prefix is fixed. In implementation, the network device configures the same cyclic prefix length for multiple users. However, different users experience different channel conditions, so the requirements for the length of the cyclic prefix may also be different. In order to ensure the performance of all users, the system selects a cyclic prefix whose length is greater than the multipath delay of a large delay extension user. However, for a small delay extension user, an excessively long cyclic prefix will cause unnecessary overhead.
  • the present application provides a method and device for symbol processing, which can realize flexible configuration of guard intervals between symbols on the premise that the length of the cyclic prefix is fixed.
  • a method for symbol processing comprising: sending a first transmission symbol and a second transmission symbol, the first transmission symbol and the second transmission symbol are continuous in time domain, and the first transmission symbol is located in the second transmission symbol prior to.
  • the symbol component whose ending position is the first reference point in the first transmission symbol is the same as the symbol component whose ending position is the second reference point in the second transmission symbol.
  • the first reference point represents the ending position of the transmission symbol
  • the second reference point Indicates the location of the intercepted CP of the transmitted symbol.
  • the length of the second reference point from the end position of the transmitted symbol is equal to the CP length.
  • the second transmission symbol has a cyclic prefix (hereinafter referred to as CP for short).
  • the end position in the first transmission symbol is the symbol component of the first reference point and the end position in the second transmission symbol is the second reference point.
  • the symbol components of are the same, so that the flexible configuration of the guard interval between symbols can be realized by controlling the length of the symbol component shared between the first transmission symbol and the second transmission symbol.
  • the length of the symbol component shared between the first transmission symbol and the second transmission symbol does not affect the frame structure of the transmission symbol. Therefore, for users with different channel conditions, the shared symbol components of different lengths can be configured .
  • the guard interval between symbols can be flexibly configured, and secondly, multiplexing (frequency division, space division and time division) can also be performed between users configured with different guard intervals.
  • the guard interval between symbols can be flexibly configured, and the guard interval length can also be flexibly configured according to user requirements.
  • a method for symbol processing includes: obtaining a plurality of complex symbols; dividing the plurality of complex symbols into a plurality of sets, wherein each set corresponds to a transmission symbol; and performing a copy operation on the plurality of sets , So that the two sets corresponding to two consecutive transmitted symbols in the time domain have partially the same complex symbols.
  • the two sets corresponding to two consecutive transmitted symbols in the time domain are copied, so that the two sets have the same complex symbol, which helps to obtain the first aspect of the method provided in the first aspect.
  • a transmission symbol and a second transmission symbol. Therefore, the present application can implement flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • a method for symbol processing includes: obtaining a plurality of complex symbols; dividing the plurality of complex symbols into a plurality of sets, wherein each set corresponds to a transmitted symbol, and the plurality of sets includes The first set of first transmission symbols and the second set corresponding to the second transmission symbols, the first transmission symbol and the second transmission symbol are continuous in time domain, and the first transmission symbol is located before the second transmission symbol;
  • the second set performs a copy operation, so that both the first set and the second set have the first complex number symbol, where the subset formed by the first complex number symbol in the first set is called the first subset, and the second set
  • the subset formed by the first complex symbol is called the second subset.
  • the time domain position of the first subset and the time domain position of the second subset may be the same or different; for the first set after the copy operation and
  • the second set performs signal processing, which includes cyclic shift or frequency domain weighting.
  • the signal processing is a cyclic shift
  • the signal processing is performed on the time-domain signal corresponding to the first set and the time-domain signal corresponding to the second set; if the signal processing is frequency-domain weighting, the signal processing is performed on the first set.
  • the frequency domain signals corresponding to the set and the frequency domain signals corresponding to the second set are frequency-domain weighted.
  • the signal processing includes first signal processing, and the first signal processing includes cyclic shift or frequency domain weighting.
  • performing signal processing on the first set and the second set after the copy operation includes: performing the first signal processing on the first set and the second set after the copy operation respectively, and the first set
  • the signal processing makes the end position of the first subset correspond to the first reference point of the first transmission symbol, and makes the end position of the second subset correspond to the second reference point of the second transmission symbol.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the position of the intercepted cyclic prefix of the transmitted symbol.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the intercepted cycle of the transmitted symbol.
  • the position of the prefix is the position of the prefix.
  • the signal processing includes first signal processing and second signal processing
  • the first signal processing includes cyclic shift or frequency domain weighting
  • the second signal processing includes cyclic shift or frequency domain weighting. Domain weighting.
  • the first signal processing is cyclic shift
  • the second signal processing is cyclic shift
  • the first signal processing is frequency domain weighting
  • the second signal processing may be frequency domain weighting or cyclic shift.
  • performing signal processing on the first set and the second set after the copy operation includes: performing first signal processing on the first set and the second set after the copy operation, respectively, and The signal processing makes the end position of the first subset correspond to the first reference point of the first transmission symbol, and makes the end position of the second subset correspond to the second reference point of the second transmission symbol;
  • the signals after the first signal processing and the signals of the second set after the first signal processing are subjected to the second signal processing, and the second signal processing makes the starting position of the first subset correspond to the first reference of the first transmitted symbol
  • the position before the dot, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the starting position of the second subset corresponds to the position before the second reference point of the second transmission symbol
  • the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol, where the first reference point represents the end position of the transmission symbol, and the second reference point represents the intercepted cyclic prefix of the transmission
  • the second signal processing can be understood as a common shift operation on the first set and the second set.
  • the present application can implement flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the start position and the end position of the first subset respectively correspond to before the first reference point of the first transmitted symbol
  • the positions after and after, and the start position and end position of the second subset respectively correspond to the positions before and after the second reference point of the second transmitted symbol, which can reduce the effect of filter tailing to a certain extent.
  • the signal processing includes third signal processing, and the third signal processing includes cyclic shift or frequency domain weighting.
  • performing signal processing on the first set and the second set after the copy operation includes: performing third signal processing on the first set and the second set after the copy operation respectively, and the third The signal processing is such that the start position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, And make the start position of the second subset correspond to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol, wherein, The first reference point represents the end position of the transmitted symbol, and the second reference point represents the position of the intercepted cyclic prefix of the transmitted symbol.
  • the third implementation manner can be regarded as the result of combining the first signal processing and the second signal processing in the second implementation manner into one signal processing, where both the first signal processing and the second signal processing are Cyclic shift, or both the first signal processing and the second signal processing are frequency domain weighted.
  • the embodiment of the present application can realize flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the start position and the end position of the first subset respectively correspond to the positions before and after the first reference point of the first transmitted symbol
  • the start position and the end position of the second subset respectively correspond to the positions before and after the second reference point of the second transmitted symbol, which can reduce to a certain extent the guard interval between the symbols due to the trailing effect of the filter The impact of expansion.
  • the starting position of the first subset corresponds to the position before the first reference point of the first transmitted symbol
  • the ending position of the first subset corresponds to the first position of the first transmitted symbol.
  • the position after the reference point means that the start position of the first subset in the first set corresponds to the tail position of the first transmitted symbol, and the end position of the first subset corresponds to the head position of the first transmitted symbol .
  • the starting position of the first subset corresponds to the position before the first reference point of the first transmission symbol
  • the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol
  • the end position of the first subset corresponds to the position after the first reference point of the first transmitted symbol
  • the position of the first subset The end position corresponds to the head position of the first transmitted symbol
  • the end position of the first subset corresponds to the position after the third reference point of the first transmitted symbol, where the third reference point represents the start of the transmitted symbol position.
  • the end position of the first subset corresponds to the position after the first reference point of the first transmitted symbol
  • the end position of the first subset corresponds to The position before the first reference point of the first transmitted symbol.
  • the time domain position of the first subset corresponds to the time domain position in the first transmitted symbol, which covers the first reference point of the first transmitted symbol (that is, the end position of the first transmitted symbol). ), therefore, the following description is adopted: "The start position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the first reference point of the first transmission symbol The position after the dot".
  • performing signal processing on the first set and the second set includes: performing frequency domain processing on the first set and the second set to obtain the corresponding The frequency domain signal corresponding to the second set and the frequency domain signal corresponding to the second set; the inverse fast Fourier transform IFFT is performed on the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set to obtain the first set corresponding Cyclically shift the time-domain signal corresponding to the first set and the time-domain signal corresponding to the second set, so that the starting position of the first subset corresponds to the first The position before the first reference point of the transmitted symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the starting position of the second subset corresponds to the second transmission symbol The position before the second reference point of, and the end position of the second subset corresponds to the position after the second reference point of the second transmitted symbol.
  • This implementation may be applicable to scenarios where the transmitted symbols are DFT-s-OFDM symbols.
  • cyclic shifting is used so that the starting position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the ending position of the first subset corresponds to the first transmission
  • the position after the first reference point of the symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position of the second transmission symbol
  • the position after the second reference point can reduce the influence of the filter's tailing effect on the extension of the guard interval between symbols to a certain extent.
  • performing signal processing on the first set and the second set includes: performing discrete Fourier transform DFT on the first set and the second set to obtain the first set and the second set.
  • Frequency domain signals corresponding to one set and frequency domain signals corresponding to the second set Frequency domain signals corresponding to one set and frequency domain signals corresponding to the second set; frequency domain weighting is performed on the frequency domain signals corresponding to the first set and the frequency domain signals corresponding to the second set, so that the starting position of the first subset corresponds to Is a position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the start position of the second subset corresponds to the position 2.
  • the position before the second reference point of the transmitted symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmitted symbol.
  • This implementation may be applicable to scenarios where the transmitted symbols are DFT-s-OFDM symbols.
  • the frequency domain weighting is used so that the start position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the first transmission
  • the position after the first reference point of the symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position of the second transmission symbol
  • the position after the second reference point can reduce the influence of the filter's tailing effect on the extension of the guard interval between symbols to a certain extent.
  • performing signal processing on the first set and the second set includes: directly performing a cyclic shift on the first set and the second set obtained by the copy operation, Make the start position of the first subset correspond to the position before the first reference point of the first transmission symbol, and make the end position of the first subset correspond to the position after the first reference point of the first transmission symbol, and make the The start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol.
  • This implementation may be applicable to scenarios where the transmitted symbols are DFT-s-OFDM symbols or SC-QAM symbols.
  • the first set and the second set are multiplexed
  • performing a copy operation on the first set and the second set includes: performing a copy operation on the first set and the second set, so that the The time domain position and the time domain position of the second subset may be the same, that is, the time domain index of the start position of the first subset is the same as the time domain index of the start position of the second subset, and the end position of the first subset The time domain index of is the same as the time domain index of the end position of the second subset.
  • the copy operation in this implementation is called a co-location copy operation.
  • the time domain index of the starting position of the first subset and the cyclic prefix is related to the symbol number.
  • the time domain index i of the starting position of the first subset satisfies the following formula:
  • l represents the symbol number of the first set
  • A represents the time domain index of the subset participating in the copy operation in the set with the symbol number l being 0
  • CL CP (1) represents the first set with the symbol number l
  • the equivalent cumulative CP length
  • this application may perform a copy operation on a set corresponding to multiple consecutive transmitted symbols.
  • the first subset and the second subset have the same length but do not have the same index, for example, the time domain position of the first subset and The time domain position of the second subset is different.
  • the transmitter can adjust the first subset and the second subset to the same time domain position through time domain cyclic shift or frequency domain weighting in the subsequent processing steps. , which is equivalent to copy at the same location.
  • performing a copy operation on the first set and the second set includes: copying the first complex symbol in the first set to the second set.
  • the replication method in this implementation can be called backward replication.
  • the first transmission symbol is a reference signal
  • the second transmission symbol is a non-reference signal
  • performing a copy operation on the first set and the second set includes: copying the first complex number symbol in the second set to the first set.
  • the copy mode in this implementation may be called forward copy.
  • the first transmission symbol is a non-reference signal
  • the second transmission symbol is a reference signal
  • the method further includes: generating a first transmission symbol and a second transmission symbol based on the signal after the signal processing, wherein the first subset Corresponding to the first symbol component of the first transmission symbol, the second subset corresponds to the second symbol component of the second transmission symbol, and the first symbol component is the same as the second symbol component.
  • the symbol component whose ending position is the first reference point in the first transmission symbol is the same as the symbol component whose ending position is the second reference point in the second transmission symbol.
  • the guard interval between symbols can be flexibly configured, and the guard interval length can also be flexibly configured according to user requirements.
  • a method for symbol processing comprising: obtaining a plurality of complex symbols; dividing the plurality of complex symbols into a plurality of sets, and the plurality of sets include a first set and a second set, The first set corresponds to a first transmission symbol, the second set corresponds to a second transmission symbol, the first transmission symbol is continuous in time domain with the second transmission symbol, and the first transmission symbol is located in the second transmission symbol.
  • the complex symbols in the first subset in the first set are the same as the complex symbols in the second subset in the second set; signal processing is performed on the first set and the second set, so
  • the signal processing includes cyclic shift or frequency domain weighting, and the signal processing makes the start position of the first subset correspond to the position before the first reference point of the first transmission symbol, and the first sub-set
  • the end position of the set corresponds to the position after the first reference point of the first transmission symbol
  • the starting position of the second subset corresponds to the position before the second reference point of the second transmission symbol
  • the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol, where the first reference point represents the end position of the transmission symbol, and the second reference point represents the interception cycle of the transmission symbol
  • the position of the prefix is performed on the first set and the second set, so
  • the signal processing includes cyclic shift or frequency domain weighting, and the signal processing makes the start position of the first subset correspond to the position before the first reference point of
  • the second complex number symbol may include a plurality of complex number symbols.
  • both the first transmission symbol and the second transmission symbol are reference signals, such as a demodulation reference signal (de-modulation reference signal, DMRS).
  • DMRS demodulation reference signal
  • the first set and the second set are not copied.
  • the transmitted symbols corresponding to the first set and the second set are reference signals, the accuracy of the reference signals can be guaranteed, The flexible configuration of the guard interval of the reference signal can be realized.
  • performing signal processing on the first set and the second set includes: performing frequency domain processing on the first set and the second set to obtain the correspondence of the first set The frequency domain signal corresponding to the second set and the frequency domain signal corresponding to the second set; the inverse fast Fourier transform IFFT is performed on the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set to obtain the first set corresponding Cyclically shift the time-domain signal corresponding to the first set and the time-domain signal corresponding to the second set, so that the starting position of the first subset corresponds to The position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the second subset The starting position of corresponds to a position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to a position after the second reference point of the second transmission symbol.
  • This implementation manner may be applicable to scenarios where the waveform of the transmitted symbol is a DFT-s-OFDM waveform.
  • cyclic shifting is used so that the starting position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the ending position of the first subset corresponds to the first transmission
  • the position after the first reference point of the symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position of the second transmission symbol
  • the position after the second reference point can reduce the influence of the filter's tailing effect on the extension of the guard interval between symbols to a certain extent.
  • performing signal processing on the first set and the second set includes: performing discrete Fourier transform DFT on the first set and the second set to obtain the first set Frequency domain signals corresponding to one set and frequency domain signals corresponding to the second set; frequency domain weighting is performed on the frequency domain signals corresponding to the three sets and the frequency domain signals corresponding to the second set, so that the starting position of the first subset corresponds to The position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the starting position of the second subset corresponds to the second The position before the second reference point of the transmitted symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmitted symbol.
  • This implementation may be applicable to scenarios where the transmitted symbols are DFT-s-OFDM symbols.
  • the frequency domain weighting is used so that the start position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the first transmission
  • the position after the first reference point of the symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position of the second transmission symbol
  • the position after the second reference point can reduce the influence of the filter's tailing effect on the extension of the guard interval between symbols to a certain extent.
  • performing signal processing on the first set and the second set includes: directly performing a cyclic shift on the first set and the second set obtained by the copy operation, Make the start position of the first subset correspond to the position before the first reference point of the first transmission symbol, and make the end position of the first subset correspond to the position after the first reference point of the first transmission symbol, and make the The start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol.
  • This implementation may be applicable to scenarios where the transmitted symbols are DFT-s-OFDM symbols or SC-QAM symbols.
  • a symbol processing device is provided, and the communication device is configured to execute the method provided in any one of the first to fourth aspects.
  • the device may include a module for executing the method provided in any one of the first to fourth aspects.
  • a symbol processing device in a sixth aspect, includes a memory and a processor.
  • the memory is used to store instructions.
  • the processor is used to execute instructions stored in the memory. Execution of the instructions stored in the memory causes the processor to execute the first Aspect to the method provided in any one of the fourth aspect.
  • a chip in a seventh aspect, includes a processing module and a communication interface.
  • the processing module is used to control the communication interface to communicate with the outside.
  • the processing module is also used to implement the method provided in any one of the first to fourth aspects. .
  • a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a computer, the computer realizes the method provided in any one of the first to fourth aspects.
  • a computer program product containing instructions is provided, when the instructions are executed by a computer, the computer realizes the method provided in any one of the first to fourth aspects.
  • the guard interval between symbols can be flexibly configured, and the guard interval length can also be flexibly configured according to user requirements.
  • Figures 1 and 2 are schematic diagrams of using a cyclic prefix (CP) as a guard interval between symbols;
  • CP cyclic prefix
  • FIG. 3 is a schematic diagram of a time domain structure of a transmitted symbol according to an embodiment of the application.
  • FIG. 4 is another schematic diagram of the time domain structure of transmitted symbols according to an embodiment of the application.
  • FIG. 5, Fig. 6 Fig. 7 are basic flowcharts of a symbol processing method according to an embodiment of this application;
  • FIG. 8 is a schematic flowchart of a symbol processing method according to an embodiment of the application.
  • FIG. 9 is a schematic diagram of the correspondence between sets and transmitted symbols without performing cyclic shift in an embodiment of the application.
  • FIG. 10 is a schematic diagram of the correspondence between sets and transmitted symbols in the case of performing cyclic shift in an embodiment of the application.
  • FIG. 11 is a schematic diagram of a time domain structure of a transmitted symbol according to an embodiment of the application.
  • FIG. 12 is a schematic diagram of a flow chart of symbol processing according to an embodiment of the application.
  • FIG. 13 is a schematic diagram of performing a copy operation on multiple sets in an embodiment of the application.
  • FIG. 14 is a schematic diagram of cyclic shifting multiple symbols in an embodiment of the application.
  • 15 is another schematic diagram of the time domain structure of the transmitted symbol according to an embodiment of the application.
  • 16 is a schematic block diagram of a symbol processing apparatus according to an embodiment of the application.
  • FIG. 17 is another schematic block diagram of a symbol processing apparatus according to an embodiment of the application.
  • FIG. 18 is another schematic block diagram of a symbol processing apparatus according to an embodiment of this application.
  • FIG. 19 is still another schematic block diagram of the symbol processing apparatus according to an embodiment of the application.
  • FIG. 20 is a schematic block diagram of a terminal device according to an embodiment of the application.
  • FIG. 21 is a schematic block diagram of a network device according to an embodiment of the application.
  • single-carrier waveforms such as DFT-s-OFDM or SC-QAM have a lower peak to average power ratio (PAPR). ), so under the same power amplifier, single carrier waveform can provide greater output power and higher power amplifier efficiency, so as to achieve the purpose of improving coverage and reducing energy consumption. Therefore, single-carrier waveforms such as DFT-s-OFDM or SC-QAM are widely used in various communication systems, such as long-term evolution (LTE) systems, 5th generation (5G) systems or new wireless (new radio, NR) system.
  • LTE long-term evolution
  • 5G 5th generation
  • NR new wireless
  • DFT-s-OFDM is Discrete Fourier Transformation-spread-orthogonal frequency division multiplexing (DFT-s-OFDM).
  • SC-QAM is single carrier-quadrature amplitude modulation (SC-QAM).
  • the DFT-s-OFDM waveform uses a cyclic prefix (CP) as the guard interval between symbols (DFT-s-OFDM symbols).
  • CP cyclic prefix
  • Figure 1 is a schematic diagram of the time domain structure of a cyclic prefix (hereinafter referred to as CP) as a guard interval between symbols.
  • CP cyclic prefix
  • the CP of the transmission symbol 1 refers to a cyclic structure formed by copying a section of the transmission symbol component from the position where the CP is intercepted to the end position in the transmission symbol 1 to the front of the transmission symbol 1.
  • the CP of the transmission symbol 2 refers to a cyclic structure formed by copying a section of the transmission symbol component from the position where the CP is intercepted to the end position in the transmission symbol 2 to the front of the transmission symbol 2.
  • the CP of transmission symbol 2 is used as a guard interval between transmission symbol 1 and transmission symbol 2
  • the CP of transmission symbol 1 is used as a guard interval between transmission symbol 1 and the previous transmission symbol (not shown in FIG. 1).
  • Fig. 2 shows the reception situation of the transmission symbol 1 and the transmission symbol 2 shown in Fig. 1 at the receiving end after channel transmission (as an illustration, only the maximum multipath delay of the channel is shown in Fig. 2).
  • Case 1 indicates that the maximum multipath delay of the channel does not exceed the CP length.
  • the receiving window of each transmitted symbol does not include the ISI of other transmitted symbols.
  • the receiving window of the transmitted symbol 2 does not include the transmitted symbol 1, so transmission can be avoided.
  • the ISI of symbol 1 and the receiving window of the transmitted symbol 1 also does not include the transmitted symbol before the transmitted symbol 1 (not shown in FIG. 2), so the transmitted symbol 1 will not be subject to ISI.
  • the received symbol is a cyclic convolution of the transmitted symbol and the channel, which allows the receiving end to use a frequency domain equalization method to eliminate channel multipath effects.
  • Case 2 indicates that the maximum multipath delay of the channel exceeds the CP length.
  • the receiving window of one transmit symbol will contain other transmit symbols.
  • the receive window of transmit symbol 2 contains a section of transmit symbol components of transmit symbol 1. Therefore, the transmission symbol 2 is subject to the ISI of the transmission symbol 1, and the reception window of the transmission symbol 1 may also include the transmission symbol before the transmission symbol 1 (not shown in FIG. 2). Therefore, the transmission symbol 1 is also subject to ISI.
  • the received symbol is no longer a cyclic convolution of the transmitted symbol and the channel, which is not conducive to the receiver's elimination of channel multipath effects.
  • the transmitting symbol mentioned in the above description means the symbol sent by the transmitting end, and the receiving symbol means the symbol received by the receiving end.
  • the CP length required by the channel condition of Case 2 is greater than the CP length required by the channel condition of Case 1.
  • different channel conditions may have different requirements for CP length.
  • the CP length affects the frame structure. Due to the complexity of the transceiver and out-of-band interference, the flexibility of multiplexing (frequency, space and time) between users with different CP lengths is poor.
  • network equipment in order to perform flexible multi-user multiplexing, network equipment usually configures the same CP length for different users.
  • user equipments with different channel conditions may also have different requirements for CP length.
  • the system in order to overcome the problem shown in Figure 2, that is, to ensure the performance of all users experiencing different channel conditions, the system selects a CP length greater than the channel delay of users with large delays as the CP length of all users. However, for Users with small delays, too long CP length will cause unnecessary signaling overhead.
  • This application proposes a method and device for symbol processing.
  • the guard interval between symbols can be flexibly configured.
  • the technical solutions of the embodiments of this application can be applied to various communication systems, for example, cellular communication systems such as LTE and their evolution, 5G systems or NR systems, machine-to-machine (M2M) systems, and other future-evolving communications System etc.
  • cellular communication systems such as LTE and their evolution, 5G systems or NR systems, machine-to-machine (M2M) systems, and other future-evolving communications System etc.
  • M2M machine-to-machine
  • An embodiment of the present application provides a method for symbol processing.
  • the method includes: transmitting a first transmission symbol and a second transmission symbol that are continuous in time domain, the first transmission symbol is located before the second transmission symbol, and the first transmission symbol
  • the symbol component whose ending position is the first reference point is the same as the symbol component of the second transmitted symbol whose ending position is the second reference point.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the position of the intercepted CP of the transmitted symbol, that is, the length of the second reference point from the end position of the transmitted symbol is equal to the CP length.
  • the second transmission symbol has a cyclic prefix.
  • FIG. 3 a schematic diagram of the time domain structure of the first transmission symbol and the second transmission symbol is shown in FIG. 3.
  • the symbol component D1 in the first transmission symbol is the same as the symbol component D2 in the second transmission symbol.
  • the end position of the symbol component D1 in the first transmission symbol is the first reference point, and the end of the symbol component D2 in the second transmission symbol The position is the second reference point.
  • the first reference point indicates the end position of the transmitted symbol
  • the second reference point indicates the position where the CP is intercepted in the transmitted symbol.
  • the symbol component D1 in the first transmission symbol is the same as the symbol component D2 in the second transmission symbol, including: the symbol component D1 and the symbol component D2 contain the same content, and the symbol component D1 and the symbol component D2 have the same time length.
  • the content contained in the symbol component D1 and the symbol component D2 is the same, and it can be understood that before the symbol component is generated, the corresponding complex symbols of the two are the same.
  • the symbol component D1 in the first transmission symbol is the same as the symbol component D2 in the second transmission symbol
  • the same here is not necessarily in an absolute sense. The same can also mean approximately the same. It should be understood that due to the filter tailing effect, there may be a slight deviation between the symbol component D1 in the first transmission symbol and the symbol component D2 in the second transmission symbol.
  • the method for symbol processing provided in the present application can be implemented by the transmitting end, for example, can be implemented by a transmitter or a circuit for implementing the transmitter.
  • the transmitting end can be a terminal device or a network device.
  • the transmission symbol in the embodiment of the present application may be an uplink waveform symbol and/or a downlink waveform symbol in a communication system.
  • FIG. 4 shows the reception situation of the first transmission symbol and the second transmission symbol (after channel transmission) shown in FIG. 3 at the receiving end (corresponding to the transmitting end).
  • Case 1 indicates that the maximum multipath delay of the channel does not exceed the CP length.
  • the receiving window of each transmitted symbol does not include the ISI of other transmitted symbols.
  • the receiving window of the second transmission symbol does not include the component of the first transmission symbol, and the ISI of the first transmission symbol can be avoided.
  • Case 2 indicates that the maximum multipath delay of the channel exceeds the CP length.
  • the receiving window of one transmitted symbol may contain other transmitted symbols.
  • the symbol component D1 of the first transmission symbol enters the receiving window of the second transmission symbol, but because the symbol component D1 of the first transmission symbol is the same as the symbol component D2 of the second transmission symbol, the first transmission symbol The symbol component D1 of the symbol enters the reception window of the second transmission symbol, which is equivalent to that the symbol component D2 of the second transmission symbol enters the reception window of the second transmission symbol.
  • the symbol component D2 is continuous with the symbol component used as the CP, based on the principle that the CP of the second transmission symbol will not cause ISI to the second transmission symbol, it enters the reception window of the second transmission symbol The symbol component D1 of the first transmission symbol will not cause ISI to the second transmission symbol.
  • the length of the symbol component D1 can be flexibly configured (which is equivalent to the length of the symbol component D2 flexibly), so that the sum of the length of the symbol component D1 and the CP length is greater than that of the channel. Extension can resist the multipath effect of the channel.
  • the symbol component D1 in the first transmission symbol and the CP of the second transmission symbol can be regarded as the difference between the first transmission symbol and the second transmission symbol.
  • the equivalent protection interval is shown in Figure 3.
  • the end position in the first transmission symbol is the symbol component of the first reference point and the end position in the second transmission symbol is the second reference point.
  • the symbol components of are the same, so that the flexible configuration of the guard interval between symbols can be realized by controlling the length of the symbol component shared between the first transmission symbol and the second transmission symbol.
  • the length of the symbol component shared between the first transmission symbol and the second transmission symbol does not affect the frame structure of the transmission symbol. Therefore, for users with different channel conditions, the shared symbol components of different lengths can be configured .
  • the guard interval between symbols can be flexibly configured, and secondly, multiplexing (frequency division, space division and time division) can also be performed between users configured with different guard intervals.
  • the guard interval between symbols can be flexibly configured, and the guard interval length can also be flexibly configured according to user requirements.
  • the length mentioned in this article for example, the length of the CP and the length of the symbol component, all refer to the length of time.
  • the time length can also be expressed by the number of time domain sampling points.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the position of the intercepted CP of the transmitted symbol
  • the third reference point represents the start position of the transmitted symbol.
  • the length of the second reference point from the end position of the transmitted symbol is equal to the CP length.
  • the starting position of the transmitted symbol refers to the starting position of the transmitted symbol itself, not the starting position of the CP of the transmitted symbol, or from another perspective, the starting position of the transmitted symbol refers to the The end position of the CP of the transmitted symbol.
  • the time domain structure of the transmission symbols (such as the first transmission symbol and the second transmission symbol described above) of the embodiment of the present application is described above in conjunction with FIG. 3 and FIG. 4.
  • the content related to the generation process of the transmission symbol will be described below.
  • Fig. 5 is a schematic diagram of a basic flow of symbol processing according to another embodiment of the present application. As shown in Figure 5, the process includes the following steps S320, S340, and S360.
  • multiple complex symbols are divided into multiple sets, and each set corresponds to a transmitted symbol.
  • the plurality of complex symbols may include modulation symbols obtained by modulating the coded bit stream.
  • the modulation method for modulating the coded bit stream can include pi/2-binary phase shift keying (BPSK), quadrature phase shift keying (quadrature phase shift keying, QPSK), 16 quadrature amplitude Modulation (quadrature amplitude modulation, QAM), 64QAM, 256QAM, phase shift keying (PSK), amplitude phase shift keying (APSK), non-uniform QAM, etc.
  • BPSK pi/2-binary phase shift keying
  • QPSK quadrature phase shift keying
  • QAM quadrature amplitude Modulation
  • QAM quadrature amplitude modulation
  • PSK phase shift keying
  • APSK amplitude phase shift keying
  • reference signal sampling points may also be included in the plurality of complex symbols.
  • the reference signal sampling points may include phase tracking reference signal (phase tracking reference signal, PTRS) sampling points, etc.
  • Each set corresponds to a transmit symbol, which means that each transmit symbol that is finally generated is generated based on a corresponding set.
  • each set corresponds to one DFT-s-OFDM symbol or SC-QAM symbol.
  • Each set can include several complex symbols.
  • each set can be regarded as a multi-dimensional time domain vector, and the complex symbols in the set can be regarded as elements in the time domain vector.
  • step S340 Perform a copy operation on the multiple sets obtained in step S320, so that two sets corresponding to two consecutive transmitted symbols in the time domain have partially identical complex symbols.
  • step S360 Obtain multiple transmission symbols by processing the multiple sets obtained in step S360, where the processing includes adding a CP.
  • step S360 add CP based on the set after the copy operation obtained in step S340, and then perform other operations to obtain the transmitted symbol.
  • Other operations described here include, but are not limited to, fast Fourier transform, carrier mapping, sampling, filtering, etc.
  • the two sets corresponding to two consecutive transmitted symbols in the time domain are copied, so that the two sets have the same complex symbols, which helps to generate the time domain structure as shown in Fig.
  • the transmitted symbols shown in 3 can thus realize the flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the naming conventions for the signals in this article are as follows: the signals to be grouped (or divided) into sets are called complex symbols; the signals obtained by grouping (or dividing) complex symbols are called sets; The set formed by part of the complex numbers in the set is called the subset; the signal sent by the transmitter is called the transmit symbol.
  • the transmission symbol in the embodiment of the present application may be a symbol of a single carrier waveform.
  • the transmitted symbol is a DFT-s-OFDM symbol.
  • the DFT-s-OFDM symbol represents a single carrier symbol whose waveform is a DFT-s-OFDM waveform.
  • the transmitted symbol is an SC-QAM symbol.
  • the SC-QAM symbol represents a single carrier symbol whose waveform is an SC-QAM waveform.
  • the application of this application to the wireless communication system using the DFT-s-OFDM waveform is recorded as application scenario 1
  • the application of this application to the wireless communication system using the SC-QAM waveform is recorded as application scenario 2.
  • the application scenario of this application is application scenario 1, that is, the transmitted symbol is a DFT-s-OFDM symbol.
  • step S360 it not only includes the operation of adding CP, but also includes the operation of discrete Fourier transform (DFT) and inverse fast fourier transform (IFFT).
  • DFT discrete Fourier transform
  • IFFT inverse fast fourier transform
  • step S360 the transmitter performs M-point DFT transformation on the set after the copy operation; maps the M-point frequency domain elements after DFT transformation to M continuous subcarriers (not shown in Figure 6); After the carrier is mapped, the frequency domain signal is transformed by IFFT; CP is added to the signal after IFFT, and the DFT-s-OFDM symbol is finally obtained.
  • DFT can also be called frequency domain precoding.
  • step S360 also includes frequency domain spectrum shaping (FDSS) operations.
  • FDSS frequency domain spectrum shaping
  • step S360 the transmitter performs M-point DFT transformation on the set after the copy operation; performs cyclic extension and frequency-domain filtering on the M-point frequency domain elements after DFT transformation (ie, FDSS operation); and then performs FDSS operation
  • the application scenario of this application is application scenario 2, that is, the transmitted symbol is an SC-QAM symbol.
  • step S360 not only the operation of adding CP, but also upsampling and filtering are included.
  • step S360 the transmitter adds a CP to the collection after the copy operation to obtain a CP-added signal, and then performs up-sampling and filtering on the CP-added signal to finally obtain an SC-QAM symbol.
  • the two sets corresponding to two consecutive transmitted symbols in the time domain are copied, so that the two sets have the same complex symbols, which helps to generate the time domain structure as shown in Fig.
  • the transmitted symbols shown in 3 can thus realize the flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • three reference points are defined for the transmitted symbol: a first reference point, a second reference point, and a third reference point, as shown in FIG. 3.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the position of the intercepted CP of the transmitted symbol
  • the third reference point represents the start position of the transmitted symbol.
  • the length of the second reference point from the end position of the transmitted symbol is equal to the CP length.
  • Application scenario one that is, the transmitted symbols are DFT-s-OFDM symbols.
  • the symbol processing flow is shown in Figure 6.
  • the time domain vector can be denoted as:
  • x l [x l (0),x l (1),...,x l (M-1)] T
  • x l represents the time domain vector.
  • the time domain vector x l includes M elements, and the time domain indexes of the first element to the last element are 0, 1, ..., M-1, respectively.
  • the number of DFT points at the transmitting end is M (consistent with Assumption 1), the size of IFFT at the transmitting end is N, and the number of sampling points of the CP is Q, the length occupied by the CP can be before DFT
  • the calculation result of K is a non-integer. In this case, the calculation result of K needs to be rounded, that is It means that (Q/N) ⁇ M is rounded down. It should be understood that the rounding method here may also be rounding up or rounding.
  • the number of sampling points Q of the CP can be obtained according to the length of the CP.
  • the foregoing correspondence relationship may represent the position of the main component of each complex symbol in the DFT-s-OFDM symbol after the DFT-s-OFDM symbol is generated for the complex symbol set.
  • Application scenario two that is, the transmitted symbol is an SC-QAM symbol.
  • DFT and IFFT are not included before adding the CP, and upsampling and filtering are performed after adding the CP, so the CP length can be directly obtained according to the CP length
  • the number of equivalent points in the time domain vector. Therefore, the transmitter can directly obtain the equivalent CP length value K1.
  • the equivalent CP length value K1 can be obtained according to the CP length.
  • the time domain vector without CP added is the M-dimensional time domain vector x l described in Application Scenario 1 , and assuming the equivalent CP length value is K1, then for the first reference point of the SC-QAM symbol, it is in the time domain vector
  • the time domain index in x l is M-1.
  • For the second reference point of the SC-QAM symbol its time domain index in the time domain vector x l is M-K1-1.
  • For the first reference point in the SC-QAM symbol Three reference points, whose time domain index in the time domain vector x l is 0.
  • the set can be regarded as a multi-dimensional time domain vector.
  • the time domain vector x l in the above example may represent the time domain vector corresponding to the set.
  • the elements in the time-domain vector x l correspond to the complex symbols in the set.
  • the time domain index of the element in the time domain vector x l corresponds to the position of the complex symbol in the collection.
  • the temporal position e.g., the first reference point, the second reference point, third reference point
  • time domain transmit symbols x l vector index in the time domain and in time domain vector elements x l having a corresponding Correspondence. Therefore, it can be understood that the positions of the complex symbols in the set also have a corresponding relationship with the positions in the transmitted symbols corresponding to the set.
  • FIG. 8 is a schematic flowchart of a symbol processing method according to another embodiment of the present application. The method includes the following steps S810 to S830.
  • the plurality of complex symbols may include modulation symbols obtained by modulating the coded bit stream.
  • reference signal sampling points may also be included in the plurality of complex symbols.
  • the reference signal sampling points may include PTRS sampling points.
  • Each set can include several complex symbols.
  • each set can be regarded as a multi-dimensional time domain vector, and the complex symbols in the set can be regarded as elements in the time domain vector.
  • Each set corresponds to a transmitted symbol.
  • each set corresponds to one DFT-s-OFDM symbol or SC-QAM symbol.
  • the multiple sets include a first set corresponding to the first transmission symbol and a second set corresponding to the second transmission symbol.
  • the first transmission symbol and the second transmission symbol are continuous in time domain, and the first transmission symbol is located before the second transmission symbol. .
  • Step S820 may correspond to step S320 shown in FIG. 5, FIG. 6, and FIG. 7.
  • S830 Perform a copy operation on the first set and the second set, so that both the first set and the second set have the first complex sign.
  • the first complex number symbol may include multiple complex number symbols.
  • the subset formed by the first complex number symbols in the first set is called the first subset
  • the subset formed by the first complex symbols in the second set is called the second subset
  • step S830 the copy operation makes the first set include the first subset, the second set includes the second subset, and the first subset and the second subset include the same complex symbols, where the time domain of the first subset The position and the time domain position of the second subset may be the same or different.
  • the time domain position of the first subset and the time domain position of the second subset may be the same, that is, the time domain index of the start position of the first subset is the same as the time domain index of the second subset.
  • the time domain index of the start position is the same, and the time domain index of the end position of the first subset is the same as the time domain index of the end position of the second subset.
  • step S830 in this embodiment is referred to as a co-location copy operation.
  • the copy operation in step S830 mentioned below is a co-location copy operation, which means that the copy operation in step S830 makes the first set and the second set have the first complex number sign, and the first complex number in the first set
  • the time domain position of the first subset formed by the symbols is the same as the time domain position of the second subset formed by the first complex symbols in the second set.
  • the first subset and the second subset have the same length, but do not have the same index, for example, the time domain position of the first subset and the time domain of the second subset The position in the domain is different.
  • the transmitter can adjust the first subset and the second subset to the same time domain position through time domain cyclic shift or frequency domain weighting in the subsequent processing steps, which is equivalent to the same time domain position.
  • copy operation performed on the first set and the second set in step S830 can also be understood as mapping the first complex number symbols in the first set and the second set.
  • Step S830 may correspond to step S340 shown in FIG. 5, FIG. 6, and FIG. 7.
  • step S830 is performed before DFT; in application scenario 2, step S830 is performed before adding CP.
  • the copy operation in step S830 may be forward copy or backward copy.
  • step S830 includes: copying the first complex symbol in the first set to the second set. This way of copying can be called backward copying.
  • step S830 includes: copying the first complex symbol in the second set to the first set. This way of copying can be called forward copying.
  • S840 Perform signal processing on the first set and the second set after the copy operation, where the signal processing includes cyclic shift or frequency domain weighting.
  • step S840 signal processing is performed on the time domain signal corresponding to the first set and the time domain signal corresponding to the second set; if the signal in step S840 The processing is frequency domain weighting, then in step S840, frequency domain weighting is performed on the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set.
  • step S840 There are multiple ways to implement step S840.
  • the signal processing in step S840 includes first signal processing, and the first signal processing includes cyclic shift or frequency domain weighting.
  • step S840 includes: performing first signal processing on the first set and the second set after the copy operation respectively, and the first signal processing makes the end position of the first subset correspond to the first transmission
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the position of the intercepted cyclic prefix of the transmitted symbol.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the intercepted cycle of the transmitted symbol. The position of the prefix.
  • the first set and the second set corresponding to the first transmission symbol and the second transmission symbol that are continuous in the time domain are copied, so that both the first set and the second set have the first complex symbol; Perform the first signal processing on the first set and the second set, so that the end position of the first subset formed by the first complex symbols in the first set corresponds to the first reference point of the first transmitted symbol, and the first signal in the second set
  • the end position of the second subset corresponds to the second reference point of the second transmission symbol, so that the first transmission symbol and the second transmission symbol as shown in FIG. 3 in the time domain structure can be generated. Therefore, the embodiment of the present application can realize flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the signal processing in step S840 includes first signal processing and second signal processing, the first signal processing includes cyclic shift or frequency domain weighting, and the second signal processing includes cyclic shift. Bit or frequency domain weighting.
  • the first signal processing is cyclic shift
  • the second signal processing is cyclic shift
  • the first signal processing is frequency domain weighting
  • the second signal processing may be frequency domain weighting or cyclic shift.
  • step S840 includes: performing first signal processing on the first set and the second set after the copy operation respectively, and the first signal processing makes the end position of the first subset correspond to the first signal processing.
  • the processed signal is subjected to a second signal processing, and the second signal processing is such that the start position of the first subset corresponds to the position before the first reference point of the first transmitted symbol, and the end position of the first subset corresponds to The position after the first reference point of the first transmission symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the second The position after the second reference point of the transmitted symbol, where the first reference point represents the end position of the transmitted symbol, and the second reference point represents the position of the intercepted cyclic
  • the second signal processing can be understood as a common shift operation on the first set and the second set.
  • the first set and the second set corresponding to the first transmission symbol and the second transmission symbol that are continuous in the time domain are copied, so that both the first set and the second set have the first complex symbol;
  • the start position and the end position of the first subset respectively correspond to the positions before and after the first reference point of the first transmitted symbol
  • the start position and the end position of the second subset respectively correspond to the positions before and after the second reference point of the second transmission symbol, so that the first transmission symbol and the second transmission symbol shown in FIG. 3 can be generated in the time domain structure. symbol. Therefore, the embodiment of the present application can realize flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the start position and the end position of the first subset respectively correspond to before the first reference point of the first transmitted symbol
  • the positions after and after, and the start position and end position of the second subset respectively correspond to the positions before and after the second reference point of the second transmitted symbol, which can reduce the effect of filter tailing to a certain extent.
  • the starting position of the first subset corresponds to the position before the first reference point of the first transmitted symbol
  • the ending position of the first subset corresponds to the first position of the first transmitted symbol.
  • the position after the reference point means that the start position of the first subset in the first set corresponds to the tail position of the first transmitted symbol, and the end position of the first subset corresponds to the head position of the first transmitted symbol .
  • the starting position of the first subset corresponds to the position before the first reference point of the first transmission symbol
  • the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol
  • the end position of the first subset corresponds to the position after the first reference point of the first transmitted symbol
  • the position of the first subset The end position corresponds to the head position of the first transmitted symbol
  • the end position of the first subset corresponds to the position after the third reference point of the first transmitted symbol, where the third reference point represents the start of the transmitted symbol position.
  • the end position of the first subset corresponds to the position after the first reference point of the first transmitted symbol
  • the end position of the first subset corresponds to The position before the first reference point of the first transmitted symbol
  • the time domain position of the first subset corresponds to the time domain position in the first transmitted symbol, which covers the first reference point of the first transmitted symbol (that is, the end position of the first transmitted symbol). ), therefore, the following description is adopted: "The start position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the first reference point of the first transmission symbol The position after the dot".
  • the signal processing in step S840 includes third signal processing, and the third signal processing includes cyclic shift or frequency domain weighting.
  • step S840 includes: performing third signal processing on the first set and the second set after the copy operation, respectively, and the third signal processing makes the start position of the first subset correspond to the first set A position before the first reference point of a transmitted symbol, and the end position of the first subset corresponds to a position after the first reference point of the first transmitted symbol, and the start position of the second subset corresponds to the second transmission
  • the position before the second reference point of the symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmitted symbol, where the first reference point represents the end position of the transmitted symbol, and the second reference point Indicates the location of the intercepted cyclic prefix of the transmitted symbol.
  • the third implementation manner can be regarded as the result of combining the first signal processing and the second signal processing in the second implementation manner into one signal processing, where both the first signal processing and the second signal processing are Cyclic shift, or both the first signal processing and the second signal processing are frequency domain weighted.
  • the first set and the second set corresponding to the first transmission symbol and the second transmission symbol that are continuous in the time domain are copied, so that both the first set and the second set have the first complex symbol;
  • the start position and the end position of the first subset respectively correspond to the positions before and after the first reference point of the first transmitted symbol, and the second subset
  • the start position and the end position of the first subset respectively correspond to the positions before and after the first reference point of the first transmitted symbol
  • the start position and the end position of the second subset respectively correspond to the positions before and after the second reference point of the second transmitted symbol, which can reduce to a certain extent the guard interval between the symbols due to the trailing effect of the filter The impact of expansion.
  • set 1 corresponds to transmission symbol 1
  • set 2 corresponds to transmission symbol 2.
  • FIG. 9 shows the correspondence between the set and the transmitted symbol in the case where step S840 is not performed.
  • set 1 and set 2 are sets that have undergone a copy operation (that is, step S830 in the embodiment of the present application). Both set 1 and set 2 include a first complex symbol, and the first complex symbol may include a plurality of complex symbols.
  • the subset formed by the first complex number symbol in set 1 is the subset S1 shown in Figure 9, and the subset formed by the first complex number symbol in set 2 is the subset S2 shown in Figure 9.
  • Subset The time domain positions of S1 and subset S2 are the same, that is, the start positions of the subset S1 and the subset S2 are the same, and the end positions are also the same.
  • transmission symbol 1 represents a transmission symbol generated based on set 1 without performing step S840
  • transmission symbol 2 represents a transmission symbol generated based on set 2 without performing step S840
  • the symbol component D1 in the transmission symbol 1 is the same as the symbol component D2 in the transmission symbol 2, and the time domain positions of the symbol component D1 and the symbol component D2 are the same.
  • the subset S1 in the set 1 corresponds to the symbol component D1 in the transmission symbol 1
  • the subset S2 in the set 2 corresponds to the symbol component D2 in the transmission symbol 2.
  • transmission symbol 1 represents a transmission symbol generated based on set 1 without performing step S840
  • transmission symbol 2 represents a transmission symbol generated based on set 2 without performing step S840
  • the position of the symbol component D1 in the transmission symbol 1 is not shifted relative to the position of the subset S1 in the set 1
  • the position of the symbol component D2 in the transmission symbol 2 is not shifted relative to the position of the subset S2 in the set 2.
  • FIG. 10 shows the corresponding relationship between the set and the transmitted symbol in the case of performing step S840.
  • the implementation manner of step S840 is the foregoing second implementation manner or the third implementation manner.
  • set 1 and set 2 are sets that have been copied (that is, step S830 in the embodiment of the present application). Both set 1 and set 2 include a first complex symbol, and the first complex symbol may include a plurality of complex symbols.
  • the subset formed by the first complex symbol in set 1 is the subset S1 shown in FIG. 10, and the subset formed by the first complex symbol in set 2 is the subset S2 shown in FIG.
  • the time domain positions of S1 and subset S2 are the same, that is, the start positions of the subset S1 and the subset S2 are the same, and the end positions are also the same.
  • transmission symbol 1 represents a transmission symbol generated based on set 1 when step S840 is performed
  • transmission symbol 2 represents a transmission symbol generated based on set 2 when step S840 is performed.
  • the symbol component D1 in the transmission symbol 1 is the same as the symbol component D2 in the transmission symbol 2.
  • the start position of the symbol component D1 is before the first reference point of the transmission symbol 1, and the end position of the symbol component D1 is the first reference point of the transmission symbol 1. After the reference point (that is, the head of the transmitted symbol 1), in other words, the end position of the symbol component D1 is located after the third reference point of the transmitted symbol 1, as shown in FIG. 10.
  • the start position of the symbol component D2 is located before the second reference point of the transmitted symbol 2, and the end position of the symbol component D2 is located after the second reference point of the transmitted symbol 2.
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the position where the transmitted symbol intercepts the CP, that is, the distance between the second reference point and the first reference point is equal to the length of the CP
  • the third reference point represents the position of the transmitted symbol starting point.
  • the symbol component D1 in the transmission symbol 1 corresponds to the subset S1 in the set 1
  • the symbol component D2 in the transmission symbol 2 corresponds to the subset S2 in the set 2.
  • the transmission symbol 1 represents the transmission symbol generated based on the set 1 in the case of performing step S840
  • the transmission symbol 2 represents the transmission symbol generated based on the set 2 in the case of performing step S840
  • the transmission symbol The position of the symbol component D1 in 1 is shifted relative to the position of the subset S1 in the set 1
  • the position of the symbol component D2 in the transmitted symbol 2 is shifted relative to the position of the subset S2 in the set 2.
  • the first set in the embodiment of the present application may correspond to set 1 in FIG. 10
  • the second set may correspond to set 2 in FIG. 10
  • the first transmission symbol may correspond to transmission symbol 1 in FIG. 10.
  • the second transmission symbol may correspond to transmission symbol 2 in FIG. 10.
  • step S840 includes first signal processing and second signal processing.
  • the time domain structure of the first transmission symbol corresponding to the first set and the second transmission symbol corresponding to the second set in the embodiment of the present application is shown in FIG. 11 Show.
  • the symbol component D1 in the first transmission symbol is the same as the symbol component D2 in the second transmission symbol.
  • the start position of the symbol component D1 is before the first reference point of the first transmission symbol, and the end of the symbol component D1
  • the position is after the first reference point of the first transmitted symbol (that is, at the head of the first transmitted symbol), the start position of the symbol component D2 is before the second reference point of the second transmitted symbol, and the end position of the symbol component D2 is After the second reference point of the second transmitted symbol.
  • the symbol component of the symbol component D1 located before the first reference point of the first transmission symbol is denoted as D11, and the symbol component of the symbol component D1 located after the first reference point of the first transmission symbol (ie, located The symbol component after the third reference point) is denoted as D12; the symbol component in the symbol component D2 located before the second reference point of the second transmission symbol is denoted as D21, and the symbol component D2 is located at the second reference of the second transmission symbol The symbol component after the dot is denoted as D22.
  • the symbol component D11 in the first transmission symbol shown in FIG. 11 corresponds to the symbol component D1 in the first transmission symbol shown in FIG. 3, and the second transmission symbol shown in FIG. 11
  • the symbol component D21 in the symbol corresponds to the symbol component D2 in the second transmission symbol shown in FIG. 3.
  • the two sets corresponding to two consecutive transmission symbols in the time domain are copied and the first signal processing and the second signal processing are performed to generate the first transmission symbol and the first transmission symbol shown in FIG. 11 in the time domain structure. 2. Launch symbol. Therefore, the embodiment of the present application can realize flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the start position and the end position of the first subset respectively correspond to before the first reference point of the first transmitted symbol
  • the positions after and after, and the start position and end position of the second subset respectively correspond to the positions before and after the second reference point of the second transmitted symbol, which can reduce the effect of filter tailing to a certain extent.
  • first and second transmission symbols that are continuous in the time domain are used as examples for description in this application. It should be understood that the symbol processing method provided in this application can be applied to the signal stream transmitted by the transmitting end. Two consecutive transmit symbols or multiple transmit symbols in any time domain.
  • step S840 in the embodiment of the present application may be different according to different application scenarios.
  • step S840 may include 1, 2, and 3 as shown in FIG. 6.
  • the transmitted symbols are DFT-s-OFDM symbols
  • the signal processing in step S840 includes cyclic shift
  • this step S840 includes the following operations: Perform frequency domain processing on the second set to obtain frequency domain signals corresponding to the first set and frequency domain signals corresponding to the second set; frequency domain signals corresponding to the first set and frequency domain signals corresponding to the second set IFFT is performed on the frequency domain signal to obtain the time domain signal corresponding to the first set and the time domain signal corresponding to the second set; the time domain signal corresponding to the first set and the time domain signal corresponding to the second set are obtained
  • the signal is cyclically shifted so that the start position of the first subset corresponds to the position before the first reference point of the first transmitted symbol, and the end position of the first subset corresponds to the first
  • the position after the first reference point of the transmitted symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset Corresponding to the position after
  • step S840 is executed at the timing shown in (3) in FIG. 6.
  • Performing frequency domain processing on the first set and the second set refers to performing DFT on the first set and the second set.
  • the transmitted symbols are DFT-s-OFDM symbols
  • the process of generating DFT-s-OFDM symbols in this application is as shown in FIG. 12.
  • the process includes the following steps.
  • the coded bit stream is modulated to obtain multiple modulation symbols.
  • the modulation symbols may be referred to as complex symbols.
  • This step may correspond to step S810 in this embodiment.
  • This step corresponds to step S820 in this embodiment.
  • Performing a copy operation of complex symbols on multiple sets may correspond to step S830 in this embodiment.
  • the M-point frequency domain elements after DFT transformation are mapped to M consecutive subcarriers (not shown in FIG.
  • step 12 the transmitter inserts zeros on subcarriers other than the M subcarriers or maps other signals.
  • IFFT transformation is performed on the frequency domain signal. Performing cyclic shift on the IFFT signal, this step may correspond to step S840 in this embodiment.
  • CP is added to the cyclically shifted signal, and after parallel-to-serial conversion (P/S), DFT-s-OFDM symbols are finally obtained.
  • the grouping in the embodiment of the present application can be implemented through serial/parallel conversion (S/P).
  • S/P serial/parallel conversion
  • the transmitted symbols are DFT-s-OFDM symbols
  • the signal processing in step S840 includes frequency domain weighting
  • this step S840 includes the following operations: performing the first set and the second set Discrete Fourier Transform DFT to obtain the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set; perform frequency domain weighting on the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set, so that The start position of the first subset corresponds to the position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the second The start position of the subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol.
  • the frequency domain weighting in this embodiment can be equivalent to the cyclic shift of the time domain symbol.
  • This embodiment corresponds to the execution of the cyclic shift at the timing shown in 2 in FIG.
  • the transmitted symbols are DFT-s-OFDM symbols
  • the process of generating DFT-s-OFDM symbols in this application includes the following steps.
  • the coded bit stream is modulated to obtain multiple modulation symbols.
  • the modulation symbols may be referred to as complex symbols.
  • This step may correspond to step S810 in this embodiment.
  • This step corresponds to step S820 in this embodiment.
  • a copy operation of complex symbols is performed on multiple sets.
  • This step may correspond to step S830 in this embodiment.
  • the frequency domain weighting is performed on the M point frequency domain elements after the DFT change.
  • the M point frequency domain elements after the frequency domain weighting are mapped to M consecutive subcarriers, and the transmitter inserts zeros on the subcarriers other than the M subcarriers or maps the remaining signals.
  • IFFT transformation is performed on the frequency domain signal. Performing cyclic shift on the IFFT signal, this step may correspond to step S840 in this embodiment. Add CP to the cyclically shifted signal, and finally obtain the DFT-s-OFDM symbol.
  • the weights used satisfy the following formula:
  • C(k,l) represents the weight.
  • j represents the plural symbol, namely
  • N u represents the length of the symbol after IFFT excluding CP
  • M represents the number of DFT points
  • N u represents the length of the symbol after IFFT excluding CP
  • M represents the number of DFT points
  • o1 represents the starting symbol of the accumulation, and the value can be 0, 1, 2, etc.
  • N 1 represents the initial shift value, and N 1 can be set.
  • n 0 (1) M ⁇ N 1 /N u .
  • n 0 (1) can be calculated by N 1 .
  • n 0 (1) can be directly defined through a protocol.
  • the equivalent shift value of the transmission symbol with the symbol number l+1 is N CP,l+1 more than the equivalent shift value of the transmission symbol with the symbol number l.
  • N CP,l /N u can be directly defined through a protocol.
  • the cyclic shift is performed after the copy operation and before the CP is added, for example, at the timing shown in 4 in FIG. 7.
  • the transmitted symbols are DFT-s-OFDM symbols or SC-QAM symbols
  • the signal processing in step S840 includes cyclic shift
  • this step S840 includes the following operations: directly to step S830
  • the obtained first set and the second set are cyclically shifted, so that the start position of the first subset corresponds to the position before the first reference point of the first transmitted symbol, and the end position of the first subset corresponds to the first The position after the first reference point of the transmitted symbol, and the start position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to the second transmission symbol The position after the second reference point.
  • This embodiment may perform cyclic shift corresponding to the timing shown in 1 in FIG. 6, or this embodiment may perform cyclic shift corresponding to the timing shown in 4 in FIG.
  • step S830 includes performing a copy operation on the first set and the second set, so that both the first set and the second set have the first complex symbol, and
  • the time domain index of the starting position of the first subset formed by the first complex symbol in the first set is the same as the time domain index of the starting position of the second subset formed by the first complex symbol in the second set, where ,
  • the time domain index of the start position of the first subset is related to the length of the CP and the symbol number.
  • the positions of the complex symbols participating in the copy operation can be determined according to the symbol numbers of the transmitted symbols.
  • step S830 a co-location copy operation is performed on the first set and the second set, where the time domain index i of the starting position of the first subset satisfies the following formula:
  • A represents the time domain index of the first subset in the set whose symbol number 1 is 0.
  • CL CP (l) represents the equivalent cumulative CP length of the first set of symbol number 1, and represents the time domain vector before the DFT of the sum of the CP lengths from the transmitted symbol with symbol number o1 to the transmitted symbol with symbol number l
  • the equivalent length in, where o1 represents the starting symbol of the accumulation, and the value can be 0, 1, 2, etc.
  • the CP length of transmission symbols with different symbol numbers may be the same or different.
  • the equivalent cumulative CP length CL CP (l) of the set of symbol number l satisfies the following formula:
  • N u denotes the length of a symbol after IFFT except CP
  • N CP o o represents a symbol number as a set of shift values (CP length) after the IFFT
  • O1 represents the accumulated start symbol
  • the value can be 0, 1, 2, etc., Indicates rounding down. Downward values can be replaced with other rounding methods.
  • the CPs of transmit symbols with different symbol numbers in the signal stream are all the same in length, then in the first set and the second set that have undergone the copy operation, the start position of the first subset is
  • the time domain index i satisfies the following formula:
  • A represents the time domain index of the first subset in the set whose symbol number 1 is 0.
  • L CP represents the equivalent length of the CP length in the time domain vector before the DFT.
  • step S830 the time domain index of the start position of the first subset is the same as the time domain index of the start position of the second subset. Therefore, the time domain index of the start position of the second subset i also satisfies the following formula above.
  • the copy position (that is, the time domain index of the symbol component to be copied) for copying the two sets corresponding to the two transmitted symbols with symbol numbers l and l+1 is the same as the symbol number l+1 and The two sets corresponding to the two transmitted symbols of l+2 have different copy positions for the copy operation.
  • FIG. 13 is a schematic diagram of the time domain structure after the co-location copy operation is performed on multiple sets corresponding to multiple time domain symbols consecutive in the time domain.
  • both set 1 and set 2 have a subset G1 composed of plural symbols, and the position of subset G1 in set 1 and set 2 is the same; set 2 and set 3 both have subset G2, and subset G2 has the same position in set 1 and set 2, and so on.
  • L CP represents the equivalent length of the CP length in the time domain vector before the DFT.
  • step S830 includes: performing a copy operation on the first set and the second set, so that both the first set and the second set have the first complex number symbol, and the first complex number in the first set
  • the time domain index of the starting position of the first subset formed by the symbols is the same as the time domain index of the starting position of the second subset formed by the first plural symbols in the second set, where the starting position of the first subset
  • the start position corresponds to the position before the first reference point of the first transmission symbol
  • the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol (that is, after the third reference point of the first transmission symbol) ⁇ position)
  • the start position of the second subset corresponds to the position before the first reference point of the second transmission symbol
  • the end position of the second subset corresponds to the position after the first reference point of the second transmission symbol (ie The position after the third reference point of the second transmitted symbol).
  • the first reference point represents the end position of the transmitted symbol
  • the second reference point represents the
  • the first set may not be cyclically shifted, and only the second set may be cyclically shifted.
  • the signal processing in step S840 includes cyclic shift.
  • the cyclic shift step size for the first set is determined according to the length of the CP and the symbol number of the first transmitted symbol.
  • the cyclic shift step size is related to the symbol number of the second transmitted symbol according to the length of the CP.
  • the cyclic shift step size Z(l) of the set of symbol number l satisfies the following formula:
  • Z 0 represents the cyclic shift step size of the set of symbol number 0
  • the CP length of transmission symbols with different symbol numbers may be the same or different.
  • the CP lengths of transmit symbols of different symbol numbers in the signal stream are all the same, and the cyclic shift step size Z(l) of the set of symbol number 1 satisfies the following formula:
  • Z 0 represents the cyclic shift step size of the set with the symbol number 0, and the cyclic shift step size of the set may be a preset value, for example, an empirical value.
  • N cp represents the equivalent length of the CP length in the time domain vector after IFFT.
  • FIG. 14 is a schematic diagram of performing a copy operation and signal processing (cyclic shift or frequency domain weighting) on multiple sets corresponding to multiple consecutive time domain symbols in the time domain.
  • the 6 transmission symbols located in the time domain window of the transmission symbol in FIG. 14 represent the continuous transmission symbols in the time domain generated by the set 1 to set 6 processed in step S830 and step S840.
  • the cyclic prefix (CP) of the transmitted symbol is not considered.
  • the symbol numbers of transmission symbol 1 to transmission symbol 6 are 0, 1, ..., 5 in sequence.
  • the transmission symbol 1 in FIG. 14 is the transmission symbol obtained by signal processing (cyclic shift or frequency domain weighting) of the set 1 in FIG. 13 and the transmission symbol 2 in FIG.
  • the transmitted symbol obtained by signal processing (cyclic shift or frequency domain weighting) of set 2 of ,..., the transmitted symbol 6 in Figure 14 is obtained by signal processing (cyclic shift or frequency domain weighting) of set 6 in Figure 13 Launch symbol.
  • the cyclic shift step size of the transmission symbol with the symbol number l+1 differs from the cyclic shift step size of the transmission symbol with the symbol number l by one CP length. It is assumed here that the CP lengths of transmitted symbols of different symbol numbers are the same.
  • the embodiments of the application can be applied to generate DFT-s-OFDM symbols and SC-QAM symbols.
  • the present application may also be applied to generate reference signals, such as reference signals such as demodulation reference signals (DMRS).
  • DMRS demodulation reference signals
  • the reference signal is usually generated in the frequency domain and directly subjected to subcarrier mapping.
  • the copy operation in this embodiment of the present application is performed after calculating the sample value for transforming the frequency domain sequence of the reference signal into the time domain.
  • the reference signal is used to estimate the channel, in order to ensure channel performance, it is not desirable that the reference signal contains time domain sampling points of other symbols.
  • step S830 if the transmission symbol x is a reference signal, and the transmission symbols before and after the transmission symbol x are all non-reference signals, then for the transmission symbol before the transmission symbol x (including the reference signal x) In step S830, forward copy is used, and for the reference signal (including the reference signal x) after the transmitted symbol x, backward copy is used in step S830.
  • the first transmission symbol may be a reference signal
  • the second transmission symbol is a non-reference signal
  • the first transmission symbol is DMRS.
  • the first transmission symbol is a non-reference signal
  • the second transmission symbol may be a reference signal
  • the second transmission symbol is DMRS.
  • the guard interval between symbols can be configured flexibly, and the integrity of the reference signal can be ensured.
  • Figure 15 shows a schematic diagram of the time-domain structure of three transmission symbols (1,2,3).
  • transmission symbol 2 is DMRS
  • transmission symbol 1 and transmission symbol 2 are non-reference signals
  • transmission symbol 2 corresponds to set 2 and transmission
  • the copy relationship between set 1 corresponding to symbol 1 is forward copy
  • the copy relationship between set 2 corresponding to transmitted symbol 2 and set 3 corresponding to transmit symbol 3 is backward copy.
  • the symbol component R12 whose starting position is the second reference point in the transmission symbol 2 is copied to the transmission symbol 1
  • the starting position of the symbol component R12 copied to the transmission symbol 1 is the third position of the transmission symbol 1.
  • Reference point, the symbol component R11 whose ending position is the second reference point in the transmission symbol 2 is copied to the transmission symbol 1
  • the ending position of the symbol component R11 copied to the transmission symbol 1 is the first reference point of the transmission symbol 1.
  • the symbol component R21 whose ending position is the first reference point in transmit symbol 2 is copied to transmit symbol 3.
  • the ending position of symbol component R21 copied to transmit symbol 3 is the second reference point of transmit symbol 3.
  • the symbol component R22 whose starting position is the third reference point is copied to the transmission symbol 3, and the starting position of the symbol component R22 copied to the transmission symbol 3 is the second reference point of the transmission symbol 3.
  • the first reference point indicates the end position of the transmitted symbol
  • the second reference point indicates the position of the intercepted CP of the transmitted symbol
  • the third reference point indicates the start position of the transmitted symbol (the end position of the CP), as shown in FIG. 15.
  • the copy relationship between transmit symbol 2 and transmit symbol 1 is forward copy, that is, the symbol components R11 and R12 in DMRS are copied to symbol 1, and so on, the symbol component D0 in transmit symbol 1 Copy to the symbol before the symbol 1 (not shown in Figure 15);
  • the copy relationship between the DMRS and the transmitted symbol 3 is backward copy, that is, the symbol components R21 and R22 in the DMRS are copied to the transmitted symbol 3, and so on,
  • the symbol component in the transmission symbol 3 is copied to the symbol after the transmission symbol 2 (not shown in FIG. 15).
  • this embodiment can not only implement flexible configuration of the guard interval between symbols, but also ensure the accuracy of the reference signal, thereby ensuring the channel performance.
  • this application proposes a method for symbol processing, which includes the following steps.
  • Step 1) get multiple complex number symbols.
  • Step 2 Divide multiple complex symbols into multiple sets.
  • the multiple sets include a first set and a second set.
  • the first set corresponds to the first transmission symbol
  • the second set corresponds to the second transmission symbol.
  • the first transmission symbol It is continuous with the second transmission symbol in the time domain, the first transmission symbol is located before the second transmission symbol, and the complex symbols in the first subset in the first set are the same as the complex symbols in the second subset in the second set.
  • the time domain vector corresponding to the first set is the same as the time domain vector corresponding to the second set.
  • Step 3) Perform signal processing on the first set and the second set.
  • the signal processing includes cyclic shift or frequency domain weighting, and the signal processing makes the starting position of the first subset correspond to the first reference point of the first transmitted symbol.
  • the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol
  • the starting position of the second subset corresponds to the position before the second reference point of the second transmission symbol
  • the end position of the second subset corresponds to the position after the second reference point of the second transmitted symbol.
  • the first reference point indicates the end position of the transmitted symbol
  • the second reference point indicates the position of the intercepted cyclic prefix of the transmitted symbol.
  • the transmission symbols corresponding to the first set and the second set are reference signals, for example, DMRS.
  • the first set and the second set are not copied.
  • the transmitted symbols corresponding to the first set and the second set are reference signals, the accuracy of the reference signals can be guaranteed. , Can realize the flexible configuration of the guard interval of the reference signal.
  • the embodiment of the present application can generate a time domain structure as shown in FIG. 3 by performing a copy operation on two sets corresponding to two consecutive transmitted symbols in the time domain and signal processing including cyclic shift or frequency domain weighting.
  • the first transmission symbol and the second transmission symbol can realize flexible configuration of the guard interval between symbols under the premise of a fixed CP length.
  • the method further includes: generating a first transmission symbol and a second transmission symbol based on the signal after the signal processing in step S840, wherein the end position in the first transmission symbol
  • the symbol component of the first reference point is the same as the symbol component of the second transmission symbol whose ending position is the second reference point.
  • the end position in the first transmission symbol is the symbol component of the first reference point and the end position in the second transmission symbol is the second reference point.
  • the symbol components of are the same, so that the guard interval between symbols can be flexibly configured by controlling the length of the symbol component.
  • the guard interval between symbols can be flexibly configured, and the guard interval length can also be flexibly configured according to user requirements.
  • the execution subject can be either a terminal device or a component (such as a chip or circuit) that can be used in a terminal device, or a network device or a component that can be used in a network device (such as a chip or circuit). ).
  • FIG. 16 shows a schematic block diagram of an apparatus 1600 for symbol processing according to an embodiment of the present application.
  • the device 1600 is used to execute the foregoing method embodiments.
  • the device 1600 may include the following units.
  • the obtaining unit 1610 is used to obtain multiple complex number symbols.
  • the grouping unit 1620 is configured to divide a plurality of complex symbols into a plurality of sets, where each set corresponds to a transmission symbol, and the plurality of sets include a first set corresponding to the first transmission symbol and a second set corresponding to the second transmission symbol.
  • the first transmission symbol and the second transmission symbol are continuous in time domain, and the first transmission symbol is located before the second transmission symbol.
  • the copying unit 1630 is configured to perform a copy operation on the first set and the second set, so that both the first set and the second set have the first complex symbol, and the first subset formed by the first complex symbol in the first set
  • the time domain index of the starting position of is the same as the time domain index of the starting position of the second subset formed by the first plural symbols in the second set.
  • the signal processing unit 1640 is configured to perform signal processing on the first set and the second set after the copy operation, the signal processing includes cyclic shift or frequency domain weighting, and the signal processing makes the start position of the first subset correspond to The position before the first reference point of the first transmission symbol, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the starting position of the second subset corresponds to the second The position before the second reference point of the transmitted symbol, and the end position of the second subset corresponds to the position after the second reference point of the second transmitted symbol, where the first reference point represents the end position of the transmitted symbol, and the second reference The dot indicates the position of the intercepted cyclic prefix of the transmitted symbol.
  • the signal processing unit 1640 is configured to: perform frequency domain processing on the first set and the second set to obtain frequency domain signals corresponding to the first set and frequency domain signals corresponding to the second set; Perform inverse fast Fourier transform IFFT on the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set to obtain the time domain signal corresponding to the first set and the time domain signal corresponding to the second set;
  • the time domain signal and the time domain signal corresponding to the second set are cyclically shifted so that the start position of the first subset corresponds to the position before the first reference point of the first transmitted symbol, and the end position of the first subset Corresponds to the position after the first reference point of the first transmission symbol, and makes the start position of the second subset correspond to the position before the second reference point of the second transmission symbol, and the end position of the second subset corresponds to The position after the second reference point of the second transmitted symbol.
  • the signal processing unit 1640 is configured to: perform Discrete Fourier Transform DFT on the first set and the second set to obtain the frequency domain signal corresponding to the first set and the frequency domain corresponding to the second set Signal; frequency domain weighting is performed on the frequency domain signal corresponding to the first set and the frequency domain signal corresponding to the second set, so that the starting position of the first subset corresponds to the position before the first reference point of the first transmitted symbol, and The end position of the first subset corresponds to the position after the first reference point of the first transmission symbol, and the starting position of the second subset corresponds to the position before the second reference point of the second transmission symbol, and the second The end position of the subset corresponds to the position after the second reference point of the second transmitted symbol.
  • the time domain index of the starting position of the first subset is related to the length of the cyclic prefix and the symbol number.
  • the time domain index i of the starting position of the first subset satisfies the following formula:
  • l represents the symbol number of the first set
  • A represents the time domain index of the subset participating in the copy operation in the set with the symbol number l being 0
  • CL CP (1) represents the first set with the symbol number l
  • the equivalent cumulative CP length
  • the copying unit 1630 is configured to copy the first complex symbol in the first set to the second set.
  • the first transmission symbol is a reference signal
  • the second transmission symbol is a non-reference signal
  • the copying unit 1630 is configured to copy the first complex symbol in the second set to the first set.
  • the first transmission symbol is a non-reference signal
  • the second transmission symbol is a reference signal
  • the apparatus 1600 further includes:
  • the symbol generating unit 1650 is configured to generate a first transmission symbol and a second transmission symbol based on the signal after the cyclic shift, wherein the end position in the first transmission symbol is the symbol component of the first reference point and the second transmission symbol The end position is the same as the sign component of the second reference point.
  • the guard interval between symbols can be flexibly configured, and the guard interval length can also be flexibly configured according to user requirements.
  • the acquiring unit 1610 may include a modulation sub-unit for modulating the encoded bit stream to obtain modulation symbols, and the modulation symbols may also be referred to as complex symbols.
  • the obtaining unit 1610 is configured to obtain a plurality of complex symbols according to the phase PTRS sampling points and modulation symbols, and use the grouping unit 1620 for processing.
  • the symbol generating unit 1650 may include a DFT subunit, a subcarrier mapping subunit, an IFFT subunit, and a CP adding subunit.
  • the signal processing unit 1640 is located between the copying unit 1630 and the symbol generating unit 1650.
  • the signal processing unit 1640 may be called a cyclic shift unit.
  • the signal processing unit 1640 may be located in the symbol generation unit 1650.
  • the signal processing unit 1640 is located between the DFT subunit and the IFFT subunit.
  • the signal processing unit 1640 may be called a frequency domain weighting unit.
  • the signal processing unit 1640 is located between the IFFT subunit and the CP adding subunit.
  • the signal processing unit 1640 may be called a cyclic shift unit.
  • the symbol generating unit 1650 may include a CP adding subunit, an upsampling subunit, and a filtering subunit.
  • the signal processing unit 1640 may be referred to as a cyclic shift unit.
  • the obtaining unit 1610 is configured to obtain a plurality of complex symbols.
  • the grouping unit 1620 is configured to divide a plurality of complex symbols into a plurality of sets.
  • the plurality of sets include a first set and a second set.
  • the first set corresponds to the first transmission symbol
  • the second set corresponds to the second transmission symbol.
  • the transmitted symbol is continuous in the time domain with the second transmitted symbol
  • the first transmitted symbol is located before the second transmitted symbol
  • the complex symbols in the first subset in the first set are the same as the complex symbols in the second subset in the second set.
  • the signal processing unit 1640 is configured to perform signal processing on the first set and the second set.
  • the signal processing includes cyclic shift or frequency domain weighting.
  • the signal processing makes the start position of the first subset correspond to the first transmitted symbol.
  • the position before the reference point, and the end position of the first subset corresponds to the position after the first reference point of the first transmission symbol
  • the starting position of the second subset corresponds to the second reference point of the second transmission symbol
  • the previous position, and the end position of the second subset corresponds to the position after the second reference point of the second transmission symbol, where the first reference point represents the end position of the transmission symbol
  • the second reference point represents the interception cycle of the transmission symbol
  • both the first transmission symbol and the second transmission symbol are reference signals.
  • the acquisition unit 1610, the grouping unit 1620, the copy unit 1630, and the signal processing unit 1640 can be implemented in software, or in hardware, or in hardware and Realized by software.
  • the acquisition unit 1610, the grouping unit 1620, the copy unit 1630, and the signal processing unit 1640 (or, the symbol generation unit 1650) may also be different chips, or they may be integrated on one chip or integrated circuit.
  • the acquisition unit 1610, the grouping unit 1620, the copy unit 1630, the signal processing unit 1640, and the symbol generation unit 1650 may all be implemented by a processor or processor-related circuits.
  • an embodiment of the present application also provides an apparatus 1900 for symbol processing.
  • the device 1900 includes a processor 1910, a memory 1920, and a transceiver 1930.
  • the memory 1920 stores a program.
  • the processor 1910 is used to execute the program stored in the memory 1920, and executes the program stored in the memory 1920, so that the device 1900 is used to execute The above method embodiment.
  • the embodiment of the present application also provides a communication device, and the communication device may be a terminal device or a chip.
  • the communication device can be used to execute the above method embodiments.
  • FIG. 20 shows a simplified schematic diagram of the structure of the terminal device. It is easy to understand and easy to illustrate.
  • the terminal device uses a mobile phone as an example.
  • the terminal equipment includes a processor, a memory, a radio frequency circuit, an antenna, and an input and output device.
  • the processor is mainly used to process the communication protocol and communication data, and to control the terminal device, execute the software program, and process the data of the software program.
  • the memory is mainly used to store software programs and data.
  • the radio frequency circuit is mainly used for the conversion of baseband signal and radio frequency signal and the processing of radio frequency signal.
  • the antenna is mainly used to send and receive radio frequency signals in the form of electromagnetic waves.
  • Input and output devices such as touch screens, display screens, and keyboards, are mainly used to receive data input by users and output data to users. It should be noted that some types of terminal devices may not have input and output devices.
  • the processor When data needs to be sent, the processor performs baseband processing on the data to be sent, and outputs the baseband signal to the radio frequency circuit.
  • the radio frequency circuit performs radio frequency processing on the baseband signal and sends the radio frequency signal to the outside in the form of electromagnetic waves through the antenna.
  • the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor, and the processor converts the baseband signal into data and processes the data.
  • FIG. 20 only one memory and processor are shown in FIG. 20. In an actual terminal device product, there may be one or more processors and one or more memories.
  • the memory may also be referred to as a storage medium or storage device.
  • the memory may be set independently of the processor, or may be integrated with the processor, which is not limited in the embodiment of the present application.
  • the antenna and radio frequency circuit with the transceiving function can be regarded as the transceiving unit of the terminal device, and the processor with the processing function can be regarded as the processing unit of the terminal device.
  • the terminal device includes a transceiver unit 2010 and a processing unit 2020.
  • the transceiver unit 2010 may also be referred to as a transceiver, a transceiver, a transceiver, and so on.
  • the processing unit 2020 may also be called a processor, a processing board, a processing module, a processing device, and so on.
  • the device for implementing the receiving function in the transceiver unit 2010 can be regarded as the receiving unit, and the device for implementing the sending function in the transceiver unit 2010 as the sending unit, that is, the transceiver unit 2010 includes a receiving unit and a sending unit.
  • the transceiver unit may sometimes be called a transceiver, a transceiver, or a transceiver circuit.
  • the receiving unit may sometimes be called a receiver, receiver, or receiving circuit.
  • the transmitting unit may sometimes be called a transmitter, a transmitter, or a transmitting circuit.
  • the processing unit 2020 is configured to execute the foregoing method embodiment.
  • the transceiver unit 2010 is used for related transceiver operations in the foregoing method embodiments.
  • the transceiver unit 2010 is used to transmit or receive DFT-s-OFDM symbols or SC-QAM symbols.
  • FIG. 20 is only an example and not a limitation, and the foregoing terminal device including a transceiver unit and a processing unit may not rely on the structure shown in FIG. 20.
  • the chip When the communication device is a chip, the chip includes a transceiver unit and a processing unit.
  • the transceiver unit may be an input/output circuit or a communication interface;
  • the processing unit may be a processor, microprocessor, or integrated circuit integrated on the chip.
  • the embodiment of the present application also provides a communication device, which may be a network device or a chip.
  • the communication device can be used to execute the above method embodiments.
  • the communication device is a network device, for example, it is a base station.
  • FIG. 21 shows a simplified schematic diagram of the base station structure.
  • the base station includes 2110 parts and 2120 parts.
  • the 2110 part is mainly used for receiving and sending radio frequency signals and the conversion between radio frequency signals and baseband signals; the 2120 part is mainly used for baseband processing and controlling the base station.
  • the 2110 part can usually be called a transceiver unit, transceiver, transceiver circuit, or transceiver.
  • the 2120 part is usually the control center of the base station, and may generally be referred to as a processing unit, which is used to control the base station to perform the processing operations on the network device side in the foregoing method embodiments.
  • the transceiver unit of part 2110 can also be called a transceiver or a transceiver, etc. It includes an antenna and a radio frequency unit, and the radio frequency unit is mainly used for radio frequency processing.
  • the device used to implement the receiving function in the 2110 part can be regarded as the receiving unit, and the device used to implement the sending function as the sending unit, that is, the 2110 part includes the receiving unit and the sending unit.
  • the receiving unit may also be called a receiver, a receiver, or a receiving circuit
  • the sending unit may be called a transmitter, a transmitter, or a transmitting circuit, etc.
  • the 2120 part may include one or more single boards, and each single board may include one or more processors and one or more memories.
  • the processor is used to read and execute programs in the memory to implement baseband processing functions and control the base station. If there are multiple boards, the boards can be interconnected to enhance processing capabilities. As an optional implementation, multiple single boards may share one or more processors, or multiple single boards may share one or more memories, or multiple single boards may share one or more processing at the same time. Device.
  • part 2120 is used to execute the foregoing method embodiment.
  • the 2110 part is used for the related transceiver operations in the above method embodiment.
  • the 2110 part is used to transmit or receive DFT-s-OFDM symbols or SC-QAM symbols.
  • FIG. 21 is only an example and not a limitation, and the foregoing network device including a transceiver unit and a processing unit may not rely on the structure shown in FIG. 21.
  • the chip When the communication device is a chip, the chip includes a transceiver unit and a processing unit.
  • the transceiver unit may be an input/output circuit or a communication interface;
  • the processing unit is a processor or microprocessor or integrated circuit integrated on the chip.
  • terminal devices in the embodiments of the present application include handheld devices, vehicle-mounted devices, wearable devices, or computing devices with wireless communication functions.
  • terminal equipment may refer to user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile equipment, user terminal, terminal, wireless communication equipment, User agent or user device.
  • the terminal device may be a mobile phone, a tablet computer, or a computer with wireless transceiver function.
  • Terminal equipment can also be virtual reality (VR) terminal equipment, augmented reality (AR) terminal equipment, wireless terminals in industrial control, wireless terminals in unmanned driving, wireless terminals in telemedicine, and smart Wireless terminals in power grids, wireless terminals in smart cities, and wireless terminals in smart homes.
  • the terminal device may be a terminal device in a 5G network or a terminal device in a public land mobile network (PLMN) that will evolve in the future.
  • PLMN public land mobile network
  • the network device in the embodiment of the present application can be used to communicate with one or more terminal devices, and can also be used to communicate with one or more base stations with partial terminal functions (such as macro base stations and micro base stations, such as access points). , The communication between).
  • Network equipment can be called a base station.
  • Base stations may come in many forms, such as macro base stations, micro base stations, relay stations, and access points.
  • the network equipment involved in the embodiments of this application may be a base station in a new radio (NR), or a global system for mobile communication (GSM) or code division multiple access (code division multiple access).
  • NR new radio
  • GSM global system for mobile communication
  • code division multiple access code division multiple access
  • the base transceiver station (BTS) in division multiple access (CDMA) can also be the node B (NB) in the wideband code division multiple access (WCDMA) system, or it can be An evolved Node B (evolutional Node B, eNB or eNodeB) in a long term evolution (LTE) system.
  • NB node B
  • WCDMA wideband code division multiple access
  • eNB evolved Node B
  • LTE long term evolution
  • the base station in 5G NR may also be called a transmission reception point (TRP) or next generation Node B (gNB).
  • TRP transmission reception point
  • gNB next generation Node B
  • the embodiments of the present application also provide a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a computer, the computer realizes the foregoing method embodiments.
  • the embodiments of the present application also provide a computer program product containing instructions, which when executed by a computer causes the computer to implement the foregoing method embodiments.
  • the terminal device or the network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer.
  • the hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and memory (also referred to as main memory).
  • the operating system may be any one or more computer operating systems that implement business processing through processes, for example, Linux operating system, Unix operating system, Android operating system, iOS operating system, or windows operating system.
  • the application layer includes applications such as browsers, address books, word processing software, and instant messaging software.
  • the embodiments of the application do not specifically limit the specific structure of the execution subject of the methods provided in the embodiments of the application, as long as the program that records the codes of the methods provided in the embodiments of the application can be provided according to the embodiments of the application.
  • the execution subject of the method provided in the embodiment of the present application may be a terminal device or a network device, or a functional module in the terminal device or network device that can call and execute the program.
  • various aspects or features of the present application can be implemented as methods, devices, or products using standard programming and/or engineering techniques.
  • article of manufacture as used in this application encompasses a computer program accessible from any computer-readable device, carrier, or medium.
  • computer-readable media may include, but are not limited to: magnetic storage devices (for example, hard disks, floppy disks, or tapes, etc.), optical disks (for example, compact discs (CD), digital versatile discs (DVD)) Etc.), smart cards and flash memory devices (for example, erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.).
  • various storage media described herein may represent one or more devices and/or other machine-readable media for storing information.
  • machine-readable medium may include, but is not limited to, wireless channels and various other media capable of storing, containing, and/or carrying instructions and/or data.
  • processors mentioned in the embodiments of this application may be a central processing unit (Central Processing Unit, CPU), or other general-purpose processors, digital signal processors (Digital Signal Processors, DSPs), and application-specific integrated circuits ( Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • the memory mentioned in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), and electrically available Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (Random Access Memory, RAM), which is used as an external cache.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • DDR SDRAM double data rate synchronous dynamic random access memory
  • Enhanced SDRAM, ESDRAM enhanced synchronous dynamic random access memory
  • Synchlink DRAM, SLDRAM synchronous connection dynamic random access memory
  • DR RAM Direct Rambus RAM
  • the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component
  • the memory storage module
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or It can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • each unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium.
  • the technical solution of this application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other media that can store program code .

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Power Engineering (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供一种符号处理的方法与装置，该方法包括：根据多个复数符号获得对应第一发射符号的第一集合与对应第二发射符号的第二集合；对第一集合与第二集合进行复制操作，使第一集合与第二集合中均具有第一复数符号，在第一集合中第一复数符号所构成的第一子集的起始位置，与在第二集合中第一复数符号所构成的第二子集的起始位置相同；对第一集合与第二集合进行包括循环移位或频域加权的信号处理，使第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，使得第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置。本申请可以灵活配置符号间的保护间隔。

Description

符号处理的方法与装置
本申请要求于2019年07月02日提交国家知识产权局、申请号为201910590953.0、申请名称为“符号处理的方法与装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，具体涉及一种符号处理的方法与装置。
背景技术
为了抵抗信道的多径效应，在符号间添加保护间隔的技术被提出。首先，保护间隔可以去除相邻符号间的码间串扰(inter symbol interference，ISI)；其次，在经过多径信道后，保护间隔将信道与发射符号的线性卷积转换为信道与发射符号的循环卷积，这使得符号接收端可以采用频域均衡方法消除信道多径效应。
通常，循环前缀(cyclic prefix，CP)被用作符号间的保护间隔。循环前缀是一个数据符号后面(或称为尾部)的一段数据复制到该符号的前面(或称为头部)形成的循环结构。
为了进行灵活的多用户复用，需要维持稳定的帧结构。为了维持稳定的帧结构，循环前缀的长度是固定的，在实现中，网络设备会为多个用户配置同样的循环前缀的长度。然而，不同用户所经历的信道条件不同，因此对循环前缀的长度的需求也可能不同。为了保证所有用户的性能，系统选择长度大于大时延扩展用户的多径时延的循环前缀，但是，对于小时延扩展用户来说，过长的循环前缀将造成不必要的开销。
因此，现有技术无法根据用户需求灵活配置符号间的保护间隔。
发明内容
本申请提供一种符号处理的方法与装置，可以在循环前缀的长度固定的前提下，实现符号间的保护间隔的灵活配置。
第一方面，提供一种符号处理的方法，该方法包括：发送第一发射符号与第二发射符号，第一发射符号与第二发射符号时域连续，且第一发射符号位于第二发射符号之前。其中，第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取CP的位置。第二参考点距离发射符号的结束位置的长度等于CP长度。其中，第二发射符号具有循环前缀(下文简称为CP)。
在本申请中，对于时域连续的第一发射符号与第二发射符号，通过使得第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同，从而可以通过控制第一发射符号与第二发射符号之间共有的符号分量的长度，实 现符号间的保护间隔的灵活配置。
此外，应理解，第一发射符号与第二发射符号之间共有的符号分量的长度不会影响发射符号的帧结构，因此，针对不同信道条件的用户，通过配置不同长度的该共有的符号分量，首先可以灵活配置符号间的保护间隔，其次，被配置了不同保护间隔的用户之间也可以进行(频分，空分和时分)复用。
因此，本申请在CP长度固定的情况下，可以实现灵活配置符号间的保护间隔，还可以根据用户需求灵活配置保护间隔的长度。
第二方面，提供一种符号处理的方法，该方法包括：得到多个复数符号；将多个复数符号分为多个集合，其中，每个集合对应一个发射符号；对多个集合进行复制操作，使得时域连续的两个发射符号对应的两个集合之间具有部分相同的复数符号。
在本申请中，通过对时域连续的两个发射符号对应的两个集合进行复制操作，使得两个集合之间具有相同的复数符号，从而有助于获得第一方面提供的方法中的第一发射符号与第二发射符号。因此，本申请可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
第三方面，提供一种符号处理的方法，该方法包括：得到多个复数符号；将多个复数符号分为多个集合，其中，每个集合对应一个发射符号，多个集合中包括对应于第一发射符号的第一集合以及对应于第二发射符号的第二集合，第一发射符号与第二发射符号时域连续，第一发射符号位于第二发射符号之前；对第一集合与第二集合进行复制操作，使得第一集合与第二集合中均具有第一复数符号，其中，在第一集合中第一复数符号所构成的子集称为第一子集，将第二集合中第一复数符号所构成的子集称为第二子集，第一子集的时域位置与第二子集的时域位置可以相同，也可以不同；对经过复制操作之后的第一集合与第二集合进行信号处理，该信号处理包括循环移位或频域加权。
应理解，若该信号处理为循环移位，则是对第一集合对应的时域信号以及第二集合对应的时域信号进行信号处理；若该信号处理为频域加权，则是对第一集合对应的频域信号以及第二集合对应的频域信号进行频域加权。
对经过复制操作之后的第一集合与第二集合进行信号处理的实现方式有多种。
可选地，作为第一种实现方式，该信号处理包括第一信号处理，该第一信号处理包括循环移位或频域加权。
在第一种实现方式中，对经过复制操作之后的第一集合与第二集合进行信号处理，包括：对经过复制操作之后的第一集合与第二集合分别进行第一信号处理，该第一信号处理使得第一子集的结束位置对应于第一发射符号的第一参考点，以及使得第二子集的结束位置对应于第二发射符号的第二参考点。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
应理解，通过对时域连续的第一发射符号与第二发射符号对应的第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号；通过对第一集合与第二集合进行第一信号处理，使得第一集合中第一复数符号所构成的第一子集的结束位置对应于第一发射符号的第一参考点，第二集合中第二子集的结束位置对应于第二发射符号的第二参考点，从而可以获得第一方面提供的方法中的第一发射符号与第二发射符号。因此，本 申请可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
可选地，作为第二种实现方式，该信号处理包括第一信号处理与第二信号处理，该第一信号处理包括循环移位或频域加权，该第二信号处理包括循环移位或频域加权。其中，若第一信号处理为循环移位，第二信号处理为循环移位；若第一信号处理为频域加权，第二信号处理可以为频域加权或循环移位。
在第二种实现方式中，对经过复制操作之后的第一集合与第二集合进行信号处理，包括：对经过复制操作之后的第一集合与第二集合分别进行第一信号处理，该第一信号处理使得，第一子集的结束位置对应于第一发射符号的第一参考点，以及使得第二子集的结束位置对应于第二发射符号的第二参考点；统一对第一集合经过第一信号处理之后的信号以及第二集合经过第一信号处理之后的信号进行第二信号处理，该第二信号处理使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
在第二种实现方式中，第二信号处理可以理解为是对第一集合与第二集合的公共移位操作。
应理解，通过对时域连续的第一发射符号与第二发射符号对应的第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号；通过对第一集合与第二集合进行第一信号处理与第二信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，从而可以获得第一方面提供的方法中的第一发射符号与第二发射符号。因此，本申请可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
此外，应理解，通过对第一集合与第二集合进行第一信号处理与第二信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，这可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
可选地，在第三种实现方式中，该信号处理包括第三信号处理，该第三信号处理包括循环移位或频域加权。
在第三种实现方式中，对经过复制操作之后的第一集合与第二集合进行信号处理，包括：对经过复制操作之后的第一集合与第二集合分别进行第三信号处理，该第三信号处理使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
应理解，第三种实现方式可以视为，将第二种实现方式中的第一信号处理与第二信号处理合并为一次信号处理的结果，其中，第一信号处理与第二信号处理均为循环移位，或 者，第一信号处理与第二信号处理均为频域加权。
还应理解，通过对时域连续的第一发射符号与第二发射符号对应的第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号；通过对第一集合与第二集合进行第三信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，从而可以获得第一方面提供的方法中的第一发射符号与第二发射符号。因此，本申请实施例可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
此外，应理解，通过对第一集合与第二集合进行第三信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，这可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
需要说明的是，本文中提及“第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”，指的是，第一集合中第一子集的起始位置对应于第一发射符号的尾部位置，第一子集的结束位置对应于第一发射符号的头部位置。
本文中提及“第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”的前提是，对第一集合进行信号处理，即对第一集合进行循环移位或频域加权。应理解，在循环移位(或频域加权)的前提下，“第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”，可以理解为“第一子集的结束位置对应于第一发射符号的头部位置”，或者“第一子集的结束位置对应于第一发射符号的第三参考点之后的位置，其中，第三参考点表示发射符号的起始位置”。或者，从第一发射符号的时域结构来看，“第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”可以表达为“第一子集的结束位置对应于第一发射符号的第一参考点之前的位置”。
还需要说明的是，本文是为了阐述第一子集的时域位置对应到第一发射符号中的时域位置是覆盖了第一发射符号的第一参考点(即第一发射符号的结束位置)，因此，采用如下描述方式“第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”。
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行信号处理，包括：对第一集合与第二集合进行频域处理，获得第一集合对应的频域信号以及第二集合对应的频域信号；对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行快速傅里叶逆变换IFFT，获得第一集合对应的时域信号以及第二集合对应的时域信号；对第一集合对应的时域信号以及第二集合对应的时域信号进行循环移位，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
本实现方式可以适用于发射符号为DFT-s-OFDM符号的场景。
在本申请中，在IFFT之后通过循环移位使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，从而可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行信号处理，包括：对第一集合与第二集合进行离散傅里叶变换DFT，获得第一集合对应的频域信号以及第二集合对应的频域信号；对第一集合对应的频域信号以及第二集合对应的频域信号进行频域加权，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
本实现方式可以适用于发射符号为DFT-s-OFDM符号的场景。
在本申请中，在DFT之后通过频域加权使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，从而可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行信号处理，包括：直接对复制操作得到的第一集合与第二集合进行循环移位，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
本实现方式可以适用于发射符号为DFT-s-OFDM符号或SC-QAM符号的场景。
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行复
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行复制操作，包括：对第一集合与第二集合进行复制操作，使得第一子集的时域位置与第二子集的时域位置可以相同，即第一子集的起始位置的时域索引与第二子集的起始位置的时域索引相同，第一子集的结束位置的时域索引与第二子集的结束位置的时域索引相同。
本实现方式中的复制操作称为同位置复制操作。
结合第三方面，在第三方面的一种可能的实现方式中，在对第一集合与第二集合进行复制操作的过程中，第一子集的起始位置的时域索引与循环前缀的长度以及符号编号有关。
可选地，在对第一集合与第二集合进行复制操作的过程中，第一子集的起始位置的时域索引i满足如下公式：
i＝A+CL CP(l)
其中，l表示所述第一集合的符号编号，A表示符号编号l为0的集合中参与复制操作的子集的时域索引，CL CP(l)表示符号编号为l的所述第一集合的等效累加CP长度。
应理解，本申请可以对连续多个发射符号对应的集合进行复制操作。
结合第三方面，在第三方面的一种可能的实现方式中，第一子集和第二子集具有相同的长度，但不具有同样的索引，例如，第一子集的时域位置与第二子集的时域位置不同，此时，发射机可在后续处理步骤中通过时域循环移位或频域加权等处理将第一子集和第二子集调整至相同的时域位置，即等效为同位置复制。
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行复制操作，包括：将第一集合中的第一复数符号复制到第二集合中。
本实现方式中的复制方式可以称为后向复制。
可选地，在本实现方式中，第一发射符号为参考信号，第二发射符号为非参考信号。
结合第三方面，在第三方面的一种可能的实现方式中，对第一集合与第二集合进行复制操作，包括：将第二集合中的第一复数符号复制到第一集合中。
本实现方式中的复制方式可以称为前向复制。
可选地，在本实现方式中，第一发射符号为非参考信号，第二发射符号为参考信号。
结合第三方面，在第三方面的一种可能的实现方式中，该方法还包括：基于经过信号处理之后的信号，生成第一发射符号与第二发射符号，其中，所述第一子集对应所述第一发射符号的第一符号分量，所述第二子集对应所述第二发射符号的第二符号分量，所述第一符号分量与所述第二符号分量相同。
作为一种实现方式，第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同。
因此，本申请在CP长度固定的情况下，可以实现灵活配置符号间的保护间隔，还可以根据用户需求灵活配置保护间隔的长度。
第四方面，提供一种符号处理的方法，该方法包括：得到多个复数符号；将所述多个复数符号分为多个集合，所述多个集合中包括第一集合与第二集合，所述第一集合对应第一发射符号，所述第二集合对应第二发射符号，所述第一发射符号与所述第二发射符号时域连续，所述第一发射符号位于所述第二发射符号之前，所述第一集合中的第一子集中的复数符号与所述第二集合中的第二子集中的复数符号相同；对所述第一集合与第二集合进行信号处理，所述信号处理包括循环移位或频域加权，所述信号处理使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
第二复数符号可以包括多个复数符号。
可选地，第一发射符号与第二发射符号均为参考信号，例如解调参考信号(de-modulation reference signal，DMRS)。
应理解，在本申请中，没有对第一集合与第二集合进行复制操作，当第一集合与第二集合对应的发射符号为参考信号时，可以在保证参考信号的准确性的前提下，可以实现参考信号的保护间隔的灵活配置。
结合第四方面，在第四方面的一种可能的实现方式中，对第一集合与第二集合进行信 号处理，包括：对第一集合与第二集合进行频域处理，获得第一集合对应的频域信号以及第二集合对应的频域信号；对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行快速傅里叶逆变换IFFT，获得第一集合对应的时域信号以及第二集合对应的时域信号；对第一集合对应的时域信号与第二集合对应的时域信号进行循环移位，使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置。
本实现方式可以适用于发射符号的波形为DFT-s-OFDM波形的场景。
在本申请中，在IFFT之后通过循环移位使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，从而可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
结合第四方面，在第四方面的一种可能的实现方式中，对第一集合与第二集合进行信号处理，包括：对第一集合与第二集合进行离散傅里叶变换DFT，获得第一集合对应的频域信号以及第二集合对应的频域信号；对三集合对应的频域信号以及第二集合对应的频域信号进行频域加权，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
本实现方式可以适用于发射符号为DFT-s-OFDM符号的场景。
在本申请中，在DFT之后通过频域加权使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，从而可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
结合第四方面，在第四方面的一种可能的实现方式中，对第一集合与第二集合进行信号处理，包括：直接对复制操作得到的第一集合与第二集合进行循环移位，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
本实现方式可以适用于发射符号为DFT-s-OFDM符号或SC-QAM符号的场景。
第五方面，提供一种符号处理的装置，该通信装置用于执行第一方面至第四方面中任一方面提供的方法。
可选地，该装置可以包括用于执行第一方面至第四方面中任一方面提供的方法的模块。
第六方面，提供一种符号处理的装置，该装置包括存储器和处理器，存储器用于存储 指令，处理器用于执行存储器存储的指令，并且对存储器中存储的指令的执行使得处理器执行第一方面至第四方面中任一方面提供的方法。
第七方面，提供一种芯片，该芯片包括处理模块与通信接口，处理模块用于控制通信接口与外部进行通信，处理模块还用于实现第一方面至第四方面中任一方面提供的方法。
第八方面，提供一种计算机可读存储介质，其上存储有计算机程序，计算机程序被计算机执行时使得计算机实现第一方面至第四方面中任一方面提供的方法。
第九方面，提供一种包含指令的计算机程序产品，所述指令被计算机执行时使得计算机实现第一方面至第四方面中任一方面提供的方法。
因此，本申请在CP长度固定的情况下，可以实现灵活配置符号间的保护间隔，还可以根据用户需求灵活配置保护间隔的长度。
附图说明
图1与图2为以循环前缀(CP)作为符号间的保护间隔的示意图；
图3为本申请实施例的发射符号的时域结构示意图；
图4为本申请实施例的发射符号的时域结构的另一示意图；
图5、图6图7为本申请实施例的符号处理的方法的基本流程图；
图8为本申请实施例的符号处理的方法的示意性流程图；
图9为本申请实施例中在不进行循环移位的情况下集合与发射符号的对应关系的示意图；
图10为本申请实施例中在进行循环移位的情况下集合与发射符号的对应关系的示意图；
图11为本申请实施例的发射符号的时域结构的示意图；
图12为本申请实施例的符号处理的流程示意图；
图13为本申请实施例中对多个集合进行复制操作的示意图；
图14为本申请实施例中对多个符号进行循环移位的示意图；
图15为本申请实施例的发射符号的时域结构的另一示意图；
图16为本申请实施例的符号处理的装置的示意性框图；
图17为本申请实施例的符号处理的装置的另一示意性框图；
图18为本申请实施例的符号处理的装置的又一示意性框图；
图19为本申请实施例的符号处理的装置的再一示意性框图；
图20为本申请实施例的终端设备的示意性框图；
图21为本申请实施例的网络设备的示意性框图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
除非另有定义，本文所使用的所有的技术和科学术语与属于本申请的技术领域的技术人员通常理解的含义相同。本文中在本申请的说明书中所使用的术语只是为了描述具体的实施例的目的，不是旨在于限制本申请。
相对于正交频分复用(orthogonal frequency division multiplexing，OFDM)等多载波 波形，DFT-s-OFDM或SC-QAM等单载波波形具有较低的峰值平均功率比(peak to average power ratio，PAPR)，因此在相同的功放下，单载波波形可以提供更大的输出功率和更高的功放效率，从而达到提升覆盖和降低能耗的目的。因此，DFT-s-OFDM或SC-QAM等单载波波形在各类通信系统中被广泛应用，例如长期演进(long term evolution，LTE)系统，第五代(5th generation，5G)系统或新无线(new radio，NR)系统。
其中，DFT-s-OFDM为离散傅里叶变换扩展正交频分复用(discrete fourier transformation-spread-orthogonal frequency division multiplexing，DFT-s-OFDM)。SC-QAM为单载波正交幅度调制(Single carrier-quadrature amplitude modulation，SC-QAM)。
在NR和LTE中，DFT-s-OFDM波形均采用循环前缀(cyclic prefix，CP)作为符号(DFT-s-OFDM符号)间的保护间隔。
图1为循环前缀(以下记为CP)作为符号间的保护间隔的时域结构示意图。在图1中，给出两个发射符号：发射符号1与发射符号2。发射符号1的CP指的是，发射符号1中截取CP的位置到结束位置之间的一段发射符号分量被复制到发射符号1的前面形成的循环结构。类似地，发射符号2的CP指的是，发射符号2中截取CP的位置到结束位置之间的一段发射符号分量被复制到发射符号2的前面形成的循环结构。
发射符号2的CP用作发射符号1与发射符号2之间的保护间隔，发射符号1的CP用作发射符号1与其之前的发射符号(图1未画出)之间的保护间隔。
图2示出图1所示的发射符号1与发射符号2经过信道传输之后在接收端的接收情况(作为示意，图2中只示出信道的最大多径时延)。
情况1表示信道最大多径时延不超过CP长度。在情况1中，因为有CP的保护，每个发射符号的接收窗均不包含其它发射符号的ISI，如图2所示，发射符号2的接收窗内不包括发射符号1，因此可以避免发射符号1的ISI，发射符号1的接收窗内也不包括发射符号1之前的发射符号(图2未示出)，因此发射符号1也不会受到ISI。此外，在情况1中，在每个发射符号的接收窗内，接收符号为发射符号与信道的循环卷积，这使得接收端可以采用频域均衡方法消除信道多径效应。
情况2表示信道最大多径时延超过CP长度。在情况2中，由于信道时延超过CP长度，导致一个发射符号的接收窗内会包含其它发射符号，如图2所示，发射符号2的接收窗内包含发射符号1的一段发射符号分量，因此，发射符号2受到发射符号1的ISI，发射符号1的接收窗内也可能包含发射符号1之前的发射符号(图2中未示出)，因此，发射符号1也会受到ISI。此外，在情况2中，在每个发射符号的接收窗内，接收符号不再是发射符号与信道的循环卷积，不利于接收端消除信道多径效应。
上面描述提及的发射符号表示发射端发出去的符号，接收符号表示由接收端接收到的符号。
从图2可知，情况2的信道条件所需的CP长度大于情况1的信道条件所需的CP长度。换句话说，不同信道条件，对CP长度的需求也可能不同。
从1或图2可知，CP长度影响帧结构。由于收发机复杂度和带外干扰等原因，具有不同CP长度的用户之间进行(频分，空分和时分)复用的灵活性较差。在实现中，为了进行灵活的多用户复用，网络设备通常会为不同用户配置相同的CP长度。但是，如图2所示，具有不同信道条件的用户设备对CP长度的需求也可能不同。当前技术中，为了克 服图2所示的问题，即为了保证所有经历不同信道条件的用户的性能，系统选择大于大时延用户的信道时延的CP长度作为所有用户的CP长度，但是，对于小时延用户来说，过长的CP长度将造成不必要的信令开销。
上述可知，现有技术，无法实现根据用户需求灵活配置符号间的保护间隔。
本申请提出一种符号处理的方法与装置，在CP长度固定的情况下，也可以实现灵活配置符号间的保护间隔。
本申请实施例的技术方案可以应用于各种通信系统，例如，LTE等蜂窝通信系统及其演进、5G系统或NR系统、机器与机器通信(machine to machine，M2M)系统、未来演进的其它通信系统等。
本申请一个实施例提供一种符号处理的方法，该方法包括：发送时域连续的第一发射符号与第二发射符号，第一发射符号位于第二发射符号之前，其中，第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同。
其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取CP的位置，即第二参考点距离发射符号的结束位置的长度等于CP长度。
第二发射符号具有循环前缀。
作为示例，第一发射符号与第二发射符号的时域结构的示意图如图3所示。第一发射符号中的符号分量D1与第二发射符号中的符号分量D2相同，符号分量D1在第一发射符号中的结束位置为第一参考点，符号分量D2在第二发射符号中的结束位置为第二参考点。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号中截取CP的位置。
其中，第一发射符号中的符号分量D1与第二发射符号中的符号分量D2相同，包括：符号分量D1与符号分量D2包含的内容相同，以及符号分量D1与符号分量D2的时间长度相同。符号分量D1与符号分量D2的包含的内容相同，可以理解为，在生成符号分量之前，两者分别对应的复数符号相同。
需要说明的是，在上文结合图3的描述中，提及“第一发射符号中的符号分量D1与第二发射符号中的符号分量D2相同”，这里的相同不一定是绝对意义上的相同，也可以表示近似相同。应理解，由于滤波器拖尾效应，第一发射符号中的符号分量D1与第二发射符号中的符号分量D2之间可能稍有偏差。
本申请提供的符号处理的方法可以由发射端实现，例如，可以由发射机或用于实现发射机的电路实现。该发射端可以是终端设备，也可以是网络设备。
本申请实施例中的发射符号可以是通信系统中的上行波形符号，和/或下行波形符号。
图4示出图3所示的第一发射符号与第二发射符号(经过信道传输之后)在接收端(与发射端相呼应)的接收情况。
情况1表示信道最大多径时延不超过CP长度。在情况1中，因为有CP的保护，每个发射符号的接收窗均不包含其它发射符号的ISI。如图4所示，第二发射符号的接收窗内不包括第一发射符号的成分，可以避免第一发射符号的ISI。
情况2表示信道最大多径时延超过CP长度。在情况2中，由于信道时延超过CP长度，导致一个发射符号的接收窗内可能包含其它发射符号。如图4所示，第一发射符号的符号分量D1进入第二发射符号的接收窗，但因为第一发射符号的符号分量D1与第二发射符号中的符号分量D2相同，所以，第一发射符号的符号分量D1进入第二发射符号的 接收窗，相当于是，第二发射符号的符号分量D2进入第二发射符号的接收窗。此外，由于在第二发射符号中，符号分量D2与用作CP的符号分量连续，则基于第二发射符号的CP不会对第二发射符号造成ISI的原理，进入第二发射符号的接收窗的第一发射符号的符号分量D1也不会对第二发射符号造成ISI。
从图3与图4可知，即使CP长度固定，也可以通过灵活配置符号分量D1的长度(也相当于是灵活配置符号分量D2的长度)，使得符号分量D1的长度与CP长度之和大于信道时延，则可以抵抗信道的多径效应。
为了更好地理解而非限定，在图3与图4的示例中，可以将第一发射符号中的符号分量D1与第二发射符号的CP一起视为第一发射符号与第二发射符号之间的等效保护间隔，如图3所示。
在本申请中，对于时域连续的第一发射符号与第二发射符号，通过使得第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同，从而可以通过控制第一发射符号与第二发射符号之间共有的符号分量的长度，实现符号间的保护间隔的灵活配置。
此外，应理解，第一发射符号与第二发射符号之间共有的符号分量的长度不会影响发射符号的帧结构，因此，针对不同信道条件的用户，通过配置不同长度的该共有的符号分量，首先可以灵活配置符号间的保护间隔，其次，被配置了不同保护间隔的用户之间也可以进行(频分，空分和时分)复用。
因此，本申请在CP长度固定的情况下，可以实现灵活配置符号间的保护间隔，还可以根据用户需求灵活配置保护间隔的长度。
需要说明的是，本文提及的长度，例如，CP的长度，符号分量的长度，均指的是时间长度。例如，本文中提及的长度(即时间长度)的单位为T c＝1/(4096·480·10 3)秒。再例如，时间长度还可以用时域采样点的数目表示。
还需要说明的是，为了便于理解与描述而非限定，在本文中，针对发射符号定义三个参考点：第一参考点、第二参考点与第三参考点(下文实施例将提到)，如图3所示。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取CP的位置，第三参考点表示发射符号的起始位置。其中，第二参考点距离发射符号的结束位置的长度等于CP长度。其中，发射符号的起始位置指的是发射符号本身的起始位置，不是该发射符号的CP的起始位置，或者，从另一个角度可以理解为，发射符号的起始位置指的是该发射符号的CP的结束位置。
还需要说明的是，本文提及的位置均指时域位置。
上文结合图3与图4描述了本申请实施例的发射符号(如前文描述的第一发射符号与第二发射符号)的时域结构。下文将描述与发射符号的生成过程相关的内容。
图5为根据本申请另一实施例的符号处理的基本流程的示意图。如图5所示，该流程包括如下步骤S320、S340与S360。
在S320中，对多个复数符号(complex-valued symbols)进行分组，获得多个集合(set)，其中，每一个集合对应一个发射符号。
或者说，多个复数符号被分为(be divided into)多个集合，每个集合对应一个发射符号。
多个复数符号中可以包括通过对编码比特流进行调制获得的调制符号。
其中，对编码比特流进行调制的调制方式可以包括pi/2-二进制相移键控(binary phase shift keying，BPSK)，正交相移键控(quadrature phase shift keying，QPSK)，16正交振幅调制(quadrature amplitude modulation，QAM)，64QAM，256QAM，相移键控(phase shift keying，PSK)，振幅移相键控(amplitude phase shift keying，APSK)，非均匀QAM等。
可选地，多个复数符号中还可以包括参考信号采样点。例如，参考信号采样点可以包括相位跟踪参考信号(phase tracking reference signal，PTRS)采样点等。
每个集合对应一个发射符号，指的是，最终生成的每个发射符号均是基于相应的一个集合生成的。例如，每个集合对应一个DFT-s-OFDM符号或SC-QAM符号。
每个集合中可以包括若干复数符号。例如，每个集合可以视作一个多维的时域向量，集合中的复数符号可以视为时域向量中的元素。
S340，对步骤S320得到的多个集合进行复制操作，使得时域连续的两个发射符号对应的两个集合之间具有部分相同的复数符号。
在本申请中，可以通过多种方式对集合进行复制操作，下文将进行描述。
S360，通过对步骤S360得到的多个集合进行处理，获得多个发射符号，其中，该处理包括添加CP。
或者，在步骤S360中，基于步骤S340得到的经过复制操作后的集合，进行添加CP，再经过其他操作，获得发射符号。这里所述的其他操作包括但不限于快速傅里叶变换，载波映射、采样、滤波等。
应理解，因为时域连续的两个发射符号对应的两个集合之间具有部分相同的复数符号，因此，在一定程度上可以实现这两个集合对应的两个发射符号的时域结构如图3所示。
因此，在本申请实施例中，通过对时域连续的两个发射符号对应的两个集合进行复制操作，使得两个集合之间具有相同的复数符号，从而有助于生成时域结构如图3所示的发射符号，从而可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
为了便于区分而非限定，本文中对信号的命名作如下约定：将待分组(或划分)为集合的信号称为复数符号；将对复数符号分组(或划分)得到的信号称为集合；将集合中的部分复数符合所构成的集称为子集；将发射端发送的信号称为发射符号。
应理解，这些命名仅是为了便于理解与区分，而非限定。例如，将来技术演进过程中，在符号生成流程的不同阶段得到的信号可能具有其它命名。
本申请实施例中的发射符号可以是单载波波形的符号。例如，发射符号为DFT-s-OFDM符号。DFT-s-OFDM符号表示波形为DFT-s-OFDM波形的单载波符号。再例如，发射符号为SC-QAM符号。SC-QAM符号表示波形为SC-QAM波形的单载波符号。
下文中，将本申请适用于采用DFT-s-OFDM波形的无线通信系统记为应用场景一，将本申请适用于采用SC-QAM波形的无线通信系统记为应用场景二。
可选地，本申请的应用场景为应用场景一，即发射符号为DFT-s-OFDM符号。如图6所示，在步骤S360中，不仅包括添加CP的操作，还包括离散傅里叶变换(discrete fourier transformation，DFT)与快速傅里叶逆变换(inverse fast fourier transform，IFFT)的操作。
例如，在步骤S360中，发射机对经过复制操作后的集合进行M点DFT变换；将DFT 变换之后的M点频域元素映射至M个连续的子载波(图6未画出)；在子载波映射之后，再对频域信号进行IFFT变换；对经过IFFT的信号添加CP，最终获得DFT-s-OFDM符号。其中，DFT也可称为频域预编码。
可选地，步骤S360中还包括频域赋形(frequency domain spectrum shaping，FDSS)操作。
例如，在步骤S360中，发射机对经过复制操作后的集合进行M点DFT变换；对DFT变换之后的M点频域元素进行循环扩展与频域滤波(即FDSS操作)；然后将经过FDSS操作之后的频域元素映射至M1(M1>＝M)个连续的子载波；在子载波映射之后，再对频域信号进行IFFT变换；对经过IFFT的信号添加CP，最终获得DFT-s-OFDM符号。
应理解，在应用场景一中，对集合的复制操作在DFT之前进行。
可选地，本申请的应用场景为应用场景二，即发射符号为SC-QAM符号。如图7所示，在步骤S360中，不仅包括添加CP的操作，还包括上采样与滤波。
例如，在步骤S360中，发射机对经过复制操作后的集合添加CP，获得添加CP后的信号，然后对添加CP后的信号进行上采样与滤波，最终获得SC-QAM符号。
应理解，在应用场景二中，对集合的复制操作在添加CP之前执行。
因此，在本申请实施例中，通过对时域连续的两个发射符号对应的两个集合进行复制操作，使得两个集合之间具有相同的复数符号，从而有助于生成时域结构如图3所示的发射符号，从而可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
为了便于理解与描述对集合的复制操作，下文先说明集合与发射符号之间的关联关系。
为了便于描述而非限定，针对发射符号定义三个参考点：第一参考点、第二参考点与第三参考点，如图3所示。第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取CP的位置，第三参考点表示发射符号的起始位置。其中，第二参考点距离发射符号的结束位置的长度等于CP长度。
下文将分别以应用场景一与应用场景二为例进行描述。
1)应用场景一，即发射符号为DFT-s-OFDM符号。在应用场景一中，符号处理流程如图6所示。
假设(记为假设1)，发射端进行DFT的点数为M，则要进行DFT变换的时域向量的维度应该为M。该时域向量可以记为：
x l＝[x l(0),x l(1),...,x l(M-1)] T
其中，x l表示该时域向量。
在时域向量x l中包括M个元素，第一个元素至最后一个元素的时域索引分别为0,1,…,M-1。
假设(记为假设2)，发射端进行DFT的点数为M(与假设1一致)，发射端进行IFFT的尺寸为N，CP的采样点数目为Q，则CP所占用的长度在DFT前可等效的点数为K＝(Q/N)·M。
如果Q不能被N整除，则K的计算结果为非整数，这种情形下，需要对K的计算结果取整，即
Figure PCTCN2020095632-appb-000001
表示对(Q/N)·M向下取整，应理解，这里 的取整方式还可以是向上取整或四舍五入等。
应理解，CP的采样点数目Q可以根据CP的长度获得。
基于上述假设，对于DFT-s-OFDM符号的第一参考点，其在时域向量x l中的时域索引为M-1；对于DFT-s-OFDM符号的第二参考点，其在时域向量x l中的时域索引为M-K-1；对于DFT-s-OFDM符号的第三参考点，其在时域向量x l中的时域索引为0。
应理解，上述对应关系可以表示复数符号集合在生成DFT-s-OFDM符号后，各个复数符号的主要分量在DFT-s-OFDM符号中所处的位置。
2)应用场景二，即发射符号为SC-QAM符号。如图7所示，在SC-QAM符号的生成过程中，在添加CP之前不包括DFT与IFFT，且上采样与滤波是在添加CP之后执行，所以，可以根据CP的长度直接获得CP的长度在时域向量中的等效点数。因此发射机可以直接得到等效CP长度值K1。等效CP长度值K1可以根据CP的长度获得。
假设未添加CP的时域向量如应用场景一中描述的M维的时域向量x l，假设等效CP长度值为K1，则对于SC-QAM符号的第一参考点，其在时域向量x l中的时域索引为M-1，对于SC-QAM符号的第二参考点，其在时域向量x l中的时域索引为M-K1-1，对于SC-QAM符号中的第三参考点，其在时域向量x l中的时域索引为0。
前文已描述，集合可以视为多维时域向量。上文示例中的时域向量x l可以表示集合对应的时域向量。时域向量x l中的元素对应于集合中的复数符号。时域向量x l中元素的时域索引对应于集合中复数符号在该集合中的位置。
上文示例表明，时域向量x l中元素的时域索引与时域向量x l对应的发射符号中的时域位置(例如，第一参考点、第二参考点、第三参考点)具有对应关系。因此，可以理解到，集合中复数符号的位置也与该集合对应的发射符号中的位置具有对应关系。
图8为根据本申请另一实施例的符号处理的方法的示意性流程图。该方法包括如下步骤S810至步骤S830。
S810，得到多个复数符号。
该多个复数符号中可以包括通过对编码比特流进行调制获得的调制符号。
可选地，多个复数符号中还可以包括参考信号采样点。例如，参考信号采样点可以包括PTRS采样点。
S820，将多个复数符号分为多个集合。
每个集合中可以包括若干复数符号。例如，每个集合可以视作一个多维的时域向量，集合中的复数符号可以视为时域向量中的元素。
每个集合对应一个发射符号。例如，每个集合对应一个DFT-s-OFDM符号或SC-QAM符号。
多个集合中包括对应于第一发射符号的第一集合以及对应于第二发射符号的第二集合，第一发射符号与第二发射符号时域连续，第一发射符号位于第二发射符号之前。
步骤S820可以对应于图5、图6、图7中所示的步骤S320。
S830，对第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号。其中，第一复数符号可以包括多个复数符号。
本文将第一集合中第一复数符号所构成的子集称为第一子集，将第二集合中第一复数符号所构成的子集称为第二子集。
在步骤S830中，复制操作使得第一集合包括第一子集，第二集合包括第二子集，第一子集与第二子集中包括的复数符号相同，其中，第一子集的时域位置与第二子集的时域位置可以相同，也可以不同。
可选地，在一些实施例中，第一子集的时域位置与第二子集的时域位置可以相同，即第一子集的起始位置的时域索引与第二子集的起始位置的时域索引相同，第一子集的结束位置的时域索引与第二子集的结束位置的时域索引相同。
本文中，将本实施例中步骤S830的复制操作称为同位置复制操作。
下文中提及的步骤S830的复制操作为同位置复制操作，指的就是，步骤S830中的复制操作使得第一集合与第二集合均具有第一复数符号，且第一集合中的第一复数符号所构成的第一子集的时域位置与第二集合中的第一复数符号所构成的第二子集的时域位置相同。
可选地，在一种可能的实现中，第一子集和第二子集具有相同的长度，但不具有同样的索引，例如，第一子集的时域位置与第二子集的时域位置不同，此时，发射机可在后续处理步骤中通过时域循环移位或频域加权等处理将第一子集和第二子集调整至相同的时域位置，即等效为同位置复制。
需要说明的是，步骤S830中对第一集合与第二集合进行的复制操作也可理解为，在第一集合和第二集合中映射第一复数符号。
步骤S830可以对应于图5、图6、图7中所示的步骤S340。
应理解，在应用场景一中，步骤S830在DFT之前执行；在应用场景二中，步骤S830在添加CP之前执行。
步骤S830中的复制操作可以是前向复制也可以是后向复制。
可选地，在图8所示实施例中，步骤S830包括：将第一集合中的第一复数符号复制到第二集合中。这种复制方式可以称为后向复制。
可选地，在图8所示实施例中，步骤S830包括：将第二集合中的第一复数符号复制到第一集合中。这种复制方式可以称为前向复制。
S840，对经过复制操作之后的第一集合与第二集合进行信号处理，该信号处理包括循环移位或频域加权。
应理解，若步骤S840中的信号处理为循环移位，则在步骤S840中，是对第一集合对应的时域信号以及第二集合对应的时域信号进行信号处理；若步骤S840中的信号处理为频域加权，则在步骤S840中，是对第一集合对应的频域信号以及第二集合对应的频域信号进行频域加权。
步骤S840有多种实现方式。
可选地，作为第一种实现方式，步骤S840中的信号处理包括第一信号处理，该第一信号处理包括循环移位或频域加权。
在第一种实现方式中，步骤S840包括：对经过复制操作之后的第一集合与第二集合分别进行第一信号处理，该第一信号处理使得第一子集的结束位置对应于第一发射符号的第一参考点，以及使得第二子集的结束位置对应于第二发射符号的第二参考点。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位 置。
在本实施例中，通过对时域连续的第一发射符号与第二发射符号对应的第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号；通过对第一集合与第二集合进行第一信号处理，使得第一集合中第一复数符号所构成的第一子集的结束位置对应于第一发射符号的第一参考点，第二集合中第二子集的结束位置对应于第二发射符号的第二参考点，从而可以生成时域结构如图3所示的第一发射符号与第二发射符号。因此，本申请实施例可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
可选地，作为第二种实现方式，步骤S840中的信号处理包括第一信号处理与第二信号处理，该第一信号处理包括循环移位或频域加权，该第二信号处理包括循环移位或频域加权。其中，若第一信号处理为循环移位，第二信号处理为循环移位；若第一信号处理为频域加权，第二信号处理可以为频域加权或循环移位。
在第二种实现方式中，步骤S840包括：对经过复制操作之后的第一集合与第二集合分别进行第一信号处理，该第一信号处理使得，第一子集的结束位置对应于第一发射符号的第一参考点，以及使得第二子集的结束位置对应于第二发射符号的第二参考点；统一对第一集合经过第一信号处理之后的信号以及第二集合经过第一信号处理之后的信号进行第二信号处理，该第二信号处理使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
在第二种实现方式中，第二信号处理可以理解为是对第一集合与第二集合的公共移位操作。
在本申请实施例中，通过对时域连续的第一发射符号与第二发射符号对应的第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号；通过对第一集合与第二集合进行第一信号处理与第二信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，从而可以生成时域结构如图3所示的第一发射符号与第二发射符号。因此，本申请实施例可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
此外，应理解，通过对第一集合与第二集合进行第一信号处理与第二信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，这可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
需要说明的是，本文中提及“第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”，指的是，第一集合中第一子集的起始位置对应于第一发射符号的尾部位置，第一子集的结束位置对应于第一发射符号的头部位置。
本文中提及“第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”的前提是，对第一集 合进行信号处理，即对第一集合进行循环移位或频域加权。应理解，在循环移位(或频域加权)的前提下，“第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”，可以理解为“第一子集的结束位置对应于第一发射符号的头部位置”，或者“第一子集的结束位置对应于第一发射符号的第三参考点之后的位置，其中，第三参考点表示发射符号的起始位置”。或者，从第一发射符号的时域结构来看，“第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”可以表达为“第一子集的结束位置对应于第一发射符号的第一参考点之前的位置”，如图11所示。
还需要说明的是，本文是为了阐述第一子集的时域位置对应到第一发射符号中的时域位置是覆盖了第一发射符号的第一参考点(即第一发射符号的结束位置)，因此，采用如下描述方式“第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置”。
可选地，在第三种实现方式中，步骤S840中的信号处理包括第三信号处理，该第三信号处理包括循环移位或频域加权。
在第三种实现方式中，步骤S840包括：对经过复制操作之后的第一集合与第二集合分别进行第三信号处理，该第三信号处理使得，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
应理解，第三种实现方式可以视为，将第二种实现方式中的第一信号处理与第二信号处理合并为一次信号处理的结果，其中，第一信号处理与第二信号处理均为循环移位，或者，第一信号处理与第二信号处理均为频域加权。
在本申请实施例中，通过对时域连续的第一发射符号与第二发射符号对应的第一集合与第二集合进行复制操作，使得第一集合与第二集合均具有第一复数符号；通过对第一集合与第二集合进行第三信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，从而可以生成时域结构如图3所示的第一发射符号与第二发射符号。因此，本申请实施例可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
此外，应理解，通过对第一集合与第二集合进行第三信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，这可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
作为示例而非限定，下文结合图9与图10进行示例性描述。在图9至图10中，集合1对应发射符号1，集合2对应发射符号2。
图9示出在未进行步骤S840的情况下，集合与发射符号之间的对应关系。
在图9中，集合1与集合2为经过复制操作(即本申请实施例中的步骤S830)的集合。集合1与集合2中均包括第一复数符号，该第一复数符号可以包括多个复数符号。该第一复数符号在集合1中构成的子集如图9中所示的子集S1，该第一复数符号在集合2 中构成的子集如图9中所示的子集S2，子集S1与子集S2的时域位置相同，即子集S1与子集S2的起始位置相同，结束位置也相同。
在图9中，发射符号1表示在不进行步骤S840的情况下，基于集合1生成的发射符号，发射符号2表示在不进行步骤S840的情况下，基于集合2生成的发射符号。发射符号1中的符号分量D1与发射符号2中的符号分量D2相同，且符号分量D1与符号分量D2的时域位置相同。其中，集合1中的子集S1对应于发射符号1中的符号分量D1，集合2中的子集S2对应于发射符号2中的符号分量D2。
从图9可以看出，由于发射符号1表示在不进行步骤S840的情况下基于集合1生成的发射符号，发射符号2表示在不进行步骤S840的情况下基于集合2生成的发射符号，因此，发射符号1中的符号分量D1的位置相对于集合1中的子集S1的位置未发生移位，发射符号2中的符号分量D2的位置相对于集合2中的子集S2的位置未发生移位。
图10示出在进行步骤S840的情况下，集合与发射符号之间的对应关系，在图10的示例中，步骤S840的实现方式为上述第二种实现方式或第三种实现方式。
在图10中，集合1与集合2为经过复制(即本申请实施例中的步骤S830)的集合。集合1与集合2中均包括第一复数符号，该第一复数符号可以包括多个复数符号。该第一复数符号在集合1中构成的子集如图10中所示的子集S1，该第一复数符号在集合2中构成的子集如图10中所示的子集S2，子集S1与子集S2的时域位置相同，即子集S1与子集S2的起始位置相同，结束位置也相同。
在图10中，发射符号1表示在进行步骤S840的情况下，基于集合1生成的发射符号，发射符号2表示在进行步骤S840的情况下，基于集合2生成的发射符号。发射符号1中的符号分量D1与发射符号2中的符号分量D2相同，符号分量D1的起始位置位于发射符号1的第一参考点之前，符号分量D1的结束位置位于发射符号1的第一参考点之后(即发射符号1的头部)，换句话说，符号分量D1的结束位置位于发射符号1的第三参考点之后，如图10所示。符号分量D2的起始位置位于发射符号2的第二参考点之前，符号分量D2的结束位置位于发射符号2的第二参考点之后。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号截取CP的位置，即第二参考点距离第一参考点的距离等于CP的长度，第三参考点表示发射符号的起始位置。其中，发射符号1中的符号分量D1对应于集合1中的子集S1，发射符号2中的符号分量D2对应于集合2中的子集S2。
从图10可以看出，由于发射符号1表示在进行步骤S840的情况下基于集合1生成的发射符号，发射符号2表示在进行步骤S840的情况下基于集合2生成的发射符号，因此，发射符号1中的符号分量D1相对于集合1中的子集S1的位置发生了移位，发射符号2中的符号分量D2相对于集合2中的子集S2的位置发生了移位。
作为示例，本申请实施例中的第一集合可以对应于图10中的集合1，第二集合可以对应于图10中的集合2，第一发射符号可以对应于图10中的发射符号1，第二发射符号可以对应于图10中的发射符号2。
作为一个示例，步骤S840包括第一信号处理与第二信号处理，本申请实施例中的第一集合对应的第一发射符号以及第二集合对应的第二发射符号的时域结构如图11所示。在图11中，第一发射符号中的符号分量D1与第二发射符号中的符号分量D2相同，符号分量D1的起始位置位于第一发射符号的第一参考点之前，符号分量D1的结束位置位于 第一发射符号的第一参考点之后(即位于第一发射符号的头部)，符号分量D2的起始位置位于第二发射符号的第二参考点之前，符号分量D2的结束位置位于第二发射符号的第二参考点之后。
在图11中，将符号分量D1中位于第一发射符号的第一参考点之前的符号分量记为D11，将符号分量D1中位于第一发射符号的第一参考点之后的符号分量(即位于第三参考点之后的符号分量)记为D12；将符号分量D2中位于第二发射符号的第二参考点之前的符号分量记为D21，将符号分量D2中位于第二发射符号的第二参考点之后的符号分量记为D22。参见图3与图11可知，图11中所示的第一发射符号中的符号分量D11对应于图3中所示的第一发射符号中的符号分量D1，图11中所示的第二发射符号中的符号分量D21对应于图3中所示的第二发射符号中的符号分量D2。
本申请实施例通过对时域连续的两个发射符号对应的两个集合进行复制操作以及第一信号处理与第二信号处理，可以生成时域结构如图11所示的第一发射符号与第二发射符号。因此，本申请实施例可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
此外，应理解，通过对第一集合与第二集合进行第一信号处理与第二信号处理，使得第一子集的起始位置与结束位置分别对应于第一发射符号的第一参考点之前与之后的位置，以及第二子集的起始位置与结束位置分别对应于第二发射符号的第二参考点之前与之后的位置，这可以在一定程度上减小滤波器的拖尾效应对符号间的保护间隔扩展的影响。
为了便于理解与描述，本申请中以时域连续的第一发射符号与第二发射符号为例进行描述，应理解，本申请提供的符号处理的方法可以适用于发射端发射的信号流中的任意时域连续的两个发射符号或多个发射符号。
本申请实施例中的步骤S840的执行时机可以根据应用场景的不同而不同。
在应用场景一中，步骤S840的执行时机可以包括如图6中所示的①、②、③。
可选地，在图8所示实施例中，发射符号为DFT-s-OFDM符号，步骤S840中的信号处理包括循环移位，该步骤S840包括如下操作：对所述第一集合与所述第二集合进行频域处理，获得所述第一集合对应的频域信号以及所述第二集合对应的频域信号；对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行IFFT，获得所述第一集合对应的时域信号以及所述第二集合对应的时域信号；对所述第一集合对应的时域信号以及所述第二集合对应的时域信号进行循环移位，使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置。
本实施例对应于在图6中③所示的时机执行步骤S840。对所述第一集合与所述第二集合进行频域处理，指的是，对所述第一集合与所述第二集合进行DFT。
作为示例，发射符号为DFT-s-OFDM符号，本申请生成DFT-s-OFDM符号的流程如如图12所示。该流程包括如下步骤。对编码比特流进行调制，获得多个调制符号，该调制符号可以称为复数符号，该步骤可以对应于本实施例中的步骤S810。对多个复数符号进行分组，获得多个集合，这个步骤对应于本实施例中的步骤S820。对多个集合进行复 数符号的复制操作，该步骤可以对应于本实施例中的步骤S830。对经过复制操作之后的信号进行DFT。将DFT变换之后的M点频域元素映射至M个连续的子载波(图12未画出)，发射机在除此M个子载波之外的子载波插零或映射其余信号。在子载波映射之后，再对频域信号进行IFFT变换。对经过IFFT的信号进行循环移位，该步骤可以对应于本实施例中的步骤S840。对经过循环移位的信号添加CP，经过并串转换(P/S)，最终获得DFT-s-OFDM符号。
例如，本申请实施例中的分组可以通过串/并转换(serial/parallel，S/P)实现。
可选地，在图8所示实施例中，发射符号为DFT-s-OFDM符号，步骤S840中的信号处理包括频域加权，该步骤S840包括如下操作：对第一集合与第二集合进行离散傅里叶变换DFT，获得第一集合对应的频域信号以及第二集合对应的频域信号；对第一集合对应的频域信号以及第二集合对应的频域信号进行频域加权，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
应理解，本实施例中的频域加权可等效为时域符号的循环移位。
本实施例对应于在图6中②所示的时机执行循环移位。
作为示例，发射符号为DFT-s-OFDM符号，本申请生成DFT-s-OFDM符号的流程包括如下步骤。对编码比特流进行调制，获得多个调制符号，该调制符号可以称为复数符号，该步骤可以对应于本实施例中的步骤S810。对多个复数符号进行分组，获得多个集合，这个步骤对应于本实施例中的步骤S820。对多个集合进行复数符号的复制操作，该步骤可以对应于本实施例中的步骤S830。对经过复制操作之后的信号进行DFT。对DFT变化之后的M点频域元素进行上述频域加权。将进过频域加权之后的M点频域元素映射至M个连续的子载波，发射机在除此M个子载波之外的子载波插零或映射其余信号。在子载波映射之后，再对频域信号进行IFFT变换。对经过IFFT的信号进行循环移位，该步骤可以对应于本实施例中的步骤S840。对经过循环移位的信号添加CP，最终获得DFT-s-OFDM符号。
应理解，在本实施例中，通过频域加权的方式等效实现循环移位。
作为示例，对第一集合对应的频域信号以及第二集合对应的频域信号进行频域加权时，采用的权值满足如下公式：
C(k,l)＝C 0(l)·exp(j2πkn 0(l)/P)
其中，C(k,l)表示权值。C 0(l)与符号编号l相关，在一个发射符号内，其为常数，本申请不限定C 0(l)的具体取值。可选地，C 0(l)＝1。j表示复数符号，即
Figure PCTCN2020095632-appb-000002
P的可能取值包括两种，P＝N u或P＝M，其中，N u表示IFFT后符号除CP外的长度，M表示DFT点数。
P的可能取值包括两种，P＝N u或P＝M，其中，N u表示IFFT后符号除CP外的长度，M表示DFT点数。
假设IFFT后的移位值为CP长度，即N CP,l，等效的频域加权的参数取值如下，当P＝N u时，n 0(l)＝N CP,l；当P＝M时，n 0(l)＝M·N CP,l/N u。
符号编号为l的发射符号的移位值为
Figure PCTCN2020095632-appb-000003
当P＝N u时，
Figure PCTCN2020095632-appb-000004
当P＝M时，
Figure PCTCN2020095632-appb-000005
其中，o1表示累加的起始符号，取值可以是0,1，2等；N 1表示初始移位值，N 1可以设置。
对应的，可以得到，n 0(1)＝M·N 1/N u。
可选地，可以通过N 1计算n 0(1)的取值。
可选地，可以通过协议直接定义n 0(1)的取值。
可选地，在一些实施例中，符号编号为l+1的发射符号的等效移位值比符号编号l为的发射符号的等效移位值多N CP,l+1。
可以理解到，因此可得到：
Figure PCTCN2020095632-appb-000006
可选地，可以通过协议直接定义N CP,l/N u的取值。
例如，在现有的NR协议中，一种可能的取值为
Figure PCTCN2020095632-appb-000007
在应用场景二中，循环移位在复制操作之后，添加CP之前进行，例如，在图7中④所示的时机进行。
可选地，在图8所示实施例中，发射符号为DFT-s-OFDM符号或SC-QAM符号，步骤S840中的信号处理包括循环移位，该步骤S840包括如下操作：直接对步骤S830得到的第一集合与第二集合进行循环移位，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
本实施例可以对应于在图6中①所示的时机执行循环移位，或者，本实施例可以对应于在图7中④所示的时机执行循环移位。
可选地，在步骤S830为同位置复制操作的实施例中，即步骤S830包括对第一集合与第二集合进行复制操作，使得第一集合与第二集合中均具有第一复数符号，且第一集合中第一复数符号所构成的第一子集的起始位置的时域索引与第二集合中第一复数符号所构成的第二子集的起始位置的时域索引相同，其中，第一子集的起始位置的时域索引与CP的长度以及符号编号有关。
换句话说，针对每两个时域连续的发射符号对应的两个集合，可以根据发射符号的符号编号，确定参与复制操作的复数符号的位置。
作为示例，在步骤S830中，对第一集合与第二集合进行同位置复制操作，其中，第一子集的起始位置的时域索引i满足如下公式：
i＝A+CL CP(l)
其中，l表示第一集合的符号编号，其中，l＝0表示信号流中的第一个发射符号，l＝1 表示信号流中的第二个发射符号，以此类推。A表示符号编号l为0的集合中的第一子集的时域索引。CL CP(l)表示符号编号为l的第一集合的等效累加CP长度，表示符号编号为o1的发射符号至符号编号为l的发射符号的CP的长度之和在DFT之前的时域向量中的等效长度，其中o1表示累加的起始符号，取值可以是0,1，2等。
符号编号不同的发射符号的CP的长度可以相同，也可以不同。
作为示例，符号编号为l的集合的等效累加CP长度CL CP(l)满足如下公式：
Figure PCTCN2020095632-appb-000008
其中，M表示DFT点数，N u表示IFFT后符号除CP外的长度，N CP,o表示符号编号为o的集合在IFFT后的移位值(CP长度),o1表示累加的起始符号，取值可以是0,1，2等，
Figure PCTCN2020095632-appb-000009
表示向下取整。向下取值可替换为其他取整方式。
可选地，在一些实施例中，信号流中不同符号编号的发射符号的CP的长度均相同，则在经过复制操作的第一集合与第二集合中，第一子集的起始位置的时域索引i满足如下公式：
i＝A+l·L CP
其中，l表示第一集合的符号编号，其中，l＝0表示信号流中的第一个发射符号，l＝1表示信号流中的第二个发射符号，以此类推。A表示符号编号l为0的集合中的第一子集的时域索引。L CP表示CP的长度在DFT之前的时域向量中的等效长度。
还应理解，在步骤S830中，第一子集的起始位置的时域索引与第二子集的起始位置的时域索引相同，因此，第二子集的起始位置的时域索引i也满足上述如下公式。
应理解，对符号编号为l与l+1的两个发射符号对应的两个集合进行复制操作的复制位置(即被复制的符号分量的时域索引)，与对符号编号为l+1与l+2的两个发射符号对应的两个集合进行复制操作的复制位置不同。
作为示例而非限定，图13为对时域连续的多个时域符号对应的多个集合进行同位置复制操作之后的时域结构示意图。
在图13中，作如下假设：集合1的符号编号为0，集合2的符号编号为1，…，集合6的符号编号5；不同符号编号的集合对应的发射符号的CP的长度相同；符号编号为0的集合1中参与复制操作的子集的时域索引A为0。
如图13所示，集合1与集合2均具有复数符号构成的子集G1，且子集G1在集合1与集合2中的位置相同；集合2与集合3均具有子集G2，且子集G2在集合1与集合2中的位置相同，以此类推。对于集合1与集合2，子集G1的时域索引为0；对于集合2与集合3，子集G2的时域索引为L CP；对于集合3与集合4，子集G3的时域索引为i＝A+l·L CP＝2L CP；对于集合4与集合5，子集G4的时域索引为i＝A+l·L CP＝3L CP；对于集合5与集合6，子集G5的时域索引为i＝A+l·L CP＝4L CP。其中，L CP表示CP的长度在DFT之前的时域向量中的等效长度。
可选地，在一些实施例中，步骤S830包括：对第一集合与第二集合进行复制操作，使得第一集合与第二集合中均具有第一复数符号，且第一集合中第一复数符号所构成的第 一子集的起始位置的时域索引与第二集合中第一复数符号所构成的第二子集的起始位置的时域索引相同，其中，第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，第一子集的结束位置对应于第一发射符号的第一参考点之后的位置(即第一发射符号的第三参考点之后的位置)，第二子集的起始位置对应于第二发射符号的第一参考点之前的位置，第二子集的结束位置对应于第二发射符号的第一参考点之后的位置(即第二发射符号的第三参考点之后的位置)。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取CP的位置，第三参考点表示发射符号的起始位置。
在本实施例的步骤S840中，可以不对第一集合进行循环移位，仅对第二集合进行循环移位。
可选地，在一些实施例中，步骤S840中的信号处理包括循环移位，对于第一集合的循环移位步长根据CP的长度与第一发射符号的符号编号确定，对于第二集合的循环移位步长根据CP的长度与第二发射符号的符号编号有关。
例如，l表示发射符号的符号编号，假设l＝0对应信号流中的第一个发射符号，l＝1对应信号流中的第二个发射符号，以此类推。在该假设下，在步骤S840中，符号编号为l的集合的循环移位步长Z(l)满足如下公式：
Figure PCTCN2020095632-appb-000010
其中，Z 0表示符号编号为0的集合的循环移位步长，
Figure PCTCN2020095632-appb-000011
表示符号编号为l的集合的等效累加CP长度，表示符号编号为o1的发射符号至符号编号为l的发射符号的CP的长度之和在IFFT之后的时域向量中的等效长度。
符号编号不同的发射符号的CP的长度可以相同，也可以不同。
可选地，在一些实施例中，信号流中不同符号编号的发射符号的CP的长度均相同，符号编号为l的集合的循环移位步长Z(l)满足如下公式：
Z(l)＝Z 0+l·N cp
其中，Z 0表示符号编号为0的集合的循环移位步长，该集合的循环移位步长可以预设值，例如可以为经验值。N cp表示CP的长度在IFFT之后的时域向量中的等效长度。
图14为对时域连续的多个时域符号对应的多个集合进行复制操作与信号处理(循环移位或频域加权)的示意图。
作为示例而非限定，图14中位于发射符号的时域窗口内的6个发射符号表示由经过步骤S830与步骤S840处理的集合1至集合6生成的时域连续的发射符号。在图14中，不考虑发射符号的循环前缀(CP)。图14中，发射符号1至发射符号6的符号编号依次为0,1，…，5。
需要说明的是，在图14中，为了更好地理解循环移位，而画出一个发射符号的时域窗口，这个时域窗口仅为了便于理解与描述，不对本申请实施例造成限定。
可以等效地认为，图14中的发射符号1是对图13中的集合1进行信号处理(循环移位或频域加权)得到的发射符号，图14中的发射符号2是对图13中的集合2进行信号处理(循环移位或频域加权)得到的发射符号，…，图14中的发射符号6是对图13中的集 合6进行信号处理(循环移位或频域加权)得到的发射符号。
从图14还可以理解到，符号编号为l+1的发射符号的循环移位步长与符号编号l为的发射符号的循环移位步长相差一个CP长度。这里假设不同符号编号的发射符号的CP长度相同。
本申请实施例可以应用于生成DFT-s-OFDM符号与SC-QAM符号。此外，本申请还可以应用于生成参考信号，例如解调参考信号(de-modulation reference signal，DMRS)等参考信号。
对于DFT-s-OFDM波形，参考信号通常在频域生成并直接进行子载波映射。
作为一种可能的实施方式，当发射符号为参考信号时，本申请实施例中的复制操作在计算将参考信号频域序列变换至时域的采样值之后执行。
考虑到参考信号用于估计信道，为了保证信道性能，不希望参考信号中包含其它符号的时域采样点。
可选地，在本申请实施例中，若发射符号x为参考信号，发射符号x之前与之后的发射符号均为非参考信号，则对于发射符号x之前的发射符号(包括该参考信号x)，在步骤S830中采用前向复制，对于该发射符号x之后的参考信号(包括该参考信号x)，在步骤S830中采用后向复制。
可选地，在上述后向复制的各个实施例中，第一发射符号可以为参考信号，第二发射符号为非参考信号。
例如，第一发射符号为DMRS。
可选地，在上述前向复制的各个实施例中，第一发射符号为非参考信号，第二发射符号可以为参考信号。
例如，第二发射符号为DMRS。
在本实施例中，既可以实现灵活配置符号间的保护间隔，又可以保证参考信号的完整性。
图15示出3个发射符号(1,2,3)的时域结构示意图，其中，发射符号2为DMRS，发射符号1与发射符号2为非参考信号，发射符号2对应的集合2与发射符号1对应的集合1之间的复制关系是前向复制，发射符号2对应的集合2与发射符号3对应的集合3之间的复制关系是后向复制。
从图15可知，发射符号2中起始位置为第二参考点的符号分量R12被复制到发射符号1中，复制到发射符号1中的符号分量R12的起始位置为发射符号1的第三参考点，发射符号2中结束位置为第二参考点的符号分量R11被复制到发射符号1中，复制到发射符号1中的符号分量R11的结束位置为发射符号1的第一参考点。发射符号2中结束位置为第一参考点的符号分量R21被复制到发射符号3中，复制到发射符号3中的符号分量R21的结束位置为发射符号3的第二参考点，发射符号2中起始位置为第三参考点的符号分量R22被复制到发射符号3中，复制到发射符号3中的符号分量R22的起始位置为发射符号3的第二参考点。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取CP的位置，第三参考点表示发射符号的起始位置(CP的结束位置)，如图15所示。
如图15所示，发射符号2与发射符号1的复制关系是前向复制，即将DMRS中的符 号分量R11与R12向复制到符号1中，以此类推，将发射符号1中的符号分量D0复制到符号1之前的符号(图15中未示出)中；DMRS与发射符号3的复制关系是后向复制，即将DMRS中的符号分量R21与R22复制到发射符号3中，以此类推，将发射符号3中的符号分量复制到发射符号2之后的符号(图15中未示出)中。
应理解，本实施例既可以实现符号间的保护间隔的灵活配置，又可以保证参考信号的准确性，从而可以保证信道性能。
在存在时域连续的两个或多个发射符号均为参考信号的情况下，本申请提出一种符号处理的方法，该方法包括如下步骤。
步骤1)，得到多个复数符号。
步骤2)，将多个复数符号分为多个集合，多个集合中包括第一集合与第二集合，第一集合对应第一发射符号，第二集合对应第二发射符号，第一发射符号与第二发射符号时域连续，第一发射符号位于第二发射符号之前，第一集合中的第一子集中的复数符号与第二集合中的第二子集中的复数符号相同。
例如，第一集合对应的时域向量与第二集合对应的时域向量相同。
步骤3)，对第一集合与第二集合进行信号处理，信号处理包括循环移位或频域加权，信号处理使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
可选地，第一集合与第二集合对应的发射符号为参考信号，例如，为DMRS。
应理解，在本实施例中，没有对第一集合与第二集合进行复制操作，当第一集合与第二集合对应的发射符号为参考信号时，可以在保证参考信号的准确性的前提下，可以实现参考信号的保护间隔的灵活配置。
基于上述描述，本申请实施例通过对时域连续的两个发射符号对应的两个集合进行复制操作以及包括循环移位或频域加权的信号处理，可以生成时域结构如图3所示的第一发射符号与第二发射符号。因此，本申请实施例可以在固定CP长度的前提下，实现符号间的保护间隔的灵活配置。
可选地，在图8所示的实施例中，该方法还包括：基于经过步骤S840的信号处理之后的信号，生成第一发射符号与第二发射符号，其中，第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同。
在本申请中，对于时域连续的第一发射符号与第二发射符号，通过使得第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同，从而可以通过控制该符号分量的长度，实现灵活配置符号间的保护间隔。
因此，本申请在CP长度固定的情况下，可以实现灵活配置符号间的保护间隔，还可以根据用户需求灵活配置保护间隔的长度。
应理解，除了本文提供的实施例，其它任何可以生成时域结构如图3所示的发射符号的方案也均落入本申请保护范围。
本文中描述的各个实施例可以为独立的方案，也可以根据内在逻辑进行组合，这些方 案都落入本申请的保护范围中。
可以理解的是，上述各个方法实施例中，执行主体既可以是终端设备或者可用于终端设备的部件(例如芯片或者电路)，也可以是网络设备或者可用于网络设备的部件(例如芯片或者电路)。
上文描述了本申请实施例提供的方法实施例，下文将描述本申请实施例提供的装置实施例。应理解，装置实施例的描述与方法实施例的描述相互对应，因此，未详细描述的内容可以参见上文方法实施例，为了简洁，这里不再赘述。
图16示出根据本申请实施例的符号处理的装置1600的示意性框图。该装置1600用于执行上述方法实施例。该装置1600可以包括如下单元。
获取单元1610，用于得到多个复数符号。
分组单元1620，用于将多个复数符号分为多个集合，其中，每个集合对应一个发射符号，多个集合中包括对应于第一发射符号的第一集合以及对应于第二发射符号的第二集合，第一发射符号与第二发射符号时域连续，第一发射符号位于第二发射符号之前。
复制单元1630，用于对第一集合与第二集合进行复制操作，使得第一集合与第二集合中均具有第一复数符号，在第一集合中第一复数符号所构成的第一子集的起始位置的时域索引，与在第二集合中第一复数符号所构成的第二子集的起始位置的时域索引相同。
信号处理单元1640，用于在复制操作之后，对第一集合与第二集合进行信号处理，该信号处理包括循环移位或频域加权，该信号处理使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
可选地，在一些实施例中，信号处理单元1640用于：对第一集合与第二集合进行频域处理，获得第一集合对应的频域信号以及第二集合对应的频域信号；对第一集合对应的频域信号以及第二集合对应的频域信号进行快速傅里叶逆变换IFFT，获得第一集合对应的时域信号以及第二集合对应的时域信号；对第一集合对应的时域信号以及第二集合对应的时域信号进行循环移位，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
可选地，在一些实施例中，信号处理单元1640用于：对第一集合与第二集合进行离散傅里叶变换DFT，获得第一集合对应的频域信号以及第二集合对应的频域信号；对第一集合对应的频域信号以及第二集合对应的频域信号进行频域加权，使得第一子集的起始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置。
可选地，在一些实施例中，在复制单元1630对第一集合与第二集合进行复制操作的过程中，第一子集的起始位置的时域索引与循环前缀的长度以及符号编号有关。
可选地，在一些实施例中，在复制单元1630对第一集合与第二集合进行复制操作的过程中，第一子集的起始位置的时域索引i满足如下公式：
i＝A+CL CP(l)
其中，l表示所述第一集合的符号编号，A表示符号编号l为0的集合中参与复制操作的子集的时域索引，CL CP(l)表示符号编号为l的所述第一集合的等效累加CP长度。
可选地，在一些实施例中，复制单元1630用于，将第一集合中的第一复数符号复制到第二集合中。
可选地，在本实施例中，第一发射符号为参考信号，第二发射符号为非参考信号。
可选地，在一些实施例中，复制单元1630用于，将第二集合中的第一复数符号复制到第一集合中。
可选地，在本实施例中，第一发射符号为非参考信号，第二发射符号为参考信号。
可选地，在一些实施例中，装置1600还包括：
符号生成单元1650用于，基于经过循环移位之后的信号，生成第一发射符号与第二发射符号，其中，第一发射符号中结束位置为第一参考点的符号分量与第二发射符号中结束位置为第二参考点的符号分量相同。
因此，本申请在CP长度固定的情况下，可以实现灵活配置符号间的保护间隔，还可以根据用户需求灵活配置保护间隔的长度。
可选地，获取单元1610中可以包括调制子单元，用于对编码后比特流进行调制获得调制符号，调制符号也可称为复数符号。
可选地，获取单元1610用于根据相位PTRS采样点与调制符号，得到多个复数符号，用于分组单元1620进行处理。
可选地，当该装置1600应用于应用场景一，作为示例，如图17所示，符号生成单元1650可以包括DFT子单元、子载波映射子单元、IFFT子单元、添加CP子单元。
在图17中，信号处理单元1640位于复制单元1630与符号生成单元1650之间，这种情形下的信号处理单元1640可以称为循环移位单元。
可选地，信号处理单元1640可以位于符号生成单元1650中。
例如，信号处理单元1640位于DFT子单元与IFFT子单元之间，这种情形下，信号处理单元1640可以称为频域加权单元。
再例如，信号处理单元1640位于IFFT子单元与添加CP子单元之间，这种情形下，信号处理单元1640可以称为循环移位单元。
可选地，当该装置1600应用于应用场景二，作为示例，如图18所示，符号生成单元1650可以包括添加CP子单元、上采样子单元与滤波子单元。这种情形下，信号处理单元1640可以称为循环移位单元。
可选地，作为该装置1600的另一种实施例，获取单元1610，用于得到多个复数符号。分组单元1620，用于将多个复数符号分为多个集合，多个集合中包括第一集合与第二集合，第一集合对应第一发射符号，第二集合对应第二发射符号，第一发射符号与第二发射符号时域连续，第一发射符号位于第二发射符号之前，第一集合中的第一子集中的复数符号与第二集合中的第二子集中的复数符号相同。信号处理单元1640，用于对第一集合与第二集合进行信号处理，信号处理包括循环移位或频域加权，信号处理使得第一子集的起 始位置对应于第一发射符号的第一参考点之前的位置，且第一子集的结束位置对应于第一发射符号的第一参考点之后的位置，以及使得第二子集的起始位置对应于第二发射符号的第二参考点之前的位置，且第二子集的结束位置对应于第二发射符号的第二参考点之后的位置，其中，第一参考点表示发射符号的结束位置，第二参考点表示发射符号的截取循环前缀的位置。
可选地，在本实施例中，第一发射符号与第二发射符号均为参考信号。
可选地，获取单元1610、分组单元1620、复制单元1630、信号处理单元1640(或者，还包括符号生成单元1650)可以通过软件的方式实现，也可以通过硬件的方式实现，还可以通过硬件和软件的方式实现。另外，获取单元1610、分组单元1620、复制单元1630、信号处理单元1640(或者，还包括符号生成单元1650)也可以分别为不同的芯片，也可以集成在一个芯片或集成电路上。
可选地，在上述实施例中，获取单元1610、分组单元1620、复制单元1630、信号处理单元1640、符号生成单元1650均可采用处理器或处理器相关电路实现。
如图19所示，本申请实施例还提供一种符号处理的装置1900。装置1900包括处理器1910、存储器1920和收发器1930，存储器1920中存储有程序，处理器1910用于执行存储器1920中存储的程序，对存储器1920中存储的程序的执行，使得装置1900用于执行上文的方法实施例。
本申请实施例还提供一种通信装置，该通信装置可以是终端设备也可以是芯片。该通信装置可以用于执行上述方法实施例。
当该通信装置为终端设备时，图20示出了一种简化的终端设备的结构示意图。便于理解和图示方便，图20中，终端设备以手机作为例子。如图20所示，终端设备包括处理器、存储器、射频电路、天线以及输入输出装置。处理器主要用于对通信协议以及通信数据进行处理，以及对终端设备进行控制，执行软件程序，处理软件程序的数据等。存储器主要用于存储软件程序和数据。射频电路主要用于基带信号与射频信号的转换以及对射频信号的处理。天线主要用于收发电磁波形式的射频信号。输入输出装置，例如触摸屏、显示屏，键盘等主要用于接收用户输入的数据以及对用户输出数据。需要说明的是，有些种类的终端设备可以不具有输入输出装置。
当需要发送数据时，处理器对待发送的数据进行基带处理后，输出基带信号至射频电路，射频电路将基带信号进行射频处理后将射频信号通过天线以电磁波的形式向外发送。当有数据发送到终端设备时，射频电路通过天线接收到射频信号，将射频信号转换为基带信号，并将基带信号输出至处理器，处理器将基带信号转换为数据并对该数据进行处理。为便于说明，图20中仅示出了一个存储器和处理器，在实际的终端设备产品中，可以存在一个或多个处理器和一个或多个存储器。存储器也可以称为存储介质或者存储设备等。存储器可以是独立于处理器设置，也可以是与处理器集成在一起，本申请实施例对此不做限制。
在本申请实施例中，可以将具有收发功能的天线和射频电路视为终端设备的收发单元，将具有处理功能的处理器视为终端设备的处理单元。
如图20所示，终端设备包括收发单元2010和处理单元2020。收发单元2010也可以称为收发器、收发机、收发装置等。处理单元2020也可以称为处理器，处理单板，处理 模块、处理装置等。可选地，可以将收发单元2010中用于实现接收功能的器件视为接收单元，将收发单元2010中用于实现发送功能的器件视为发送单元，即收发单元2010包括接收单元和发送单元。收发单元有时也可以称为收发机、收发器、或收发电路等。接收单元有时也可以称为接收机、接收器、或接收电路等。发送单元有时也可以称为发射机、发射器或者发射电路等。
例如，在一种实现方式中，处理单元2020用于执行上述方法实施例。收发单元2010用于上述方法实施例中相关的收发操作。例如，收发单元2010用于发送或接收DFT-s-OFDM符号或SC-QAM符号。
应理解，图20仅为示例而非限定，上述包括收发单元和处理单元的终端设备可以不依赖于图20所示的结构。
当该通信装置为芯片时，该芯片包括收发单元和处理单元。其中，收发单元可以是输入输出电路或通信接口；处理单元可以为该芯片上集成的处理器或者微处理器或者集成电路。
本申请实施例还提供一种通信装置，该通信装置可以是网络设备也可以是芯片。该通信装置可以用于执行上述方法实施例。当该通信装置为网络设备时，例如为基站。
图21示出了一种简化的基站结构示意图。基站包括2110部分以及2120部分。2110部分主要用于射频信号的收发以及射频信号与基带信号的转换；2120部分主要用于基带处理，对基站进行控制等。2110部分通常可以称为收发单元、收发机、收发电路、或者收发器等。2120部分通常是基站的控制中心，通常可以称为处理单元，用于控制基站执行上述方法实施例中网络设备侧的处理操作。
2110部分的收发单元，也可以称为收发机或收发器等，其包括天线和射频单元，其中射频单元主要用于进行射频处理。可选地，可以将2110部分中用于实现接收功能的器件视为接收单元，将用于实现发送功能的器件视为发送单元，即2110部分包括接收单元和发送单元。接收单元也可以称为接收机、接收器、或接收电路等，发送单元可以称为发射机、发射器或者发射电路等。
2120部分可以包括一个或多个单板，每个单板可以包括一个或多个处理器和一个或多个存储器。处理器用于读取和执行存储器中的程序以实现基带处理功能以及对基站的控制。若存在多个单板，各个单板之间可以互联以增强处理能力。作为一种可选的实施方式，也可以是多个单板共用一个或多个处理器，或者是多个单板共用一个或多个存储器，或者是多个单板同时共用一个或多个处理器。
例如，在一种实现方式中，2120部分用于执行上述方法实施例。2110部分用于上述方法实施例中相关的收发操作。例如，2110部分用于发送或接收DFT-s-OFDM符号或SC-QAM符号。
应理解，图21仅为示例而非限定，上述包括收发单元和处理单元的网络设备可以不依赖于图21所示的结构。
当该通信装置为芯片时，该芯片包括收发单元和处理单元。其中，收发单元可以是输入输出电路、通信接口；处理单元为该芯片上集成的处理器或者微处理器或者集成电路。
本申请实施例中的终端设备包括具有无线通信功能的手持式设备、车载式设备、可穿戴设备或计算设备。作为示例，终端设备可以指用户设备(user equipment，UE)、接入 终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。例如，终端设备可以是手机(mobile phone)、平板电脑或带无线收发功能的电脑。终端设备还可以是虚拟现实(virtual reality，VR)终端设备、增强现实(augmented reality，AR)终端设备、工业控制中的无线终端、无人驾驶中的无线终端、远程医疗中的无线终端、智能电网中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端等。终端设备可以是5G网络中的终端设备或者未来演进的公用陆地移动通信网络(public land mobile network，PLMN)中的终端设备等。
本申请实施例中的网络设备可以用于与一个或多个终端设备进行通信，也可以用于与一个或多个具有部分终端功能的基站进行通信(比如宏基站与微基站，如接入点，之间的通信)。网络设备可以称为基站。基站可能有多种形式，比如宏基站、微基站、中继站和接入点等。示例性地，本申请实施例涉及到的网络设备可以是新空口(new radio，NR)中的基站，也可以是全球移动通信系统(global system for mobile communication，GSM)或码分多址(code division multiple access，CDMA)中的基站收发台(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)系统中的节点B(nodeB，NB)，还可以是长期演进(long term evolution，LTE)系统中的演进型节点B(evolutional Node B，eNB或eNodeB)。其中，5G NR中的基站还可以称为发送接收点(transmission reception point，TRP)或下一代节点B(next generation Node B，gNB)。
本申请实施例还提供一种计算机可读存储介质，其上存储有计算机程序，该计算机程序被计算机执行时使得该计算机实现上述方法实施例。
本申请实施例还提供一种包含指令的计算机程序产品，该指令被计算机执行时使得该计算机实现上述方法实施例。
上述提供的任一种通信装置中相关内容的解释及有益效果均可参考上文提供的对应的方法实施例，此处不再赘述。
在本申请实施例中，终端设备或网络设备包括硬件层、运行在硬件层之上的操作系统层，以及运行在操作系统层上的应用层。该硬件层包括中央处理器(central processing unit，CPU)、内存管理单元(memory management unit，MMU)和内存(也称为主存)等硬件。该操作系统可以是任意一种或多种通过进程(process)实现业务处理的计算机操作系统，例如，Linux操作系统、Unix操作系统、Android操作系统、iOS操作系统或windows操作系统等。该应用层包含浏览器、通讯录、文字处理软件、即时通信软件等应用。并且，本申请实施例并未对本申请实施例提供的方法的执行主体的具体结构特别限定，只要能够通过运行记录有本申请实施例的提供的方法的代码的程序，以根据本申请实施例提供的方法进行通信即可，例如，本申请实施例提供的方法的执行主体可以是终端设备或网络设备，或者，是终端设备或网络设备中能够调用程序并执行程序的功能模块。
另外，本申请的各个方面或特征可以实现成方法、装置或使用标准编程和/或工程技术的制品。本申请中使用的术语“制品”涵盖可从任何计算机可读器件、载体或介质访问的计算机程序。例如，计算机可读介质可以包括，但不限于：磁存储器件(例如，硬盘、软盘或磁带等)，光盘(例如，压缩盘(compact disc，CD)、数字通用盘(digital versatile  disc，DVD)等)，智能卡和闪存器件(例如，可擦写可编程只读存储器(erasable programmable read-only memory，EPROM)、卡、棒或钥匙驱动器等)。另外，本文描述的各种存储介质可代表用于存储信息的一个或多个设备和/或其它机器可读介质。术语“机器可读介质”可包括但不限于，无线信道和能够存储、包含和/或承载指令和/或数据的各种其它介质。
应理解，本申请实施例中提及的处理器可以是中央处理单元(Central Processing Unit，CPU)，还可以是其他通用处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现成可编程门阵列(Field Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
还应理解，本申请实施例中提及的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(Read-Only Memory，ROM)、可编程只读存储器(Programmable ROM，PROM)、可擦除可编程只读存储器(Erasable PROM，EPROM)、电可擦除可编程只读存储器(Electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(Static RAM，SRAM)、动态随机存取存储器(Dynamic RAM，DRAM)、同步动态随机存取存储器(Synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data Rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(Synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM，DR RAM)。
需要说明的是，当处理器为通用处理器、DSP、ASIC、FPGA或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件时，存储器(存储模块)集成在处理器中。
应注意，本文描述的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的 部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (26)

  1. 一种符号处理的方法，其特征在于，包括：
    得到多个复数符号；
    将所述多个复数符号分为多个集合，其中，每个集合对应一个发射符号，所述多个集合中包括对应于第一发射符号的第一集合以及对应于第二发射符号的第二集合，所述第一发射符号与所述第二发射符号时域连续，所述第一发射符号位于所述第二发射符号之前；
    对所述第一集合与所述第二集合进行复制操作，使得所述第一集合与所述第二集合中均具有第一复数符号，其中，在所述第一集合中所述第一复数符号所构成的第一子集的起始位置的时域索引，与在所述第二集合中所述第一复数符号所构成的第二子集的起始位置的时域索引相同；
    在所述复制操作之后，对所述第一集合与所述第二集合进行信号处理，所述信号处理包括循环移位或频域加权，所述信号处理使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置，
    其中，所述第一参考点表示发射符号的结束位置，所述第二参考点表示发射符号的截取循环前缀的位置。
  2. 根据权利要求1所述的方法，其特征在于，对所述第一集合与所述第二集合进行信号处理，所述信号处理包括循环移位或频域加权，包括：
    对所述第一集合与所述第二集合进行频域处理，获得所述第一集合对应的频域信号以及所述第二集合对应的频域信号；
    对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行快速傅里叶逆变换IFFT，获得所述第一集合对应的时域信号以及所述第二集合对应的时域信号；
    对所述第一集合对应的时域信号以及所述第二集合对应的时域信号进行循环移位，使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置。
  3. 根据权利要求1所述的方法，其特征在于，对所述第一集合与所述第二集合进行信号处理，所述信号处理包括循环移位或频域加权，包括：
    对所述第一集合与所述第二集合进行离散傅里叶变换DFT，获得所述第一集合对应的频域信号以及所述第二集合对应的频域信号；
    对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行频域加权，使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结 束位置对应于所述第二发射符号的第二参考点之后的位置。
  4. 根据权利要求1至3中任一项所述的方法，其特征在于，所述第一子集的起始位置的时域索引与循环前缀的长度以及符号编号有关。
  5. 根据权利要求4所述的方法，其特征在于，所述第一子集的起始位置的时域索引i满足如下公式：
    i＝A+CL CP(l)
    其中，l表示所述第一集合的符号编号，A表示符号编号l为0的集合中参与复制操作的子集的时域索引，CL CP(l)表示符号编号为l的所述第一集合的等效累加CP长度。
  6. 根据权利要求1至5中任一项所述的方法，其特征在于，对所述第一集合与所述第二集合进行复制操作，包括：
    将所述第一集合中的所述第一复数符号复制到所述第二集合中。
  7. 根据权利要求1至5中任一项所述的方法，其特征在于，对所述第一集合与所述第二集合进行复制操作，包括：
    将所述第二集合中的所述第一复数符号复制到所述第一集合中。
  8. 根据权利要求6所述的方法，其特征在于，所述第一发射符号为参考信号，所述第二发射符号为非参考信号。
  9. 根据权利要求7所述的方法，其特征在于，所述第一发射符号为非参考信号，所述第二发射符号为参考信号。
  10. 根据权利要求1至9中任一项所述的方法，其特征在于，所述方法还包括：
    基于经过所述信号处理之后的信号，生成所述第一发射符号与所述第二发射符号，
    其中，所述第一子集对应所述第一发射符号的第一符号分量，所述第二子集对应所述第二发射符号的第二符号分量，所述第一符号分量与所述第二符号分量相同。
  11. 一种符号处理的方法，其特征在于，包括：
    得到多个复数符号；
    将所述多个复数符号分为多个集合，所述多个集合中包括第一集合与第二集合，所述第一集合对应第一发射符号，所述第二集合对应第二发射符号，所述第一发射符号与所述第二发射符号时域连续，所述第一发射符号位于所述第二发射符号之前，所述第一集合中的第一子集中的复数符号与所述第二集合中的第二子集中的复数符号相同；
    对所述第一集合与第二集合进行信号处理，所述信号处理包括循环移位或频域加权，所述信号处理使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置，
    其中，所述第一参考点表示发射符号的结束位置，所述第二参考点表示发射符号的截取循环前缀的位置。
  12. 根据权利要求11所述的方法，其特征在于，所述第一发射符号与所述第二发射符号均为解调参考信号。
  13. 一种符号处理的装置，其特征在于，包括：
    获取单元，用于得到多个复数符号；
    分组单元，用于将所述多个复数符号分为多个集合，其中，每个集合对应一个发射符号，所述多个集合中包括对应于第一发射符号的第一集合以及对应于第二发射符号的第二集合，所述第一发射符号与所述第二发射符号时域连续，所述第一发射符号位于所述第二发射符号之前；
    复制单元，用于对所述第一集合与所述第二集合进行复制操作，使得所述第一集合与所述第二集合中均具有第一复数符号，其中，在所述第一集合中所述第一复数符号所构成的第一子集的起始位置的时域索引，与在所述第二集合中所述第一复数符号所构成的第二子集的起始位置的时域索引相同；
    信号处理单元，用于在所述复制操作之后，对所述第一集合与所述第二集合进行信号处理，所述信号处理包括循环移位或频域加权，所述信号处理使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置，
    其中，所述第一参考点表示发射符号的结束位置，所述第二参考点表示发射符号的截取循环前缀的位置。
  14. 根据权利要求13所述的装置，其特征在于，所述信号处理单元，用于：
    对所述第一集合与所述第二集合进行频域处理，获得所述第一集合对应的频域信号以及所述第二集合对应的频域信号；
    对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行快速傅里叶逆变换IFFT，获得所述第一集合对应的时域信号以及所述第二集合对应的时域信号；
    对所述第一集合对应的时域信号以及所述第二集合对应的时域信号进行循环移位，使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置。
  15. 根据权利要求13所述的装置，其特征在于，所述信号处理单元用于：
    对所述第一集合与所述第二集合进行离散傅里叶变换DFT，获得所述第一集合对应的频域信号以及所述第二集合对应的频域信号；
    对所述第一集合对应的频域信号以及所述第二集合对应的频域信号进行频域加权，使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置。
  16. 根据权利要求13至15中任一项所述的装置，其特征在于，所述第一子集的起始位置的时域索引与循环前缀的长度以及符号编号有关。
  17. 根据权利要求16所述的装置，其特征在于，所述第一子集的起始位置的时域索引i满足如下公式：
    i＝A+CL CP(l)
    其中，l表示所述第一集合的符号编号，A表示符号编号l为0的集合中参与复制操作的子集的时域索引，CL CP(l)表示符号编号为l的所述第一集合的等效累加CP长度。
  18. 根据权利要求13至17中任一项所述的装置，其特征在于，所述复制单元用于，将所述第一集合中的所述第一复数符号复制到所述第二集合中。
  19. 根据权利要求13至17中任一项所述的装置，其特征在于，所述复制单元用于，将所述第二集合中的所述第一复数符号复制到所述第一集合中。
  20. 根据权利要求18所述的装置，其特征在于，所述第一发射符号为参考信号，所述第二发射符号为非参考信号。
  21. 根据权利要求19所述的装置，其特征在于，所述第一发射符号为非参考信号，所述第二发射符号为参考信号。
  22. 根据权利要求13至21中任一项所述的装置，其特征在于，所述装置还包括：
    符号生成单元用于，基于经过所述信号处理之后的信号，生成所述第一发射符号与所述第二发射符号，
    其中，所述第一子集对应所述第一发射符号的第一符号分量，所述第二子集对应所述第二发射符号的第二符号分量，所述第一符号分量与所述第二符号分量相同。
  23. 一种符号处理的装置，其特征在于，包括：
    获取单元，用于得到多个复数符号；
    分组单元，用于将所述多个复数符号分为多个集合，所述多个集合中包括第一集合与第二集合，所述第一集合对应第一发射符号，所述第二集合对应第二发射符号，所述第一发射符号与所述第二发射符号时域连续，所述第一发射符号位于所述第二发射符号之前，所述第一集合中的第一子集中的复数符号与所述第二集合中的第二子集中的复数符号相同；
    信号处理单元，用于对所述第一集合与第二集合进行信号处理，所述信号处理包括循环移位或频域加权，所述信号处理使得所述第一子集的起始位置对应于所述第一发射符号的第一参考点之前的位置，且所述第一子集的结束位置对应于所述第一发射符号的第一参考点之后的位置，以及使得所述第二子集的起始位置对应于所述第二发射符号的第二参考点之前的位置，且所述第二子集的结束位置对应于所述第二发射符号的第二参考点之后的位置，
    其中，所述第一参考点表示发射符号的结束位置，所述第二参考点表示发射符号的截取循环前缀的位置。
  24. 根据权利要求23所述的装置，其特征在于，所述第一发射符号与所述第二发射符号均为解调参考信号。
  25. 一种通信装置，其特征在于，所述通信装置包括存储器和处理器，所述存储器用于存储指令，所述处理器用于执行所述存储器存储的指令，并且对所述存储器中存储的指令的执行使得所述处理器执行权利要求1至10中任一项所述的方法，或者，权利要求11或12所述的方法。
  26. 一种计算机可读存储介质，其特征在于，其上存储有计算机程序，所述计算机程序被计算机执行时使得所述计算机实现权利要求1至10中任一项所述的方法，或者，权利要求11或12所述的方法。
PCT/CN2020/095632 2019-07-02 2020-06-11 符号处理的方法与装置 WO2021000712A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20835506.5A EP3962009B1 (en) 2019-07-02 2020-06-11 Symbol processing method and device
US17/565,669 US11991112B2 (en) 2019-07-02 2021-12-30 Symbol processing method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910590953.0 2019-07-02
CN201910590953.0A CN112187690B (zh) 2019-07-02 2019-07-02 符号处理的方法与装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/565,669 Continuation US11991112B2 (en) 2019-07-02 2021-12-30 Symbol processing method and apparatus

Publications (1)

Publication Number Publication Date
WO2021000712A1 true WO2021000712A1 (zh) 2021-01-07

Family

ID=73914323

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/095632 WO2021000712A1 (zh) 2019-07-02 2020-06-11 符号处理的方法与装置

Country Status (4)

Country Link
US (1) US11991112B2 (zh)
EP (1) EP3962009B1 (zh)
CN (1) CN112187690B (zh)
WO (1) WO2021000712A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112187682B (zh) * 2019-07-02 2022-08-26 华为技术有限公司 符号处理的方法与装置
CN114422308B (zh) * 2022-03-14 2022-07-01 北京理工大学 无线信号传输方法、装置、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1476695A (zh) * 2000-09-22 2004-02-18 ����ɭ�绰�ɷ����޹�˾ 用于减轻ofdm系统中isi的循环延迟分集
CN101375571A (zh) * 2006-01-17 2009-02-25 高通股份有限公司 包括初始符号和扩展部分的多符号信号
WO2017031649A1 (zh) * 2015-08-21 2017-03-02 华为技术有限公司 发送、解调数据的方法、设备及系统
WO2018059330A1 (zh) * 2016-09-30 2018-04-05 华为技术有限公司 数据传输方法及通信设备

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1881968B (zh) * 2005-06-15 2011-07-27 华为技术有限公司 一种减小多径延迟干扰的数据传输方法
WO2008056901A1 (en) * 2006-11-10 2008-05-15 Electronics And Telecommunications Research Institute Transmitter for extending guard interval for individual user equipment in ofdma systems
ES2376606T3 (es) * 2008-06-13 2012-03-15 Telefonaktiebolaget L M Ericsson (Publ) Métodos y disposiciones en un sistema de comunicaciones inal�?mbricas para producir una estructura de señal con prefijo c�?clico.
JP5361082B2 (ja) * 2009-01-08 2013-12-04 シャープ株式会社 送信装置、受信装置、通信システム、送信方法および受信方法
WO2016029482A1 (zh) * 2014-08-30 2016-03-03 华为技术有限公司 一种发送数据的方法、信道估计方法及装置
US10009153B2 (en) * 2015-01-30 2018-06-26 Motorola Mobility Llc Apparatus and method for reception and transmission of control channels
WO2017200842A2 (en) * 2016-05-12 2017-11-23 Interdigital Patent Holdings, Inc. Method and apparatus for modulation of millimeter waves and preamble design
US10200994B2 (en) * 2016-05-20 2019-02-05 Qualcomm Incorporated Non-equal bit allocation for coexistence with scaled numerology systems
US10700910B2 (en) * 2017-06-16 2020-06-30 Qualcomm Incorporated Single carrier waveform data transmission and reception based on configurable DFT window

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1476695A (zh) * 2000-09-22 2004-02-18 ����ɭ�绰�ɷ����޹�˾ 用于减轻ofdm系统中isi的循环延迟分集
CN101375571A (zh) * 2006-01-17 2009-02-25 高通股份有限公司 包括初始符号和扩展部分的多符号信号
WO2017031649A1 (zh) * 2015-08-21 2017-03-02 华为技术有限公司 发送、解调数据的方法、设备及系统
WO2018059330A1 (zh) * 2016-09-30 2018-04-05 华为技术有限公司 数据传输方法及通信设备

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MITSUBISHI ELECTRIC: "Transmit diversity for DFTsOFDM-based PUCCH in long duration", 3GPP TSG-RAN WG1 #89, R1-1707804, 19 May 2017 (2017-05-19), XP051273005, DOI: 20200819081837A *
See also references of EP3962009A4

Also Published As

Publication number Publication date
EP3962009A1 (en) 2022-03-02
US11991112B2 (en) 2024-05-21
CN112187690A (zh) 2021-01-05
CN112187690B (zh) 2022-10-04
US20220123899A1 (en) 2022-04-21
EP3962009B1 (en) 2024-03-20
EP3962009A4 (en) 2022-07-13

Similar Documents

Publication Publication Date Title
CN115001923B (zh) 基于序列的信号处理方法及装置
WO2021008392A1 (zh) 符号处理的方法与装置
WO2017035808A1 (zh) 一种信号发送或接收方法和设备
CN108632193B (zh) 一种资源指示方法及网络设备、终端设备
WO2021081831A1 (zh) 符号处理的方法与装置
WO2021000712A1 (zh) 符号处理的方法与装置
WO2020211578A1 (zh) 参考信号发送方法和装置
WO2020199864A1 (zh) 数据压缩方法及装置
US10999108B2 (en) Wireless communication method, apparatus, and system
WO2019242738A1 (zh) 发送调制符号的方法、接收调制符号的方法和通信设备
WO2021000711A1 (zh) 符号处理的方法与装置
WO2020143780A1 (zh) 信号处理的方法和装置
CN110971554B (zh) 数据传输方法及装置
WO2020114317A1 (zh) 一种参考信号的传输方法及装置
WO2021134600A1 (zh) 信号传输的方法及装置
WO2021082008A1 (zh) 符号处理的方法与装置
WO2024094132A1 (zh) 一种通信的方法和通信装置
WO2023143159A1 (zh) 一种符号处理的方法与装置
WO2020063364A1 (zh) 一种数据传输方法及装置

Legal Events

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

Ref document number: 20835506

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020835506

Country of ref document: EP

Effective date: 20211124

NENP Non-entry into the national phase

Ref country code: DE