Transmission and reception method and apparatus for reducing peak to average power ratio in orthogonal frequency division multiplexing system

Abstract

A transmission and reception method and apparatus for reducing a PAPR in an orthogonal frequency division multiplexing (OFDM) system are provided. A transmission method includes performing constellation rotation with respect to L input data symbols, performing L-point DFT spreading and circular extension on the constellation-rotated L data symbols to be K symbols, performing frequency domain (FD) windowing processing by multiplying the K circular-extended data symbols by a circular filter coefficient, and transmitting the processed data symbols.

Claims

1. A transmission method for reducing a peak-to-average power ratio (PAPR) in an orthogonal frequency division multiplexing (OFDM) system, the method comprising: performing a constellation rotation with respect to L input data symbols; performing an L-point discrete Fourier transform (DFT) spreading and circular extension on the L constellation-rotated data symbols to be K symbols; performing a frequency domain (FD) windowing processing by multiplying the K circular-extended data symbols by a circular filter coefficient; and transmitting the processed data symbols, wherein L denotes a number of data symbols to be transmitted through a single OFDM symbol, and K denotes a circular filter spreading (CFS)-OFDM spreading factor.

2. The method of claim 1, wherein, when binary phase shift keying (BPSK) is used as a constellation, an optimal phase value .sub.opt for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right).$

3. The method of claim 2, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the BPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L}{4},$ wherein i denotes a frequency index and j denotes a symbol index.

4. The method of claim 1, wherein, when QPSK is used as a constellation, an optimal phase value .sub.opt for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right),$ wherein L denotes the number of data symbols to be transmitted through a single OFDM symbol, and K denotes a CFS-OFDM spreading factor.

5. The method of claim 4, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the QPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L\mathrm{or}3L}{8},$ wherein i denotes a frequency index and j denotes a symbol index.

6. A transmitting apparatus in an orthogonal frequency division multiplexing (OFDM) system, the apparatus comprising: a transmission module configured to: perform a constellation rotation with respect to L input data symbols, execute an L-point discrete DFT spreading and a circular extension on the L constellation-rotated data symbols to be K symbols, and perform a frequency domain (FD) windowing processing by multiplying the K circular-extended data symbols by a circular filter coefficient, wherein L denotes a number of data symbols to be transmitted through a single OFDM symbol, and K denotes a circular filter spreading (CFS)-OFDM spreading factor.

7. The apparatus of claim 6, wherein, when binary phase shift keying (BPSK) is used as a constellation, an optimal phase value .sub.opt for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right).$

8. The apparatus of claim 7, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the BPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L}{4},$ wherein i denotes a frequency index and j denotes a symbol index.

9. The apparatus of claim 6, wherein, when QPSK is used as a constellation, an optimal phase value .sub.opt for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right),$ wherein L denotes the number of data symbols to be transmitted through a single OFDM symbol, and K denotes a CFS-OFDM spreading factor.

10. The apparatus of claim 9, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the QPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L\mathrm{or}3L}{8},$ wherein i denotes a frequency index and j denotes a symbol index.

11. A method for operating a base station in an orthogonal frequency division multiplexing (OFDM) system, the method comprising: performing a constellation rotation with respect to L input data symbols; performing an L-point discrete Fourier transform (DFT) spreading and circular extension on the L constellation-rotated data symbols to be K symbols; performing a frequency domain (FD) windowing processing by multiplying the K circular-extended data symbols by a circular filter coefficient; and transmitting the FD window processing performed data symbols, wherein L denotes a number of data symbols to be transmitted through a single OFDM symbol, and K denotes a circular filter spreading (CFS)-OFDM spreading factor.

12. The method of claim 11, wherein, when binary phase shift keying (BPSK) is used as a constellation, an optimal phase value for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right).$

13. The method of claim 12, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the BPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L}{4},$ wherein i denotes a frequency index and j denotes a symbol index.

14. The method of claim 11, wherein, when QPSK is used as a constellation, an optimal phase value .sub.opt for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right),$ wherein L denotes the number of data symbols to be transmitted through a single OFDM symbol, and K denotes a CFS-OFDM spreading factor.

15. The method of claim 14, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the QPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L\mathrm{or}3L}{8},$ wherein i denotes a frequency index and j denotes a symbol index.

16. A base station for an orthogonal frequency division multiplexing (OFDM) system, the base station comprising: a controller configured to: perform a constellation rotation with respect to L input data symbols, execute an L-point discrete DFT spreading and a circular extension on the L constellation-rotated data symbols to be K symbols, and perform a frequency domain (FD) windowing processing by multiplying the K circular-extended data symbols by a circular filter coefficient; and a transceiver configured to transmit the FD window processing performed data symbols, wherein L denotes a number of data symbols to be transmitted through a single OFDM symbol, and K denotes a circular filter spreading (CFS)-OFDM spreading factor.

17. The base station of claim 16, wherein, when binary phase shift keying (BPSK) is used as a constellation, an optimal phase value for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right).$

18. The base station of claim 17, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the BPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L}{4},$ wherein i denotes a frequency index and j denotes a symbol index.

19. The base station of claim 16, wherein, when QPSK is used as a constellation, an optimal phase value .sub.opt for the constellation rotation is determined to be an equation provided below: ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right),$ wherein L denotes the number of data symbols to be transmitted through a single OFDM symbol, and K denotes a CFS-OFDM spreading factor.

20. The base station of claim 19, wherein the constellation rotation is performed by applying a shift index (shiftindex) optimized in the QPSK with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as shown in an equation provided below: ${\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}$ $\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L\mathrm{or}3L}{8},$ wherein i denotes a frequency index and j denotes a symbol index.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:

(2) FIG. 1 illustrates a transmission and reception architecture based on a DFT-S-OFDM scheme;

(3) FIG. 2 illustrates a PAPR feature when CFS-OFDM, normal OFDM, and DFT-S-OFDM are applied respectively in an uplink of an OFDM system;

(4) FIG. 3 illustrates a transmission and reception architecture of CFS-OFDM, which is an extended version of DFS-S-OFDM;

(5) FIG. 4 illustrates an example of a structure of a circular filter spreader in a CFS-OFDM transmitting end;

(6) FIG. 5 illustrates an example of a structure of a circular filter de-spreader in a CFS-OFDM receiving end;

(7) FIG. 6 illustrates another example of a structure of a circular filter de-spreader in a CFS-OFDM receiving end;

(8) FIG. 7 illustrates a structure of a CFS-OFDM transmitting end;

(9) FIG. 8 illustrates a structure of a transmitting end of a rotated constellation CFS-OFDM according to embodiments of the present disclosure;

(10) FIG. 9 illustrates a structure of a transmitting end of a rotated constellation CFS-OFDM according to other embodiments of the present disclosure;

(11) FIG. 10 is a flowchart illustrating a method of optimizing a filter value and a phase value in rotated constellation CFS-OFDM according to embodiments of the present disclosure;

(12) FIG. 11 illustrates an example of a method of allocating a resource in rotated constellation CFS-OFDM according to embodiments of the present disclosure;

(13) FIG. 12 illustrates a PAPR feature in rotated constellation CFS-OFDM according to embodiments of the present disclosure; and

(14) FIGS. 13 to 16 illustrate PAPR features in the rotated constellation CFS-OFDM according to embodiments of the present disclosure.

DETAILED DESCRIPTION

