First communication device for DFT precoded OFDM with orthogonal spreading sequences

By designing reasonable DFT and spread-spectrum sequence input mapping at the DFT precoder input, the problem of high signal CM in PRB interleaved transmission of the DFT precoder system is solved, and signal transmission with low power dynamics and high spectral efficiency is achieved.

CN114450902BActive Publication Date: 2024-11-29HUAWEI TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN201980100906.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-10-02
Publication Date
2024-11-29
Estimated Expiration
2039-10-02

AI Technical Summary

Technical Problem

In the case of PRB interleaved transmission, the DFT precoding OFDM system is difficult to ensure that the traditional technical solution generates low cubic metric (CM) signals, resulting in a large power dynamic of the transmitted signal and a small coverage range.

Method used

By rationally designing the input map of DFT and spread sequences at the DFT preencoder input, ensure that the elements in each block are multiplied by different elements in the spread sequence and associate multiple orthogonal spread sequences to different block to reduce the composite spread spectrum sequence CM.

Benefits of technology

It is realized that under the case of PRB interleaved transmission, the low power dynamics of the transmitted signal are maintained, the spectrum efficiency is improved, and the CM of the signal is reduced.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114450902B_ABST
    Figure CN114450902B_ABST
Patent Text Reader

Abstract

The present disclosure relates to a first communication device for DFT precoded OFDM with orthogonal spreading sequences. The first communication device (100) obtains M modulation symbols and one or more spreading sequences, wherein the length of each spreading sequence is N SF . Obtain M·N according to the M modulation symbols SF elements, where the M·N SF The elements are arranged into M blocks, each block contains N SF elements. A discrete Fourier transform (DFT) precoder input (122) is obtained, wherein the DFT precoder input (122) is obtained by multiplying each element in each block with an element in the one or more spreading sequences, at least two elements of the one or more spreading sequences are different in at least one block. Finally, the DFT precoder input (122) is provided to a DFT precoder (130). Therefore, the spreading factor N can be increased. SF , while maintaining low power dynamics of the transmitted signal. In addition, the present disclosure also relates to a corresponding second communication device, a corresponding method and a computer program.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to a first communication device for DFT precoded OFDM with orthogonal spreading sequences. In addition, the present application also relates to a corresponding second communication device, a corresponding method and a computer program.

[0002] Abbreviations and Definitions

[0003] At least the following abbreviations and terms are used in this disclosure:

[0004] 3GPP Third Generation Partnership Project

[0005] B-IFDMA Block IFDMA

[0006] CM cubic metric

[0007] DFT discrete Fourier transform

[0008] LTE Long Term Evolution

[0009] FDM frequency division multiplexing

[0010] gNB NR NodeB

[0011] IDFT inverse DFT (inverse DFT)

[0012] IFDMA interleaved frequency division multiple access (interleaved FDM access)

[0013] NR New Radio

[0014] OCB Occupied channel bandwidth

[0015] OCC Orthogonal Cover Code

[0016] OFDM Orthogonal FDM

[0017] PAPR peak-to-average-power ratio

[0018] PRB physical resource block

[0019] PSD power spectral density

[0020] PUCCH physical uplink control channel

[0021] RRC Radio Resource Control

[0022] UE User equipment (UE).

[0023] symbol

[0024] At least the following symbols are used in this disclosure:

[0025] M is the number of modulation symbols.

[0026] N PRB Number of PRBs

[0027] Number of subcarriers per PRB

[0028] N SF Spreading Factor

[0029] w Spread spectrum sequence

[0030] v Composite Spread Spectrum Sequence

[0031] v Signal voltage

[0032] DFT output symbol

[0033] d k Modulation Symbol

[0034] DFT input symbol. Background Art

[0035] Transmissions in unlicensed spectrum may be constrained by a minimum occupied channel bandwidth (OCB) requirement and additionally by a maximum power spectral density (PSD) requirement. Therefore, in order to occupy sufficient bandwidth and allow for maximum transmit power, it is advantageous to transmit over a large bandwidth. Considering Orthogonal Frequency Division Multiplexing (OFDM) transmission, one approach is to use every nth physical resource block (PRB) known in the literature to generate a Block Interleaved Frequency Division Multiple Access (B-IFDMA) waveform. The concept of interlace is sometimes used to represent the allocation of every nth PRB. A PRB consists of multiple (e.g., 12) consecutive subcarriers.

[0036] For standalone unlicensed operation, i.e., when operating without the assistance of a licensed carrier, the Physical Uplink Control Channel (PUCCH) needs to be transmitted in the unlicensed spectrum. 3GPP New Radio (NR) Release 15 supports several PUCCH formats, each with its own characteristics, but none of them is suitable for PRB interleaved transmission. One possibility is to enhance NR PUCCH formats 3 and 4 to PRB interleaved transmission, as these formats enable large payload and user equipment (UE) multiplexing, respectively.

[0037] NR PUCCH format 3 is transmitted on 1 to 16 consecutive PRBs depending on the payload, does not support UE multiplexing, and uses a discrete Fourier transform (DFT) precoder. NR PUCCH format 4 is transmitted on only 1 PRB (i.e., Subcarriers), but supports orthogonal cover code (OCC) (i.e., orthogonal spreading sequence) before the DFT precoder for multiplexing UEs. The purpose of the DFT precoder is to reduce the power dynamics of the generated signal, usually measured by its cubic metric (CM) or peak-to-average power ratio (PAPR). For PUCCH format 4, the spreading factor N is supported. SF =1, 2 and 4, OCC consists of DFT sequence.

[0038] The key performance metric related to the required transmitter power back-off is CM, defined as:

[0039]

[0040] Where, v is the normalized voltage of the signal, v ref is the normalized voltage of the reference signal, and “rms” means root mean square. Therefore, CM is determined based on the overall distribution of the signal voltage. In the prior art, the literature includes many methods for reducing the PAPR of multicarrier signals, a measure that depends on the peak power of the signal, not on the distribution of the signal power. Therefore, although its nonlinear behavior significantly reduces CM, the methods developed to reduce PAPR do not necessarily bring the same gain for CM, which is usually more commonly used in practice. In particular, transmissions on non-adjacent PRBs tend to drastically reduce CM.

[0041] Consider a DFT precoded OFDM system that utilizes OCC before the DFT precoder. SF >1, Collection Each data modulation symbol in will be spread so that it is repeated N times. SF The DFT precoder output is mapped to the input of the Inverse DFT (IDFT) to generate an OFDM signal.

[0042] When mapped to the input of the inverse IDFT, even if a DFT precoder is applied, repeated data symbols may cause the signal after the IDFT to have a large number of subcarriers, resulting in large variations in the power of the transmitted signal. Large power variations in the signal may mean that the transmitter must apply transmit power back-off, resulting in a smaller signal coverage area.

[0043] Since the DFT output is mapped to non-contiguous PRBs at the IDFT in the case of PRB interleaved transmission, the resulting signal is no longer a single carrier waveform (this is the case of DFT precoded OFDM on continuous PRBs, for example, NR PUCCH formats 3 and 4). Therefore, when non-contiguous PRB allocation is applied, the traditional technical scheme cannot be guaranteed to produce a low CM signal. The input mapping of the IDFT is controlled by the interleaving structure and usually does not change. However, the input mapping of the DFT precoder can be optimized with respect to the CM. Therefore, the input mapping of the DFT and spreading sequence needs to be reasonably designed.

[0044] In addition, when PRB interleaving is used for transmission, the resource overhead is increased due to the interleaving. For example, if each interleaving includes 10 PRBs, then the transmission will use at least 10 PRBs regardless of the data payload. In order to improve the spectral efficiency, a larger N is envisioned. SFHowever, this will further increase the number of repeated data symbols and may increase the power dynamics of the signal. Therefore, it is also desirable to provide low CM for larger spreading factors.

