WO2022078590A1 - Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication - Google Patents

Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication Download PDF

Info

Publication number
WO2022078590A1
WO2022078590A1 PCT/EP2020/078902 EP2020078902W WO2022078590A1 WO 2022078590 A1 WO2022078590 A1 WO 2022078590A1 EP 2020078902 W EP2020078902 W EP 2020078902W WO 2022078590 A1 WO2022078590 A1 WO 2022078590A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
communication device
variable
variables
coefficient
Prior art date
Application number
PCT/EP2020/078902
Other languages
English (en)
Inventor
Yi Qin
Renaud-Alexandre PITAVAL
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to PCT/EP2020/078902 priority Critical patent/WO2022078590A1/fr
Publication of WO2022078590A1 publication Critical patent/WO2022078590A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2614—Peak power aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2602—Signal structure
    • 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/0053—Allocation of signaling, i.e. of overhead other than pilot signals

Definitions

  • the invention relates to sequences with low Peak-to-Average Power Ratios, PAPR, for a communication system. Especially, the invention relates to a first communication device and a second communication device and corresponding methods using such sequences in a communication system.
  • a demodulation reference signal (DMRS)-less transmission method based on quadrature phase shift keying (QPSK) modulated gold sequence has been proposed to improve physical uplink control channel (PUCCH) coverage.
  • QPSK quadrature phase shift keying
  • Another DMRS-less transmission method based on sequences generated by exponentiating quadratic forms has also been proposed to achieve a better maximum cross-correlation.
  • PAPRs peak-to-average power ratios
  • the DMRS-less PUCCH transmission system is also referred to as pilot-less multi-dimensional transmission/modulation. It should be noticed that the same method can also be applied to other physical channels. Assuming that the payload size of PUCCH is N bits, an user equipment (UE) selects a sequence x from a set C of 2 N sequences, and maps the sequence x on N RB resource blocks (RB) and N os DFT-s-ODFM symbols in frequency-first manner.
  • UE user equipment
  • the first 12N RB elements of sequence x are allocated to the 12N RB resource elements of the first orthogonal frequency division multiplexing (OFDM) symbol, then the next 12N RB resource elements of sequence x are mapped to the 12m RB resource elements of the next symbol and so on, until complete allocation of x.
  • the gNb determines the detected N bits uplink control information based on x in C. If we take the sequence set C as a constellation, each sequence in the set C is a modulation symbol. Summary
  • An objective of examples of the invention is to provide a solution which mitigates or solves the drawbacks and problems of conventional solutions.
  • M - 1 is an index of each element x( ⁇ ) in the sequence x, and wherein the m number of variables comprises a variable l ⁇ , where a value of the variable l ⁇ equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0; and transmit a signal onto the N RB number of resource blocks, wherein the signal is based on the sequence x.
  • That the signal is based on the sequence x may be understood as that the signal can be the sequence x or that the signal is obtained based on the sequence x after at least one of the following signal processing procedures: scrambling, precoding, discrete Fourier transform (DFT) spreading or other spreading techniques, phase shift, cyclic shift, power amplification, etc.
  • DFT discrete Fourier transform
  • An advantage of the first communication device is that the maximum PAPR may be reduced substantially which e.g. can increase the coverage of physical control channels in the communication system such as physical uplink control channel (PUCCH).
  • PUCCH physical uplink control channel
  • the sequence design herein guarantees that each transmitted DFT spread OFDM waveform (DFT-s-OFDM) symbol can be identified with a symbol repetition mapping of using a DFT or Zadoff-Chu sequence as spreading sequence, which acts as a window function providing low PAPR.
  • the proposed DMRS-less transmission can also be used for the transmission of other physical channels, e.g., physical uplink shared channel (PUSCH), physical downlink shared channel (PDSCH), physical downlink control channel (PDCCH), physical broadcast channel (PBCH), etc.
  • a value of the prime factor p t is any of: 2, 3, or the largest prime factor of all prime factors of the number of subcarriers in the N RB number of resource blocks.
  • An advantage of this implementation form is that 2 and 3 are always prime factor of the number of subcarriers in the N RB number of resource blocks because e.g. in NR and LTE there are 12N RB subcarriers. Therefore, a fixed value of p t can be defined and the complexity of determining the sequence x will be low at the transmitter and receiver. If p t is the largest prime factor of all prime factors of the number of subcarriers in the N RB number of resource blocks, the number of candidate DFT or Zadoff-Chu sequences as spreading sequences is maximized and therefore more sequences can be generated for transmitting information bits in the communication system.
  • the quadratic polynomial comprises a plurality of first-order terms of the m number of variables, and a coefficient of a first-order term of the variable l ⁇ is an integer within the set of values ⁇ 0,1. p t - l ⁇ .
  • This implementation form guarantees that different values of information bits are not corresponding to the same sequence x, because any two coefficients of a first- order term of the variable l ⁇ satisfy the relation which corresponds to the same sequence x.
  • the quadratic polynomial comprises a plurality of second-order terms of the m number of variables, and a coefficient of each second-order term that is determined by the variable l ⁇ and one other variable in the m number of variables is 0, and a coefficient of a second-order term of the variable l ⁇ is within the set of values ⁇ 0,1, ... , p t - 1 ⁇ .
  • the coefficient of the second-order term of the variable l ⁇ is within the set of values ⁇ 1,2, ... Pt ⁇ 1 ⁇ -
  • An advantage of this implementation form is to guarantee low PAPR, because if the coefficient of the second-order term of the variable s 0 the PAPR may be high.
  • the coefficient of the first-order term of the variable is an integer within the set of values ⁇ 1,2, ... p t - 1 ⁇ , and the coefficient of the second-order term of the variable is 0.
  • An advantage of this implementation form is to achieve very low PAPR.
  • the first communication device being configured to generate the signal based on multiplexing the sequence x with a cover code, wherein the cover code is a sequence comprising of 1s or determined by the plurality of information bits.
  • M - 1 is an index of each element x( ⁇ ) in the sequence x, and wherein the m number of variables comprises a variable l lt where a value of the variable equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0; and determine the plurality of information bits based on the received signal.
  • An advantage of the second communication device is that the maximum PAPR may be reduced substantially which e.g. can increase the coverage of physical control channels in the communication system such as PUSCH .
  • the sequence design herein guarantees that each transmitted DFT-s-OFDM symbol can be identified with a symbol repetition mapping of using a DFT or Zadoff-Chu sequence as spreading sequence, which acts as a window function providing low PAPR.
  • the proposed DMRS-less transmission can also be used for the transmission of other physical channels, e.g., PUSCH, PDSCH, PDCCH, PBCH, etc.
  • a value of the prime factor p t is any of: 2, 3, or the largest prime factor of all prime factors of the number of subcarriers in the N RB number of resource blocks.
  • An advantage of this implementation form is that 2 and 3 are always prime factor of the number of subcarriers in the N RB number of resource blocks because e.g. in NR and LTE there are 12N RB subcarriers. Therefore, a fixed value of p t can be defined and the complexity of determining the sequence x will be low at the transmitter and receiver. If p t is the largest prime factor of all prime factors of the number of subcarriers in the N RB number of resource blocks, the number of candidate DFT or Zadoff-Chu sequences as spreading sequences is maximized and therefore more sequences can be generated for transmitting information bits in the communication system.
  • the quadratic polynomial comprises a plurality of first-order terms of the m number of variables, and a coefficient of a first-order term of the variable l ⁇ is an integer within the set of values
  • the quadratic polynomial comprises a plurality of second-order terms of the m number of variables, and a coefficient of each second-order term that is determined by the variable l ⁇ and one other variable in the m number of variables is 0, and a coefficient of a second-order term of the variable l ⁇ is within the set of values ⁇ 0,1, ... , p t - 1 ⁇ .
  • the coefficient of the second-order term of the variable is within the set of values
  • An advantage of this implementation form is to guarantee low PAPR, because if the coefficient of the second-order term of the variable s 0 the PAPR may be high.
  • the coefficient of the first-order term of the variable l ⁇ is an integer within the set of values ⁇ 1,2, ... p t - 1 ⁇ , and the coefficient of the second-order term of the variable l ⁇ is 0.
  • An advantage of this implementation form is to achieve very low PAPR.
  • M - 1 is an index of each element x( ⁇ ) in the sequence x, and wherein the m number of variables comprises a variable where a value of the variable equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0; and transmitting a signal onto the N RB number of resource blocks, wherein the signal is based on the sequence x.
  • an implementation form of the method comprises the feature(s) of the corresponding implementation form of the first communication device.
  • the method according to the fourth aspect can be extended into implementation forms corresponding to the implementation forms of the second communication device according to the second aspect.
  • an implementation form of the method comprises the feature(s) of the corresponding implementation form of the second communication device.
  • the advantages of the methods according to the fourth aspect are the same as those for the corresponding implementation forms of the second communication device according to the second aspect.
  • the invention also relates to a computer program, characterized in program code, which when run by at least one processor causes said at least one processor to execute any method according to examples of the invention. Further, the invention also relates to a computer program product comprising a computer readable medium and said mentioned computer program, wherein said computer program is included in the computer readable medium, and comprises of one or more from the group: ROM (Read-Only Memory), PROM (Programmable ROM), EPROM (Erasable PROM), Flash memory, EEPROM (Electrically EPROM) and hard disk drive.
  • ROM Read-Only Memory
  • PROM Programmable ROM
  • EPROM Erasable PROM
  • Flash memory Flash memory
  • EEPROM Electrically EPROM
  • FIG. 1 shows a first communication device according to an example of the invention
  • FIG. 2 shows a method for a first communication device according to an example of the invention
  • FIG. 3 shows a second communication device according to an example of the invention
  • FIG. 4 shows a method for a second communication device according to an example of the invention
  • FIG. 5 illustrates a wireless communication system according to an example of the invention.
  • sequence set C also known as a constellation
  • DMRS-less sequence design is that the maximum cross-correlation among modulation symbols in sequence set C should be ideally minimized or at least not-too- large for error-rate performance.
  • the impact of cross-correlation on error rate performance is nonlinear in that the pairwise error probability between two sequences is barely changing with a correlation between 0 and 0.5 and is significantly increasing with a correlation above 0.8.
  • QPSK modulated gold sequence it has been proposed to use QPSK modulated gold sequence.
  • sequences generated by exponentiating quadratic forms has been proposed. That is, a sequence length M is decomposed as where p ⁇ ⁇ • •• ⁇ p n are the n unique prime factors, each of order m r , the Z-th element of a modulation symbol is constructed as where
  • • 1 is a vector obtained from I based on a one-to-one mapping, i.e. where elements in GF(pTM fc ) are represented by vectors of m k entries in GF(p fe ), i.e., (GF(p fe ) represents a number within the set ⁇ 0,1, ... , p k - 1 ⁇ , is a vector of length m k with element within the set ⁇ 0, 1, ... p k - 1 ⁇ ).
  • the mapping from transmitted bits to the pair (S, k) can be any arbitrary pre-defined method.
  • an objective of examples of the invention is to provide a solution to generate constellation, i.e., sequence set C of sequences, with the structure of Eq. (1) while also achieving low PAPR.
  • a constellation of size 2 N i.e., there are 2 N sequences in the sequence set C
  • 2 N modulation symbols i.e., sequences
  • the selection of the 2 N modulation symbols may be based on a pre-defined rule that takes into account how the generated sequences are mapped to time-frequency resources, e.g. one or more DFT-s- OFDM symbols, such that the resultant DFT-s-OFDM symbols generated by the selected 2 N modulation symbols can have low PAPR.
  • Fig. 1 shows a first communication device 100 according to an example of the invention.
  • the first communication device 100 comprises a processor 102, a transceiver 104 and a memory 106.
  • the processor 102 may be coupled to the transceiver 104 and the memory 106 by communication means 108 known in the art.
  • the first communication device 100 may further comprise an antenna or antenna array 110 and/or a wired communication interface 112 coupled to the transceiver 104, which means that the first communication device 100 may be configured for communications in a communication system. That the first communication device 100 may be configured to perform certain actions can in this disclosure be understood to mean that the first communication device 100 comprises suitable means, such as e.g. the processor 102 and the transceiver 104, configured to perform said actions.
  • the processor 102 of the first communication device 100 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.
  • the memory 106 of the first communication device 100 may be a read-only memory, a random access memory, or a non-volatile random access memory (NVRAM).
  • NVRAM non-volatile random access memory
  • the transceiver 104 of the first communication device 100 may be a transceiver circuit, a power controller, an antenna, or an interface which communicates with other modules or devices.
  • the transceiver 104 of the first communication device 100 may be a separate chipset or being integrated with the processor 102 in one chipset. While in some examples, the processor 102, the transceiver 104, and the memory 106 of the first communication device 100 are integrated in one chipset.
  • the first communication device 100 is configured to determine a sequence x of length M based on a plurality of information bits, where M is an integer and M > 1 .
  • M - 1 is an index of each element x( ⁇ ) in the sequence x, and the m number of variables comprises a variable l ⁇ , where a value of the variable equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0 .
  • the first communication device 100 is further configured to transmit a signal 510 onto the N RB number of resource blocks, wherein the signal 510 is based on the sequence x.
  • the signal 510 may be transmitted to a second communication device 300 over a radio channel as illustrated in Fig. 5.
  • a quadratic polynomial having m number of variables may e.g. be the polynomial is 1 T S1 + k T Dl in Eq. (1), and the m number of variables are the m number of entries of vector 1.
  • the quadratic polynomial includes first-order terms k T Dl and second-order terms 1 T S1.
  • the second order terms are terms of variable l hi and l hz , i.e., l hl l hz .
  • Each term l hl l hz has a coefficient that equals to the entry of S on the /i ⁇ -th row and /i 2 -th column. Since S is symmetric matrix, the coefficient can also be the entry of S on the /i ⁇ -th column and /i 2 -th row.
  • Fig. 2 shows a flow chart of a corresponding method 200 which may be executed in a first communication device 100, such as the one shown in Fig. 1.
  • the method 200 comprises determining 202 a sequence x of length M based on a plurality of information bits, where M is an integer and M > 1.
  • M - 1 is an index of each element x( ⁇ ) in the sequence x
  • the m number of variables comprises a variable l ⁇ , where a value of the variable equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0.
  • the method 200 further comprises transmitting 204 a signal 510 onto the N RB number of resource blocks, wherein the signal 510 is based on the sequence x.
  • Fig. 3 shows a second communication device 300 according to an example of the invention.
  • the second communication device 300 comprises a processor 302, a transceiver 304 and a memory 306.
  • the processor 302 is coupled to the transceiver 304 and the memory 306 by communication means 308 known in the art.
  • the second communication device 300 may be configured for both wireless and wired communications in wireless and wired communication systems, respectively.
  • the wireless communication capability is provided with an antenna or antenna array 310 coupled to the transceiver 304, while the wired communication capability is provided with a wired communication interface 312 coupled to the transceiver 304. That the second communication device 300 is configured to perform certain actions can in this disclosure be understood to mean that the second communication device 300 comprises suitable means, such as e.g. the processor 302 and the transceiver 304, configured to perform said actions.
  • the processor 302 of the second communication device 300 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.
  • the memory 306 of the second communication device 300 may be a read-only memory, a random access memory, or a NVRAM.
  • the transceiver 304 of the second communication device 300 may be a transceiver circuit, a power controller, an antenna, or an interface which communicates with other modules or devices.
  • the transceiver 304 of the second communication device 300 may be a separate chipset or being integrated with the processor 302 in one chipset. While in some examples, the processor 302, the transceiver 304, and the memory 306 of the second communication device 300 are integrated in one chipset.
  • the second communication device 300 is configured to receive a signal 510 mapped onto N RB number of resource blocks, where N RB > 0.
  • the signal may be received from a first communication device 100 as illustrated in Fig. 5.
  • the received signal 510 is based on a sequence x of length M determined based on a plurality of information bits, where M is an integer and M > 1.
  • M is an integer and M > 1.
  • the m number of variables comprises a variable l ⁇ , where a value of the variable l ⁇ equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0.
  • the second communication device 300 is further configured to determine the plurality of information bits based on the received signal 510.
  • Fig. 4 shows a flow chart of a corresponding method 400 which may be executed in a second communication device 300, such as the one shown in Fig. 3.
  • the method 400 comprises receiving 402 a signal 510 mapped onto N RB number of resource blocks, where N RB > 0.
  • the received signal is based on a sequence x of length M determined based on a plurality of information bits, where M is an integer and M > 1.
  • M is an integer and M > 1.
  • the m number of variables comprises a variable l ⁇ , where a value of the variable l ⁇ equals to I modulo a prime factor p t , where the prime factor p t is a prime factor of a number of subcarriers in N RB number of resource blocks, where N RB > 0.
  • the method 400 comprises determining 404 the plurality of information bits based on the received signal 510.
  • the receiver of the second communication device 300 may consider the received signal 510 as the received sequence, or determine the received sequence based on the received signal 510 by at least one of the following procedures for lower detection complexity:
  • the receiver can detect the cover code as the one corresponding to the received sequence with the largest power.
  • Fig. 5 illustrates a communication system 500, such as 3GPP 5G also known as new radio (NR), according to a non-limiting example of the invention.
  • the communication system 500 comprises a first communication device 100 and a second communication device 300 configured to operate and interact in the communication system 500.
  • the communication system 500 shown in Fig. 5 only comprises one first communication device 100 and one second communication device 300.
  • the communication system 500 may comprise any number of first communication devices 100 and any number of second communication devices 300 without deviating from the scope of the invention.
  • the first communication device 100 and a second communication device 300 are illustrated as a UE and a gNB, respectively, but the reverse case is also possible.
  • the first communication device 100 transmits a signal 510, e.g.
  • the signal 510 is generated based on the sequence x according to examples of the invention.
  • the second communication device 300 receives the transmitted signal 510, and demodulates and decodes the received signal 510 so as to determine the information bits of the sequence x.
  • the prime factor p t may be selected to satisfy one of the following:
  • p t is the largest prime factor of the number of REs/subcarriers in one DFT-s-OFDM symbol to which the modulated symbol is mapped;
  • a value of the prime factor p t is any of: 2, 3, or the largest prime factor of all prime factors of the number of subcarriers in the N RB number of resource blocks.
  • Another possible case is when p t is another prime factor of the number of REs/subcarriers in one DFT-s-OFDM symbol to which the modulated symbol is mapped. This case can also achieve low PAPR but not as low as the previous cases.
  • the matrix S in Eq. (1) is symmetric block diagonal with the last block being of size l x l which may be understood as that the quadratic polynomial comprises a plurality of second-order terms of the m number of variables, i.e., terms of l hl l hz where l hi and l hz are the /i ⁇ -th and /i 2 -th entries of 1, respectively, .
  • a coefficient of each second-order term that is determined by the variable l ⁇ and one other variable in the m number of variables i.e., the coefficient of term l 1 l hz where h 2 e ⁇ 1,2, and l ⁇ and l hz are not the same entry in 1
  • a coefficient of a second-order term of the variable l ⁇ i.e., the coefficient of term is within the set of values ⁇ 0,1, - 1 ⁇ .
  • the quadratic polynomial comprises a plurality of first-order terms of the m number of variables, i.e., terms of l h where l h is the Zi-th entry of 1, and a coefficient of a first-order term of the variable l ⁇ (i.e., the coefficient of term l ⁇ ) is an integer within the set of values ⁇ 0,1, ..., p t - 1 ⁇ .
  • a constellation part of a larger constellation different selection rules for determining 2 N low PAPR modulation symbols may be applied.
  • the coefficient of the first-order term of the variable l ⁇ is an integer within the set of values ⁇ 1,2, ... p t - 1 ⁇ , and the coefficient of the second-order term of the variable l ⁇ is 0.
  • the signal PAPR is very low compared to other possible values of the coefficients of the first-order term and the second-order term.
  • the last block of S is not 0.
  • the coefficient of the second-order term of the variable l ⁇ is within the set of values ⁇ 1,2, ... p t - 1 ⁇ . This selection results in higher PAPR performance than the previous selection but provides more modulation symbols.
  • N re 12N 0S N RB resource elements (there are 12 sub-carriers in one RB in 5G).
  • N re are the n unique prime factors.
  • the N bits can be coded bits or uncoded bits. If there are more than N bits to be transmitted, the transmitter of the first communication device 100 may modulate every N bits into a modulation symbol and therefore generate multiple modulation symbols.
  • Each modulation symbol is generated based on a matrix S and a vector k according to Eq. (1), so that there are 2 N pairs of (S, k) to generate all of the 2 N modulation symbols in the constellation C.
  • the mapping from transmitted bits to (S, k) can be any arbitrary pre-defined method. Modifying the construction in Eq. (1), the sequences are constructed as (the Z-th element of x s k ) (4) where
  • S is a symmetric block diagonal matrix.
  • the size of the last block in S is 1 x 1, see Appendix 1 for detailed structure of S.
  • T is the normalization constant if needed.
  • the value of p t determines modulation symbols with periodic and successive repetition of at least p t entries.
  • p 1; p 2 , -> Pn can be any order of prime factors of N re .
  • the last element of l equals to Z mod p t in Eq. (4).
  • it can be any other fixed position of 1 instead of the last position, e.g., the w-th element of 1 equals to I mod p t .
  • the w-th element of k and the w-th diagonal element of S should be in Z Pt .
  • each DFT-s-OFDM symbol can be identified with the symbol repetition mapping using a DFT or Zadoff-Chu sequence, which acts as a window function. Therefore, the PAPR of each DFT-s-OFDM symbol is very low.
  • the symmetric matrix S is block diagonal matrix and can be written
  • the modulation symbol is split in multiple segments to match the number of sub-carriers in one DFT-s-OFDM symbol which may be assumed to be 12N RB , where N RB is the number of RBs.
  • N RB is the number of RBs.
  • p t is selected to be a factor of 12N RB , the resource allocation to the
  • t can then be shown that after DFT p recoc
  • the spreading sequence is a DFT sequence, which if in addition is not the all-one sequence. • If 0 , the spreading sequence is a quadratic polynomial phase sequence which can be identified as a Zadoff-Chu sequence.
  • the constellations are constructed by Eq. (4) and transmitted over 1 RB and 14 DFT-s-OFDM symbols.
  • the modulation symbols are indexed such that they form 3 different groups of PAPR levels.
  • the constellation includes all modulation symbols in these three groups.
  • Bandwidth 1 RB and one modulation symbol mapped on one RB:
  • one modulation symbol is mapped on one RB and N os e ⁇ 1,2,3, ...,14 ⁇ DFT-s-OFDM symbols, i.e. , the length of modulation symbol is 12/V 0S .
  • the constellation size is 2 N where the number of bits conveyed by one modulation symbol is N e ⁇ 1,2,3, ...,11 ⁇ .
  • p t 3. The mappings in Eq. (3) for different N os are listed in Table 2.
  • GF Galois Fields
  • the last Galois Field (Z 3 ) in Table 2 can be other primes (denoted as p tl ) in the prime factors of 127V RB , e.g., the largest prime of 12N RB .
  • Bandwidth M RB > 1 RBs and one modulation symbol mapped on N RB ⁇ M RB RBs:
  • the same constellation in Option 1 and 2 as above can be reused.
  • the bits b llt b 10 , ect. are set to zero. If there are more than 11 bits transmitted in x, additional bit multiplexed with additional basis matrix can be added to P and/or additional bits can be transmitted in b ⁇ / 0 . Moreover, other order of information bits is also feasible.
  • p t may be a prime factor of 12N RB .
  • f is any factor of 12m RB and f ⁇ 12N RB .
  • PAPR of the signal is very low (similar to group 1 in Fig. 6).
  • a larger constellation size can be achieved in this case.
  • the proposed constellation design according to examples of the invention does not result in additional receiver complexity because the selection of 2 N pairs of (S, k) in Eq. (4) does not introduce extra encoding complexity compared to any other selection.
  • Baseline-Maximum likelihood detection This is the highest complex detection method but with optimum performance, which requires the receiver to compute the summation of correlation between received signals on each receiver (Rx) antenna and modulation symbols in the constellation.
  • N bits are transmitted on N RB RBs and N os DFT-s-OFDM symbols, one can select modulation symbol with length N re smaller than 12N RB N 0S and the constellation size is 2 N .
  • the length-/V re modulation symbol is mapped in frequency first manner to the first N re REs in the total of the 12N RB N 0S REs, then the remaining REs within the N RB RBs and N os DFT-s-OFDM symbols are filled by repetition of the same modulation symbol.
  • the receiver can first combine the — — — received modulation symbols by adding them together for each Rx antenna.
  • each correlation is reduced by because the modulation symbol length is reduced.
  • extra bits can be conveyed by cover code of the repetitions, i.e., a cover code is multiplexed with each repetition and the cover code is determined by the extra bits.
  • one or more extra bit can be used to determine the cover code of the repetitions, e.g., [1 ,1 , 1 ,1 , 1 ,1], [1 , -1 ,1 , -1 ,1 ,- 1 ,1], It is desired to select the cover code from BPSK or QPSK symbols to reduce the combination complexity. For example, it can be row/column of Hadamard matrix with 1 and - 1. Generally, this example may be formulated that the first communication device 100 generates the signal 510 based on multiplexing the sequence x with a cover code, and the cover code is a sequence comprising of 1 :s or determined by the plurality of information bits.
  • the modulation symbol can be express as Kronecker product(s) of a QPSK sequence and one or more other sequences. In this case, the receiver can detect the other sequences and then detect the QPSK sequence. When detecting the QPSK sequence, multiplication is not needed because inner product with QPSK symbol sequence is equivalent to complex addition/subtraction.
  • Receiver signal combination If there are too many receiver antennas, i.e. N Rx Rx antennas, the receiver complexity will be very high because it is proportional to the number of receiver antennas. So, we can combine the received signal 510 before correlation operation, which may be after the combination of repetition, detection of cover code and/or detection of nonbinary sequence. Assuming the received signal on the j-th antenna is y; is a 1 x N Rx vector, the combined signal can be the eigenvector of corresponding to the largest eigenvalue.
  • Combined signal of any two signal a and b can be the eigenvector of a H a + b H b with the largest eigenvalue multiplexed with square root of total power of a and b, which can be expressed as
  • One or more of the complexity reduction methods described above can be used together to achieve good trade-off between performance and receiver complexity.
  • U V®I Pt
  • V is a ⁇ x unitary matrix
  • ® is the Kronecker product
  • I Pt is p t x p t identity matrix or any p t x p t matrix satisfies
  • I Pt b is a DFT or ZC sequence if b is a DFT or ZC sequence.
  • the distance e.g., Euclidean distance, between modulation symbols of detected constellation and any equivalent constellation of examples of this invention, is smaller than a threshold, it can be considered that they are equivalent.
  • t a transmitter may use a constellation with the same distance properties and length-p t symbol repetition as the constellation design disclosed in the examples of this invention for the given size 2 N and dimension N re .
  • Fig. 7 shows the comparison of the distribution of PAPR, i.e. complementary cumulative distribution function (CCDF) on the y-axis, for the proposed constellation according to examples of the invention compared to conventional solutions and QPSK symbols in NR PUSCH for a constellation size of 2 11 symbols of vector length 168 transmitted over 1 RB and 14 DFT-s-OFDM symbols.
  • PAPR of the proposed constellation is very small compared to other three cases, i.e. sequence generated according to Eq. (1) in a conventional solution, QPSK modulated gold sequence in conventional solution, and QPSK symbols in NR PUCCH format 3.
  • the first communication device 100 and/or the second communication device 300 in this disclosure includes but is not limited to: a UE such as a smart phone, 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 having a wireless communication function, a computing device or another processing device connected to a wireless modem, an in-vehicle device, a wearable device, an integrated access and backhaul node (IAB) such as mobile car or equipment installed in a car, a drone, a device-to-device (D2D) device, a wireless camera, a mobile station, an access terminal, an user unit, a wireless communication device, a station of wireless local access network (WLAN), a wireless enabled tablet computer, a laptop-embedded equipment, an universal serial bus (USB) dongle, a wireless customerpremises equipment (CPE), and/or a chipset.
  • a UE
  • the UE may further be referred to as a mobile telephone, a cellular telephone, a computer tablet or laptop with wireless capability.
  • the UE in this context may e.g. be portable, pocket- storable, hand-held, computer-comprised, or vehicle-mounted mobile device, enabled to communicate voice and/or data, via the radio access network, with another entity, such as another receiver or a server.
  • the UE can be a station (STA), which is any device that contains an IEEE 802.11 -conformant media access control (MAC) and physical layer (PHY) interface to the wireless medium (WM).
  • STA station
  • the UE may also be configured for communication in 3GPP related LTE and LTE-Advanced, in WiMAX and its evolution, and in fifth generation wireless technologies, such as NR.
  • the first communication device 100 and/or the second communication device 300 in this disclosure includes but is not limited to: a NodeB in wideband code division multiple access (WCDMA) system, an evolutional Node B (eNB) or an evolved NodeB (eNodeB) in LTE systems, or a relay node or an access point, or an in-vehicle device, a wearable device, or a gNB in the fifth generation (5G) networks.
  • the first communication device 100 and/or the second communication device 300 herein may be denoted as a radio network access node, an access network access node, an access point, or a base station, e.g.
  • radio base station which in some networks may be referred to as transmitter, “gNB”, “gNodeB”, “eNB”, “eNodeB”, “NodeB” or “B node”, depending on the technology and terminology used.
  • the radio network access nodes may be of different classes such as e.g. macro eNodeB, home eNodeB or pico base station, based on transmission power and thereby also cell size.
  • the radio network access node can be a station (STA), which is any device that contains an IEEE 802.11 -conformant MAC and PHY interface to the wireless medium.
  • the radio network access node may also be a base station corresponding to the 5G wireless systems.
  • any method according to examples of the invention may be implemented in a computer program, having code means, which when run by processing means causes the processing means to execute the steps of the method.
  • the computer program is included in a computer readable medium of a computer program product.
  • the computer readable medium may comprise essentially any memory, such as a ROM (Read-Only Memory), a PROM (Programmable Read-Only Memory), an EPROM (Erasable PROM), a Flash memory, an EEPROM (Electrically Erasable PROM), or a hard disk drive.
  • examples of the first communication device 100 and the second communication device 300 comprises the necessary communication capabilities in the form of e.g., functions, means, units, elements, etc., for performing the solution.
  • Examples of other such means, units, elements and functions are: processors, memory, buffers, control logic, encoders, decoders, rate matchers, de-rate matchers, mapping units, multipliers, decision units, selecting units, switches, interleavers, de-interleavers, modulators, demodulators, inputs, outputs, antennas, amplifiers, receiver units, transmitter units, DSPs, MSDs, TCM encoder, TCM decoder, power supply units, power feeders, communication interfaces, communication protocols, etc. which are suitably arranged together for performing the solution.
  • the processor(s) of the first communication device 100 and the second communication device 300 may comprise, e.g., one or more instances of a Central Processing Unit (CPU), a processing unit, a processing circuit, a processor, an Application Specific Integrated Circuit (ASIC), a microprocessor, or other processing logic that may interpret and execute instructions.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • microprocessor may thus represent a processing circuitry comprising a plurality of processing circuits, such as, e.g., any, some or all of the ones mentioned above.
  • the processing circuitry may further perform data processing functions for inputting, outputting, and processing of data comprising data buffering and device control functions, such as call processing control, user interface control, or the like.
  • S is a symmetric matrix of size m x m generated as following where
  • S® is a matrix of size mt x m h except S (2) which is of size (m 2 - 1) x (m 2 - 1) whose entries are integers in Z p ..
  • the S® in different S blkdiag are selected such that to have the largest minimum rank difference in modulo pt arithmetic. To achieve this they can be notably selected from the Delsart Goethal (DG) sets defined as follows, which can also be found in [2],
  • the Delsarte-Goethals sets DG(m, r) are defined recursively as where m and r are integers.
  • the extension is the set of all m x m symmetric matrices with binary diagonal entries and off-diagonal entries equal to either 0, 1/2, 1 or 3/2.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne des séquences à faible PARR pour un système de communication, tel que 3GPP NR et LTE. Par conséquent, une solution est fournie pour générer des constellations, c'est-à-dire, l'ensemble de séquences C de séquences, avec un faible PAPR. Afin de générer une constellation de taille 2 N (c'est-à-dire, il y a 2N séquences dans l'ensemble de séquences C), on peut d'abord générer une constellation plus grande de taille K > 2 N , puis sélectionner 2 N symboles de modulation (c'est-à-dire des séquences) de cette constellation plus grande pour garantir une bonne performance de corrélation croisée maximale. En particulier, la sélection des 2 N symboles de modulation peut être basée sur une règle prédéfinie qui tient compte de la manière dont les séquences générées sont mappées sur des ressources temps-fréquence, par exemple un ou plusieurs symboles DFT-s-OFDM, de telle sorte que les symboles DFT-s-OFDM résultants générés par les 2 N symboles de modulation sélectionnés peuvent avoir un faible PAPR.