(15) FIGS. 1 through 16, discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged telecommunication devices.

(16) In the following description of embodiments of the present disclosure, a detailed description of known functions or configurations incorporated herein will be omitted when it is determined that the detailed description thereof may unnecessarily obscure the subject matter of the present disclosure.

(17) First, a transmission and reception architecture in a DFT-S-OFDM scheme and a transmission and reception architecture in a CFS-OFDM scheme will be described to help the understanding of the present disclosure, and embodiments of the present disclosure will be described.

(18) FIG. 1 is a diagram illustrating a transmission and reception architecture based on a DFT-S-OFDM scheme, and illustrates an example of the transmission and reception architecture based on DFT-S-OFDM, that is, SC-FDMA that is used in an uplink of an LTE system.

(19) Referring to FIG. 1, in the uplink of the LTE system, a terminal operates as a transmitting end 110 and a base station operates as a receiving end 130. When the base station allocates L consecutive subcarrier resources to the terminal, the transmitting end 110 inputs L QAM data symbols into L-point DFT for spreading, maps the same to IFFT index positions corresponding to the allocated consecutive subcarriers, and fills the remaining area with 0, thereby performing N-point IFFT. Subsequently, an operation of applying a CP, an operation of applying pulse shaping as occasion needs, or the like are the same as the existing OFDM transmission architecture. The receiving end 130 operates in reverse order of operations of the transmitting end 110.

(20) FIG. 2 is a diagram illustrating a PAPR feature when CFS-OFDM, normal OFDM, and DFT-S-OFDM are applied respectively in the uplink of an OFDM system. The example of FIG. 2 illustrates PAPR complementary cumulative distribution functions (CCDF) of CFS-OFDM, normal OFDM, and DFT-S-OFDM, respectively, when L=7, which means that seven QPSK data symbols are transmitted in seven subcarriers in the uplink of the OFDM system that uses 128-IFFT (that is, N=128). The reference numeral 201 indicates a CCDF of the CFS-OFDM, the reference numeral 203 indicates a CCDF of the normal OFDM, and the reference numeral 205 indicates a CCDF of the DFT-S-OFDM.

(21) A PAPR of a channel estimation preamble (a known signal without randomness), such as an uplink DM-RS in the LTE system, is designed to be in a 2 to 4 dB level. A PAPR of a DFT-S-OFDM symbol that is to transmit a data symbol is greater than or equal to 6 dB as shown in FIG. 2, and thus, back-off needs to be increased by adjusting an operation point of a PA to the PAPR of the DFT-S-OFDM symbol of a data transmission side. As a matter of course, the PAPR feature of the DFT-S-OFDM is better than the PAPR feature of pure OFDM, but may not reach the level of the PAPR feature of an RS. Also, the OFDM system for CIoT needs to support a low data transmission rate to use as little energy as possible. Therefore, in the case of the uplink, resource allocation can be performed based on a single subcarrier unit. Also, in the case of a CIoT terminal that requires a relatively higher data transmission rate, it is possible that a modulation and coding scheme (MCS) level can be raised, but a transmission band needs to be increased by performing per-tone channel bonding. The case also corresponds to a multi-tone transmission, and thus, can cause a drawback of a high PAPR, like the DFT-S-OFDM of FIG. 2. Therefore, to increase the PA efficiency of a terminal in the OFDM system, there is a desire for an OFDM uplink multi-access scheme that has a PAPR feature better than the existing DFT-S-OFDM. Particularly, in the case of the CIoT terminal, a feature of a low PAPR is strongly required to use a battery for years.

(22) FIG. 3 is a diagram illustrating a transmission and reception architecture of CFS-OFDM, which is an extended version of DFS-S-OFDM.

(23) Unlike the DFT-S-OFDM transmitting end 110 that uses an L-point DFT to transmit L symbols in FIG. 1, a CFS-OFDM transmitting end 310 of FIG. 3 uses a K-point circular filter as a spreader to transmit L symbols. Here, K denotes a CFS-OFDM spreading factor, and is a natural number greater than or equal to L (that is, KL). The circular filter spreader used in the CFS-OFDM is defined by Equation 1 as provided below:

(24) $\begin{array}{cc}\mathrm{Sd}={\left[s_{\mathrm{mn}}\right]}_{KL}\left[\begin{array}{c}{d}_0\\ d_1\\ \mathrm{.Math.}\\ d_{L-1}\end{array}\right],s_{\mathrm{mn}}=p_m{}^{-j^{\frac{2}{L}\mathrm{mn}}},\left(m=0,1,\mathrm{.Math.},K-1,n=0,1,\mathrm{.Math.},L-1\right)& \left[\mathrm{Equation}1\right]\end{array}$

(25) In Equation 1, d.sub.0, d.sub.1, . . . , and d.sub.L-1 denote L complex data symbols to be transmitted in a single OFDM symbol, and S denotes a KL matrix that performs circular filter spreading. p.sub.m denotes a complex number or a real number that does not depend on a column index n, which is referred to as a circular filter coefficient. A transmission power per data symbol can be normalized by limiting the circular filter coefficient to .sub.m=0.sup.K-1|p.sub.m|.sup.2=1. The circular filter coefficient can be referred to as a filter value.

(26) An L-point DFT spreader used in the DFT-S-OFDM can be defined by Equation 2 as provided below:

(27) $\begin{array}{cc}\mathrm{Wd}={\left[w_{\mathrm{mn}}\right]}_{LL}\left[\begin{array}{c}{d}_0\\ d_1\\ \mathrm{.Math.}\\ d_{L-1}\end{array}\right]w_{\mathrm{mn}}=\frac{1}{\sqrt{L}}{}^{-j^{\frac{2}{L}\mathrm{mn}}},\left(m,n=0,1,\mathrm{.Math.},L-1\right)& \left[\mathrm{Equation}2\right]\end{array}$

(28) In Equation 2, Wd denotes a DFT matrix for spreading. Through the comparison between Equation 1 and Equation 2, it is determined that the DFT-S-OFDM is a special case of the CFS-OFDM in which K=L and p.sub.m is a constant value of

(29) $\frac{1}{\sqrt{L}}.$
Also, like the example of the structure of a circular filter spreader of a transmitting end of FIG. 4, the CFS-OFDM reuses a DFT spreader of the DFT-S-OFDM, and can be embodied as an extended structure by adding the multiplication of a circular filter coefficient (p.sub.0, . . . , p.sub.k). The CFS-OFDM that is embodied in which K>L, can be converted into the DFT-S-OFDM by changing the setting of a circular filter coefficient to

(30) $p_m=\frac{1}{\sqrt{L}},$
(m=0, 1, . . . , L1), p.sub.m=0 (m=L, L+1, . . . , K).

(31) A CFS-OFDM receiving end 330 FIG. 3 operates in reverse order of the operations of the CFS-OFDM transmitting end 310.

(32) FIG. 5 is a diagram illustrating an example of a configuration of a circular filter de-spreader, that is, K-point circular filter of the CFS-OFDM receiving end 330. The CFS-OFDM receiving end 330 outputs final complex symbol data d.sub.0, d.sub.1, . . . , and d.sub.L-1, through the circular filter de-spreader, and subsequently, performs a demodulation process. In the CFS-OFDM receiving end 330, the conversion from CFS-OFDM into DFT-S-OFDM can be also performed by setting a circular filter coefficient, like the CFS-OFDM transmitting end 310. Also, the circular filter coefficient q.sub.m (m=0, 1, . . . , K) in the CFS-OFDM receiving end 330 can be set to be Hermitian matrix (that is, a complex conjugate matrix) of the circular filter matrix in the CFS-OFDM transmitting end 310 (i.e., q.sub.m=p.sub.m*), as shown in the example of FIG. 6, but the circular filter coefficient can be changed to another circular filter coefficient q.sub.m based on a reception algorithm.