[0045] The traditional technical solution for DFT-spread PUCCH for interleaved transmission is to use NR PUCCH formats 3 and 4 are extended with a DFT size of 0.1. The DFT output is mapped to the interleaved PRBs allocated at the IDFT input.

[0046] Another conventional technical solution is limited to assuming mapping (1) and continuous PRBs, i.e., no interleaved transmission, and enhancing N PRB =1 and is designed for PUCCH format 3 for OCC with low PAPR but not low CM. Summary of the invention

[0047] The purpose of the embodiments of the present disclosure is to provide a technical solution that reduces or solves the shortcomings and problems of traditional technical solutions.

[0048] The above and other objects are achieved by the subject-matter of the independent claims. Further advantageous embodiments of the disclosure can be found in the dependent claims.

[0049] According to a first aspect of the present disclosure, the above and other objects are achieved by a first communication device used in a wireless communication system, wherein the first communication device is configured to:

[0050] Obtain M modulation symbols, where M is a positive integer;

[0051] Obtain one or more spreading sequences, where the length of each spreading sequence is N SF , N SF is a positive integer;

[0052] Obtain M·N according to the M modulation symbols SF elements, where the M·N SF The elements are arranged into M blocks, each block contains N SF elements;

[0053] Obtaining a discrete Fourier transform (DFT) precoder input, wherein the DFT precoder input is obtained by multiplying each element in each block with an element in the one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block;

[0054] The DFT precoder input is provided to a DFT precoder.

[0055] The advantage of the first communication device according to the first aspect is that the spreading factor N can be increased. SF , while maintaining low power dynamics of the transmitted signal.

[0056] In an implementation manner of the first communication device according to the first aspect, there is at least one block, wherein the elements in the block are obtained by SF The elements in the spreading sequence are multiplied by the same modulation symbol.

[0057] The advantage of this implementation is that PRB interleaved transmission has low CM.

[0058] In an implementation manner of the first communication device according to the first aspect, the first communication device is configured to:

[0059] At least one block is arranged to include less than M modulation symbols.

[0060] The advantage of this implementation is that PRB interleaved transmission has low CM.

[0061] In an implementation manner of the first communication device according to the first aspect, the first communication device is configured to:

[0062] The elements in each block are multiplied by different elements in the one or more spreading sequences.

[0063] The advantage of this implementation is that PRB interleaved transmission has low CM.

[0064] In an implementation manner of the first communication device according to the first aspect, the one or more lengths N are obtained. SF The spreading sequences include:

[0065] Get the length N SF a single spreading sequence; and the first communication device is further configured to:

[0066] Combine each element in at least one block with the length N SF Multiply one or more elements of a single spreading sequence.

[0067] The advantage of this implementation is that PRB interleaved transmission has low CM.

[0068] In an implementation manner of the first communication device according to the first aspect, the DFT precoder input is composed of M·N SF elements are given, and these elements are arranged as follows:

[0069]

[0070] in, Represents the element in the i-th spreading sequence represents the M modulation symbols.

[0071] The advantage of this implementation is that PRB interleaved transmission has low CM.

[0072] In an implementation manner of the first communication device according to the first aspect, the first communication device is configured to:

[0073] Get m orthogonal spread spectrum sequences, where the length of each spread spectrum sequence is N SF , 1<m≤M;

[0074] Associating the m orthogonal spreading sequences to different blocks; and

[0075] Multiply each element in each block by the element in its associated spreading sequence.

[0076] The advantage of this implementation is that different orthogonal sequences can be applied to different blocks, thereby reducing the use of complex spreading sequences composed of elements with the same value, which results in similar CMs for all spreading sequences.

[0077] According to an implementation of the first communication device described in the first aspect, the m orthogonal spread spectrum sequences have a length of M·N SF The composite spreading sequence is arranged to have N SF orthogonal composite spreading sequences.

[0078] The advantage of this implementation is that different users (eg, UEs) can be SF orthogonally multiplexed on symbol blocks.

[0079] In an implementation manner of the first communication device according to the first aspect, the m orthogonal spread spectrum sequences are determined by a predefined rule.

[0080] The advantage of this implementation is that no additional signaling may be provided to the second communication device in order to determine the composite spreading sequence.

[0081] In an implementation manner of the first communication device according to the first aspect, the one or more spreading sequences are any spreading sequence in the group consisting of:

[0082] DFT sequence set;

[0083] The set of cyclically shifted Zadoff-Chu sequences;

[0084] Hadamard sequence set;

[0085] The Slepian sequence set; and

[0086] The set of orthogonal sequences does not include sequences whose elements are all identical.

[0087] The advantage of this implementation is that it can achieve orthogonal multiplexing while producing low power dynamics of the transmitted signal.

[0088] In an implementation manner of the first communication device according to the first aspect, the first communication device is configured to:

[0089] Mapping the DFT precoder output to the input of the inverse discrete Fourier transform (IDFT);

[0090] Obtaining a signal for transmission according to an output of IDFT;

[0091] The signal is transmitted to a second communication device.

[0092] The advantage of this implementation is a signal with low power dynamics.

[0093] In an implementation manner of the first communication device according to the first aspect, mapping the DFT precoder output to the IDFT input includes:

[0094] The DFT precoder output is mapped to a set of non-contiguous resource blocks.

[0095] The advantage of this implementation is a signal with low power dynamics while making it possible to use PRB interleaving transmission.

[0096] In an implementation manner of the first communication device according to the first aspect, the first communication device is configured to provide an index of the one or more spreading sequences in at least one of the following:

[0097] Radio resource control signaling;

[0098] Uplink control channel;

[0099] Downlink control channel;

[0100] Media access control signaling; and

[0101] Allocation of time-frequency resources for transmitting the signal.

[0102] An advantage of this implementation is that the second communication device (receiver) can unambiguously determine the spreading sequence used by the first communication device (transmitter).

[0103] In an implementation manner of the first communication device according to the first aspect, the M modulation symbols are associated with any one of the following items:

[0104] Uplink control information;

[0105] Downlink control information;

[0106] Uplink data information; or

[0107] Downlink data information.

[0108] The advantage of this implementation is that a signal with low power dynamics can be provided for any link direction (uplink / downlink) and any type of transmission information.

[0109] According to a second aspect of the present disclosure, the above and other objects are achieved by a second communication device used in a wireless communication system, wherein the second communication device is configured to:

[0110] receiving a signal from a first communication device;

[0111] Obtain one or more spreading sequences, where the length of each spreading sequence is N SF , N SF is a positive integer;

[0112] According to the received signal, M blocks are obtained, where M is a positive integer, M·N SF The elements are arranged in the M blocks, each block including N SF elements;

[0113] despreading the symbols in each block by multiplying each symbol by an element of the one or more spreading sequences and summing the despread symbols corresponding to the same modulation symbol, wherein at least two elements of the one or more spreading sequences are different in at least one block; and

[0114] The summed despread symbols are demodulated and decoded.

[0115] The second communication device according to the second aspect is advantageous in that, in order to separate the multiplexed data from different first communication devices, spectrum spreading is performed.

[0116] According to a third aspect of the present disclosure, the above and other objects are achieved by a method for a first communication device, the method comprising:

[0117] Obtain M modulation symbols, where M is a positive integer;

[0118] Obtain one or more spreading sequences, where the length of each spreading sequence is N SF , N SF is a positive integer;

[0119] Obtain M·N according to the M modulation symbols SF elements, where the M·N SF The elements are arranged into M blocks, each block contains N SF elements;