PCT/EP2020/078902 2020-10-14 2020-10-14 Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication WO2022078590A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2020/078902 WO2022078590A1 (fr) 2020-10-14 2020-10-14 Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2020/078902 WO2022078590A1 (fr) 2020-10-14 2020-10-14 Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication

Publications (1)

Publication Number Publication Date
WO2022078590A1 true WO2022078590A1 (fr) 2022-04-21

Family

ID=72964647

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2020/078902 WO2022078590A1 (fr) 2020-10-14 2020-10-14 Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication

Country Status (1)

Country Link
WO (1) WO2022078590A1 (fr)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HUAWEI ET AL: "Short PUCCH for UCI of up to 2 bits", vol. RAN WG1, no. Prague, Czech Republic; 20171009 - 20171013, 3 October 2017 (2017-10-03), XP051352571, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg_ran/WG1_RL1/TSGR1_90b/Docs/> [retrieved on 20171003] *
NEC: "Discussion on UL Signals and Channels in NR-U", vol. RAN WG1, no. Chengdu, China; 20181008 - 20181012, 28 September 2018 (2018-09-28), XP051518216, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg%5Fran/WG1%5FRL1/TSGR1%5F94b/Docs/R1%2D1810811%2Ezip> [retrieved on 20180928] *

Similar Documents