(33) The CFS-OFDM transmission and reception architecture of FIG. 3 can be configured in a form that substitutes a spreader/de-spreader for the existing DFT spreader/de-spreader, and other elements in the CFS-OFDM transmission and reception architecture can reuse the elements of the existing DFT-S-OFDM architecture.

(34) To reduce a PAPR in the OFDM system, a /2-binary phase shift keying (BPSK) or /4-quadrature phase shift keying (QPSK) modulation scheme, or a scheme of combining a pulse of the CFS-OFDM with a different pulse such as Gaussian, Prolate, Kaiser, or the like, instead of RRC, and transmitting the same, can be considered. However, a technology that derives an optimal pulse pattern by defining a relationship between constellation rotation and pulse shaping of the CFS-OFDM, or a technology that takes into consideration the orthogonality of a frequency domain pulse sample has not yet been proposed.

(35) To increase the PA efficiency of a terminal in the OFDM system, a PAPR of a data symbol having randomness needs to be lowered to a PAPR level of a low PAPR preamble (e.g., an LTE UL DM-RS) for uplink channel estimation. Therefore, embodiments of the present disclosure propose a scheme of dramatically decreasing a PAPR of an OFDM transmission symbol that transmits transmission data to be lower than that of the DFT-S-OFDM, without being dependent upon the corresponding transmission data having randomness, through a method of optimizing the constellation rotation and pulse shaping of the CFS-OFDM.

(36) To this end, proposed in the embodiments of the present disclosure are a technology for designing an optimal transmit waveform using an object function that is directly associated with a PAPR by reflecting a constellation, and optimized parameter values therefor. An embodiment of the present disclosure to be described herein proposes a modified CFS-OFDM scheme (hereinafter, referred to as a rotated constellation CFS-OFDM scheme) that further decreases a PAPR by modifying the phase of a modulation symbol in the existing CFS-OFDM, an optimal scheme for designing a transmit waveform in the rotated constellation CFS-OFDM scheme, and an optimal scheme for constellation rotation. Optimal parameters provided through the optimal schemes can be locally optimum values in constellation rotation, and can have features of increasing a PAPR performance in proportion to the amount of resource that is additionally used in comparison to the existing CF S-OFDM.

(37) First, variables used in the equations to be described for the descriptions of the present disclosure are defined as listed in Table 1 as below. Variables that are not defined in Table 1 provided below can comply with the definition in each equation.

(38) TABLE-US-00001 TABLE 1 Variables Descriptions L The number of data symbols to be transmitted through a single OFDM symbol K CFS-OFDM spreading factor N OFDM IDFT size W.sub.L L-point DFT matrix N-point IDFT matrix d[n] L-by-1 data symbol vector S K-by-L circular filter matrix having (S).sub.i,j as an element ${\left(S\right)}_{i,j}=p_i{e}^{-j\frac{2\left(i-1\right)\left(j-1\right)}{L}}$ Here, i denotes a frequency index, j denotes a symbol index, and p.sub.i denotes an i.sup.th component of a circular filter vector x[n] Transmit-vector $A\stackrel{}{=}S[\begin{array}{c}{W}_L\\ 0_{N-L\mathrm{by}L}\end{array}$ $\mathrm{Overall}\mathrm{pulse}\mathrm{shaping}\mathrm{matrix}{\mathrm{having}\left(A\right)}_{i,j}=\frac{1}{\sqrt{N}}\underset{k=1}{\overset{K}{.Math.}}{p}_k{e}^{j2\left(k-1\right)\left(\frac{\left(i-1\right)}{N}-\frac{\left(j-1\right)}{L}\right)}$ $\underset{\_}{p}\stackrel{}{=}\left[\begin{array}{c}{p}_1\\ p_2\\ \mathrm{.Math.}\\ p_K\end{array}\right]$ Circular filter vector S.sub.l Transmit-waveform vector of 1.sup.st symbol

(39) When designing a transmit waveform of CFS-OFDM, embodiments of the present disclosure derive a circular filter vector p indicating an optimal circular filter that decreases a PAPR and maintains an orthogonality between data. The circular filter vector p that minimizes a PAPR is expressed by Equation 3 as provided below.

(40) $\begin{array}{cc}\underset{\underset{\_}{p}}{\mathrm{minimize}}\mathrm{PPAR}& \left[\mathrm{Equation}3\right]\end{array}$

(41) subject to satisfy orthogonality condition

(42) 0$\underset{\underset{\_}{p}}{\mathrm{minimize}}\mathrm{Pr}\left(\frac{\underset{1iN}{\max }{.Math.x_i.Math.}^2}{\frac{1}{N}\mathrm{��}\left[{.Math.\underset{\_}{x}\left[n\right].Math.}^2\right]}>y\right)$$\mathrm{subject}\mathrm{to}{S}^{}S=I$

(43) In Equation 3, Pr( ) indicates a probability that a PAPR is higher than a predetermined threshold value (y) for reducing a PAPR.

(44) To reduce a PAPR, a necessary and sufficient condition of a circular filter that maintains the orthogonality between data, which is given as a constraint condition, is defined by Equation 4 as provided below.

(45) $\begin{array}{cc}\underset{i^{}=0}{\overset{.Math.\frac{N}{L}.Math.}{.Math.}}{.Math.p_{L.Math.i^{}+i}.Math.}^2=\mathrm{const},i\left\{1,2,\mathrm{.Math.},L\right\}.& \left[\mathrm{Equation}4\right]\end{array}$

(46) Also, in embodiments of the present disclosure, an example of a condition associated with a KL value can be listed in Table 2 as provided below. p.sub.1, p.sub.2, . . . , and p.sub.K in Table 2 are components of a circular filter vector indicating a circular filter.

(47) TABLE-US-00002 TABLE 2 # of free K-L variables Free variables conditions 1 0 ${.Math.p_1.Math.}^3={.Math.p_K.Math.}^3=\frac{\mathrm{const}}{2}$ 2 1 (|p.sub.1|.sup.2) |p.sub.2|.sup.3 = |p.sub.K2|.sup.3 = const |p.sub.2|.sup.2, |p.sub.K|.sup.2|p.sub.1|.sup.2 3 1 (|p.sub.1|.sup.2) ${.Math.p_3.Math.}^2={.Math.p_{K-2}.Math.}^2=\mathrm{const}-{.Math.p_1.Math.}^2,{.Math.p_K.Math.}^2={.Math.p_1.Math.}^3$${.Math.p_2.Math.}^2={.Math.p_{K-1}.Math.}^2=\frac{\mathrm{const}}{2}$ 4 2 (|p.sub.1|.sup.2 , |p.sub.2|.sup.2) |p.sub.3|.sup.2 = |p.sub.K2|.sup.2 = const |p.sub.2|.sup.2, |p.sub.4|.sup.2 = |p.sub.K3|.sup.2 = const |p.sub.1|.sup.2, |p.sub.K1|.sup.2 = |p.sub.2|.sup.2 .Math. |p.sub.K|.sup.2 = |p.sub.1|.sup.2 5 2 (|p.sub.1|.sup.2 , |p.sub.2|.sup.2) ${.Math.p_4.Math.}^2={.Math.p_{K-3}.Math.}^2=\mathrm{const}-{.Math.p_2.Math.}^2,{.Math.p_3.Math.}^3={.Math.p_{K-4}.Math.}^2=\mathrm{const}-{.Math.p_3.Math.}^2,{.Math.p_{K-1}.Math.}^2={.Math.p_2.Math.}^2,{.Math.p_K.Math.}^2={.Math.p_1.Math.}^2$${.Math.p_K.Math.}^2={.Math.p_{K-2}.Math.}^2=\frac{\mathrm{const}}{2}$

(48) Through Equation 4, an orthogonality condition of a circular filter with respect to every K and L can be calculated. Although not mentioned in embodiments of the present disclosure, the optimization for reducing a PAPR considers filters that satisfy orthogonality.

(49) FIG. 7 illustrates the structure of a CFS-OFDM transmitting end, and Equation 5 provided below expresses the transmitting end of FIG. 7 as a formula. The meaning of each variable illustrated in FIG. 7 is the same as the definition of Table 1, and Nc is the number of samples that is added as a CP is added. Also, the operations (subcarrier mapping, IDFT, CP adding) performed after circular filtering in FIG. 7 are the same as the publicly known operations performed in the OFDM system, and thus, the detailed descriptions thereof will be omitted.

(50) $\begin{array}{cc}\begin{array}{c}\underset{\_}{x}\left[n\right]=W_N^{}\left[\begin{array}{c}S\\ 0_{N-K\mathrm{by}L}\end{array}\right]\underset{\_}{d}\left[n\right]\\ =A\underset{\_}{d}\left[n\right]\\ =\underset{l=1}{\overset{L}{.Math.}}{d}_l\left[n\right]{\underset{\_}{s}}_l\end{array}\mathrm{where}{\underset{\_}{s}}_I\stackrel{}{=}{W}_N^{}\left({\underset{\_}{\tilde{w}}}_L^{\left(l\right)}\underset{\_}{p}\right)& \left[\mathrm{Equation}5\right]\end{array}$

(51) Equation 5 expresses a transmit vector x|n| of a final transmit signal using a data symbol d|n| vector and an overall pulse shaping matrix A. In Equation 5, O.sub.NK by L denotes 0 matrix in a size of NK by L, {tilde over (w)}.sub.L.sup.(l) denotes an element of a first column of an L-by-1 DFT matrix, and denotes the operator of element wise multiplication.

(52) In this instance, a PAPR can be expressed by Equation 6 as provided below, and the PAPR can be simply expressed as the last line of Equation 6 based on the similarity in structures between CFS-OFDM and SC-FDMA.

(53) $\begin{array}{cc}\begin{array}{c}\mathrm{Pr}\left(\frac{\underset{1iN}{\max }{.Math.x_i.Math.}^2}{\frac{1}{N}\mathrm{��}\left[{.Math.\underset{\_}{x}\left[n\right].Math.}^2\right]}>y\right)=1-\mathrm{Pr}\left(\frac{\underset{1iN}{\max }{.Math.x_i.Math.}^2}{\frac{1}{N}\mathrm{��}\left[{.Math.\underset{\_}{x}\left[n\right].Math.}^2\right]}y\right)\\ 1-{\mathrm{Pr}\left(\frac{\underset{1iN/L}{\max }{.Math.x_i.Math.}^2}{\frac{1}{N}\mathrm{��}\left[{.Math.\underset{\_}{x}\left[n\right].Math.}^2\right]}y\right)}^L\end{array}& \left[\mathrm{Equation}6\right]\end{array}$

(54) Therefore, a PAPR is determined based on a peak value of the components of a transmit vector x[n], and thus, the PAPR can be decreased through the optimization like Equation 7 as provided below.

(55) $\begin{array}{cc}\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},N\right\}}{\max }.Math.x_i.Math.& \left[\mathrm{Equation}7\right]\end{array}$