[0120] Obtaining a DFT precoder input, wherein the DFT precoder input is obtained by multiplying each element in each block with an element in the one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block; and

[0121] The DFT precoder input is provided to a DFT precoder.

[0122] The method according to the third aspect can be extended to an implementation manner corresponding to the implementation manner of the first communication device according to the first aspect. Therefore, the implementation manner of the method includes the features of the corresponding implementation manner of the first communication device.

[0123] The advantages of the method according to the third aspect are the same as the advantages of the corresponding implementation of the first communication device according to the first aspect.

[0124] According to a fourth aspect of the present disclosure, the above and other objects are achieved by a method for a second communication device, the method comprising:

[0125] receiving a signal from a first communication device;

[0126] Obtain one or more spreading sequences, where the length of each spreading sequence is N SF , N SF is a positive integer;

[0127] Obtain N blocks according to the received signal, where N is a positive integer, M·N SF The elements are arranged in the N blocks, each block including N SF elements;

[0128] despreading the symbols in each block by multiplying each symbol by an element of the one or more spreading sequences and summing the despread symbols corresponding to the same modulation symbol, wherein at least two elements of the one or more spreading sequences are different in at least one block; and

[0129] The summed despread symbols are demodulated and decoded.

[0130] The method according to the fourth aspect can be extended to an implementation corresponding to the implementation of the second communication device according to the second aspect. Therefore, the implementation of the method includes the features of the corresponding implementation of the second communication device.

[0131] The advantages of the method according to the fourth aspect are the same as the advantages of the corresponding implementation of the second communication device according to the second aspect.

[0132] The present disclosure also relates to a computer program, wherein the program code, when executed by at least one processor, causes the at least one processor to perform any method according to the embodiments of the present disclosure. In addition, the present disclosure also relates to a computer program product, comprising a computer-readable medium and the computer program, wherein the computer program is included in the computer-readable medium and comprises one or more of the following groups: ROM (read-only memory), PROM (programmable ROM), EPROM (erasable PROM), flash memory, EEPROM (electrical EPROM) and hard disk drive.

[0133] Other applications and advantages of the disclosed embodiments will become apparent from the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0134] The accompanying drawings are intended to illustrate and explain different embodiments of the present disclosure, in which:

[0135] Figure 1 A block diagram showing an example of DFT precoded OFDM with a time domain spreading sequence;

[0136] Figure 2 A block diagram of a first communication device provided by an embodiment of the present disclosure is shown;

[0137] Figure 3 A first communication device implemented and / or integrated in a network access node provided by an embodiment of the present disclosure is shown;

[0138] Figure 4 A flowchart of a method for a first communication device provided by an embodiment of the present disclosure is shown;

[0139] Figure 5 A block diagram of a second communication device provided by an embodiment of the present disclosure is shown;

[0140] Figure 6 A receiving device implemented and / or integrated in a client device provided by an embodiment of the present disclosure is shown;

[0141] Figure 7 A flowchart of a method for a second communication device provided by an embodiment of the present disclosure is shown;

[0142] Figure 8 A wireless communication system provided by an embodiment of the present disclosure is shown;

[0143] Fig. 9 The absolute value of the window function of the embodiment of the present disclosure is shown;

[0144] Figures 10a to 10c shows the cubic metric performance results of the disclosed embodiment;

[0145] Fig.11 The absolute value of the window function of the embodiment of the present disclosure is shown;

[0146] Figures 12a to 12c shows the cubic metric performance results of the disclosed embodiment;

[0147] Fig.13 The absolute value of the window function of the embodiment of the present disclosure is shown;

[0148] Fig.14a and Fig.14b shows the cubic metric performance results of the disclosed embodiment;

[0149] Fig.15 The subcarrier mapping of the DFT precoder output provided by the embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0150] Now refer to Figure 1 An example of a conventional technical solution for DFT precoded OFDM with OCC is described to provide an understanding of some of the analysis behind the conclusions drawn for the embodiments of the present disclosure. In this regard, reference is made to Figure 1 In step I, consider modulation symbols, These symbols are arranged at the input of the DFT precoder (step II) and multiplied by the spreading sequence (i.e., OCC). That is, applying the spreading factor N SF , where N SF is an integer, specifically N SF > 1. The modulation symbol can be taken from any well-known modulation format (for example, pi / 2-BPSK, QPSK, 16-QAM, etc.), and carries uplink control information bits that have been encoded by polar code or Reed-Muller code, etc.

[0151] In NR PUCCH format 4, the 12-point DFT output is mapped to 1 PRB at the N-point Inverse DFT (IDFT) input in step III, its output is processed from parallel to serial in step IV, and then a cyclic prefix (CP) is inserted in step V. The size N of the IDFT is related to the system bandwidth, each input element represents a transmission on a subcarrier, and zeros are inserted on unallocated subcarriers.

[0152] As an enhancement to NR PUCCH formats 3 and 4, it has been proposed to generate modulation symbols, where N PRB is the number of interleaved PRBs, for example, 10. The spreading factor is restricted to integer values ​​of N. The input of the point DFT precoder can be expressed as M·N SF elements, arranged as follows:

[0153]

[0154] in, is the number of elements in (1), and the i-th OCC is given by Given. Sequence w (i) ,i=0,1,…,N SF -1 includes orthogonal sets. The length L may be further constrained by implementation requirements of the DFT size so that it must be a multiple of these factors, e.g., 2, 3, 5, etc.

[0155] The DFT precoder The output values ​​are mapped to the subcarriers in the interleaved PRB at the IDFT input. It should be noted that according to (1), the symbols are mapped to the positions of the DFT precoder input as follows: Each element in the spread sequence In N SF Repeated at consecutive positions; each data symbol d k is regularly mapped to every Mth position.

[0156] A further feature of (1) is that the input of the DFT precoder is divided into N SF There are M blocks of size M, where each block contains M different modulation symbols. For example, the first block is

[0157] First, consider the output of the DFT precoder (which will then be mapped to the input of the IDFT) when the input to the DFT precoder is given by (1). After some algebra, using L = MN SF , obtained by:

[0158]

[0159] Where n = 0, 1, ..., L-1, and

[0160] In (2), the first sum is independent of k and can therefore be obtained from the coefficients at the IDFT input is considered a window function. Then, use but

[0161]

[0162] Therefore, using L = MN SF ,get:

[0163]

[0164] From (3), we can observe two properties: the L-point DFT of (2) is reduced to an M-point DFT; the output of the DFT assumes that every Nth SF The second property produces a comb transmission due to the use of a DFT sequence as an OCC, which is called Interleaved Frequency Division Multiple Access (IFDMA). As can be seen from (3), different OCCs (i.e., index i) produce different comb transmissions. As shown in (3), the implementation can also avoid using OCCs by only calculating the M-point DFT and mapping its output to every N-th SF Therefore, due to the existence of N SF transmission comb teeth, that is, using each N SF subcarriers, and the UE multiplexing in the frequency domain is orthogonalized by FDM.

[0165] Figure 2 The first communication device 100 is a block diagram of a first communication device 100 according to an embodiment of the present disclosure. The first communication device 100 includes a first processing block 110 , a second processing block 120 and a DFT precoder block 130 .

[0166] The first processing block 110 is used to obtain a modulation symbol (modulation symbol, MS) and one or more spreading sequences (spreading sequence, SS). In other words, the first communication device 100 is used to obtain M modulation symbols, where M is a positive integer; and to obtain one or more spreading sequences, where the length of each spreading sequence is N. SF , N SF is a positive integer, especially N SF > 1. The first processing block 110 outputs M modulation symbols and one or more spreading sequences to the second processing block 120.

[0167] The second processing block 120 is configured to receive the output 112 from the first processing block 110 and obtain M·N according to the M modulation symbols. SF elements, among which M·N SF The elements are arranged into M blocks, each block contains N SF elements.