Publication Publication Date Title
US11611418B2 (en) Phase tracking reference signal processing method and apparatus
US11032837B2 (en) Wireless device and a network node for a wireless communication system
KR101516100B1 (ko) 무선 통신 장치, 무선 통신 방법 및 집적 회로
US10158404B2 (en) Data transmission method, transmit end device, and receive end device
JP5635174B2 (ja) 通信装置及び送信方法
KR101444977B1 (ko) 이동국 및 송신 방법
US10530541B2 (en) Transmitting device, receiving device and methods thereof
CN115189855A (zh) 信号处理的方法和装置
US20150289275A1 (en) Mobile station device and communication method
KR101710209B1 (ko) 무선 통신 시스템에서 상향링크 제어 신호 전송 방법 및 장치
WO2018228460A1 (fr) Procédé et appareil de traitement de signal de référence de suivi de phase
WO2022078590A1 (fr) Séquences avec des rapports de puissance de crête sur puissance moyenne (papr) faibles pour un système de communication
KR20180081424A (ko) 무선 통신 시스템에서 피크 대 평균 전력 비율 감소를 위한 장치 및 방법
WO2020164099A1 (fr) Procédé et appareil de séquencement
US11743087B2 (en) Devices and methods for multicarrier modulation schemes
US20240195559A1 (en) High capacity dmrs sequences for a communication system
US11121901B2 (en) Symbols incorporation scheme for DFT-S-OFDM
WO2021063494A1 (fr) Premier dispositif de communication pour ofdm précodé par dft avec des séquences d&#39;étalement orthogonales
WO2021115618A1 (fr) Premier et second dispositifs de communication pour transmissions sans pilote dans un système de communication
WO2024037716A1 (fr) Signal dft-s-ofdm avec extension de spectre

Legal Events

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

Ref document number: 20793598

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20793598

Country of ref document: EP

Kind code of ref document: A1