(56) In Equation 7, the optimization is about a condition that optimizes an exactly asymptotic PAPR, that is, a near 100% percentile PAPR. The optimization can be expressed by Equation 8 using an overall pulse shaping matrix A and data d.sub.j.

(57) $\begin{array}{cc}\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},N\right\}}{\max }.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.& \left[\mathrm{Equation}8\right]\end{array}$

(58) In Equation 8, (A).sub.i,j(p) denotes an (i,j) element of the overall pulse shaping matrix A to which a circular filter p is applied, and d.sub.j is a j.sup.th data symbol in a data symbol vector.

(59) An optimal transmit waveform can vary based on a modulation scheme used in the OFDM system, that is, a constellation through which a data symbol is transmitted. On the assumption that a uniform PSK is used, the optimization can be expressed by Equation 9 as provided below.

(60) $\begin{array}{cc}\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},N\right\}}{\max }.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.=\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},N\right\}}{\max }\underset{j=1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},.Math.\frac{N}{L}.Math.\right\}}{\max }\underset{j=1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.& \left[\mathrm{Equation}9\right]\end{array}$

(61) In the case of the uniform PSK, within a unit circle of a complex plain, all phases are used for a data symbol transmission, and thus, a data symbol vector in which all phases of (A).sub.i,j(p) are aligned can exist. Therefore, the peak value can be the sum of all absolute values of (A).sub.i,j(p) when the all phases are aligned. A circular filter that minimizes the peak value can be an optimal circular filter. Also, based on the similarity in structures between CFS-OFDM and SC-FDMA, the optimization can be simplified from the entire length N to N/L.

(62) According to embodiments of the present disclosure, when BPSK is used as a constellation, the optimization (hereinafter, a PAPR optimization condition) can be expressed by Equation 10 as provided below.

(63) 0$\begin{array}{cc}\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.=\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\frac{\left(l1-l2\right)\left(K-1\right)}{L}\right).Math.\right)\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},.Math.\frac{N}{L}.Math.\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\frac{\left(l1-l2\right)\left(K-1\right)}{L}\right).Math.\right)& \left[\mathrm{Equation}10\right]\end{array}$

(64) In Equation 10, l.sub.1 and l.sub.2 are symbol indices of data symbols in BPSK, and a phase difference between (A).sub.i,l1(p) and (A).sub.i,l2(p) is always

(65) $\frac{\left(l1-l2\right)\left(K-1\right)}{L}.$
Therefore, the maximum value of

(66) $.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.$
can be calculated to be

(67) $\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\right).Math.\right)$
through the combination with BPSK data symbols of +1 and 1. The PAPR optimization condition can be an optimal solution to minimize a near 100% percentile PAPR, in the case of the CFS-OFDM that uses a BPSK constellation. In the same manner, the PAPR optimization condition can be simplified to

(68) $.Math.\frac{N}{L}.Math.,$
as opposed to the entire length N of IDFT.

(69) According to embodiments of the present disclosure, when QPSK is used as a constellation, the PAPR optimization condition can be expressed by Equation 11 as provided below.