[0168] An element represents a symbol having a value, which may be a complex value. Examples of an element are an element in a spreading sequence, an element in a modulation symbol, or an element obtained by multiplying an element in a spreading sequence and a modulation symbol.

[0169] The second processing block 120 is further configured to obtain a DFT precoder input 122, wherein the DFT precoder input 122 is obtained by multiplying each element in each block with an element in one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block. The second processing block 120 provides the DFT precoder input 122 to an input of the DFT precoder block 130.

[0170] The DFT precoder block 130 is used to obtain the DFT precoder input 122 and output a transform of the time domain input to a frequency domain output.

[0171] In an embodiment of the present disclosure, the first communication device 100 further includes a mapping block 140 , which is used to obtain a DFT output 132 from the DFT precoder block 130 and map the DFT precoder output 132 to an input of the IDFT block 150 .

[0172] In an embodiment, mapping the DFT precoder output 132 to the input of the IDFT 150 includes mapping the DFT precoder output 132 to a set of non-contiguous resource blocks. SF The output symbols are mapped to the N interleaved at the input of IDFT block 150 PRB PRBs.

[0173] Fig.15 shows N from the DFT precoder block 130 PRB = Two non-limiting examples of mappings of 10 blocks, each of which will The symbols include N interleaved at the IDFT input PRB PRBs. Mapping can be performed from top to bottom, such as Fig.15 The mapping can also be performed from bottom to top, as shown in the left figure of Fig.15 As shown in the right figure.

[0174] The IDFT block 150 is used to obtain the mapping 142 from the mapping block 140 and output a transformation of the frequency domain input to the time domain output.

[0175] Finally, further processing is performed to obtain a radio frequency (RF) signal 510 for transmission based on the output of the IDFT 150. Non-limiting examples of such processing are parallel-to-serial mapping, CP insertion, transmit filtering, antenna processing (including mapping data to layers and antenna ports), and up-conversion to the RF domain. The first communication device 100 transmits a signal 510 to the second communication device 300, such as Figure 8 shown.

[0176] In one possible embodiment, there is at least one block, where the elements in the block are obtained by replacing a block with a length of N SF The elements of the spreading sequence are multiplied by the same modulation symbol. For example, a block can be represented as Among them, the modulation symbol is d0 and the spreading sequence is

[0177] In one possible embodiment, the first communication device 100 may be configured to arrange at least one block to include less than M modulation symbols. For example, a block with 1 modulation symbol may be represented as Therefore, the modulation symbol d0 is included. Another example is a block with 2 modulation symbols, which can be represented as

[0178] In a further non-limiting example of a block having more than 1 but less than M modulation symbols, consider N SF =4 and M = 3. These three blocks can be arranged as

[0179] as well as

[0180] Alternatively, these three blocks can be arranged as

[0181] as well as

[0182] Other orderings of the modulation symbols are possible as long as all blocks are considered and the modulation symbol has been multiplied with each element of the spreading sequence.

[0183] In one possible embodiment, the first communication device 100 may be configured to multiply the elements in each block with different elements in one or more spreading sequences. For example, if a block is composed of 1 modulation symbol d0, all elements in the spreading sequence will be multiplied as follows: This is applied in blocks. Thus, each block can be processed individually in the second communication device (receiver), ie despreading can be performed per block.

[0184] Figure 3 The first communication device 100 provided by the embodiment of the present disclosure is implemented and / or integrated in the network access node 600, for example, the integrated access and backhaul (IAB) in the UE or NR. However, it should be noted that the first communication device 100 can also be implemented in a client device or in any other suitable communication device having a transmission capability in the communication system.

[0185] exist Figure 3In the illustrated embodiment, the network access node 600 includes a processor 602, a transceiver 604, and a memory 606. The processor 602 is coupled to the transceiver 604 and the memory 606 via a communication component 608 known in the art. The network access node 600 can perform wireless communication in a wireless communication system and wired communication in a wired communication system. The wireless communication capability is provided by an antenna or antenna array 610 coupled to the transceiver 604, and the wired communication capability is provided by a wired communication interface 612 coupled to the transceiver 604. In the present disclosure, the network access node 600 is used to perform certain actions, which should be understood to mean that the network access node 600 includes suitable components for performing the actions, such as the processor 602 and the transceiver 604. More details about the network access node 600 can be found in the later part of the present disclosure.

