Underwater acoustic (UWA) communications have diverse applications, such as disaster warning, marine environment monitoring, undersea exploration, and navigation [1]. However, communications over a UWA channel are burdened with non-preferable properties, namely, a limited available bandwidth, long delay spread, and high Doppler effects [2]. For example, since the speed of sound in UWA communications is as low as {c}
= 1500 m/s and the delay spread ranges tens to hundreds of milliseconds, long channel impulses are typically induced. The effects of a Doppler shift, proportional to {v} / {c}
, is significantly higher than that of radio communications, where {v}
is the relative transmitter-receiver velocity. Time selectivity of a UWA channel is also induced by surface scattering and internal waves, where Doppler spreads are determined by wind speed and sea surface conditions [1]. Single-carrier transmission with iterative frequency-domain equalization (FDE) and orthogonal frequency-domain multiplexing (OFDM) [3] are two popular transmission techniques to solve the problems associated with a frequency-selective channel.
Furthermore, to combat the limitations imposed by a rapidly time-varying channel, several techniques have been developed for UWA communications [4]–[7]. In most previous studies, the detrimental effects of Doppler shifts are reduced by employing advanced signal processing, such as resampling and adaptive filtering. These techniques aiming to diminish the time compression/dilation induced by time-selective fading require estimation algorithms for the Doppler scaling factor. Additionally, a process is implemented to compensate for the residual Doppler effect after resampling [6], [7]. However, Doppler shift compensation based on transmit signaling has not been well explored.
The concept of faster-than-Nyquist (FTN) signaling [8], [9] has been investigated for microwave and optical communications to increase the transmission rate by reducing the symbol interval further to that defined by the time-orthogonal Nyquist criterion. An information-theoretic analysis in additive white Gaussian noise (AWGN) and frequency-flat channels shows that FTN signaling with a root-raised cosine (RRC) shaping filter achieves an information rate of the Shannon’s capacity bound assuming an idealistic rectangular shaping filter, regardless of the roll-off factor of the RRC shaping filter [9]–[12]. This implies that FTN signaling is capable of exploiting the excess bandwidth that is typically wasted in the conventional Nyquist signaling with an RRC shaping filter. Moreover, FTN signaling transceivers capable of operating in a frequency-selective channel have been developed [13], [14].
Also, FTN signaling was introduced in the context of UWA communications [15]–[17] for the sake of increasing an information rate to combat the limitations imposed by the narrow available bandwidth of a UWA channel. In [15], FTN signaling channel-encoded by rateless codes as well as the low-complexity minimum mean-square error (MMSE) decision-feedback equalization (DFE) was presented for UWA communications. In [16], [17], the performance of FTN signaling with turbo equalization was investigated. Note that in [15], [16], a time-invariant UWA channel was considered. Hence, the above-mentioned previous FTN studies in UWA communications ignored the detrimental effects of a UWA-specific rapidly changing time-selective channel.
More recently, in [18], another novel benefit of FTN signaling was implied by simulation results. Specifically, FTN signaling may have the potential to have higher robustness against a time-selective channel over the conventional Nyquist signaling counterpart. This is owing to the benefits that lower symbol interval results in lower effects of a time-varying channel. However, such performance benefits of FTN signaling, especially in the context of rapidly time-varying UWA channels, have not been investigated in a quantitative manner.
Against this background, the novel contributions of this letter are as follows. Motivated by the recent FTN signaling scheme developed for time-invariant frequency-selective channel [9], [18], We present eigenvalue decomposition (EVD)-assisted FTN signaling having high robustness over a doubly selective fading channel specific to UWA communications. The proposed signaling transmitter relies on water-filling-based transmit precoding. Furthermore, the proposed FTN signaling allows us to reduce the effects of the time-varying channel upon decreasing the symbol’s packing ratio \tau ~(\le 1)
, which represents the compression by FTN signaling. Furthermore, the proposed FTN signaling scheme dispenses with the information rate loss associated with the excess bandwidth typically imposed on the conventional Nyquist signaling with a band-limiting shaping filter. Moreover, the three-stage-concatenated turbo equalization architecture is constituted to eliminate the effects of UWA-specific doubly selective channels and those of FTN-induced inter-symbol interference.
A. Channel Model
The channel impulse response (CIR) of an {L}
-tap time-varying doubly selective UWA channel is given by [3], [19]\begin{equation*} c(t,\kappa)=\sum ^{L-1}_{l=0}A_{l}(t)\delta (\kappa -\kappa _{l}(t)), \tag{1}\end{equation*}
View Source
\begin{equation*} c(t,\kappa)=\sum ^{L-1}_{l=0}A_{l}(t)\delta (\kappa -\kappa _{l}(t)), \tag{1}\end{equation*}
where A_{l}(t)
and \kappa _{l}(t)
represent the amplitude and delay of the {l}
th path, respectively. For a short block length, the delay variation within a block is approximated by a first-order polynomial as follows:\begin{equation*} \kappa _{l}(t)=\kappa _{l}-a_{l}t, \tag{2}\end{equation*}
View Source
\begin{equation*} \kappa _{l}(t)=\kappa _{l}-a_{l}t, \tag{2}\end{equation*}
where \kappa _{l}
is the initial delay and a_{l}
is the first derivative of \kappa _{l}(t)
. Hence, supposing that the amplitudes remain constant during each block, (1) can be rewritten as \begin{equation*} c(t,\kappa)=\sum ^{L-1}_{l=0}A_{l}(t)\delta (\kappa -\kappa _{l}+a_{l}t). \tag{3}\end{equation*}
View Source
\begin{equation*} c(t,\kappa)=\sum ^{L-1}_{l=0}A_{l}(t)\delta (\kappa -\kappa _{l}+a_{l}t). \tag{3}\end{equation*}
At the transmitter, information symbols {\mathbf x}=[x_{0},\ldots,x_{N-1}]^{T}\in {{\mathbb {C}}^{N}}
are passed through an RRC shaping filter h_{tr}(t)
having a roll-off factor \beta
with an interval T=\tau T_{s}
, where T_{s}
is the symbol interval for ISI-free transmission based on the Nyquist criterion, and \tau \in {(0,1] }
is the packing ratio for FTN transmission. Then, the signal is transmitted from a transducer, which is represented by \begin{equation*} x(t)=\sum _{n}x_{n}h_{tr}(t-nT). \tag{4}\end{equation*}
View Source
\begin{equation*} x(t)=\sum _{n}x_{n}h_{tr}(t-nT). \tag{4}\end{equation*}
At the receiver, after matched filtering with h_{re}(t)=h^{*}_{tr}(-t)
, the received baseband signal is represented by [20] \begin{equation*} y(t)= \sum _{n} x_{n}\int ^{\infty }_{-\infty } c(t,\kappa)g(t-nT-\kappa)d\kappa +z(t), \tag{5}\end{equation*}
View Source
\begin{equation*} y(t)= \sum _{n} x_{n}\int ^{\infty }_{-\infty } c(t,\kappa)g(t-nT-\kappa)d\kappa +z(t), \tag{5}\end{equation*}
where z(t)=\int _{-\infty }^{+\infty }n(\xi)h^{*}_{tr}(\xi -t)\mathop {}\mathrm {d} \xi
is the associated noise, and n(t)
is the additive white Gaussian noise (AWGN) with zero mean and a spectral density of N_{0}
. Furthermore, we have g(t)=\int _{-\infty }^{+\infty }h_{tr}(\xi)h_{re}(t-\xi)\mathrm {d}\xi
.
Now, let us assume that the path amplitudes are constant in each block and all paths share the same Doppler scale, which is appropriate since the dominant Doppler shift comes from the relative motion between the transmitter and the receiver, and the channel coherence time is sufficiently high [21]. Then, the received samples are given by\begin{align*} y(iT)=&\sum ^{L-1}_{l=0}\sum _{n}A_{l}(t)x_{n}g((i-l-n)T)+z(iT)\tag{6}\\=&\sum ^{L-1}_{l=0}\sum _{n}A_{l}(0)e^{j2\pi iF_{d}T}x_{n}g((i-l-n)T)+z(iT), \\ \tag{7}\end{align*}
View Source
\begin{align*} y(iT)=&\sum ^{L-1}_{l=0}\sum _{n}A_{l}(t)x_{n}g((i-l-n)T)+z(iT)\tag{6}\\=&\sum ^{L-1}_{l=0}\sum _{n}A_{l}(0)e^{j2\pi iF_{d}T}x_{n}g((i-l-n)T)+z(iT), \\ \tag{7}\end{align*}
where F_{d}
is the maximum Doppler shift. Note that, with the aid of the resampling technique, the received samples are affected by the residual effects of the Doppler shift [7]. Also, (7) is expressed in matrix form as \begin{align*} \mathbf {y}=&[y(0),\ldots,y((N-1)T)]^{T}\in {{\mathbb {C}}^{N}} \tag{8}\\=&{\mathbf {D}}\mathbf {H}{\mathbf x}+\mathbf {z}, \tag{9}\end{align*}
View Source
\begin{align*} \mathbf {y}=&[y(0),\ldots,y((N-1)T)]^{T}\in {{\mathbb {C}}^{N}} \tag{8}\\=&{\mathbf {D}}\mathbf {H}{\mathbf x}+\mathbf {z}, \tag{9}\end{align*}
where {\mathbf {D}}=\mathrm {diag}\{1,e^{j2\pi F_{d}T}, {\dots },e^{j2\pi F_{d}T(N-1)}\}
is the Doppler phase rotation matrix. The {i}
th-row and {k}
th-column entry of H, which includes the effects of the RRC filter and ISI caused by the frequency-selective channel and FTN signaling, is given by H(i,k)=\sum ^{L-1}_{l=0}A_{l}(0)g((i-k-l)T)
.
Moreover, the covariance matrix of the noise components z is given by {\mathbb {E}}[\mathbf {z}\mathbf {z}^{H}]=N_{0}\mathbf {G}\in {\mathbb {R}^{N\times N}}
, where {\mathbb {E}}[\cdot]
is the expectation operation. Note that G has a Toeplitz and Hermitian matrix structure and is formulated as [11] \begin{align*} \mathbf {G}=\begin{bmatrix} g_{0} &~~ g_{-1} &~~ {\dots }&~~ g_{-(N-1)} \\ g_{1} &~~ g_{0} &~~ {\dots }&~~ g_{-(N-2)} \\ \vdots &~~ \vdots &~~ \ddots &~~ \vdots \\ g_{N-1} &~~ g_{N-2} &~~ {\dots }&~~ g_{0} \end{bmatrix},\tag{10}\end{align*}
View Source
\begin{align*} \mathbf {G}=\begin{bmatrix} g_{0} &~~ g_{-1} &~~ {\dots }&~~ g_{-(N-1)} \\ g_{1} &~~ g_{0} &~~ {\dots }&~~ g_{-(N-2)} \\ \vdots &~~ \vdots &~~ \ddots &~~ \vdots \\ g_{N-1} &~~ g_{N-2} &~~ {\dots }&~~ g_{0} \end{bmatrix},\tag{10}\end{align*}
where g_{i}=g(iT)
. Hence, we arrive at the EVD of \begin{equation*} \mathbf {G}=\mathbf {Q}\boldsymbol{\Theta }\mathbf {Q}^{T},\tag{11}\end{equation*}
View Source
\begin{equation*} \mathbf {G}=\mathbf {Q}\boldsymbol{\Theta }\mathbf {Q}^{T},\tag{11}\end{equation*}
where \mathbf {Q}\in {\mathbb {R}^{N\times N}}
is an orthogonal matrix, and \boldsymbol{\Theta }=\mathrm {diag}\{\theta _{0},\ldots,\theta _{N-1}\} \in {\mathbb {R}^{N\times N}}
in the descending order \theta _{0}\geq \theta _{1}\geq \cdots \geq \theta _{N-1}
. Moreover, to avoid the significantly low eigenvalues intractable in the standard double-precision environment, we assume the relationship of \tau \geq {1}/({1+\beta })
, which guarantees \theta _{k} > 0\;(k=0,\ldots,N-1)
[18].
B. Precoded FTN Signaling Transceiver
In the proposed scheme, we employ precoding to generate the transmitted symbols x. More specifically, EVD-based precoding and weighting are designed for diagonalizing received blocks into parallel substreams. Assume an unprecoded information symbol block \mathbf {s}=[s_{0},\ldots,s_{N-1}]^{T}\in {{\mathbb {C}}^{N}}
having average energy per symbol {\mathbb {E}}[\lvert s_{n}\rvert ^{2}]=\sigma ^{2}_{s} \,\,(n=0,\ldots,N-1)
. The transmitted information symbol block is generated by multiplying the precoding matrix \mathbf {P}\in {{\mathbb {C}}^{N\times N}}
as follows:\begin{equation*} {\mathbf x}=\mathbf {P}\mathbf {s}, \tag{12}\end{equation*}
View Source
\begin{equation*} {\mathbf x}=\mathbf {P}\mathbf {s}, \tag{12}\end{equation*}
where P is designed under the block-based energy constraint \begin{equation*} E_{N}=N\sigma _{s}^{2}. \tag{13}\end{equation*}
View Source
\begin{equation*} E_{N}=N\sigma _{s}^{2}. \tag{13}\end{equation*}
The precoding matrix is optimized to maximize mutual information (MI) [18]. First, let us ignore the effects of residual phase rotations {\mathbf {D}}
since it is a challenging task to estimate {\mathbf {D}}
; then, in our optimization, the received sample block is assumed to be \mathbf {y}_{h}=\mathbf {H}{\mathbf x}+\mathbf {z}
instead of (9). The approximated MI between {\mathbf x}
and \mathbf {y}_{h}
per block is given by \begin{align*}&I({\mathbf x};\mathbf {y}_{h}) =h_{e}(\mathbf {y}_{h})-h_{e}(\mathbf {z})\tag{14}\\&\;\leq \log _{2}((\pi e)^{N} {\left \lvert{ {\mathbb {E}}[\mathbf {y}_{h}\mathbf {y}_{h}^{H}]}\right \rvert }) -\log _{2}\left ({(\pi e)^{N}{\left \lvert{ {\mathbb {E}}[\mathbf {z}\mathbf {z}^{H}]}\right \rvert }}\right)\qquad \tag{15}\\&\;\leq \log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}\mathbf {H}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\mathbf {H}^{H}\mathbf {G}^{-1}}\right \rvert }, \tag{16}\end{align*}
View Source
\begin{align*}&I({\mathbf x};\mathbf {y}_{h}) =h_{e}(\mathbf {y}_{h})-h_{e}(\mathbf {z})\tag{14}\\&\;\leq \log _{2}((\pi e)^{N} {\left \lvert{ {\mathbb {E}}[\mathbf {y}_{h}\mathbf {y}_{h}^{H}]}\right \rvert }) -\log _{2}\left ({(\pi e)^{N}{\left \lvert{ {\mathbb {E}}[\mathbf {z}\mathbf {z}^{H}]}\right \rvert }}\right)\qquad \tag{15}\\&\;\leq \log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}\mathbf {H}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\mathbf {H}^{H}\mathbf {G}^{-1}}\right \rvert }, \tag{16}\end{align*}
where h_{e}(\cdot)
and {\lvert \cdot \rvert }
denote differential entropy and the determinant of a matrix, respectively. \mathbf {I}_{N}
represents the N\times N
-sized identity matrix. Additionally, from (15) to (16), the following relationship is used: {\mathbb {E}}[\mathbf {y}_{h}\mathbf {y}_{h}^{H}]=\mathbf {H}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\mathbf {H}^{H}+N_{0}\mathbf {G}
. Since G is positive definite, we can further modify the upper bound of the approximated MI (16) as \begin{align*} I({\mathbf x};\mathbf {y}_{h})\leq&\log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\mathbf {H}^{H}\mathbf {Q}\boldsymbol{\Theta }^{-\frac {1}{2}}\boldsymbol{\Theta }^{-\frac {1}{2}}\mathbf {Q}^{T} \mathbf {H}}\right \rvert } \\=&\log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\boldsymbol{\Upsilon }^{H}\boldsymbol{\Upsilon }}\right \rvert }, \tag{17}\end{align*}
View Source
\begin{align*} I({\mathbf x};\mathbf {y}_{h})\leq&\log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\mathbf {H}^{H}\mathbf {Q}\boldsymbol{\Theta }^{-\frac {1}{2}}\boldsymbol{\Theta }^{-\frac {1}{2}}\mathbf {Q}^{T} \mathbf {H}}\right \rvert } \\=&\log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}{\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}]\boldsymbol{\Upsilon }^{H}\boldsymbol{\Upsilon }}\right \rvert }, \tag{17}\end{align*}
where \boldsymbol{\Upsilon }=\boldsymbol{\Theta }^{-\frac {1}{2}}\mathbf {Q}^{T}\mathbf {H}
. The matrix \boldsymbol{\Upsilon }^{H}\boldsymbol{\Upsilon }
can be decomposed by EVD into \boldsymbol{\Upsilon }^{H}\boldsymbol{\Upsilon }=\mathbf {B}\boldsymbol{\Omega }\mathbf {B}^{H}
, where \mathbf {B}\in {\mathbb {C}}^{N\times N}
is an orthogonal matrix, and \boldsymbol{\Omega }=\mathrm {diag}\{\omega _{0},\ldots,\omega _{N-1}\} \in \mathbb {R}^{N\times N}
is a diagonal eigenvalue matrix. Hence, we arrive at \begin{equation*} I({\mathbf x};\mathbf {y}_{h}) \leq \log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}\boldsymbol{\Omega }^{\frac {1}{2}}\mathbf {B}^{H} {\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}] \mathbf {B} \boldsymbol{\Omega }^{\frac {1}{2}}}\right \rvert }. \tag{18}\end{equation*}
View Source
\begin{equation*} I({\mathbf x};\mathbf {y}_{h}) \leq \log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {1}{N_{0}}\boldsymbol{\Omega }^{\frac {1}{2}}\mathbf {B}^{H} {\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}] \mathbf {B} \boldsymbol{\Omega }^{\frac {1}{2}}}\right \rvert }. \tag{18}\end{equation*}
Based on Hadamard’s inequality in [18], the approximated MI of (18) is maximized when the matrix \mathbf {B}^{H} {\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}] \mathbf {B}
is diagonal, i.e., \mathbf {B}^{H} {\mathbb {E}}[{\mathbf x}{\mathbf x}^{H}] \mathbf {B}=\sigma ^{2}_{s}\mathbf {M}
and \mathbf {M}=\mathrm {diag}\{\mu _{0}, {\dots },\mu _{N-1}\}\in \mathbb {R}^{N\times N}
. Also, if we set \mathbf {P}=\mathbf {B}\mathbf {M}^{\frac {1}{2}}
, the approximated MI of (18) is upper-bounded as \begin{align*} I({\mathbf x};\mathbf {y}_{h})\leq&\log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {\sigma _{s}^{2}}{N_{0}}\boldsymbol{\Omega }^{\frac {1}{2}} \mathbf {M} \boldsymbol{\Omega }^{\frac {1}{2}}}\right \rvert }\tag{19}\\=&\sum ^{N-1}_{i=0}\log _{2}\left ({1+\frac {\sigma _{s}^{2}}{N_{0}}\omega _{i}\mu _{i}}\right). \tag{20}\end{align*}
View Source
\begin{align*} I({\mathbf x};\mathbf {y}_{h})\leq&\log _{2} {\left \lvert{ \mathbf {I}_{N}+\frac {\sigma _{s}^{2}}{N_{0}}\boldsymbol{\Omega }^{\frac {1}{2}} \mathbf {M} \boldsymbol{\Omega }^{\frac {1}{2}}}\right \rvert }\tag{19}\\=&\sum ^{N-1}_{i=0}\log _{2}\left ({1+\frac {\sigma _{s}^{2}}{N_{0}}\omega _{i}\mu _{i}}\right). \tag{20}\end{align*}
Note that under the assumption of perfect CSI, the approximated MI bound of (20) is maximized with respect to \mu _{i}\;(i=0,\ldots,N-1)
. Here, the average energy per block for the precoded symbols x is [18] \begin{align*} E_{N}=&{\mathbb {E}}\left [{{\mathbf x}^{H}\mathbf {G}{\mathbf x}}\right]\tag{21}\\=&\sigma _{s}^{2}{\mathrm {Tr}}\left \{{\mathbf {M}\mathbf {B}^{H}\mathbf {G}\mathbf {B}}\right \}\tag{22}\\=&\sigma _{s}^{2}\sum _{i=0}^{N-1}\mu _{i}\psi _{i}, \tag{23}\end{align*}
View Source
\begin{align*} E_{N}=&{\mathbb {E}}\left [{{\mathbf x}^{H}\mathbf {G}{\mathbf x}}\right]\tag{21}\\=&\sigma _{s}^{2}{\mathrm {Tr}}\left \{{\mathbf {M}\mathbf {B}^{H}\mathbf {G}\mathbf {B}}\right \}\tag{22}\\=&\sigma _{s}^{2}\sum _{i=0}^{N-1}\mu _{i}\psi _{i}, \tag{23}\end{align*}
where \mathrm {Tr}\{\cdot \}
denotes the trace operation, and \mathbf {B}^{H}\mathbf {G}\mathbf {B}
has a diagonal elements \psi _{i} \,\,(i=0,\ldots, N-1)
. From (13) and (23), the energy constraint is given by \sigma _{s}^{2}\sum _{i=0}^{N-1}\mu _{i}\psi _{i}=N\sigma _{s}^{2}
. Therefore, the approximated MI bound of (20) is maximized under the constraint \sum _{i=0}^{N-1}\mu _{i}\psi _{i}=N
with the aid of the method of Lagrange multipliers. The Lagrangian function is formulated as \begin{equation*} {\mathcal { L}}=\sum ^{N-1}_{i=0}\log _{2}\left ({1+\frac {\sigma _{s}^{2}}{N_{0}}\omega _{i}\mu _{i}}\right) -\lambda \left ({\sum _{i=0}^{N-1}\mu _{i}\psi _{i}-N}\right), \tag{24}\end{equation*}
View Source
\begin{equation*} {\mathcal { L}}=\sum ^{N-1}_{i=0}\log _{2}\left ({1+\frac {\sigma _{s}^{2}}{N_{0}}\omega _{i}\mu _{i}}\right) -\lambda \left ({\sum _{i=0}^{N-1}\mu _{i}\psi _{i}-N}\right), \tag{24}\end{equation*}
where \lambda
is a Lagrange multiplier. By solving {\partial {\mathcal { L}}}/{\partial \mu _{i}}=0\;(\mu _{i}\geq 0)
, the optimal \mu _{i}
values are calculated as \begin{equation*} \mu _{i}=\max \left ({\frac {1}{\lambda \psi _{i}\ln 2}-\frac {N_{0}}{\omega _{i}\sigma _{s}^{2}},\;0}\right). \tag{25}\end{equation*}
View Source
\begin{equation*} \mu _{i}=\max \left ({\frac {1}{\lambda \psi _{i}\ln 2}-\frac {N_{0}}{\omega _{i}\sigma _{s}^{2}},\;0}\right). \tag{25}\end{equation*}
Note that the solution is similar to that of the singular-value decomposition (SVD)-MIMO water-filling scheme [22, Ch.10].
At the receiver, the weighting matrix is set to \mathbf {W}=\mathbf {B}^{H}\boldsymbol{\Upsilon }^{H}\boldsymbol{\Theta }^{-\frac {1}{2}}\mathbf {Q}^{T}
, making the received symbol block become \begin{align*} \mathbf {y}_{w}=&\mathbf {W}\mathbf {y}\tag{26}\\=&\mathbf {W}{\mathbf {D}}\mathbf {H}{\mathbf x}+\mathbf {W}\mathbf {z}, \tag{27}\end{align*}
View Source
\begin{align*} \mathbf {y}_{w}=&\mathbf {W}\mathbf {y}\tag{26}\\=&\mathbf {W}{\mathbf {D}}\mathbf {H}{\mathbf x}+\mathbf {W}\mathbf {z}, \tag{27}\end{align*}
where the covariance matrix of the additive noise is calculated as {\mathbb {E}}[(\mathbf {W}\mathbf {z})(\mathbf {W}\mathbf {z})^{H}] =\mathbf {W}{\mathbb {E}}[\mathbf {z}\mathbf {z}^{H}]\mathbf {W}^{H} =N_{0}\boldsymbol{\Omega }
, which ensures whitened noise.
For the ideal time-invariant scenario of {\mathbf {D}}=\mathbf {I}_{N}
, (27) can be further simplified to \begin{equation*} \mathbf {y}_{w}={\mathbf {D}}\boldsymbol{\Omega }\mathbf {M}^{\frac {1}{2}}{\mathbf x}+\mathbf {W}\mathbf {z}, \tag{28}\end{equation*}
View Source
\begin{equation*} \mathbf {y}_{w}={\mathbf {D}}\boldsymbol{\Omega }\mathbf {M}^{\frac {1}{2}}{\mathbf x}+\mathbf {W}\mathbf {z}, \tag{28}\end{equation*}
where the received symbol block is diagonalized into several independent streams. Nevertheless, D is no longer the identity matrix in the presence of the Doppler shift, which may degrade the achievable performance. However, owing to the benefits of a reduced symbol interval T < T_{s}
, in comparison to the Nyquist criterion, the effects of the Doppler shift are minimized.
Similar to [18], the detection complexity of the proposed scheme is dominated by EVD operation, which is the order of N^{3}
per block. However, the recent fast Fourier transform (FFT)-based approximation [23] allows us to reduce it to N\log N
.
SECTION III.
Performance Results
In this section, the achievable performance of the proposed scheme is evaluated in terms of bit error ratio (BER) under different scenarios, where the basic system parameters are listed in Table I. Three-stage-concatenated turbo coding is employed as a channel encoder [24]. The bit loading part is applied to allocate information bits to the activated substreams according to (25). More specifically, binary phase-shift keying (BPSK), quadrature phase-shift keying (QPSK), and {M}
-ary quadrature amplitude modulation (MQAM) are assigned to each active substream to achieve a target rate. The detailed implementation is found in [23, Sec.IV-B].
We considered a doubly selective UWA channel, where the same amplitude and delay of each path as those in [2, Fig.5] were used. The block size and the target information rate were {N}
= 200 and {R}
= 1 bps/Hz, respectively. The bandwidth was set to 2B_{d}(1+\beta)={5}
kHz, where the Nyquist interval was T_{s}=1/(2B_{d})
.
In Fig. 1, we compared the BER performance of the proposed FTN signaling and that of the Nyquist criterion, both employing the same RRC filter with roll-off factor \beta =0.25
, which is a similar value to those employed in the many standards and in the previous FTN signaling studies [9], [16]. The normalized Doppler shift was fixed as 1.2\times 10^{-4}
. The packing ratio of FTN signaling was given by \tau =0.8
and 0.9. The curves of the Nyquist criterion employing the idealistic rectangular shaping filter (\beta =0
) and the same RRC shaping filter as that of the proposed scheme are also plotted as a reference, where EVD-based precoding and detection are employed in the same manner to the proposed scheme. Observe in Fig. 1 that the FTN signaling schemes outperformed the Nyquist-criterion counterpart employing the RRC shaping filter. Furthermore, the performance of FTN signaling improved upon decreasing the packing ratio from \tau =0.9
to 0.8 and became closer to the ideal bound (\tau =1,\beta =0
).
Fig. 2 shows the effects of roll-off factor \beta
on the achievable performance of the proposed FTN signaling scheme and the Nyquist-based counterpart. The SNR and the normalized Doppler frequency were given by \sigma _{s}^{2}/N_{0}={10}\mathrm {dB}
and F_{d}T_{s}=1.2\times 10^{-4}
, respectively. The roll-off factor was varied from \beta =0
to 1 in steps of 0.1. The packing ratio of the FTN scheme was set to \tau =1/(1+\beta)
for each \beta
. As shown in Fig. 2, the proposed FTN signaling scheme outperformed the Nyquist-criterion counterpart except for the idealistic sinc pulse scenario of \beta =0
. More specifically, upon increasing the \beta
value, the performance gain of the proposed FTN signaling scheme increased.
Fig. 3 shows BER performance of the proposed FTN signaling scheme and the Nyquist-criterion benchmark for different normalized Doppler shifts. The roll-off factor of the RRC filter and the block size were given by \beta =0.25
and {N}
= 200, respectively. The curves corresponding to no Doppler shift are also plotted. As seen in Fig. 3, in each F_{d}T_{s}
scenario, the proposed FTN signaling scheme exhibited better performance than the conventional Nyquist counterpart owing to the reduced symbol interval. This performance gain is achieved because the effective normalized Doppler shift experienced by our FTN signaling is characterized by F_{d}T
, which is \tau
times lower than F_{d}T_{s}
.
Fig. 4 shows the BER curves of the proposed scheme with normalized Doppler shifts of F_{d}T_{s} = 5\times 10^{-5}, 1\times 10^{-4}
, and 1.2\times 10^{-4}
while maintaining a roll-off factor of \beta =0.25
. The block size was given by {N}
= 1000, and the packing ratio of the proposed FTN scheme was set to \tau =0.8
. The Nyquist-criterion counterpart (\tau =1
) with F_{d}T_{s}=1.2\times 10^{-4}
is plotted for comparison. Observe in Fig. 4 that the performance of the FTN signaling scheme is affected more by F_{d}T_{s}
than in the {N}
= 200 scenario (Fig. 3) while typically outperforming the Nyquist-criterion scheme. This is because the effects of channel rotation increase upon increasing the block size in the system model considered.
In Fig. 5, the effects of normalized Doppler shift on BER performance are illustrated with an SNR of \sigma _{s}^{2}/N_{0}={10}\mathrm {dB}
and the block size fixed as {N}
= 200. Both the proposed FTN signaling and the Nyquist-criterion schemes employed an RRC filter with \beta =0.25
. The normalized Doppler shift was varied in the range of F_{d}T_{s}\in [0,2\times 10^{-3}]
in steps of 0.0001. The packing ratio of the proposed scheme was given by \tau =0.8
and 0.9. From Fig. 5, it can be found that the BER of both the schemes increased upon increasing F_{d}T_{s}
. In the entire range of F_{d}T_{s}
, the proposed FTN signaling scheme exhibited higher performance than the Nyquist-criterion benchmark.
In this letter, we proposed the FTN signaling scheme with EVD-based power allocation to achieve high robustness over the doubly selective UWA channel. It was demonstrated that the proposed scheme’s reduced symbol interval benefits from the better BERs than the conventional Nyquist-criterion counterpart.