(70) $\begin{array}{cc}\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.=\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math.c\left(l1,l2\right)\right)\underset{\underset{\_}{p}}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},.Math.\frac{N}{L}.Math.\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math.c\left(l1,l2\right)\right)c\left(l1,l2\right)\stackrel{}{=}\underset{\left\{c,\frac{N}{L}\right\}}{\max }.Math.\cos \left(\frac{\left(l1-l2\right)\left(K-1\right)}{L}+\right).Math.& \left[\mathrm{Equation}11\right]\end{array}$

(71) In Equation 11, a phase difference between (A).sub.i,l1(p) and (A).sub.i,l2(p) is always

(72) $\frac{\left(l1-l2\right)\left(K-1\right)}{L},$
and thus, the maximum value of

(73) $.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.$
can be calculated as shown in Equation 12 and Equation 13 by combining a QPSK data symbol and

(74) ${}^{\mathrm{j0}},{}^{\frac{j}{2}}{}^j,{}^{\frac{\mathrm{j3}}{2}}{}^{\mathrm{j0}},{}^{\frac{j}{2}}{}^j,{}^{\frac{\mathrm{j3}}{2}}$

(75) $\begin{array}{cc}\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math.c\left(l1,l2\right)\right)& \left[\mathrm{Equation}12\right]\\ c\left(l1,l2\right)\stackrel{}{=}\underset{\left\{0,\frac{}{2}\right\}}{\max }.Math.\cos \left(\frac{\left(l1-l2\right)\left(K-1\right)}{L}+\right).Math.& \left[\mathrm{Equation}13\right]\end{array}$

(76) The PAPR optimization condition can be an optimal solution to minimize a near 100% percentile PAPR, in the case of the CFS-OFDM that uses a QPSK constellation. In the same manner, the PAPR optimization condition can be simplified to

(77) 0$.Math.\frac{N}{L}.Math.,$
as opposed to the entire length N of IDFT.

(78) Also, a person skilled in the art can readily derive an optimization condition for obtaining an optimal circular filter according to various constellations (e.g., 16-QAM, 64-QAM, or the like) by extending the embodiments of the present disclosure.

(79) FIG. 8 is a diagram illustrating a structure of a transmitting end of a rotated constellation CFS-OFDM according to embodiments of the present disclosure. The transmitting end of the rotated constellation CFS-OFDM of FIG. 8 includes a circular filter 801, a subcarrier mapper 803, an IDFT unit 805, and a CP adder 807. The subcarrier mapper 803, the IDFT unit 805, and the CP adder 807 can use publicly known configurations.

(80) The circular filter 801 in FIG. 8 performs constellation rotation with respect to L input data symbols, executes L-point DFT spreading and circular extension on the L constellation-rotated data symbols to be K symbols, and performs frequency domain (FD) windowing by multiplying the K circular extended data symbols with a circular filter coefficient. Here, K is a natural number that is greater than or equal to L. As another example, the circular filter 801 can be embodied as a spreader that performs a spreading operation using a K-by-L matrix, without performing L-point DFT spreading and FD windowing like the LTE system. In this instance, the L constellation-rotated data symbols can be spread by the K-by-L matrix and can be output as K data symbols. Here, K is a natural number that is greater than or equal to L. As another example, the circular filter 801 can be embodied as a spreader of a K-by-L matrix so as to perform a spreading operation including the constellation rotation with respect to L input data symbols. When the circular filter 801 is embodied as a single spreader Equation 14 can be given as provided below. In this instance, the effect of the constellation rotation can be provided through a shift index.

(81) In FIG. 8, the subcarrier mapper 803 maps the K data symbols to IDFT index positions corresponding to N subcarriers, the IDFT unit 805 performs IDFT that transforms the mapped data symbols from the frequency domain to the time domain, and the CP adder 807 adds CPs to the IDFT-processed data symbols and outputs the same as OFDM symbols.

(82) The constellation rotation performed in the circular filter 801 can be performed using a shift index (shiftindex) as shown in Equation 14. The constellation rotation can have the effect of rotating the constellation of data symbols. Equation 14 expresses an element (S).sub.i,j in a K-by-L circular filter matrix.

(83) $\begin{array}{cc}{\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}\begin{array}{c}i\text{:}\mathrm{frequency}\mathrm{index}\\ j\text{:}\mathrm{symbol}\mathrm{index}\end{array}& \left[\mathrm{Equation}14\right]\end{array}$

(84) FIG. 9 is a diagram illustrating a structure of a transmitting end of a rotated constellation CFS-OFDM according to other embodiments of the present disclosure. The transmitting end of the rotated constellation CFS-OFDM of FIG. 9 includes a constellation rotator 901, a circular filter 903, a subcarrier mapper 905, an IDFT unit 907, and a CP adder 909. The subcarrier mapper 903, the IDFT unit 907, and the CP adder 909 can use publicly known configurations, like the embodiment of FIG. 8.

(85) The embodiment of FIG. 8 configures the circular filter 801 to further perform a constellation rotation function. The embodiment of FIG. 9 configures the constellation rotator 901 that performs constellation rotation as a separate block that is distinguished from the circular filter 903. Although the transmitting ends in the embodiments of FIGS. 8 and 9 are examples of different configurations of a transmitting end, they are different merely in view of embodiment and an output of the transmitting end according to the two embodiments are the same. The circular filter 903 performs L-point DFT spreading and circular extension on L constellation-rotated data symbols to be K symbols, and performs FD windowing that multiplies the K circular extended data symbols with a circular filter coefficient.

(86) A receiving end that corresponds to the transmitting end of FIG. 8 and FIG. 9 operates in reverse order of the operations of the transmitting end, and thus, detailed descriptions thereof will be omitted.

(87) The optimization of a transmit waveform of CFS-OFDM, which has been described in FIG. 7, designs a circular filter p with respect to a given constellation. However, the rotated-constellation CFS-FDM according to the embodiments of the present disclosure considers the optimization of a circular filter p (that is, a filter value) and a constellation rotation value (that is, a phase value) with respect to a given constellation. In a case in which BPSK is used as a constellation and rotated-constellation CFS-OFDM is used, the optimization of a transmit waveform can be expressed by Equation 15.

(88) $\begin{array}{cc}\underset{\underset{\_}{p},}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }.Math.\underset{j=1}{\overset{L}{.Math.}}{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right)d_j.Math.=\underset{\underset{\_}{p},}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+\right)\right).Math.\right)\underset{\underset{\_}{p},}{\mathrm{minimize}}\underset{i\left(1,2,\mathrm{.Math.},.Math.\frac{N}{L}.Math.\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+\right)\right).Math.\right)& \left[\mathrm{Equation}15\right]\end{array}$

(89) Equation 15 is almost similar to Equation 3, and considers the optimization of p and together. Double optimization that optimizes p and together can be performed to detect optimal p and values through repetition. When BPSK is used as a constellation, an operation of detecting the optimal p and values can be performed as given in Equation 16 and FIG. 10.

(90) $\begin{array}{cc}{\underset{\_}{p}}_0=\underset{\underset{\_}{p}}{\arg \min }\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+{}_0\right)\right).Math.){}_1=\underset{}{\arg \min }\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left({\underset{\_}{p}}_0\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left({\underset{\_}{p}}_0\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left({\underset{\_}{p}}_0\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+\right)\right).Math.){\underset{\_}{p}}_1=\underset{\underset{\_}{p}}{\arg \min }\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left(\underset{\_}{p}\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left(\underset{\_}{p}\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left(\underset{\_}{p}\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+{}_1\right)\right).Math.){}_2=\underset{}{\arg \min }\underset{i\left(1,2,\mathrm{.Math.},N\right)}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}\left({\underset{\_}{p}}_1\right).Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}\left({\underset{\_}{p}}_1\right).Math..Math..Math.{\left(A\right)}_{i,l2}\left({\underset{\_}{p}}_1\right).Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+\right)\right).Math.\right)& \left[\mathrm{Equation}16\right]\end{array}$

(91) Equation 16 briefly expresses an example of a case when a single repetition is performed, and the operation can be repeatedly performed until the optimal p and values are detected as shown in FIG. 10.

(92) FIG. 10 is a flowchart illustrating a method of optimizing a filter value and a phase value in rotated constellation CFS-OFDM according to embodiments of the present disclosure.

(93) Referring to FIG. 10, when an initial value of a phase value in operation 1001 is .sub.0, a filter value P.sub.n+1 is optimized using a phase value .sub.n obtained through an n.sup.th repetition in operation 1003. The phase value .sub.n obtained through the n.sup.th repetition uses .sub.0 which is the initial value of the phase value in operation 1001 at an initial operation. The filter value P.sub.n+1 can be optimized by Equation 16. In operation 1005, a phase value .sub.n+1 is optimized using a filter value P.sub.n+1 obtained in operation 1003. In the same manner, the phase value O.sub.n+1 can be optimized by Equation 16. In operations 1003 and 1005, the optimization of the filter value and the phase value can be performed until the difference between .sub.n and .sub.n+1 becomes smaller than a predetermined threshold value in operation 1007. When the difference between .sub.n and .sub.n+1 is smaller than the predetermined threshold value in operation 1007, P.sub.n+1 and .sub.n+1 can be used as final optimal filter value and phase value, respectively, in operation 1009. The optimal filter value and the phase value are values that converge to at least locally optimal values.

(94) When a BPSK modulation is used and the number L of data symbols to be transmitted through a single OFDM symbol is an even number, the phase value can be optimized to be

(95) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right).$
The constellation rotation can be performed by applying a shift index (shiftindex) optimized in BPSK as shown in Equation 17 with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as described in the embodiment of FIG. 8.

(96) $\begin{array}{cc}{\left(\hat{S}\right)}_{i,j}=p_i{}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}\mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L}{4}.& \left[\mathrm{Equation}17\right]\end{array}$

(97) Also, when the front end of the circular filter 903 performs constellation rotation like the embodiment of FIG. 9, and BPSK is used as the constellation, the constellation rotator 901 can apply constellation rotation with respect to an L-by-1 data symbol vector d[n], as shown in Equation 18. Here, a phase value

(98) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right)$
optimized in BPSK is used as a phase value .

(99) As another example, when a vector

(100) $\left[\begin{array}{c}1\\ e^j\\ e^{j2}\\ \mathrm{.Math.}\\ e^{j\left(L-1\right)}\end{array}\right]$
is configured as a diagonal matrix in the constellation rotation as expressed in Equation 18, the diagonal matrix can be expressed by Equation 14 by combining with a matrix that embodies the spreader of the circular filter 801 in the embodiment of FIG. 8.

(101) $\begin{array}{cc}d\left[n\right]\left[\begin{array}{c}1\\ e^j\\ e^{j2}\\ \mathrm{.Math.}\\ e^{j\left(L-1\right)}\end{array}\right]& \left[\mathrm{Equation}18\right]\end{array}$

(102) When a QPSK modulation is used and the number L of data symbols to be transmitted through a single OFDM symbol is an even number, the phase value can be optimized to be

(103) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right).$
The constellation rotation can be performed by applying a shift index (shiftindex) optimized in QPSK as shown in Equation 19 with respect to an element (S).sub.i,j in a K-by-L circular filter matrix, as described in the embodiment of FIG. 8.

(104) 0$\begin{array}{cc}{\left(\hat{S}\right)}_{i,j}=p_i{e}^{-j\frac{2\left(i-1-\mathrm{shiftindex}\right)\left(j-1\right)}{L}}& \left[\mathrm{Equation}19\right]\\ \mathrm{where}\mathrm{shiftindex}=\frac{K-1}{2}\frac{L\mathrm{or}3L}{8}& \end{array}$

(105) Also, when the front end of the circular filter 903 performs constellation rotation like the embodiment of FIG. 9, and QPSK is used as the constellation, the constellation rotator 901 can apply constellation rotation with respect to an L-by-1 data symbol vector d[n], as shown in Equation 18. Here, a phase value

(106) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right)$
optimized in QPSK is used as a phase value .

(107) In the present embodiment, the optimal phase value can have a different PAPR performance gain of the rotated constellation CFS-OFDM compared to the existing CFS-OFDM, based on a K value and an L value. In BPSK, when

(108) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right)0\mathrm{or},$
a performance gain is small, and the performance gain is higher as the difference is higher. For example, when K=32 and L is 20 or 21, the performance gain can be low. In QPSK, when

(109) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right)0\mathrm{or}\frac{}{2},$
a performance gain is small, and the performance gain is higher as the difference is higher. For example, when K=32 and L is 24 or 25, the performance gain can be small.

(110) A method of adding a shift index (shiftindex) in shifted CFS-OFDM can also be applied to DFT-S-OFDM, and an optimal value is the same as the optimal value of rotated constellation CFS-OFDM when L is an even number. Therefore, in this instance,

(111) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right)$
is used as an optimal phase value in BPSK, and

(112) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right)$
is used as an optimal phase value in QPSK.

(113) Hereinafter, a solution for optimization (that is, a PAPR optimization condition) using a DFS-S-OFDM signal model will be described.

(114) A DFT-S OFDM signal model can be expressed by Equation 20 as provided below.

(115) $\begin{array}{cc}\underset{\_}{x}=W_N^{}\left[\begin{array}{c}{W}_L\\ 0_{N-L\mathrm{by}L}\end{array}\right]\underset{\_}{d}=A\underset{\_}{d}& \left[\mathrm{Equation}20\right]\end{array}$

(116) In the case of BPSK, the PAPR optimization condition in the DFT-S-OFDM signal model can be expressed by Equation 21 as provided below.

(117) $\begin{array}{cc}\underset{}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},N\right\}}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}.Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}.Math..Math..Math.{\left(A\right)}_{i,l2}.Math..Math..Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+\right)\right).Math.\right)& \left[\mathrm{Equation}21\right]\end{array}$

(118) In the case of QPSK, the PAPR optimization condition in the DFT-S OFDM signal model can be expressed by Equation 22 as provided below.

(119) $\begin{array}{cc}\underset{}{\mathrm{minimize}}\underset{i\left\{1,2,\mathrm{.Math.},N\right\}}{\max }\left(\underset{j=1}{\overset{L}{.Math.}}{.Math.{\left(A\right)}_{i,j}.Math.}^2+2\underset{l1=1}{\overset{L-1}{.Math.}}\underset{l2=l1+1}{\overset{L}{.Math.}}.Math.{\left(A\right)}_{i,l1}.Math..Math..Math.{\left(A\right)}_{i,l2}.Math..Math.|.Math.c\left(l1,l2\right)\right)c\left(l1,l2\right)\stackrel{}{=}\underset{\left\{0,\frac{}{2}\right\}}{\max }.Math.\cos \left(\left(l1-l2\right)\left(\frac{\left(K-1\right)}{L}+\right)+\right).Math.& \left[\mathrm{Equation}22\right]\end{array}$

(120) A method of optimizing a CFS-OFDM transmit waveform and a rotated constellation CFS-OFDM transmit waveform can be applied to K, L, and a constellation order (that is, a modulation order), and can be capable of designing a transmit waveform having an appropriate PAPR performance level depending on a field of utilization.

(121) Hereinafter, a method of configuring information between a transmitting end and a receiving end of the rotated constellation CFS-OFDM, and of transferring the information according to embodiments of the present disclosure will be described from the perspective of an uplink.

(122) For rotated constellation CFS-OFDM transmission of a terminal, a base station needs to inform the terminal of resource allocation related information. The information includes a combination value of (K, L, {p.sub.m}, ). That is, the information includes the number K of subcarriers to be allocated, the number L of data symbols to be used for configuring a single CSF-OFDM symbol, a circular filter coefficient corresponding thereto, and an optimal phase value. K can be utilized as a channel bonding factor in OFDMA that allows per-tone access. The combination of (K, L, {p.sub.m}, ) indicates that different L, {p.sub.m}, and values can be allocated to a given K. For example, when 12 subcarrier resources are allocated based on K=12, L can be 8 or 10 (L=8 or L=10). In this instance, a filter coefficient and a phase value that make a PAPR be optimal can be different for each case. By taking into consideration an information storage space (that is, a memory) of a terminal, a filter coefficient and a phase value that make the PAPR be optimal can correspond to a single optimal value. Also, the base station can inform the terminal of the value (K, L, {p.sub.m}, ) itself. However, by providing granularity in view of the complexity of the embodiment, a limited number of optimal (K, L, {p.sub.m}, ) sets are agreed between the base station and the terminal (that is, prepared in advance as table information), and the base station can informationize only a corresponding index into a downlink control channel or the like and inform the terminal of the same. The table information can be managed by being integrated with an existing modulation and coding scheme (MCS) level. For example, with respect to an MCS to which BPSK or QPSK is applied, it can be defined that a ratio of L to K is 10:12, {p.sub.m} is an RRC filter coefficient that uses roll-off of the corresponding ratio or a filter coefficient optimized for a PAPR, is a

(123) ${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1}{2}\right)$
value for BPSK, and is a

(124) 0${}_{\mathrm{opt}}=\left(\frac{K-1}{L}\frac{1\mathrm{or}3}{4}\right)$
value for QPSK, in a manner of one-to-one match. In this instance, when the base station reports, to the terminal through a control channel, only an MCS index and the number of allocated RBs for an uplink data transmission, the terminal can recognize L or K to be a (the number of allocated RBsthe number of subcarriers per RB) value according to the one-to-one relationship, and can perform an uplink transmission using a corresponding filter coefficient and a phase rotation value.

(125) In the case of a terminal existing in a cellular IoT or an edge area of a cell, the class of the terminal is identified based on a coverage, and an MCS level for each class can be defined. In this instance, the (K, L, {p.sub.m}, ) value and the MCS level can be integrated as a single information transfer unit, and can be mapped and used as index information. That is, in a case in which the base station performs scheduling with respect to the terminal, when the base station transmits the index information through a downlink control channel or the like, the terminal reads the index information, generates and transmits a rotated constellation CFS-OFDM signal, and the base station can demodulate, based on the index information, a received signal through a reverse process.

(126) Also, the uplink resource allocation can be allocated based on two references, that is, K and L values. That is, the allocation can be performed based on a K(>L) value to maintain intra-cell orthogonality. The allocation can be performed based on an L value by mitigating the orthogonality so that the amount of available resource increases and a multi-user reception scheme of a base station can be used. In this instance, IFFT resource mapping location information, which has been required in the existing DFT-S-OFDM, is also required. In the case of per-tone OFDMA, since a sub-channel number is assigned for each subcarrier, an accurate IFFT resource location to which a symbol spread through a circular filter is to be mapped can be identified when a reference number and a K value are obtained. Generally, the reference number can be a sub-channel number of a start sub carrier to which a first symbol after circular filter spreading is to be mapped. However, another number can be set as the reference number. Like an LTE uplink, a plurality of consecutive (e.g., 12) subcarriers can be defined as a single resource block (RB), and IFFT mapping information can be reported through an RB index. In this instance, a factor of CFS-OFDM that corresponds to the number of allocated RBs can be K or L.

(127) Generally, when a multi-access is used that maintains orthogonality, (the number of allocated RBs)(the number of subcarriers per RB)=K. However, when non-orthogonality multi-access is allowed, (the number of allocated RBs)(the number of subcarriers per RB)=L. That is, (KL) subcarrier resources can overlap among terminals that are assigned with neighboring resources, as illustrated in FIG. 11. In this instance, a channel estimation preamble, such as a DM-RS, is transmitted after L, as opposed to K, is set (that is, in the same manner as the LTE uplink) to prevent interference among terminals. In association with the channel estimation of a (KL) resource area (that is, an area where resources of neighboring terminals overlap), an estimated value obtained by extrapolating a channel estimated value obtained through a DM-RS of each terminal can be applied to channel equalization of each terminal.

(128) FIG. 11 illustrates a diagram illustrating an example of a resource allocation method in rotated constellation CFS-OFDM according to embodiments of the present disclosure. The example of FIG. 11 illustrates resource allocation (here, L=RB Size) with respect to three terminals in the case of 1 RB, K=14, and L=12.

(129) In a case in which resource partial overlapping allowance of FIG. 11 is extended to per-one OFDMA, although a terminal is assigned with as much resource as a channel bonding factor K, transmission can be performed by limiting the location that carries a channel estimation preamble to L subcarrier areas within a subband. For example, a terminal that is assigned with resources based on K=5 and L=3 can perform transmission by loading a preamble into only three consecutive subcarriers out of 5 consecutive subcarriers in an OFDM symbol that needs to carry a channel estimation preamble. This can be an aggressive operation mode or a non-orthogonal operation mode that uses five resources to increase a spectrum usage rate and performs channel estimation using three resources out of the five resources, although it partially allows interference. Conversely, when a preamble is loaded into all of the 5 subcarriers and does not allow resource overlapping, this can be a conservative operation mode or an orthogonal operation mode.

(130) In a case in which the base station performs scheduling with respect to terminals, when L is greater than K, an access bandwidth (BW) increases and a noise power increases in comparison with the same transmit power. Therefore, a CFS-OFDM reception SINR is converted by taking into consideration the above, and can be used as a standard for selecting a (K, L, p.sub.m, ) set and a resource allocation location. Also, a CFT-S-OFDM mode that does not require additional resource consumption can be included as a predetermined setting, and thus, selecting whether it is a DFT-S transmission or a CFS transmission, which is different from the DFT-S transmission, can be included. In this instance, when the SINR is converted, a PAPR threshold value that utilizes a CCDF, an available transmit power, a channel quality (CQI or MCS level), or the like can be considered.

(131) An item that needs to be taken into consideration when designing a filter for circular filter spreading is a PAPR limit, a degree of securing orthogonality after the operation of a spreader and a de-spreader, SNR deterioration caused by a noise power from signal spreading, and the like. When an optimal filter coefficient is independently generated based on K and L values, an issue associated with a memory capacity for storing the same can be generated. Therefore, granularity can be applied to (K, L, p.sub.m, ) based on the complexity of the embodiment.