[0186] Figure 4 It is shown that the first communication device 100 (for example, Figure 2 Flow chart of the corresponding method 200 executed in the first communication device 100 shown in FIG. The method 200 includes obtaining 202M modulation symbols, where M is a positive integer.

[0187] The method 200 further includes acquiring 204 one or more spreading sequences, wherein each spreading sequence has a length of N. SF , N SF Is a positive integer.

[0188] The method 200 further includes obtaining 206M·N according to the M modulation symbols. SF elements, where the M·N SF The elements are arranged into M blocks, each block contains N SF elements.

[0189] The method 200 further comprises obtaining 208 a DFT precoder input, wherein the DFT precoder input is obtained by multiplying each element in each block with an element of the one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block.

[0190] The method 200 also includes providing 210 the DFT precoder input 122 to the DFT precoder block 130 .

[0191] It should be understood that Figure 4 The processes in are non-limiting examples, and each process may not depend on the previous process.

[0192] Figure 5FIG. 3 is a block diagram of a second communication device 300 provided by an embodiment of the present disclosure. The second communication device 300 includes a receiving block 310 , a first processing block 320 , a despreading block 330 , and a demodulation decoding block 340 .

[0193] The receiving block 310 is used to receive an RF signal 510 from the first communication device 100, such as Figure 8 The receiving block 310 provides the RF signal 510 in baseband representation to the first processing block 320 .

[0194] The first processing block 320 obtains the signal 510 from the receiving block 310. The first processing block 320 may be used to obtain one or more spreading sequences SS, wherein each spreading sequence has a length of N. SF , N SF Is a positive integer.

[0195] The first processing block 320 may be configured to obtain M blocks according to the received signal 510, where M is a positive integer, M·N SF The elements are arranged in the M blocks, each block including N SF elements.

[0196] The receiver knows from the receiving side that each element in each block is the product of a modulation symbol multiplied by an element in one or more spreading sequences, at least two elements of which are different in at least one block. This information is used by the receiver (e.g., the first processing block 320) for despreading, which is given below and is not described in detail here.

[0197] The first processing block 320 may be used to output modulation symbols 322 to the despreading block 330 .

[0198] The despreading block 330 may be configured to obtain the modulation symbols 322 from the first processing block 320. The despreading block 330 is configured to despread the symbols in each block by multiplying each symbol with an element of the one or more spreading sequences and adding the despread symbols corresponding to the same modulation symbol, wherein at least two elements of the one or more spreading sequences are different in at least one block.

[0199] The despreading operation consists of combining the modulation symbol with the received N SF The despreading block 330 is used to output the summed despread symbols 332 to the demodulation decoding block 340.

[0200] The demodulation decoding block 340 may be used to obtain the summed despread symbols 332 from the despreading block 330. The demodulation decoding block 340 is used to demodulate and decode the summed despread symbols to provide an output as a set of information bits.

[0201] Generally, the second communication device 300 can be used to process the signal 510 in the reverse order of the processing at the first communication device 100. The received RF signal 510 is subjected to baseband processing, including, for example, sampling, filtering, A / D conversion, etc. The baseband signal is further processed by removing CP, performing DFT, performing channel equalization, performing IDFT, performing despreading operation, performing channel decoding, etc.

[0202] Alternatively, channel equalization may be performed after IDFT. In more detail, according to the embodiment of the present disclosure, the second communication device 300 may perform the following main steps:

[0203] 1. Receive RF signal 510 from first communication device 100;

[0204] 2. Convert the received signal 510 from the RF domain to the baseband domain;

[0205] 3. Perform DFT on the baseband signal;

[0206] 4. Perform channel equalization on the output of the DFT;

[0207] 5. Extract the allocated time-frequency resources from the equalized output of the DFT;

[0208] 6. Perform inverse DFT on the extracted time-frequency resources;

[0209] 7. Extract the input block from the output of the inverse DFT;

[0210] 8. Get at least one length of N SF The spreading sequence of

[0211] 9. Despread the modulation symbols in each input block; and

[0212] 10. Demodulate and decode the despread modulation symbols to obtain the transmitted data information.

[0213] In this regard, in an embodiment of the present disclosure, the M modulation symbols are associated with any one of uplink (UL) control information, downlink (DL) control information, uplink data information, or downlink data information. Therefore, the information content may be related to uplink or downlink data, or to uplink or downlink control information. For data transmission, a physical uplink shared channel (PUSCH) and a physical downlink shared channel (PDSCH) may be used. For control information, a physical uplink control channel (PUCCH) and a physical downlink control channel (PDCCH) may be used.

[0214] Figure 6 The second communication device 300 provided by the embodiment of the present disclosure and / or integrated in the client device 700 is shown, for example, the next generation node B (gNB) or the IAB in the NR. However, it should be noted that the second communication device 300 can also be implemented in any other suitable communication device with a receiving capability in the communication system, for example, a UE in a device to device (D2D) scenario.

[0215] exist Figure 6 In the illustrated embodiment, client device 700 includes a processor 702, a transceiver 704, and a memory 706. Processor 702 may be coupled to transceiver 704 and memory 706 via a communication component 708 as is known in the art.

[0216] The client device 700 also includes an antenna or antenna array 710 coupled to the transceiver 704, which means that the client device 700 is configured to communicate wirelessly in a wireless communication system.

[0217] In the present disclosure, the client device 700 can be used to perform certain actions, which can be understood to mean that the client device 700 includes suitable components for performing the actions, such as the processor 702 and the transceiver 704. More details about the client device 700 can be found in the following part of the present disclosure.

[0218] Figure 7 It is shown that the second communication device 300 (for example, Figure 5 Flow chart of the corresponding method 400 performed in ).

[0219] The method 400 comprises receiving 402 a signal 510 from a first communication device 100 .

[0220] The method 400 further includes obtaining 404 one or more spreading sequences, wherein each spreading sequence has a length of N. SF , N SF Is a positive integer.

[0221] The method 400 further includes obtaining 406M blocks according to the received signal 510, where M is a positive integer, M·N SF The elements are arranged in the M blocks, each block including N SF elements.

[0222] The receiver knows from the receiving side that each element in each block is the product of a modulation symbol multiplied by an element in one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block. This information is used by the receiver (e.g., the second communication device 300) for despreading, which is given below and is not described in detail here.

[0223] The method 400 also includes despreading 408 the symbols in each block by multiplying each symbol with an element of one or more spreading sequences, wherein at least two elements of the one or more spreading sequences are different in at least one block, and summing the despread symbols corresponding to the same modulation symbol.

[0224] The method 400 further includes demodulating and decoding 410 the summed despread symbols.

[0225] It should be understood that Figure 7 The processes in are non-limiting examples, and each process may not depend on the previous process, and the order of processes is not limiting.

[0226] Figure 8 The wireless communication system 500 provided by the embodiment of the present disclosure is shown. The wireless communication system 500 includes a first communication device 100 and a second communication device 300.

[0227] like Figure 8 As shown in and mentioned above, the first communication device 100 may be part of a network access node 600, such as a gNB; the second communication device 300 may be part of a client device 700, such as a UE. However, the opposite situation is also within the scope of the present disclosure, that is, the first communication device 100 is part of a client device and the second communication device 300 is part of a network access node.

[0228] To keep it simple, Figure 8The wireless communication system 500 shown includes only one first communication device 100 and one second communication device 300. However, the wireless communication system 500 may include any number of first communication devices 100 and any number of second communication devices 300 without departing from the scope of the present disclosure.

[0229] In the wireless communication system 500, the network access node 600 transmits an RF signal 510 to a client device 700 in the DL, and the client device 700 receives the RF signal 510 and processes the RF signal 510 accordingly. The client device 700 transmits an RF signal to the network access node 600 in the uplink. The wireless communication system 500 may be any orthogonal frequency division multiplexing (OFDM) system using DFT precoding. In addition, the embodiments of the present disclosure are not limited to unlicensed spectrum, but are applicable to higher spectrum, for example, where a waveform with low power dynamics is desired.

[0230] In embodiments of the present disclosure, different aspects of spreading sequence index signaling are also disclosed. The spreading sequence index signaling may be performed by any combination of: radio resource control signaling, uplink control channel, downlink control channel, media access control (MAC) control element (CE), and allocation of time-frequency resources for transmitting signal 510.

[0231] For example, the spreading sequence index may be provided to the second communication device 300 by higher layer signaling (e.g., in radio resource control (RRC)). The spreading sequence index may be predefined by a standard specification. For example, the standard specification may define a set of spreading sequences in a table, each sequence having an index.

[0232] In another example, if a composite spreading sequence is to be arranged, it constitutes a spreading sequence index (ie, index i=0, 1, ..., N SF -1) can be obtained by predefined rules from the index sent by the signal.

[0233] In yet another example, the spreading sequence index may be implicitly determined from transmission parameters. For example, these parameters may include an interlace index or be related to the allocated time-frequency resources.

[0234] The signaling of the spreading sequence index may be performed in an uplink control channel and / or a downlink control channel of the wireless communication system 500 .

[0235] Other embodiments of the present disclosure are described below.

[0236] According to an embodiment of the present disclosure, a method of using the input of a DFT precoder as M·N SF elements, arranged as follows:

[0237]

[0238] In mapping (4), the spreading sequence is repeated block by block. Another feature of (4) that is different from (1) is that the input of the DFT precoder is divided into M blocks of size N. SF Each block includes 1 modulation symbol. For example, the first block is

[0239] The output of the DFT precoder can be obtained after some algebra:

[0240]

[0241]

[0242] The first sum in (5) is different because the denominator in the exponential function is L instead of N as in (2) SF The second sum represents the M-point DFT of the data symbols, rather than the L-point DFT in (2), i.e. It should be noted that when N SF When =1, (3) and (5) are equal.

[0243] Furthermore, if the DFT of the spreading sequence is defined,

[0244]

[0245] It can be seen that the inner product of the spreading sequence in the frequency domain (i.e., after the DFT precoder) is orthogonal, i.e.,

[0246]

[0247] in, represents the complex conjugate of w. Therefore, the DFT outputs from two users transmitting different sets of modulation symbols and using different spreading sequences will be orthogonal.

[0248] In the above disclosed DFT mapping embodiment, one spreading sequence (i.e., index i) is used to transmit M modulation symbols. The length of the spreading sequence is N SF , and is expanded to length N by repetition in the mapping step (1) or (4) SF That is, a spreading sequence index i is used to arrange L=N in (4) SF Thus, we have described the use of blocks of length N. SFA single spreading sequence is created, and each element in at least one block is combined with a sequence of length N SF Multiply one or more elements of a single spreading sequence.

[0249] However, in other embodiments of the present disclosure, more than 1 (>1) spreading sequences, but no more than M spreading sequences, are used to transmit N SF In this regard, the first communication device 100 obtains m orthogonal spreading sequences, wherein the length of each spreading sequence is N. SF , where m is an integer satisfying the relationship 1<m≤M. The first communication device 100 associates m orthogonal spreading sequences to different blocks and multiplies each element in each block by the element in the spreading sequence associated with it. In an embodiment, the m orthogonal spreading sequences constitute a length of M·N SF The composite spreading sequence is arranged to have a total of N SF An example of a composite spreading sequence with m=1 is to repeat the sequence M times with a length of N. SF The spreading sequence is defined as follows, for example, Therefore, such a structure allows the definition of length M·N SF N SF By properly selecting the orthogonal sequences, this structure can also be defined as a length of M·N SF N SF A set of orthogonal composite spreading sequences.

[0250] For m>1, the composite spreading sequence will consist of m different spreading sequences, that is, Among them, i≠j.

[0251] In an embodiment, the m orthogonal spreading sequences are determined by a predefined rule. This means that the OCC index for the composite spreading sequence can be determined without any additional signaling over the OCC index used to transmit a single OCC index i. For example, OCC index j can be a function of OCC index i, and so on.

[0252] Any of the above DFT input mappings (1) or (4) can be used with the above structure using m>1 composite spreading sequences that constitute the spreading sequence. The benefit of using more than one spreading sequence per block of M modulation symbols is that, for example, it can prevent the use of an all-one spreading sequence, which is a spreading sequence that produces a relatively high CM.

[0253] As a non-limiting example, consider the DFT input mapping in equation (1) and N SF =2 and the following mapping, where M can be N SF divisible by an alternating spreading sequence index and Orthogonality between

[0254]

[0255] as well as

[0256]

[0257] For these two examples, the composite spreading sequences would become:

[0258]

[0259] and

[0260]

[0261] Another non-limiting example is to consider (4), so that:

[0262]

[0263] as well as

[0264]

[0265] For these two examples, the composite spreading sequences would become:

[0266]

[0267] and

[0268]

[0269] In these examples, each data symbol is multiplied by the same spreading sequence. Therefore, for any of the above examples, if w (0) =[1,1] and w (1) =[1,-1], and None of the will use an all-ones composite spreading sequence.

[0270] There are several ways to apply multiple spreading sequences to a block of M modulation symbols. SF The length of the spreading sequence combination is MN SF Composite spreading sequence Should still be orthogonal.

[0271] For example, for the spread spectrum information modulation symbol d k , k = 0, 1, ..., M-1, a simple predefined rule is to use the spreading sequence í = (i + k) mod NSF , where i = 0, 1, ..., N SF -1, "mod" is the modulo operator. Because 0≤i,j≤N SF -1, then (i+k) mod N SF ≠(j+k)mod N SF , when i≠j, the composite spreading sequences corresponding to i and j are orthogonal.

[0272] Orthogonal sequence set

[0273] It will be appreciated from this disclosure that the CM is determined from the spreading sequence by its DFT (i.e., its window function). In embodiments of the present disclosure, different sets of orthogonal sequences may be used to spread the modulation symbols, and thus several non-limiting examples of such orthogonal sequences are considered and described in this section.

[0274] DFT Sequence

[0275] In an embodiment, a DFT sequence is used to spread the modulation symbols. The sequence is composed of definition:

[0276]

[0277] Since (6) is not a constant and is determined according to the index n, it acts as a frequency domain filter at the IDFT input, i.e., the value The absolute value of function (6) is Fig. 9 Draw in, N SF =4, M=30 and i=0,1,2,3. It should be noted from (6) that, compared with (1) using DFT sequences, (4) using DFT sequences does not result in comb transmission, i.e., all L subcarriers are allocated at the output of the DFT precoder. However, after the DFT precoder, the multiplexing is still orthogonal, as shown above in the derivation of the inner product of the spreading sequence in the frequency domain.

[0278] exist Figure 10a-10c According to (1) and (4), N SF =4, 6 and 8 for each spreading sequence, i = 0, 1, ..., N SF -1 plots CM vs. DFT mapping. Also included is the reference case, i.e., no spreading N SF =1. Figures 10a to 10c The CM comparison of the transmitted signal using the DFT sequence is shown, where the DFT sequence has a spreading factor N. SF exist Fig.10a =4, in Fig.10b =6, in Fig.10c Middle is equal to 8.

[0279] Can be obtained from Figure 10a-10c It can be seen that the DFT mapping according to (4) can provide a lower CM than that defined by (1), and the CM is even lower than the reference case without a spreading sequence. However, it can also be seen that (4) has a spreading sequence with a relatively high CM, which is the spreading sequence corresponding to i=0, that is, a sequence of all ones. In conventional NR systems, the spreading sequence index is indicated to the UE, so the use of this particular sequence can be avoided, or it can even be deleted from the set of spreading sequences. Another option is to explore other types of spreading sequences that do not contain sequences of all ones.

[0280] Zadoff-Chu sequence

[0281] In an embodiment, N is formed by cyclically shifting a Zadoff-Chu (ZC) sequence. SF Therefore, the spreading sequence is defined by the following formula:

[0282]

[0283] Among them, 0<u<N SF Yes and N SF The root indices of the two sequences are coprime, that is, their greatest common divisor is 1, and "mod" is the modulo operator. It can be proved that these spreading sequences are orthogonal. The window function becomes

[0284]

[0285] It is a quadratic sum in p and has closed-form solutions only in certain special cases. The absolute value of function (7) is Fig.11 Draw in, N SF =4, M=30 and i=0,1,2,3.

[0286] exist Figure 12a-12c According to (4), use N SF = 4, 6 and 8 (using root index u = 3, 5 and 3 respectively) for each spreading sequence i = 0, 1, ..., N SF -1 plots CM vs. DFT-mapping. Also included is the reference case, i.e., no spreading N SF =1. Figures 12a to 12c The CM comparison of the transmitted signal using a DFT sequence to map the input to the DFT according to formula (4) is shown. The spreading factor of the DFT sequence is Fig.12a =4, in Figure 12b =6, in Fig.12c Middle is equal to 8.

[0287] from Figure 12a-12cIt can be seen that the ZC sequence does not produce a specific high CM spreading sequence (because there is no ZC sequence consisting of one value), which is the case with the DFT sequence.

[0288] Hadamard sequence

[0289] In an embodiment, the Hadamard sequence is used to spread the modulation symbols. SF If is equal to 2 or a multiple of 4, then the spreading sequence can be determined from the rows or columns of the Hadamard matrix. The advantage of Hadamard sequences is that they are real-valued, i.e., +1 or –1, so low-complexity implementations are possible because the spreading operation can be performed by direct phase shifting rather than complex-valued multiplications.

[0290] exist Fig.13 In the case of N SF =4, M=30, i=0,1,2,3 Hadamard sequence plotting The absolute value of .

[0291] exist Figure 14a-14b According to (4), use N SF =4 and 8 for each spreading sequence i=0,1,…,N of the DFT sequence and the Hadamard sequence respectively. SF -1 plots the CM and DFT mapping. Also included is the reference case, i.e., no spreading N SF =1. Figure 14a-14b The CM comparison of the transmitted signal using the DFT sequence with a spreading factor N is shown for mapping the input to the DFT formula (4). SF exist Fig.14a =4, in Fig.14b Middle is equal to 8.

[0292] from Figure 14a-14b It can be seen that the Hadamard sequence performs better than the DFT sequence.

[0293] Orthogonal sequences that do not include sequences where all elements are identical

[0294] In an embodiment, a set of orthogonal sequences that do not include sequences with all elements being identical is used to spread the modulation symbols. The problem with a spreading sequence consisting of only a plurality of "1s" is the potential co-phasing of the modulation symbols, which may increase the CM. However, the CM does not change the phase shift of the signal, so a spreading sequence consisting of only -1 or any other complex-valued constant (i.e., all elements have the same value Q) is not used. ) will also result in high CM. Therefore, a spreading sequence set that does not include such a sequence is useful.

[0295] In one example, the first spreading sequence set is defined to include The set of DFT sequences is such a candidate set. The set of spread spectrum sequences can be composed of N SF ×N SF The matrix A represents that the rows (or columns) of the matrix are composed of spreading sequences. Then, from linear algebra, it can be known that the change of the basis to the new orthogonal basis, that is, the second spreading sequence set, can be obtained by the projection matrix P. The new spreading sequence set, B = AP. By appropriately selecting P (for example, it can be an orthogonal matrix), the second spreading sequence set may not include sequence.

[0296] Slepian Sequence

[0297] In an embodiment, a Slepian sequence is used to spread the modulation symbols. Slepian sequences are also known as discrete prolate spheroidal sequences (DPSS). The property of these sequences is that the discrete time Fourier transform of the sequence has the maximum concentration of signal energy within a given limited frequency band, that is, the energy of the side lobes outside the frequency band is minimized.

[0298] DPSS can be used as a window sequence after a DFT precoder, which is known to reduce the PAPR of the transmitted signal. In this case, there is a window function and only a DPSS is applied.

[0299] In contrast, here we disclose generating multiple DPSSs and using them as spreading sequences, while also achieving the goal of being a window function. The Slepian sequence is obtained by solving the eigenvalue problem, and the nth order Slepian sequence corresponds to the (n+1)th eigenvalue. It can be shown that the nth order Slepian sequence is orthogonal to lower order Slepian sequences. Therefore, this article discloses that 1 to N order Slepian sequences can be used. SF The Slepian sequence set of order forms a spreading sequence set.

[0300] Typically, the inverse DFT of a window sequence will produce a time-domain spreading sequence, and if the window sequence is orthogonal, the time-domain spreading sequence is also orthogonal. However, since the length of the window sequence is L and the length of the spreading sequence is N SF , so it is impossible to perform the inverse DFT of a windowed sequence of length L, since no window of length N is given. SF OCC.

[0301] Therefore, here, the generation length N is disclosed. SF Slepian sequences, and then perform N of these sequences SFSince the window function is shown above as the L-point DFT of the spreading sequence, the corresponding length N SF The window function of the Slepian sequence becomes the original length N after the L-point DFT precoder. SF The L / N of the Slepian sequence SF times oversampled version.

[0302] Therefore, in one example, the spreading sequence is defined as in, and is the i-th Slepian sequence, i.e., the Slepian sequence is defined in the frequency domain, and the spreading sequence is obtained as its inverse DFT.

[0303] In another example, in, is the i-th Slepian sequence, ie, the Slepian sequence is defined in the time domain and represents a spreading sequence.

[0304] In the above description, the normalization factors, such as M, L, N SF , have been inserted before the DFT or IDFT operation, or as part of the sequence definition. It should be understood that CM is invariant to these normalization factors, mainly for notational convenience.

[0305] The network access node 600 in the present disclosure includes but is not limited to: a NodeB in a wideband code division multiple access (WCDMA) system, an evolutionary Node B (eNB) or an evolved NodeB (eNodeB) in an LTE system, or a relay node or access point in a fifth generation (5G) network, or a vehicle-mounted device, a wearable device or a gNB.

[0306] In addition, the network access node 600 in this article can also be represented as a wireless network access node, an access network access node, an access point or a base station (for example, a radio base station (RBS)). In some networks, depending on the technology and terminology used, the base station can be called a transmitter, "gNB", "gNodeB", "eNB", "eNodeB", "NodeB" or "B node".

[0307] Depending on the transmission power and therefore the cell size, the wireless network access node may have different categories, for example, a macro eNodeB, a home eNodeB or a pico base station. A wireless network access node may be a station (STA), which is any device including a MAC compliant with IEEE 802.11 and a physical layer (PHY) interface to the wireless medium. A wireless network access node may also be a base station corresponding to a 5G wireless system or higher.

[0308] The processor of the network access node 600 may be referred to as one or more general purpose CPUs, one or more DSPs, one or more ASICs, one or more FPGAs, one or more programmable logic devices, one or more discrete gates, one or more transistor logic devices, one or more discrete hardware components, and one or more chipsets.

[0309] The memory of the network access node 600 may be a read-only memory, a random access memory or an NVRAM.

[0310] The transceiver of the network access node 600 may be a transceiver circuit, a power controller, an antenna, or an interface for communicating with other modules or devices. In an embodiment, the transceiver of the network access node 600 may be a separate chipset, or integrated with a processor in a chipset. In some embodiments, the processor, transceiver, and memory of the network access node 600 are integrated in a chipset.

[0311] The client device 700 in the present disclosure includes but is not limited to: UE, such as a smartphone, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device or other processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, an integrated access and backhaul (IAB) node, such as a mobile car or a device installed in a car, a drone, a device-to-device (D2D) device, a wireless camera, a mobile station, an access terminal, a user unit, a wireless communication device, a wireless local access network (WLAN) station, a tablet computer supporting wireless function, a laptop embedded device, a universal serial bus (USB) adapter, a wireless customer-premises equipment (CPE) and / or a chipset. In the Internet of Things (IOT) scenario, the client device 700 may represent a machine or other device or chipset that performs communication with other wireless devices and / or network devices.

[0312] It should be understood that in some cases, the client device 700 can be part of the second communication device. However, in some other cases, the client device 700 can be part of the first communication device. It is a non-limiting example in the present disclosure.

[0313] UE may also be referred to as a mobile phone, cellular phone, computer tablet or laptop with wireless capabilities. In this context, a UE may be, for example, a portable, pocket storage, handheld, computer-based or vehicle-mounted mobile device capable of transmitting voice and / or data with another entity (e.g., another receiver or server) via a wireless access network. A UE may be a station (STA), which is any device including a media access control (MAC) compliant with IEEE 802.11 and a physical layer (PHY) interface to a wireless medium (WM). UE may also be used to communicate in 3GPP-related LTE and LTE-Advanced, in worldwide interoperability for microwave access (WiMAX) and its evolution, and in fifth-generation wireless technologies such as NR.

[0314] The processor of the client device 700 may be referred to as one or more general-purpose central processing units (CPUs), one or more digital signal processors (DSPs), one or more application-specific integrated circuits (ASICs), one or more field programmable gate arrays (FPGAs), one or more programmable logic devices, one or more discrete gates, one or more transistor logic devices, one or more discrete hardware components, and one or more chipsets.

[0315] The memory of the client device 700 may be a read-only memory, a random access memory, or a non-volatile random access memory (NVRAM).

[0316] The transceiver of the client device 700 may be a transceiver circuit, a power controller, an antenna, or an interface for communicating with other modules or devices. In an embodiment, the transceiver of the client device 700 may be a separate chipset, or integrated with a processor in a chipset. In some embodiments, the processor, transceiver, and memory of the client device 700 are integrated in a chipset.

[0317] The wireless communication system in the present disclosure includes but is not limited to: LTE, 5G or future wireless communication systems.

[0318] In addition, any method according to an embodiment of the present disclosure can be implemented in a computer program having a coding component, and when a processing component runs the computer program, the processing component is caused to perform the method steps. The computer program is included in a computer-readable medium of a computer program product. The computer-readable medium can basically include any memory, such as a read-only memory (ROM), a programmable read-only memory (PROM), an erasable PROM (EPROM), a flash memory, an electrically erasable PROM (EEPROM), or a hard disk drive.

