{'fraction_non_alphanumeric': 0.04747859181731684, 'fraction_numerical': 0.01569933396764986, 'mean_word_length': 4.219500082767754, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Low CP Overhead Waveform Design for Multi-Path Channels with Timing Synchronization Error

In classical orthogonal frequency division multiplexing (OFDM) systems, inserting the cyclic prefix (CP) is necessary before each symbol to overcome the multi-path effect, which, however, occupies numerous time-frequency radio resources, resulting in hampered spectrum efficiency. To address this issue, in this paper, symbol repetition aware OFDM (SR-OFDM) is developed to lower the overhead of CP. In the proposed SR-OFDM, multiple symbols share the same CP with which we examine that the multi-path channels can also be overcome by a simple single-tap equalization without causing any interference. Moreover, after the discrete Fourier transform at the receiver, different symbols are proved to be separated in the time domain, which is beneficial for lowering the demodulation complexity. Furthermore, it is revealed that the above conclusions still hold even under timing synchronization errors, which makes the proposed SR-OFDM favorable in real systems. Extensive simulations validate the efficacy of our proposed SR-OFDM system under the multi-path channels with or without timing synchronization errors.


Introduction
In recent decades, the effective method of improving the data rate has been to increase the system's bandwidth in wireless communication networks. More precisely, the bandwidths in 3G, 4G, and 5G are up to 5 MHz, 20 MHz, and 400 MHz, respectively [1][2][3]. In general, the increase of system bandwidth results in the decrease of the sampling period [4], which in turn makes the multi-path effect become more and more severe. To overcome the multi-path effect, cyclic prefix (CP) combined with orthogonal frequency division multiplexing (OFDM) is extremely pervasive because of its capability of converting the multi-tap time-domain channel into a single-tap frequency coefficient, reducing the complexity of signal processing significantly. Therefore, CP-OFDM is widely adopted in the physical layers of many communication standards [5,6]. However, CP is a redundancy essentially obtained by duplicating the tail of each OFDM signal [7], which lowers the spectral efficiency greatly. For instance, the overhead of CP accounts for 20% of time-frequency resources in IEEE 802.11a [8]. Therefore, it is of vital importance to lower the overhead of CP while maintaining low complexity of signal detection in wireless communications.
So far, several schemes have been presented to lower the CP overhead. In [9], to shorten CP, a precoding matrix was acquired by building a sum-rate optimization problem to deal with the inter-user interference. In [10], an iterative receiver was proposed by utilizing soft decision feedback to eliminate the interference caused by shortening the CP. In [11], the authors presented an equalization algorithm with symbol cyclic shift to shorten the CP by using stored feedback equalization at the receiver. In [12], based on the overlapping minimum mean square error (MMSE) equalization, the authors proposed a CP-free method for OFDM systems, which performed well at the region of the low signal-to-noise ratio (SNR). Although these wors were devoted to shortening CP, the problem of the remaining interference among symbols is still a non-negligible obstacle, especially at high SNR. What is more, the resulting complexity of signal processing is increased considerably. In fact, the CP overhead can be reduced efficiently via the intuitive idea of reducing the subcarrier spacing at the cost of increasing the sensitivity to the phase noise or frequency offset. In [13,14], the vector OFDM system was presented by adopting a unit matrix for precoding multiple symbols. Since one data block consisting of multiple symbols only includes one CP, the CP overhead can be reduced significantly in the vector OFDM system. However, although there exists no inter-symbol interference, vector OFDM does not consider the complexity of symbol demodulation at the receiver, and all symbols in one block have to be performed jointly.
In this paper, the symbol repetition aware OFDM (SR-OFDM), in which multiple symbols share the same CP and there exists no inter-symbol interference, is developed to lower the overhead of CP. In addition, the received signals of different symbols can be separated in the time domain after the discrete Fourier transform (DFT), and single-tap equalization can be adopted at the receiver, which is beneficial for lowering the demodulation complexity. Furthermore, compared with [15] (our previous work), we extend the influencing factors in SR-OFDM, especially adding a timing synchronization error. It is revealed that when the symbol timing error is within the CP, symbol demodulation with a single-tap equalizer can be performed without causing any inter-symbol interference. Note that the CP length subtracting the timing error is required to be larger than the maximum channel delay. The robustness to the timing error releases the dependence on time synchronization accuracy, which makes our devised SR-OFDM more favorable in practice. For simplicity, main novelties and contributions of this paper are summarized as follows.

•
A novel waveform, i.e., SR-OFDM, is developed, aiming to lower the overhead of CP, whilst satisfying the orthogonality of a multi-carrier modulation system.

•
Under the designed paradigm, we mathematically show that the multi-path channels can be overcome via the single-tap equalizer without any interference, even under a timing synchronization error.

•
With a rigorous complexity analysis, it is demonstrated that the CP overhead is reduced significantly by the proposed SR-OFDM at the cost of an acceptable complexity. • Two estimation methods are devised for SR-OFDM together with the theoretical analysis on its key performance features, such as, spectral efficiency, peak to average power ratio (PAPR), and complexity.
The remainder of this paper is organized as follows. In Section 2, the novel waveform, SR-OFDM, is presented, including the design of the transmitter and the symbol demodulation at the receiver. Subsequently in Section 3, we present the robustness of SR-OFDM to a timing synchronization error, as well as two methods in regard to the estimation for the channel and timing synchronization error. In Section 4, the spectral efficiency, complexity, and PAPR of SR-OFDM are analyzed and compared with the classical OFDM, respectively. Then, the numerical results are provided in Section 5, followed by the conclusion and future work in Section 6.
For convenience, Table 1 gives several notations used throughout this paper.

Proposed SR-OFDM
The proposed SR-OFDM in this paper is based on the symbol repetition in OFDM, wherein one piece of data is transmitted repeatedly at one subcarrier for R symbol durations. To guarantee the data rate, R − 1 other symbols are transmitted simultaneously at the same subcarrier during the same time duration, and phase factors are required to maintain the orthogonality of different symbols. Compared with the classical OFDM system, R symbols only occupy one CP in SR-OFDM, hence the CP overhead of SR-OFDM is 1/R of OFDM. Figure 1a shows the SR-OFDM transmitter equipped with M subcarriers, including R branches for R independent data streams. The r-th branch is used to transmit the symbol d m,r , where m is the index of the subcarrier. For each subcarrier, R symbols are transmitted simultaneously during R symbols duration, i.e., RT, where T is the symbol duration and 1/T is the subcarrier spacing. For the sampling period of T s = T/M, the time duration RT corresponds to RM samples. Therefore, when the CP overhead is not considered, SR-OFDM will have the same data rate as the classical OFDM system.

SR-OFDM Transmitter
where k = 0, 1, . . . , M − 1. Then, the signals s r [k] are repeated for R times. For the p-th repetition with p ∈ [0, R − 1], s r [k] is multiplied by the phase coefficient e j2πrp/R , as shown in Figure 2. Then, for r ∈ [0, R − 1], the signal is obtained as where k = pM +k, p = 0, 1, . . . , R − 1 andk = 0, 1, . . . , M − 1. Next, CP is inserted by the following equation,s where L cp is the length of CP. Note that the length of CP should be larger than the maximum channel delay to eliminate the interference among symbols [16].  Finally, the baseband equivalent transmitted signal of SR-OFDM is written as

SR-OFDM Receiver
Denote a multi-path channel as h[k] with k = 0, 1, . . . , L h , where L h is the maximum channel delay. Then, the received signal is written as where k = −L cp , −L cp + 1, . . . , RM + L h − 2, and η[k] stands for the noise that satisfies the Gaussian distribution [17][18][19]. As shown Figure 1b, CP is removed from the signal r[k], and it is written as where k = 0, 1 . . . , RM − 1.
In the following, the signals of different d m,r (r = 0, 1, . . . , R − 1) can be separated via n RM-point discrete Fourier transform (DFT), as presented below. The signal separation for different r ∈ [0, R − 1] will lower the demodulation complexity greatly. After DFT oñ r[k], it is obtained as Substituting (4) and (6) into (7), it is obtained as wherem = 0, 1 . . . , RM − 1 and the noise term ηm can be obtained by Due to the fact thats r [k] is a signal with the circular structure according to (3), Equation (8) can be rewritten as It is obvious that the distribution of ηm is the same as that of η [k]. In addition, it can be easily observed that the term ∑ where k = pM +k,k ∈ [0, M − 1], and p ∈ [0, R − 1]. According to the definition of s r [k] in (1), the following equation holds, As a result, substituting (1) into (11), Equation (11) can be rewritten as . Then, Equation (13) can be rewritten as Note that the orthogonality condition of SR-OFDM always holds, as follows, , and ε = 0. Note that ε is non-zero. According to (15), Equation (14) can be rewritten as Equation (16) indicates that, the signal ym with indexm = mR + r is determined only by d m 0 ,r with respect to r, r ∈ [0, R − 1]. In other words, the received signals of d m 0 ,r and d m 0 ,p can be separated in the time domain as presented in Figure 3. As a consequence, symbol demodulations of different d m 0 ,r with respect to r can be conducted independently, lowering the receiver complexity. In the following, symbol demodulations of different d m 0 ,r will be presented based on Equation (16).

Symbol Demodulation of d m,0
When r = 0, Equation (16) can be rewritten as Note that the following equation holds, Then, y mR can be obtained as where m = 0, 1, . . . , M − 1. When the channel frequency response H mR is known at the receiver, the single-tap equalization can be performed to recover d m,0 , i.e., where m = 0, 1, . . . , M − 1. It is worthwhile to point out that the factor 1/ √ R in (20) is a result of symbol repetition by R times in the SR-OFDM system.
When r = 0, according to Equation (16), it can be obtained as When H mR is known by the receiver, the single-tap equalizer can be applied, i.e., × e −j2πrk/RM +η mR+r , whereη mR+r is obtained by η mR+r /H mR+r . From Equation (22), it is realized that the signalsỹm R+r are determined only by d m 0 ,r , and not interfered by d m 0 ,p with p = r. As a result, for the symbol recovery of d m 0 ,r , signals related to d m 0 ,r are extracted, i.e., Subsequently, performing IDFT with length of RM on the signal Υm ,r , it is obtained Υm ,r e j2πmn/RM , k = pM +k,k = 0, 1, . . . , M − 1, and m = 0, 1, . . . , M − 1. In addition, note that the noise termη n,r in (24) is written as Then, a phase coefficient is defined MultiplyΥ n,r by Ω(r), Θ n,r =Υ n,r Ω(r) is obtained as in (28), which is shown at the top of the next page, In addition, let pM = n −ñ where n ∈ [0, RM − 1] andñ ∈ [0, M − 1], then, (28) is rewritten as in (29) (at the top of the next page). Then, it is obtained as The noise termη n,r isη n,r e −j2πr(n−ñ)/RM . From the analysis in (27), it is realized that for each r, the signal Θ n,r has a structure of repetition, as shown in Figure 4, in which the noise termη n,r is ignored.  Then, symbol demodulation is achieved by performing a RM-point DFT, i.e., Finally, it is obtained asd where r ∈ [1, R − 1]. Similar to the classical OFDM, SR-OFDM can overcome the multi-path effect with the help of CP. Note that CP is inserted for each OFDM symbol, while CP is shared by one block consisting of several symbols in the proposed SR-OFDM. As a result, compared to OFDM, the overhead of CP is lowered significantly in SR-OFDM. In addition, it is obvious that the symbol demodulation of SR-OFDM is different from that in OFDM, resulting in more complex signal processing for its combination with the multiple input multiple output (MIMO) technique [20,21].

SR-OFDM under a Timing Synchronization Error
For the symbol demodulation, the starting position of one symbol is required to be obtained from the received signal, which is based on the timing synchronization. However, due to the noise or interference, denoted as L e as shown in Figure 5, degrading the performance of the symbol demodulation. In this section, we focus on the performance of SR-OFDM under a timing error. It will be proven that when the timing error is within the CP, symbol demodulation with a single-tap equalizer can be performed without causing any inter-symbol interference as long as the CP length is large enough. It will also demonstrate that under such a condition, the property that the signals of different data symbols are separated in the time domain still remains, which ensures a low complexity of symbol demodulation.

Received Signal with Timing Synchronization Error
When the time synchronization is perfect, the signal after the CP removing,r[k], k = 0, 1, . . . , RM − 1, is obtained as in Equation (6). Under a time synchronization error, denoted as L e , the signal can be obtained as where k = −L e , −L e + 1, . . . , RM − 1 − L e . Note that it is assumed that the time synchronization error is within the CP, and the value of L cp − L e is still larger than the maximum channel delay. Otherwise, the inter-symbol interference will occur definitely, and this will go beyond our concern.
Subsequently, the RM-point DFT is performed onr[k], and since the indexes ofr[k] are −L e , −L e + 1, . . . , RM − 1 − L e , the result after the DFT can be written as wherem = 0, 1, . . . , RM − 1. Substituting (4) and (33) into (34), it is obtained as Due to the fact thats r [k] is a signal with the circular structure according to (3), Equation (35) can be rewritten as Note that the term in (36), e −j2πmLe /RM Hm √ RM only depends on the parameterm for a fixed timing synchronization error L e . Then, similar to derivations from (11) to (16), Equation (36) can be rewritten asȳ Equation (37) indicates that for a fixed timing synchronization error L e , the signal y mR+r with indexm = mR + r is determined only by d m 0 ,r with respect to r, r ∈ [0, R − 1]. In other words, for d m 0 ,r with different r, their received signals are still separated, exactly as the conclusion presented in (16). The separation of received signals makes it possible to perform symbol demodulation independently for each r, ensuing a low complexity of the receiver. It is easily observed that when the term e −j2π(mR+r)L e /RM H mR+r in (37) can be removed, the symbol demodulation can be performed according to Equations (17)-(32) (within Section 2.2.1) without any interference among symbols.
Due to the reason that the timing synchronization error L e is unknown, the key to symbol demodulation is the elimination of L e . In the following subsection, methods for symbol demodulation are proposed under the timing synchronization error L e .

Symbol Demodulation under Timing Synchronization Error
According to (37), the estimations of channel frequency responses and the timing synchronization error are required before the symbol demodulation. In wireless com-munications, the channel estimation is usually conducted by using pilots [22,23], i.e., the transmitter sends a reference signal that has been known by the receiver in advance. This method of pilots can also be used for the estimations of channel frequency responses and the timing synchronization error in Equation (37).
For the branch of r = 0, similar to the derivations of (17)- (19),ȳ mR+r in (37) can be rewritten asȳ where m = 0, 1, . . . , M − 1. From (38), the received signal of the branch r = 0 in SR-OFDM is the product of the channel frequency response H mR and transmitted symbol d m,0 , which is similar to the classical OFDM. Consequently, for the proposed SR-OFDM, the branch of r = 0 preserves the simplicity of the classical OFDM, which is helpful for the pilot design and channel estimation. According to (38), the term e −j2πmRL e /RM H mR can be easily estimated by making d m,0 as pilots, and the estimation can be written aŝ  Figure 6 where R is set to 4 as an example. Therefore, algorithms are required to obtain the the whole estimations of e −j2πmL e /RM Hm only by the branch r = 0 in SR-OFDM. As a remark, the estimations of e −j2πmL e /RM Hm can be also achieved by other branches r ∈ [1, R − 1] instead of only the branch r = 0. For the sake of simplicity, this paper performs the estimations of e −j2πmL e /RM Hm only by using pilots in the branch r = 0. As shown in Figure 7, d m,0 are set to the pilot symbols, and d m,r , r = 0 are data symbols. Note that the variable r in Figure 7   can be designed to extract the non-zero channel coefficients, Then, it is written ash where k = 0, 1, . . . , M − 1. Moreover, the function g[k] is helpful to improve the estimation performance since it gets rid of the noise at k = L h + L e , L h + L e + 1, . . . , M − 1.
After that, the frequency interpolations can be obtained by an RM-point DFT operation, i.e.,Ĥm wherem = 0, 1, . . . , RM − 1 andξ k is the noise term, which can be obtained by On the basis, a single-tap equalizer, i.e., 1/Ĥm, can be performed on the received signal y mR+r in (37). When ignoring the noise for simplicity, it is obtained as

Linear Interpolation Estimation
According to the analysis in (43) where m is the subcarrier index, and r = 1, 2, . . . , R − 1. Similar to (46), the single-tap equalizer, i.e., 1/Ĥm, can be performed, and symbol demodulation can be obtained. The linear interpolation estimation can be implemented easily due to the low complexity. However, under a channel with strong frequency selectivity, the linear interpolation estimation in (47) will suffer from a little distortion, which may result in a degraded performance for high-order modulation or high signal-to-noise (SNR). Compared with the linear interpolation estimation, the DFT-based method can achieve the accurate estimation of e −j2πmL e /RM Hm. Furthermore, the design of the time-domain window in (43) can significantly improve the estimation performance since it removes much noise. In spite of this, the DFT-based method requires the maximum channel delay L h as the a priori knowledge.

Spectral Efficiency
In this subsection, we analyze the spectral efficiency of SR-OFDM under an AWGN channel and show the advantage compared to the classical OFDM. According to the Shannon theory [24,25], the spectral efficiency depends on the received SNR and the time used for the useful signals.
First, the SNR of symbol demodulation is analyzed. For simplicity, assume that the transmit power of for each symbol d m,r is 1, and the variance of the channel noise η[k] is σ 2 . According to Equations (20) and (32), SNR of symbol demodulation can be easily obtained as The factor R in (48) is due to the symbol repetition in the proposed SR-OFDM. For a fair transmit power for each symbol, the SR-OFDM and OFDM exhibit the same received SNR of symbol demodulation.
As for the transmission time, according to Section 2.1, one symbol d m,r is repeated for R times, and therefore, it costs the time RT when the CP overhead is not considered. Due to the design of R branches as shown in Figure 1, the proposed SR-OFDM can transmit RM data symbols totally during the time RT (ignoring the CP overhead), where M is the number of subcarriers. It is well known that the classical OFDM can also transmit RM data symbols totally during the time RT [26] (ignoring the CP overhead). Therefore, when ignoring the CP overhead and ensuring the same transmit power for fairness, the proposed SR-OFDM will have the same spectral efficiency as the classical OFDM. When CP is considered, the overhead of the classical OFDM is T cp T+T cp since CP is required for each symbol, whereas the overhead of the proposed SR-OFDM is T cp RT+T cp , where T cp is the time duration of CP.
As shown in Figure 8, the spectral efficiency of the proposed SR-OFDM is compared with the classical OFDM, in which T cp is set to 0.25 T exactly as IEEE 802.11a [8]. The proposed SR-OFDM offers a significant spectral efficiency gain over the classical OFDM, especially for a large R, thanks to the reduction of CP in the proposed SR-OFDM.

Complexity Comparison
In this subsection, we compare the complexity of the proposed SR-OFDM with the classical OFDM. In general, the overall number of complex-valued multiplications can be used to evaluate the complexity [27].
As presented in Section 2.1, the complexity of the SR-OFDM transmitter mainly stems from R branches of IDFT transforms and the multiplications with the phase coefficients e j2πrp/R . Note that the M-point IDFT can be implemented by the M-point inverse fast Fourier transform (IFFT) that has a multiplication number of Mlog 2 (M). Therefore, the complexity of the SR-OFDM transmitter is whereas the complexity of the transmitter in the classical OFDM is RMlog 2 (M) for R symbols. As for the receiver, although the first branch of SR-OFDM, i.e., d m,0 , preserves the simplicity of OFDM and only the DFT transform is required, the rest of the R − 1 branches have a higher complexity than the classical OFDM. As presented in Section 2.2, the complexity of the SR-OFDM receiver mainly stems from an RM-point DFT, R − 1 branches of IDFT, the multiplications with phase coefficients, and DFT. As a result, the complexity of the SR-OFDM receiver is As a comparison, the complexity of the classical OFDM receiver is RMlog 2 (M) for R symbols. According to Table 2, the complexity of the proposed SR-OFDM is higher than the classical OFDM. However, it is noted that the increase of complexity mainly depends on the parameter R, which is limited by the channel coherence time. Therefore, a small R makes the complexity of SR-OFDM acceptable in practice. For instance, M = 2048 and R = 2, the complexity ratio of the SR-OFDM and OFDM receivers is

Multiplications OFDM(R Symbols) SR-OFDM
Transmitter For the parameters M = 2048 and R = 4 , the complexity ratio of the SR-OFDM and OFDM receivers is

PAPR Comparison
As it is well known, PAPR in multi-carrier modulations is mainly caused by the superposition of all subcarrier signals [28]. However, the signal superposition in the proposed SR-OFDM is not only from the subcarriers but also the branches as shown in Figure 1. To evaluate the PAPR, Figure 9 shows the complementary cumulative distribution function (CCDF) curves of the transmitted signals in SR-OFDM and OFDM, in which the number of subcarriers is M = 2048. From the simulation results, we see that the PAPR difference of SR-OFDM and OFDM is very limited. The reason is as follows. It has been demonstrated in [28] that the transmitted signal of the classical OFDM follows the Gaussian distribution when the subcarrier number is large enough and data symbols are independent and identically distributed (i.i.d). According to the principle diagram in Figure 1, the transmitted signal of the proposed SR-OFDM is equivalent to the superposition of multiple OFDM signals, which also approaches the Gaussian distribution and leads to a similar PAPR with the classical OFDM.

Simulation Results
In this section, bit error rate (BER) and mean square error (MSE) are carried out to validate the performance of the proposed SR-OFDM under multi-path fading channels and a time synchronization error. In simulations, we consider the SR-OFDM system with R = 2 and subcarrier number M = 2048, in which quadrature phase shift keying (QPSK) is adopted. The subcarrier spacing is set to 15,000 Hz exactly as the long-term evolution (LTE) standard [29], and then the duration one symbol will be T = 1 15000 s = 66.7 µs. The time duration of CP is set to 0.25 T, which is the same as the length of extended CP in LTE [29]. Moreover, the multi-path channels are adopted by considering the Stanford University interim (SUI) models [30], and the detailed channel profiles are shown in Table 3 [30], in which the channel SUI-5 has a larger path delay and exhibits a stronger frequency selectivity than the SUI-3 channel. Table 3. Profiles of SUI-3 and SUI-5 channel models. Frequency selectivity low high Figure 10 depicts the BER comparison between the classical OFDM and the proposed SR-OFDM under the AWGN channel and the SUI-5 channel, respectively, in which the perfect channel estimation and time synchronization are assumed. For a fair comparison, the total transmit power of the proposed SR-OFDM is the same as that of the classical OFDM when ignoring the CP overhead. Simulation results show that the proposed SR-OFDM achieves the same BER performance as the classical OFDM, which indicates that the multi-path channel can be overcome without causing the interference among symbols. Note that exactly as the classical OFDM, the simple single-tap equalization still works in the proposed SR-OFDM as the equations in (20) and (22). Furthermore, it is demonstrated that the received signals of different d m,r with respect to r are separated after the DFT module at the receiver, as in (16), reducing the complexity of symbol demodulation in the proposed SR-OFDM. As a result, the proposed SR-OFDM is an efficient multi-carrier waveform, which reduces the CP overhead significantly. When a time synchronization error exists for the proposed SR-OFDM, it is demonstrated that the time synchronization error and the multi-path channel can be jointly overcome by a single-tap equalizer, as the equation in (37). The joint estimation of time synchronization error and the multi-path channel can be achieved by the proposed algorithms, i.e., the DFT-based estimation and the linear interpolation estimation in Section 3.2. Figure 11 depicts the MSE performances of the proposed algorithms, in which the time synchronization error is set to 0.9 µs. Note that the length of CP is 0.25 T ≈ 16.7 µs. The maximum channel delay of SUI-3 is 0.9 µs, and the maximum channel delay of SUI-5 is 10 µs. As a result, the time synchronization error 0.9 µs is within the CP, and the CP length subtracting the time synchronization error is still larger than the maximum channel delay for both SUI-3 and SUI-5, i.e., 16.7 µs − 0.9 µs > 10 µs > 0.9 µs. From the simulation results, it is observed that the proposed DFT-based estimation achieves a better MSE performance than the linear interpolation estimation thanks to the time-domain window in the proposed DFT-based estimation. It is worthwhile to point out that the priori knowledge of maximum channel delay is required in the proposed DFT-based estimation. Moreover, for the proposed DFT-based estimation, the MSE of SUI-3 is lower than that of SUI-5, which is because a shorter time-domain window is required, and more noise is removed for the SUI-3 channel. Furthermore, for the proposed linear interpolation estimation, there exists a performance floor of MSE under the channel SUI-5 at the high SNR region compared with the channel SUI-3, which is due to the strong frequency selectivity in the SUI-5 channel. Figures 12 and 13 show BER of the proposed DFT-based and linear interpolation methods under SUI-3 and SUI-5, respectively, in which the time synchronization error is set to L e = 0.9 µs. For both SUI-3 and SUI-5, the BER of the DFT-based method approaches the performance of the perfect estimation, indicating that most of the noise is removed in the proposed DFT-based estimation. Note that the priori knowledge of maximum channel delay is required in the proposed DFT-based method. Moreover, the proposed linear interpolation method suffers from a performance floor of BER at high SNR under the SUI-5 channel, which means that a bit distortion for the estimation of the channel exists as well as the time synchronization error, especially for the channel with strong frequency selectivity.  Figure 14 shows BER of the proposed DFT-based method under SUI-3 and SUI-5, respectively, in which the time synchronization error is set to L e = 10 µs. For the CP length, 0.25 T = 16.7 µs, 16.7 µs − 10 µs > 0.9 µs and 16.7 µs − 10 µs < 10 µs. Note that 0.9 µs is the maximum channel delay of SUI-3 and 10 µs is the maximum channel delay of SUI-5. According to the analysis in Section 3 , the proposed SR-OFDM will suffer from the performance floor under the SUI-5 channel due to the interference among symbols, while there is no performance floor under the SUI-3 channel, which is verified in Figure 14.  As a remark, the CP overhead of the proposed SR-OFDM is 1/R of the classical OFDM. When R is set to 1, the proposed SR-OFDM is fully equivalent to OFDM. To highlight the contribution of this paper, we compare the proposed scheme with [12,13] as shown in Table 4. The proposed SR-OFDM does not have interference among symbols, and it is obvious that the SR-OFDM could also perform well at the region of high SNR compared to [12]. In addition, when R is small, the increase of complexity of the proposed SR-OFDM is acceptable in practice compared to [13]. Table 4. Comparison of different CP reduction schemes.

Element Attribute Characteristic
Ov-OFDM [12] Propose a CP-free method for OFDM systems based on overlapping MMSE.
Remaining interference, applicable to low SNR.
Vector OFDM [13] Propose a unit matrix for precoding multiple symbols so that multiple symbols only include one CP.
No inter-symbol interference, high complexity compared to other two methods.

SR-OFDM
Propose a novel waveform to make multiple symbols share one CP based on the concept of symbol repetition.
No inter-symbol interference, acceptable increased complexity.

Conclusions
In this paper, a novel waveform, SR-OFDM, was proposed based on the concept of symbol repetition. Compared with the classical OFDM, the CP overhead of the proposed SR-OFDM could be greatly reduced at the cost of an acceptable increased complexity. It was demonstrated that the multi-path channel can be efficiently overcome with a simple single-tap equalizer, even under a time synchronization error. The robustness to the time synchronization error would make the proposed SR-OFDM favorable in practice, since it could release the dependence on time synchronization accuracy. The performance of the proposed SR-OFDM has been verified by numerical simulations. As a remark, due to the difference to OFDM regarding the symbol demodulation, the combination of SR-OFDM and MIMO remains an important issue for one of our future works. Author Contributions: J.C. contributed to the conception of the study; B.W. performed the simulations; J.G. helped perform the analysis with constructive discussions; X.S. performed the data analyses and wrote the manuscript; D.K. contributed significantly to analysis and manuscript preparation. All authors have read and agreed to the published version of the manuscript.