(132) In a case of CFS-OFDM that uses an optimal transmit waveform based on a constellation, a PAPR performance can increase as the difference between K and L increases, except for predetermined sections. Also, a significantly great improvement in a PAPR performance can be shown in a low-order constellation, such as BPSK. By utilizing the above, an appropriate waveform can be considered from the perspective of a PAPR in various environments.

(133) Therefore, according to embodiments of the present disclosure, in the case of a rotated constellation CFS-OFDM that uses an optimal transmit wave form and rotation based on a constellation, a PAPR performance increases as the difference between K and L increases. Therefore, it is determined that a trade-off between a resource and a PAPR exists. A significantly great improvement in a PAPR performance can be shown in a low constellation, such as BPSK. By utilizing the same, an appropriate waveform can be considered from the perspective of a PAPR in various environments. When constellation rotation, that is, an optimal shift index (shiftindex), such as rotated constellation CFS-OFDM, is applied to DFT-S OFDM, a PAPR performance can increase higher than conventional DFT-S OFDM as shown in the result of a simulation of FIG. 12. Reference numerals 1201, 1203, and 1205 of FIG. 12 illustrate rotated constellation CFS-OFDM (that is, shifted pulse shaped CFS), pulse shaped CFS, and a PAPR feature in existing DFT-S, respectively. In the case of the shifted pulse shaped CFS according to embodiments of the present disclosure, a PAPR performance can dramatically increase in comparison with existing DFT-S OFDM.

(134) Also, Table 3 shows a comparison of a PAPR performance of the present disclosure with existing DFT-S OFDM and a case that uses an existing RRC pulse when BPSK is used. Table 4 shows a comparison of a PAPR performance of the present disclosure with existing DFT-S OFDM and a case that uses an existing RRC pulse when QPSK is used

(135) TABLE-US-00003 TABLE 3 BPSK PAPR PAPR proposed PAPR proposed PAPR Gain vs. PAPR Gain vs. RRC [dB] filter [dB] shifted filter RRC [dB] DFT-S [dB] Roll-off Resource (BPSK @ # of free (BPSK @ (BPSK @ (proposed (proposed K L Factor Utility CCDF 10.sup.4) variables CCDF 10.sup.4) CCDF 10.sup.4) (proposed) shifted) (proposed) shifted) 32 32 0 (=DFT-S) 100% 8.31 0 8.31 6.19 Ref. 2.12 Ref. 2.12 30 2/30 93.80% 1 6.88 4.48 1.43 3.83 (=0.0667) 28 4/28 87.50% 2 5.04 3.14 3.27 5.17 (=0.1429) 26 6/26 81.30% 3 3.3 2.08 6.01 6.23 (=0.2308) 24 8/24 75.00% 4 2.27 1.78 6.04 6.53 (=0.3333) 22 10/22 68.80% 5 2 1.7 6.31 6.61 (=0.4545) 20 12/20 62.50% 6 1.8 1.65 6.51 6.66 (=0.6000) 18 14/18 56.30% 7 2.46 1.64 5.85 6.67 (=0.7778) 16 16/16 50.00% 8 2.64 1.54 5.67 6.77 (=1.0000)

(136) TABLE-US-00004 TABLE 4 QPSK PAPR PAPR proposed PAPR proposed PAPR Gain vs. PAPR Gain vs. RRC [dB] filter [dB] shifted filter RRC [dB] DFT-S [dB] Roll-off Resource (QPSK @ # of free (QPSK @ [dB] (QPSK @ (proposed (proposed K L Factor Utility CCDF 10.sup.4) variables CCDF 10.sup.4) CCDF 10.sup.4) (proposed) shifted) (proposed) shifted) 32 32 0 (=DFT-S) 100% 7.71 0 7.71 7.47 Ref. 0.24 Ref. 0.24 30 2/30 93.80% 6.84 1 6.71 6.22 0.13 0.62 1 1.49 (=0.0667) 28 4/28 87.50% 5.7 2 5.35 5.15 0.35 0.55 2.36 2.56 (=0.1429) 26 6/26 81.30% 4.47 3 4.13 4.08 0.34 0.39 3.58 3.63 (=0.2308) 24 8/24 75.00% 3.43 4 3.12 3.1 0.31 0.33 4.59 4.61 (=0.3333) 22 10/22 68.80% 3.1 5 2.95 2.73 0.15 0.37 4.76 4.98 (=0.4545) 20 12/20 62.50% 3.3 6 2.94 2.63 0.36 0.62 4.77 5.08 (=0.6000) 18 14/18 56.30% 3.03 7 2.59 2.55 0.44 0.48 5.12 5.16 (=0.7778) 16 16/16 50.00% 3.52 8 2.74 2.48 0.78 1.04 4.97 5.23 (=1.0000)

(137) Table 3 and Table 4 indicate that when a resource utility of 50% is used, that is, when K=32 and L=16, a PAPR performance gain of 6.77 dB can be obtained in comparison with the existing DFT-S OFDM in BPSK. A PAPR performance gain of 5.23 dB can be obtained in QPSK. When a resource utility of 75% (K=32, L=24) is used, BPSK obtains a PAPR performance gain of 6.53 dB, and QPSK obtains a PAPR performance gain of 4.61 dB, in comparison with the existing DFT-S OFDM. Therefore, according to the present disclosure, a PAPR performance can increase in comparison to CFS-OFDM that uses existing DFT-S OFDM and an existing RRC pulse.

(138) FIGS. 13 to 16 are diagrams illustrating a PAPR feature in rotated constellation CFS-OFDM according to embodiments of the present disclosure, and shows that a PAPR performance is better than existing schemes such as CFS-OFDM and the like. RC-CFS-OFDM in FIGS. 13 to 16 indicates rotated constellation CFS-OFDM of the present disclosure. The result of the simulation of FIGS. 13 to 16 is obtained under the condition of Table 5 as provided below.

(139) TABLE-US-00005 TABLE 5 Simulation conditions FIG. 13 $\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{BPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\frac{}{2}-\mathrm{BPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{BPSK}\mathrm{join}\mathrm{optimal}\mathrm{phase}\text{/}\mathrm{filter}$$K=16,L=10,N=128$$\mathrm{number}\mathrm{of}\mathrm{simulations}\text{:}1000000$ FIG. 14 $\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{BPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\frac{}{2}-\mathrm{BPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{BPSK}\mathrm{join}\mathrm{optimal}\mathrm{phase}\text{/}\mathrm{filter}$$K=16,L=14,N=128$$\mathrm{number}\mathrm{of}\mathrm{simulations}\text{:}1000000$ FIG. 15 $\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{BPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\frac{}{4}-\mathrm{QPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{QPSK}\mathrm{join}\mathrm{optimal}\mathrm{phase}\text{/}\mathrm{filter}$$K=16,L=10,N=128$$\mathrm{number}\mathrm{of}\mathrm{simulations}\text{:}1000000$ FIG. 16 $\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{QPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\frac{}{4}-\mathrm{QPSK}+\mathrm{CFS}-\mathrm{OFDM}$$\mathrm{RC}-\mathrm{CFS}-\mathrm{OFDM}w\text{/}\mathrm{RRC}\text{:}\mathrm{QPSK}\mathrm{join}\mathrm{optimal}\mathrm{phase}\text{/}\mathrm{filter}$$K=16,L=14,N=128$$\mathrm{number}\mathrm{of}\mathrm{simulations}\text{:}1000000.$