[0319] In addition, the skilled person recognizes that embodiments of the first communication device 100 and the second communication device 300 include necessary communication capabilities in the form of functions, components, units, elements, etc. for performing the technical solution. Examples of other such components, units, elements and functions are: processors, memories, buffers, control logic, encoders, decoders, rate matchers, derate matchers, mapping units, multipliers, decision units, selection units, switches, interleavers, deinterleavers, modulators, demodulators, inputs, outputs, antennas, amplifiers, receiving units, transmitting units, DSPs, MSDs, TCM encoders, TCM decoders, power supply units, power supply feeders, communication interfaces, communication protocols, etc., which are appropriately arranged together to perform the technical solution.

[0320] In particular, the processors of the first communication device 100 and the second communication device 300 may include a central processing unit (CPU), a processing unit, a processing circuit, a processor, an application specific integrated circuit (ASIC), a microprocessor, or one or more instances of other processing logic that can interpret and execute instructions.

[0321] The expression "processor" may therefore refer to a processing circuit comprising a plurality of processing circuits, such as any, some or all of the items listed above. The processing circuit may also perform data processing functions for inputting, outputting and processing data, including data buffering and device control functions, such as call handling control, user interface control, etc.

[0322] Finally, it should be understood that the present disclosure is not limited to the embodiments described above, but also relates to and incorporates all embodiments within the scope of the attached independent claims.

Claims

1. A first communication device (100) for a wireless communication system (500), characterized in that: The first communication device (100) comprises: The first processing block (110) is used to: Obtain M modulation symbols, where M is a positive integer; and Obtain one or more spreading sequences, where the length of each spreading sequence is N SF , N SF is a positive integer; The second processing block (120) is used to: Obtain M·N according to the M modulation symbols SF elements, where the M·N SF The elements are arranged into M blocks, each block contains N SF elements; where there is at least one block, the elements in the block are obtained by SF The elements in the spreading sequence are multiplied by the same modulation symbol; Obtaining a discrete Fourier transform (DFT) precoder input (122), wherein the DFT precoder input (122) is obtained by multiplying each element in each block with an element in the one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block; and The DFT precoder input (122) is provided to a DFT precoder (130).

2. The first communication device (100) according to claim 1, characterized in that The second processing block (120) is used for: At least one block is arranged to include less than M modulation symbols.

3. The first communication device (100) according to claim 1 or 2, characterized in that: The second processing block (120) is used for: The elements in each block are multiplied by different elements in the one or more spreading sequences.

4. The first communication device (100) according to claim 1 or 2, characterized in that: The first processing block (110) is used to: Get the length N SF A single spreading sequence of The second processing block (120) is used to: combine each element in at least one block with the length N SF Multiply one or more elements of a single spreading sequence.

5. The first communication device (100) according to claim 4, characterized in that The DFT precoder input (122) is composed of M·N SF elements are given, and these elements are arranged as follows: in, Represents the element in the i-th spreading sequence p=0,1,…,N SF -1, represents the M modulation symbols.

6. The first communication device (100) according to claim 1 or 2, characterized in that: The first processing block (110) is used to obtain m orthogonal spread spectrum sequences, wherein the length of each orthogonal spread spectrum sequence is N. SF , 1 <m≤M; The second processing block (120) is used for: Associating the m orthogonal spreading sequences to different blocks; Multiply each element in each block by the element in its associated orthogonal spreading sequence.

7. The first communication device (100) according to claim 6, characterized in that The length of the m orthogonal spread spectrum sequences is M·N SF The composite spreading sequence is arranged to have N SF orthogonal composite spreading sequences.

8. The first communication device (100) according to claim 6, characterized in that The m orthogonal spreading sequences are determined by a predefined rule.

9. The first communication device (100) according to claim 1 or 2, characterized in that: The one or more spreading sequences are any spreading sequence in the group consisting of: DFT sequence set; The set of cyclically shifted Zadoff-Chu sequences; Hadamard sequence set; The Slepian sequence set; and The set of orthogonal sequences does not include sequences whose elements are all identical.

10. The first communication device (100) according to claim 1 or 2, characterized in that: The first communication device (100) further comprises: A mapping block (140) is used to map the DFT precoder output (132) to an input (142) of an Inverse Discrete Fourier Transform (IDFT) block (150); the output of the IDFT block (150) is used to obtain a signal (510) for transmission to a second communication device (300).

11. The first communication device (100) according to claim 10, characterized in that: The mapping block (140) is used to: The DFT precoder output (132) is mapped to a set of non-contiguous resource blocks.

12. The first communication device (100) according to claim 10, characterized in that The index of the one or more spreading sequences in at least one of the following is provided by the first communication device (100): Radio resource control signaling; Uplink control channel; Downlink control channel; Media access control signaling; as well as Allocation of time-frequency resources for transmitting the signal (510).

13. The first communication device (100) according to claim 1 or 2, characterized in that: The M modulation symbols are associated with any of the following: Uplink control information; Downlink control information; Uplink data information; or Downlink data information.

14. A second communication device (300) for a wireless communication system (500), characterized in that: The second communication device (300) comprises: A receiving block (310) for receiving a signal (510) from a first communication device (100); The first processing block (320) is used to obtain one or more spreading sequences, wherein the length of each spreading sequence is N. SF , N SF is a positive integer; and, obtaining M blocks according to the received signal (510), wherein M is a positive integer, M·N SF The elements are arranged in the M blocks, each block including M SF elements; where there is at least one block, the elements in the block are obtained by SF The elements in the spreading sequence are multiplied by the same modulation symbol; a despreading block (330) for despreading the symbols in each block by multiplying each symbol with an element of the one or more spreading sequences and adding the despread symbols corresponding to the same modulation symbol, wherein at least two elements of the one or more spreading sequences are different in at least one block; and The demodulation and decoding block (340) is used to demodulate and decode the summed despread symbols.

15. A method (200) for a first communication device (100), characterized in that: The method (200) comprises: Obtain (202) M modulation symbols, where M is a positive integer; Obtain (204) one or more spreading sequences, wherein each spreading sequence has a length of N. SF , N SF is a positive integer; Obtain (206) M·N according to the M modulation symbols SF elements, where the M·N SF The elements are arranged into M blocks, each block contains N SF elements; where there is at least one block, the elements in the block are obtained by SF The elements in the spreading sequence are multiplied by the same modulation symbol; obtaining (208) a discrete Fourier transform (DFT) precoder input (122), wherein the DFT precoder input (122) is obtained by multiplying each element in each block with an element of the one or more spreading sequences, at least two elements of the one or more spreading sequences being different in at least one block; and The DFT precoder input (122) is provided (210) to a DFT precoder (130).

16. A method (400) for a second communication device (300), characterized in that: The method (400) comprises: receiving (402) a signal (510) from a first communication device (100); Obtain (404) one or more spreading sequences, wherein each spreading sequence has a length of N. SF , N SF is a positive integer; Obtain (406) M blocks according to the received signal (510), where M is a positive integer, M·N SF The elements are arranged in the M blocks, each block including N SF elements; where there is at least one block, the elements in the block are obtained by SF The elements in the spreading sequence are multiplied by the same modulation symbol; despreading the symbols in each block by multiplying each symbol by an element of the one or more spreading sequences and summing the despread symbols corresponding to the same modulation symbol (408), wherein at least two elements of the one or more spreading sequences are different in at least one block; and The summed despread symbols are demodulated and decoded (410).

17. A communication device, characterized in that: include: processor; as well as A memory coupled to the processor and having processor-executable instructions stored thereon, which, when executed by the processor, cause the processor to perform the method according to claim 15 or 16.

Citation Information

Patent Citations

  • System and method for generating spreaded sequence with low peak-to-average power ratio (PAPR) waveform

    WO2018134838A1

  • Apparatus and method for in multiple access in wireless communication

    WO2018174686A1