CN110417698B - Information processing method and device and computer readable storage medium - Google Patents
Information processing method and device and computer readable storage medium Download PDFInfo
- Publication number
- CN110417698B CN110417698B CN201810395932.9A CN201810395932A CN110417698B CN 110417698 B CN110417698 B CN 110417698B CN 201810395932 A CN201810395932 A CN 201810395932A CN 110417698 B CN110417698 B CN 110417698B
- Authority
- CN
- China
- Prior art keywords
- symbols
- spreading
- symbol
- sequence
- length
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000010365 information processing Effects 0.000 title claims abstract description 30
- 238000003672 processing method Methods 0.000 title claims abstract description 26
- 230000007480 spreading Effects 0.000 claims abstract description 211
- 238000000034 method Methods 0.000 claims description 43
- 125000004122 cyclic group Chemical group 0.000 claims description 12
- 230000005540 biological transmission Effects 0.000 claims description 10
- 238000010606 normalization Methods 0.000 claims description 8
- 238000013507 mapping Methods 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 7
- 239000011159 matrix material Substances 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000009466 transformation Effects 0.000 description 4
- 238000006243 chemical reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000010363 phase shift Effects 0.000 description 2
- 239000000969 carrier Substances 0.000 description 1
- 230000007274 generation of a signal involved in cell-cell signaling Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
-
- 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]
-
- 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
- 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/2634—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation
- H04L27/2636—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]
-
- 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
-
- 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/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Physics & Mathematics (AREA)
- Discrete Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
An information processing method and device and a computer readable storage medium are provided. The information processing method includes: and spreading a plurality of symbols by using a spreading sequence, wherein the lengths of the spreading sequences corresponding to two or more symbols are different. The information processing method provided by the application can be used for expanding the symbols by using the expansion sequences with different lengths, the number of the expanded symbols is more flexible, and the system requirements are met.
Description
Technical Field
The present invention relates to communications technologies, and in particular, to an information processing method and apparatus, and a computer-readable storage medium.
Background
The symbol spreading technology is to spread a symbol to be transmitted by using a spreading sequence (the symbol to be transmitted includes a digital amplitude-phase modulation symbol, a symbol generated after a series of processing is performed on the digital amplitude-phase modulation symbol, and a pilot symbol).
Specifically, a symbol s to be transmitted is spread by using a spreading sequence with a length L, that is, the symbol s is multiplied by each element in the spreading sequence to generate L symbols, for example, one of the L long spreading sequences is set as [ c 0 ,c 1 ,...c L-1 ]The symbol s is spread by the spreading sequence to generate L symbols [ s · c ] 0 ,s·c 1 ,...s·c L-1 ]. When a plurality of symbols to be transmitted exist, spreading sequences with the length of L are used for spreading. The scheme is beneficial to simplifying the expansion of the transmitting side and the de-expansion operation of the receiving side, but the flexibility is not enough, and the application scene is limited.
Disclosure of Invention
At least one embodiment of the invention provides an information processing method and device and a computer readable storage medium.
In order to achieve the object of the present invention, at least one embodiment of the present invention provides an information processing method, including:
and spreading a plurality of symbols by using a spreading sequence, wherein the lengths of the spreading sequences corresponding to two or more symbols are different.
At least one embodiment of the present invention provides an information processing apparatus including a memory and a processor, the memory storing a program that realizes the information processing method according to any one of the embodiments when the program is read and executed by the processor.
At least one embodiment of the present invention provides a computer-readable storage medium storing one or more programs, which are executable by one or more processors to implement the information processing method described in any one of the embodiments.
Compared with the related art, in at least one embodiment of the invention, when a plurality of symbols to be transmitted are spread by using the spreading sequences, at least 2 spreading sequences with different lengths are used for spreading, so that the requirement of a scene with a requirement on the number of the spread symbols is met.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the example serve to explain the principles of the invention and not to limit the invention.
FIG. 1 is a diagram illustrating multi-carrier OFDM modulation in the related art;
FIG. 2 is a diagram illustrating a frequency domain generation method of an SC-FDMA signal in the related art;
FIG. 3 is a diagram illustrating a time-domain generation method of an SC-FDMA signal in the related art;
FIG. 4 is a flowchart of an information processing method according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a multicarrier OFDM symbol extension according to an embodiment of the present invention;
FIG. 6 is a diagram illustrating DFT-S-OFDM symbol spreading according to another embodiment of the present invention;
fig. 7 is a diagram illustrating SC-FDMA symbol spreading according to an embodiment of the present invention;
FIG. 8 is a diagram illustrating symbol expansion according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of symbol expansion according to another embodiment of the present invention;
fig. 10 is a block diagram of an information processing apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features of the embodiments in the present application may be arbitrarily combined with each other without conflict.
The steps illustrated in the flow charts of the figures may be performed in a computer system such as a set of computer-executable instructions. Also, while a logical order is shown in the flow diagrams, in some cases, the steps shown or described may be performed in an order different than here.
The symbol spreading technique may be applied to CP (Cyclic Prefix) -OFDM (Orthogonal Frequency Division Multiplexing), and may also be applied to a low peak-to-average ratio SC-FDMA (Single-carrier Frequency-Division Multiple Access)/DFT-S-OFDM (Discrete Fourier Transform-Spread OFDM) transmission scheme with CP.
FIG. 1 is a diagram illustrating multi-carrier OFDM modulation in the related art, as shown in FIG. 1, a digital amplitude-phase modulation symbol d (xPSK/xQAM symbol, such as BP)SK (Binary Phase Shift Keying), QPSK (Quadrature Phase Shift Keying), 16QAM (Quadrature Amplitude Modulation), etc.) (which may sometimes be simply referred to as Modulation symbols) are first grouped, with M symbols per group, i.e., D [ [ D ] for Modulation symbols ] 0 ,d 1 ,...d M-1 ]And directly mapped to M subcarriers of one OFDM symbol. It can also be said that each Resource Element (RE) directly carries one digital amplitude modulation symbol, or the M digital amplitude modulation symbols are carried by one OFDM symbol (because there is M subcarriers for one OFDM symbol), or one OFDM symbol carries M digital amplitude modulation symbols. After that, an Inverse Fast Fourier Transform (IFFT) of N points is performed, a cyclic prefix is added, parallel-to-serial conversion is performed, and then transmission is performed by a transmission circuit. Here, a resource unit of an OFDM symbol is a subcarrier resource of an OFDM symbol, and since the subcarrier is in the frequency domain, one resource unit may also be referred to as a frequency domain resource unit. Furthermore, the definition of RE resource elements is also applicable to DFT-S-OFDM/SC-FDMA modulation, i.e. one subcarrier resource of one DFT-S-OFDM/SC-FDMA symbol. SC-FDMA modulation with single carrier is adopted as a carrier modulation method for uplink transmission by LTE (Long Term Evolution) standards because it can basically maintain the excellent properties of multicarrier OFDM and can have the advantages of Low Peak-to-Average Power Ratio (Low PAPR) of single carrier signals. The SC-FDMA signal generation method of single carrier can be divided into two methods:
1) a frequency domain generation method based on Discrete Fourier Transform (DFT) spreading, namely a DFT-S-OFDM method;
2) a direct time domain generation method.
Fig. 2 is a schematic diagram of a frequency domain generation method of an SC-FDMA signal in the related art. As shown in fig. 2, the frequency domain generation method of single-carrier SC-FDMA, i.e. DFT-S-OFDM modulation is the same as the multi-carrier OFDM method, and each DFT-S-OFDM symbol also carries M digital amplitude modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]. But unlike the multi-carrier OFDM approach, in DFT-S-OFDM modulation symbols, this is trueM digital amplitude modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]Is transmitted in the time domain rather than being carried directly on the REs in the frequency domain. Specifically, M REs of one DFT-S-OFDM symbol do not directly carry M digital amplitude-phase modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]Instead, the M digital amplitude modulation symbols D ═ D are carried 0 ,d 1 ,...d M-1 ]M symbols S ═ S generated after DFT conversion and spreading 0 ,s 1 ,...s M-1 ]. The relation of S and D may be expressed as S ═ DFT (D), where DFT () refers to a DFT spread transform function, or a DFT spread transform function or a DFT spread transform operation, and the precise operation rule of DFT transform may be expressed by matrix operation, and a specific matrix operation rule of a common M-point DFT transform operation S ═ DFT (D) is as follows:
i.e. S ═ QD
Wherein
Is the transform matrix of the M-point DFT transform. Q is an M matrix, i.e., a square matrix of M rows and M columns, with the row index from row 1 to row M and the column index from column 1 to column M, where the elements of row n +1 and column M +1 are
It can be seen that the DFT spread transform is a linear operation, i.e. each RE of a DFT-S-OFDM symbol carries a signal where the M digital amplitude modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]Linear combinations of (3).
M digital amplitude modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]After M-point DFT spreading, M symbols S ═ S are obtained 0 ,s 1 ,...s M-1 ]Mapping S to M sub-carriers, then carrying out N-point IFFT, adding cyclic prefix, carrying out parallel-to-serial conversion, and then transmitting through a transmitting circuit.
Fig. 3 is a diagram illustrating a time-domain generation method of an SC-FDMA signal in the related art. As shown in fig. 3, this approach has no DFT or IFFT operations, is simpler to implement, and is suitable for some scenarios requiring low implementation complexity. Unlike the multicarrier OFDM scheme, in SC-FDMA modulation, M number of digital amplitude-phase modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]Is transmitted directly in the time domain and is not carried directly on the RE. There are two implementations:
without block repetition, in particular, M digital amplitude modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]And after the user-specific frequency offset is carried out, adding a cyclic prefix, carrying out pulse filtering, and transmitting through a transmitting circuit. As shown in fig. 3 (a).
With block repetition, in particular, M digital amplitude modulation symbols D ═ D 0 ,d 1 ,...d M-1 ]After the repetition of the user-specific blocks, the user-specific frequency offset is performed, a cyclic prefix is added, pulse filtering is performed, and transmission is performed through a transmitting circuit. As shown in fig. 3 (b).
The time domain generation method of single-carrier SC-FDMA has no explicit DFT and IFFT time-frequency transformation, so symbols carried on frequency domain subcarriers or symbols carried on frequency domain RE are not explicitly generated in the generation process, but as long as one SC-FDMA symbol is converted into a frequency domain through discrete Fourier transform, or frequency domain symbols S ═ S on M subcarriers capable of generating the SC-FDMA symbol are generated 0 ,s 1 ,...s M-1 ]In (1). Therefore, it can be said that M frequency domain symbols S ═ S on M subcarriers are implicitly included in one SC-FDMA symbol generated by the SC-FDMA time domain generation method 0 ,s 1 ,...s M-1 ]Or implicitly includes M frequency domain symbols S ═ S carried on M frequency domain REs 0 ,s 1 ,...s M-1 ]And the M frequency domain symbols S ═ S 0 ,s 1 ,...s M-1 ]And M time domain numbersAmplitude-phase modulation symbol D ═ D 0 ,d 1 ,...d M-1 ]It can also be transformed by discrete fourier transform/inverse discrete fourier transform (DFT/IDFT), i.e. S ═ DFT (d). In contrast, the frequency domain generation method, namely DFT-S-OFDM modulation has explicit DFT and IFFT time-frequency transformation, and M frequency domain symbols S ═ S on M subcarriers are explicitly generated in the generation process 0 ,s 1 ,...s M-1 ]。
Therefore, it can also be said that M frequency domain symbols S ═ S carried on M frequency domain REs are implicitly contained in one SC-FDMA symbol generated by the SC-FDMA time domain generation method 0 ,s 1 ,...s M-1 ]Wherein the frequency domain symbol is M digital amplitude modulation symbols D ═ D of the time domain 0 ,d 1 ,...d M-1 ]Linear combinations of (3). The time domain generation method and the frequency domain generation method of SC-FDMA are equivalent.
In the related art, based on the symbol spreading technique, all symbols to be transmitted in one transmission are spread by using spreading sequences with the same length. Specifically, N symbols to be transmitted are transmitted at a time, and are spread by using a spreading sequence with a length of L, so that N × L spread symbols are finally generated. However, if the symbols available for one transmission are not N x L, the spreading technique cannot be applied. Therefore, in at least one embodiment of the present application, the symbols are spread using spreading sequences of 2 or more lengths. The application is further illustrated by the following specific examples.
Example one
An embodiment of the present invention provides an information processing method, as shown in fig. 4, including:
Wherein, the length of the spreading sequences corresponding to two or more symbols is different, which means that the symbols are spread by using spreading sequences with at least two lengths, for example, one part of the symbols is spread by using a spreading sequence with a length of L1, and the other part of the symbols is spread by using a spreading sequence with a length of L2. The specific values of the elements of the spreading sequence are not limited in this application.
The information processing method provided by this embodiment uses spreading sequences of different lengths to spread symbols, and the spreading manner is more flexible and meets the system requirements.
One of the expansion methods is, for example: a symbol s to be transmitted using a spreading sequence c of length L 0 ,c 1 ,...c L-1 ]In spreading, the symbol s is multiplied by each element in the spreading sequence to generate L symbols [ s · c ] 0 ,s·c 1 ,...s·c L-1 ]。
In one embodiment, the method further comprises determining the spreading sequence by one of:
determining index information, and selecting an extended sequence from a stored extended sequence list according to the index information; or determining index information, and generating the extended sequence according to the index information through a preset generation rule.
In an embodiment, the selecting the extended sequence from the stored extended sequence list according to the index information includes: and directly selecting the extended sequences from the extended sequence list according to the index information, or selecting the extended sequences from the extended sequences formed after energy normalization of the extended sequences in the extended sequence list according to the index information.
In one embodiment, the index information is determined according to one of the following ways: the method comprises the steps of determining according to system configuration information, determining according to indication information sent by a receiving end of a symbol, determining according to code word bits formed after information bits corresponding to the symbol are subjected to cyclic redundancy check coding, determining according to the number of symbols before extension and the number of symbols after extension, and randomly generating. Wherein the random generation randomly generates index information for a transmitting end of the symbol. The code word bits (CRC code word bits for short) formed by the information bits corresponding to the symbols after being subjected to cyclic redundancy check coding include the information bits corresponding to the symbols and check bits generated by the information bits after being subjected to cyclic redundancy check coding, and the spreading sequence is determined according to the code word bits formed by the information bits after being subjected to CRC coding, which is beneficial to a receiver of a non-scheduling access scheme to reconstruct decoded correct bits and eliminate the process.
Wherein the determining according to the number of symbols before the extension and the number of symbols after the extension includes: and acquiring a target value of the number of symbols (namely the number of the symbols after the spreading), and determining the length of the spreading sequence according to the target value of the number of symbols after the spreading so as to enable the number of the symbols after the spreading to be the target value of the number of symbols. For example, if the number of symbols to be spread is 2 and the target value of the number of symbols is 9, one spreading sequence with a length of 4 and one spreading sequence with a length of 5 may be selected, so that the number of symbols after spreading is 4+5 — 9, that is, the number of symbols after spreading is the target value of the number of symbols.
In an embodiment, the spreading the plurality of symbols to be transmitted by using a spreading sequence includes:
when the number of the symbols is 3, spreading one symbol by using a spreading sequence with the length of 4, and spreading the other two symbols by using a spreading sequence with the length of 3; alternatively, two of the symbols are spread using a length-4 spreading sequence and the other symbol is spread using a length-2 spreading sequence.
In an embodiment, the spreading the plurality of symbols to be transmitted by using a spreading sequence includes:
when the number of the plurality of symbols is 3, two symbols are spread by using a spreading sequence with the length of 4, and the other symbol is spread by using a spreading sequence with the length of 3.
In an embodiment, the method further comprises mapping the spread symbols onto the same subcarrier in a certain transmission time interval.
In an embodiment, the information processing method is applied to multicarrier OFDM or SC-FDMA or discrete fourier-spread orthogonal frequency division multiplexing. For example, when applied to multicarrier OFDM, the subcarriers may be performedBefore mapping, D ═ D 0 ,d 1 ,...d M-1 ]The expansion method provided by the embodiment is used for expansion. As another example, when applied to SC-FDMA, D ═ D 0 ,d 1 ,...d M-1 ]After spreading by using the spreading method provided in this embodiment, M-point DFT spreading is performed. Note that D is not limited to [ D ] 0 ,d 1 ,...d M-1 ]For spreading, other symbols in the procedure of multicarrier OFDM or SC-FDMA may also be spread using the information processing method provided in this embodiment. In addition, the information processing method provided by the embodiment is not limited to multicarrier OFDM or SC-FDMA, and can also be applied to other scenarios requiring symbol spreading.
Example two
In this embodiment, the number of symbols to be transmitted is 2, but the number of symbols after spreading is limited to 7, one of the symbols is spread by using a spreading sequence with a length of 3, the other symbol is spread by using a spreading sequence with a spreading length of 4, and the number of symbols obtained after spreading is 3+4 — 7.
EXAMPLE III
In this embodiment, the number of symbols to be transmitted is 2, but the number of symbols after spreading is limited to 5, one of the symbols is spread by using a spreading sequence with a length of 3, the other symbol is spread by using a spreading sequence with a spreading length of 2, and the number of symbols obtained after spreading is 3+2 — 5.
Example four
In this embodiment, the number of symbols to be transmitted is 3, but the number of symbols after spreading is limited to 10, two of the symbols are spread by using a spreading sequence with a length of 4, another symbol is spread by using a spreading sequence with a length of 2, and the number of symbols obtained after spreading is 4 × 2+2 — 10.
EXAMPLE five
In this embodiment, the number of symbols to be transmitted is 3, but the number of symbols after spreading is limited to 10, one of the symbols is spread by using a spreading sequence with a spreading length of 4, the other two symbols are spread by using a spreading sequence with a length of 3, and the number of symbols obtained after spreading is 4+3 × 2 — 10.
EXAMPLE six
In this embodiment, the number of symbols to be transmitted is 3, but the number of symbols after spreading is limited to 11, two of the symbols are spread by using a spreading sequence with a spreading length of 4, another symbol is spread by using a spreading sequence with a length of 3, and the number of symbols obtained after spreading is 4 × 2+3 — 11.
EXAMPLE seven
There are 14 OFDM symbols or 14 SC-FDMA/DFT-S-OFDM symbols for 1 TTI (Transmission Time Interval, length of 1ms) of the LTE/5G NR (new radio) system, of which 2 are Demodulation Reference signals (DMRSs). Some applications require more pilot symbols, e.g., supporting non-orthogonal multiple access with a larger number of users, and more demodulated pilot symbols, e.g., 4 demodulated pilot symbols. After the 4 demodulated pilot symbols are removed, 10 OFDM/SC-FDMA/DFT-S-OFDM symbols remain, that is, the number of the symbols after spreading in the scene needs to be 10. If the number of symbols before spreading is 3 and the symbols are spread by using spreading sequences of the same length, the number of symbols after spreading may not be 10, and thus the requirement may not be met, for example, if the information symbols are modulated by OFDM/SC-FDMA/DFT-S-OFDM to generate 3 OFDM/SC-FDMA/DFT-S-OFDM symbols, then spreading the 3 OFDM/SC-FDMA/DFT-S-OFDM symbols by applying the spreading technique is required, if a spreading sequence of length 3 is used, then spreading is performed to 3 × 3 — 9 OFDM/SC-FDMA/DFT-S-OFDM symbols instead of 10 symbols, if a spreading sequence of length 4 is used, spreading is performed to 3 × 4 — 12 symbols, more than 10 symbols, and therefore, if spreading is performed to 3 OFDM/SC-FDMA/DFT-S-OFDM symbols before spreading, and 10 OFDM/SC-FDMA/DFT-S-OFDM symbols after the spreading, the method can only be applied to the following steps: wherein two OFDM/SC-FDMA/DFT-S-OFDM symbols are spread using a spreading sequence of one spreading length and another OFDM/SC-FDMA/DFT-S-OFDM symbol is spread using a spreading sequence of another spreading length.
In addition, some applications require 3 demodulated pilot symbols. After the 3 demodulated pilot symbols are removed, 11 OFDM/SC-FDMA/DFT-S-OFDM symbols remain, i.e., the number of the symbols after spreading in the scene needs to be 11. If the number of symbols before spreading is 3 and the symbols are spread by using spreading sequences of the same length, the number of symbols after spreading may not be 11, and thus the requirement cannot be met, for example, if the information symbols are modulated by OFDM/SC-FDMA/DFT-S-OFDM to generate 3 OFDM/SC-FDMA/DFT-S-OFDM symbols, then spreading the 3 OFDM/SC-FDMA/DFT-S-OFDM symbols is required to apply the spreading technique, if a spreading sequence of length 3 is used, then spreading is performed to 3 × 3 — 9 OFDM/SC-FDMA/DFT-S-OFDM symbols instead of 11 symbols, if a spreading sequence of length 4 is used, spreading is performed to 3 × 4 — 12 symbols, more than 11 symbols, and therefore, if spreading is performed to 3 OFDM/SC-FDMA/DFT-S-OFDM symbols before spreading, and 11 OFDM/SC-FDMA/DFT-S-OFDM symbols after spreading, the present application can only be applied: wherein two OFDM/SC-FDMA/DFT-S-OFDM symbols are spread using a spreading sequence of one spreading length and another OFDM/SC-FDMA/DFT-S-OFDM symbol is spread using a spreading sequence of another spreading length.
A common symbol spreading technique may be one that spreads a symbol into multiple symbols, e.g., a spreading sequence [ c ] where the symbol s is L-long 0 ,c 1 ,...c L-1 ]Extended into L symbols s.c 0 ,s·c 1 ,...s·c L-1 ]. The symbol spreading technique is applied to OFDM/SC-FDMA/DFT-S-OFDM modulation, and may also be spreading by using one OFDM/SC-FDMA/DFT-S-OFDM symbol as a unit, specifically, spreading one OFDM/SC-FDMA/DFT-S-OFDM symbol into L OFDM/SC-FDMA/DFT-S-OFDM symbols through L long spreading sequences, where a specific spreading manner is shown in fig. 5 to 7.
The process of correspondingly expanding one OFDM symbol into several OFDM symbols is shown in fig. 5, where symbol expansion may expand a digital amplitude-phase modulation symbol before subcarrier mapping, or may expand a symbol after IFFT transformation, or may expand a symbol after CP addition.
The process of correspondingly expanding one DFT-S-OFDM symbol into several DFT-S-OFDM symbols is shown in fig. 6, where the symbol expansion may expand the digital amplitude-phase modulation symbol before DFT, or may expand the symbol after subcarrier mapping, or may expand the symbol after IFFT transformation, or may expand the symbol after CP addition.
The process of correspondingly expanding one SC-FDMA symbol into several SC-FDMA symbols is shown in fig. 7, and symbol expansion may expand a digital amplitude-phase modulation symbol before frequency shifting, or expand a symbol after CP addition.
Specifically, two of the OFDM/SC-FDMA/DFT-S-OFDM symbols are spread using a length-4 spreading sequence, to 2 × 4 ═ 8 OFDM/SC-FDMA/DFT-S-OFDM symbols, and the other OFDM/SC-FDMA/DFT-S-OFDM symbol is spread using a length-2 spreading sequence. Thus, the spreading is exactly 2 × 4+2 ═ 10 OFDM/SC-FDMA/DFT-S-OFDM symbols, which are mapped into one TTI. As shown in fig. 8.
Alternatively, two of the OFDM/SC-FDMA/DFT-S-OFDM symbols are spread with a spreading sequence of length 3 and the other OFDM/SC-FDMA/DFT-S-OFDM symbol is spread with a spreading sequence of length 4. Thus, the spreading is exactly 3 × 2+4 ═ 10 OFDM/SC-FDMA/DFT-S-OFDM symbols, which are mapped into one TTI. As shown in fig. 9.
Wherein two OFDM/SC-FDMA/DFT-S-OFDM symbols are spread with a length-4 spreading sequence to 2 × 4 ═ 8 OFDM/SC-FDMA/DFT-S-OFDM symbols, and another OFDM/SC-FDMA/DFT-S-OFDM symbol is spread with a length-3 spreading sequence. Thus, the spreading is exactly 2 × 4+3 ═ 11 OFDM/SC-FDMA/DFT-S-OFDM symbols, which are mapped into one TTI.
In order to implement the above-mentioned symbol spreading, it is necessary to generate spreading sequences of two lengths, and this process requires that both the receiving end and the transmitting end of the symbol include spreading sequence tables storing these spreading sequences, for example, the example shown in fig. 8 requires a spreading sequence of length 4 and a spreading sequence of length 2, both the receiving end and the transmitting end of the symbol include spreading sequence tables storing a spreading sequence of length 4 and a spreading sequence of length 2, and then obtain the required spreading sequence of length 4 and spreading sequence of length 2 from the sequence index table.
Specifically, the spreading sequence with length 4 may be all or part of the spreading sequences in table 1, or all or part of the sequences formed by energy normalization of the spreading sequences in the table; the sequence may be all or part of the spreading sequences in tables 2 and 3, or all or part of the sequences formed by energy normalization of the spreading sequences in tables 2 and 3. Wherein, taking the first spreading sequence in Table 1 as an example, energy normalization refers to 1 per element/2, (1/2) ^2+ (1/2) ^2+ (1/2) ^2+ (1/2) ^2 +. The remaining elements are similar.
TABLE 1 spreading sequences of length 4
Where i is an imaginary unit and i ═ sqrt (-1), sqrt () is a square root operation, and hereinafter i ═ sqrt (-1), which will not be described.
TABLE 2 spreading sequence of length 2 one
TABLE 3 spreading sequence two of Length 2
Specifically, both the receiving end and the transmitting end of the symbol may include an extended sequence table, which stores all or part of the sequences in table 4, and table 4 stores both the extended sequence with length 4 and the extended sequence with length 2. In some application scenarios, all or part of the sequences formed by respectively performing energy normalization on the spreading sequence with the length of 4 and the spreading sequence with the length of 2 in table 4 will be stored.
TABLE 4 contains both the length-4 spreading sequence and the length-2 spreading sequence
For example, the example shown in fig. 9 requires a spreading sequence with a length of 4 and a spreading sequence with a length of 3, both the receiving end and the transmitting end of the symbol need to include a spreading sequence table storing the spreading sequence with a length of 4 and the spreading sequence with a length of 3, and then obtain the required spreading sequence with a length of 4 and the spreading sequence with a length of 3 from the table according to the sequence index.
The specific length-4 spreading sequence may be all or part of the spreading sequences in table 1, or all or part of the sequences formed by the energy normalization of the spreading sequences in the table; the specific length-3 spreading sequence may be all or part of the spreading sequences in tables 5 to 8 below, or all or part of the sequences formed by energy normalization of the spreading sequences in tables 5 to 8 below.
TABLE 5 spreading sequence of length 3 one
TABLE 6 spreading sequence two of length 3
In table 6, w ═ exp (i × 2/3 × pi), and w2 ═ w ═ exp (i × 4/3 × pi).
TABLE 7 spreading sequence three of length 3
In table 7, a ═ 1+ sqrt (5))/2.
TABLE 8 spreading sequence four of length 3
Specifically, both the receiving end and the transmitting end of the symbol may include an extended sequence table, which stores all or part of the sequences in table 9, table 10, or table 11, and table 9, table 10, or table 11 simultaneously stores the extended sequence with length 4 and the extended sequence with length 3. In some application scenarios, all or part of the sequences formed by energy normalizing the length-4 spreading sequence and the length-3 spreading sequence in table 9 or table 10, respectively, may be stored.
TABLE 9 contains both the length-4 spreading sequence and the length-3 spreading sequence
Table 10, which contains both a length-4 spreading sequence and a length-3 spreading sequence.
In table 10, w is exp (i is 2/3), and w2 is exp (i is 4/3).
Table 11, which contains both the length-4 spreading sequence and the length-3 spreading sequence.
In table 11, a is (1+ sqrt (5))/2.
It should be noted that the values of the spreading sequences in the above table are only examples, and other values may be taken as needed.
Fig. 8 the extended sequences of two lengths as described in fig. 9 may obtain the index information of the extended sequence by one of the following ways: and determining the indication information of the receiving end of the symbol according to the bit formed after the Cyclic Redundancy Check (CRC) coding of the information bit and the number of the symbols before and after the extension through system configuration information.
And then obtaining the extended sequences with the two lengths from the stored extended sequence list according to the index information, or generating the extended sequences according to the index information and a preset generation rule. The preset generation rule is, for example, a formula, and the extended sequence is generated according to the formula, where the index information corresponds to the input parameter of the formula.
As shown in fig. 10, an embodiment of the present invention provides an information processing apparatus 100, including a memory 1010 and a processor 1020, where the memory 1010 stores a program, and when the program is read and executed by the processor 1020, the program performs the following operations:
and spreading a plurality of symbols by using a spreading sequence, wherein the lengths of the spreading sequences corresponding to two or more symbols are different.
In another embodiment, the program, when read and executed by the processor, further performs the information processing method according to any one of the embodiments.
An embodiment of the present invention provides a computer-readable storage medium storing one or more programs, which are executable by one or more processors to implement the information processing method according to any one of the embodiments.
The computer-readable storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Although the embodiments of the present invention have been described above, the above description is only for the convenience of understanding the present invention, and is not intended to limit the present invention. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (7)
1. An information processing method comprising:
spreading a plurality of symbols by using a spreading sequence, wherein the lengths of the spreading sequences corresponding to two or more symbols are different;
the method further includes determining the spreading sequence by one of:
determining index information, and selecting the extended sequence from a stored extended sequence list according to the index information; or,
determining index information, and generating the extended sequence according to the index information through a preset generation rule;
the index information is determined according to one of the following ways: determining according to the indication information sent by the receiving end of the symbol, determining according to the code word bit formed after the information bit corresponding to the symbol is subjected to cyclic redundancy check coding, determining according to the number of the symbols before expansion and the number of the symbols after expansion, and randomly generating; wherein the randomly generating randomly generates index information for a sending end of the symbol, codeword bits formed after cyclic redundancy check coding of information bits corresponding to the symbol include the information bits corresponding to the symbol and check bits generated by cyclic redundancy check coding of the information bits, and the determining according to the number of symbols before extension and the number of symbols after extension includes: acquiring a target value of the number of symbols, and determining the length of an extended sequence according to the target value of the number of symbols so that the number of the symbols after extension is the target value of the number of symbols;
the selecting the extended sequence from the stored extended sequence list according to the index information includes: and directly selecting the extended sequences from the extended sequence list according to the index information, or selecting the extended sequences from the extended sequences formed after energy normalization of the extended sequences in the extended sequence list according to the index information.
2. The information processing method of claim 1, wherein the spreading the plurality of symbols using the spreading sequence comprises:
when the number of the symbols is 3, spreading one symbol by using a spreading sequence with the length of 4, and spreading the other two symbols by using a spreading sequence with the length of 3; alternatively, two of the symbols are spread using a length-4 spreading sequence and the other symbol is spread using a length-2 spreading sequence.
3. The information processing method of claim 1, wherein the spreading the plurality of symbols using the spreading sequence comprises:
when the number of the plurality of symbols is 3, two symbols are spread by using a spreading sequence with the length of 4, and the other symbol is spread by using a spreading sequence with the length of 3.
4. The information processing method of claim 1, further comprising mapping the spread symbols onto the same subcarriers in a transmission time interval.
5. The information processing method according to any one of claims 1 to 4, wherein the information processing method is applied to multi-carrier orthogonal frequency division multiplexing or discrete Fourier spread orthogonal frequency division multiplexing or single carrier frequency division multiple access.
6. An information processing apparatus comprising a memory and a processor, the memory storing a program that, when read and executed by the processor, implements the information processing method according to any one of claims 1 to 5.
7. A computer-readable storage medium, characterized in that the computer-readable storage medium stores one or more programs which are executable by one or more processors to implement the information processing method according to any one of claims 1 to 5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810395932.9A CN110417698B (en) | 2018-04-27 | 2018-04-27 | Information processing method and device and computer readable storage medium |
| PCT/CN2019/083897 WO2019206144A1 (en) | 2018-04-27 | 2019-04-23 | Information processing method and device, and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810395932.9A CN110417698B (en) | 2018-04-27 | 2018-04-27 | Information processing method and device and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110417698A CN110417698A (en) | 2019-11-05 |
| CN110417698B true CN110417698B (en) | 2022-08-05 |
Family
ID=68294911
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810395932.9A Active CN110417698B (en) | 2018-04-27 | 2018-04-27 | Information processing method and device and computer readable storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110417698B (en) |
| WO (1) | WO2019206144A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024124573A1 (en) * | 2022-12-16 | 2024-06-20 | 华为技术有限公司 | Sequence transmission method and apparatus |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009022293A2 (en) * | 2007-08-14 | 2009-02-19 | Nokia Corporation | Variable transmission structure for reference signals in uplink messages |
| CN102916783A (en) * | 2011-08-02 | 2013-02-06 | 华为技术有限公司 | Method for transmitting, receiving and processing information, base station and user equipment |
| CN103312438A (en) * | 2012-03-12 | 2013-09-18 | 中兴通讯股份有限公司 | Method and device for uplink information transmitting |
| CN105493426A (en) * | 2013-08-30 | 2016-04-13 | 高通股份有限公司 | Resource mapping to handle bursty interference |
-
2018
- 2018-04-27 CN CN201810395932.9A patent/CN110417698B/en active Active
-
2019
- 2019-04-23 WO PCT/CN2019/083897 patent/WO2019206144A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009022293A2 (en) * | 2007-08-14 | 2009-02-19 | Nokia Corporation | Variable transmission structure for reference signals in uplink messages |
| CN102916783A (en) * | 2011-08-02 | 2013-02-06 | 华为技术有限公司 | Method for transmitting, receiving and processing information, base station and user equipment |
| CN103312438A (en) * | 2012-03-12 | 2013-09-18 | 中兴通讯股份有限公司 | Method and device for uplink information transmitting |
| CN105493426A (en) * | 2013-08-30 | 2016-04-13 | 高通股份有限公司 | Resource mapping to handle bursty interference |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019206144A1 (en) | 2019-10-31 |
| CN110417698A (en) | 2019-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5890391B2 (en) | Method and apparatus for transmitting control information in wireless communication system | |
| JP5789616B2 (en) | Method and apparatus for transmitting control information in wireless communication system | |
| US9942011B2 (en) | Wireless communication apparatus and the method thereof | |
| JP5782052B2 (en) | Method and apparatus for transmitting control information in wireless communication system | |
| JP5973353B2 (en) | Method and apparatus for transmitting control information in wireless communication system | |
| US11177992B2 (en) | Sequence-based signal processing method and signal processing apparatus | |
| CN111431686B (en) | Signal processing method and device | |
| KR20200035455A (en) | Sequence-based signal processing method and apparatus | |
| WO2020143591A1 (en) | Method for transmitting demodulation reference signal, terminal device, and network device | |
| CN111510412A (en) | Data modulation method, device and equipment | |
| CN110417698B (en) | Information processing method and device and computer readable storage medium | |
| KR20230035053A (en) | Data modulation method, communication device and storage medium | |
| US20120051317A1 (en) | Method and apparatus for transmitting uplink data and control information in a wireless mobile communication system that supports mimo antennas | |
| CN111431829B (en) | Sequence-based signal processing method and device | |
| CN115378771A (en) | Data transmission method and device, electronic equipment and storage medium | |
| WO2018072565A1 (en) | Data modulation method and device utilized in multi-carrier system | |
| CN113765635B (en) | Data transformation preprocessing method and device and network equipment | |
| KR102567079B1 (en) | Symbol Aggregation Method for DFT-S-OFDM | |
| CN110535594B (en) | Pilot sequence configuration method and device, electronic equipment and storage medium | |
| KR20220154581A (en) | Spectrum shaping method for generating almost constant envelope signal in communication system and transmitter for performing the same | |
| CN117176535A (en) | Signal generation method, device, storage medium and computer equipment | |
| CN114070529A (en) | Transmission method, terminal, network device and storage medium of uplink control information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |