# Compressed Detection for Pulse-Based Communications in the Terahertz Band

Authors: Pankaj Singh; Byung-Wook Kim; Sung-Yoon Jung
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

Terahertz (THz) band (0.1-10 THz)-based electromagnetic communications are envisioned as a key technology to enable future high-data-rate short-range ultrabroadband communications. However, one of the fundamental bottlenecks is the efficiency of the analog-to-digital converters (ADCs) considering the formidable challenge of sampling the signal at the Nyquist rate eventually increasing transceiver design complexity. The Compressed sensing (CS) framework enables the successful reconstruction of sparse signals from a small set of projections onto a random vector which would lead to sub-Nyquist rate sampling. In this paper, THz band channel estimation based on the theory of CS is developed. The proposed approach exploits the fact that transmitting an ultrashort pulse through a multipath THz channel leads to a received THz signal that can be approximated by a linear combination of a few atoms from a predefined dictionary, yielding thus a sparse representation of the received signal. The fundamental idea is in the design of the dictionary of atoms that closely matches the transmitted pulse leading thus to a higher probability of CS reconstruction. The Orthogonal Matching Pursuit (OMP) algorithm is used to identify the strongest atoms in the projected signal. This reconstructed signal is subsequently used as a reference template in a correlator-based detector. The bit error rate (BER) performance of the proposed detector is analyzed and compared with the conventional CS-based channel estimation and reconstruction approach. Extensive simulations show that, for different design parameters, our proposed detector outperforms the traditional CS-based correlator receiver for the same sampling rate leading thus to a much-reduced use of analog-to-digital resources. Moreover, the proposed detector has been shown to reduce the hardware complexity of the receiver by significantly reducing the number of parallel mixer-integration branches.


---

## Body

## 1. Introduction

Wireless data communication is penetrating into many dimensions of human life, from mobile Internet to real-time healthcare monitoring and environmental protection. Moreover, wireless data traffic has been exponentially increasing which will lead to an increasing demand for the high-speed wireless communication, anywhere, anytime, in the near future. To satisfy the forthcoming data needs and develop future wireless communications systems, we need to utilize the already congested spectrum very efficiently. One of way is to improve our classical communication paradigms using more advanced digital schemes, e.g., Orthogonal Frequency Division Multiplexing (OFDM), Multiple-Input Multiple-Output (MIMO) systems, and beamforming. Another way is to look for the new solutions at the same time, e.g., cognitive radio and underutilized bands. Terahertz (THz) band is one such least explored zone of the electromagnetic (EM) spectrum. Recently, Terahertz band (0.1 THz–10.0 THz) communications are envisaged as a wireless technology that can bring novel solutions to the future communication needs, particularly in the Wireless Personal Area Networks (WPANs) [1]. Terahertz band-based short-range nanoscale communications would enable Terabit-per-second (Tbps) links in the short-range, i.e., up to 1 m [2]. The expected range of communication can be increased up to 10 m using the transparency windows achieving a capacity of up to 10 Mbps [3]. This would enable the next-generation small cell cellular networks with ultrahigh-speed data communication to alleviate the problem of spectrum scarcity and capacity limitations. Moreover, THz band communications open the door to the development of variety of applications which demand ultrahigh data rates in many fields such as medical, environmental, and military [1].However, there exist several research challenges from the communication perspective. One of the main problems is the high-frequency signal processing. Over the years, signal processing has been governed by classical Nyquist theorem. According to this theorem, a signal can be determined from its samples, if the sampling rate is more than twice the highest frequency present in the signal. In other words, the number of samples needed to reconstruct a signal depends on its bandwidth. However, due to the very short duration and ultrabroadband nature of the transmitted THz signals, this theorem imposes several challenges on the hardware, storage, and subsequent signal processing ultimately leading to stressed out analog-to-digital converters (ADCs) at the receiver side [4, 5]. Moreover, the state-of-the art ADCs can only sample at rates around 100 Giga-Samples-per-second (GSas) [6, 7], much below the Nyquist rate for THz signals. On the other hand, most of the signals with large bandwidth have a small rate of information [8]. In recent years, an alternative approach has emerged for signal reconstruction known ascompressed sensing (CS) [9]. This method uses the sparse nature of wideband signals and provides an option to deal with the signal reconstruction problem by utilizing far fewer samples than required by the Nyquist theorem.The field of CS has been heavily investigated in recent years for various communications systems. Different works on CS in combination with ultrawideband (UWB) related to channel estimation [10, 11], detection [12, 13], and time of arrival (ToA) estimation [14, 15] have been presented. At millimeter wave (mmWave) frequencies (30 GHz-300 GHz), an efficient channel estimator using CS for hybrid MIMO system has been proposed in [16]. An approach to leverage the sparse structure of the frequency-selective mmWave channels and a formulation for channel estimation has been developed in [17]. An adaptive one-bit compressed sensing scheme that can be used at low-resolution mmWave receivers for channel estimation has been proposed as an alternative to high-resolution power-hungry ADCs [18]. In the THz band, as of now, CS has been exploited for applications in the fields of Imaging and Spectroscopy [19]. However, in this work, CS has been analyzed from the wireless communications aspect in the Terahertz band.In this study, mathematical properties of CS are applied to channel estimation and demodulation design for the pulse-based Terahertz band communications. In the THz band communications, an ultrashort femtosecond-long pulse is used as transmitted signal to convey the information [20]. The received signal remains sparse in time domain due to the multipath nature of the channel. Exploiting the signal sparsity of the received THz signals, a correlator-based detector based on the concept of CS has been developed. Using the frame template reconstruction of pilot symbols which has been done using the Orthogonal Matching Pursuit (OMP), the remaining information-bearing symbols are demodulated in the analog domain. The compressive measurements are sampled at the frame rate. Moreover, a new method, where measurements from all the frames are applied simultaneously to OMP, is also proposed. The proposed method exploits the received signal properties to design the dictionary of parameterized waveforms (atoms). As those waveforms closely match the remaining information carrying pulse, the new method has been shown to improve the receiver performance and reduce the hardware complexity at the same time.The rest of this paper is organized as follows. In Section2, basic theory related to CS has been discussed. Section 3 describes the system model for pulse-based Terahertz band communications including the multipath channel. In Section 4, the proposed CS-based channel estimation along with the corresponding demodulation scheme has been developed. A correlation-based detector has been used. In addition, the conventional CS-based scheme is also described. Section 5 shows the simulation results and the work is concluded in Section 6.


## 2. CS Preliminary

Compressed sensing is a novel mathematical concept, which provides an alternative to the existing state-of-the-art receivers which require extremely high-sampling rates for signal reconstruction [21–23]. Essentially, CS is signal reconstruction from random projections of a signal vector, provided that the signal is sparse in the vector space. Specifically, one can recover certain signals from far fewer samples than traditionally required. However, two important criteria must be satisfied for the successful reconstruction of the signal. First, the signal should besparse in some domain.Sparsity implies that the signal has a few nonzero components on some basis. In other words, sparsity is a signal property that measures the signal redundancy in some domain or basis. If a signal has only “K” nonzero coefficients on an adequately chosen basis, it is said to be K-sparse. The second criterion is that the property ofincoherence must be satisfied. Incoherence measures the maximum correlation between any two elements of two different matrices. These two matrices represent two different bases. If Φ is an N×N matrix representing the basis in which the signal is sparse and Ψ is an M×N measurement matrix, i.e., matrix used to sample or sense signal, then the property of incoherence between above two matrices translates to fewer samples requirement for the signal reconstruction.Mathematically, if a signal,x∈RN, composed of N samples is K-sparse in some orthonormal basis, Φ=[ϕ1,ϕ2,…,ϕN], such that x can be approximated by a linear combination of K-vectors from the dictionary Φ, where K≪N, then the CS theory shows that x can be recovered from M(≪N) measurements with high probability when M=CKlog⁡N, where C is the oversampling factor [21]. The measurements are given by y=Ψx, where Ψ is a M×N random projection matrix. At the same time, to satisfy the incoherence property between sensing matrix and the representation matrix, random matrices are proposed as they are largely incoherent with any fixed basis. The Restricted Isometry Property (RIP) criterion is the most widely used tool to check whether a specific sensing matrix is qualified for recovering a sparse signal or not. A matrix Ψ, of size M×N, is said to satisfy RIP of order K with a restricted isometry constant (RIC), with δK∈(0,1) being the smallest number such that(1)1-δKx22≤Ψx22≤1+δKx22holds for all K-sparse vectors x. In other words, it could be loosely said that a matrix Ψ obeys the RIP of order K if δK is not too close to one. RIP of order K implies that Ψ preserves the Euclidean distance between any two K-sparse signals which in turn implies that K-sparse vectors cannot reside in the null space of Ψ. A random M×N matrix whose entries are independently identically distributed (i.i.d.) realization of certain zero-mean random variable with variance 1/N satisfies the RIP with a high probability when M≥CKlog⁡(N/K).Regarding signal recovery, Orthogonal Matching Pursuit (OMP) [24] has been used as it is not based on optimization and finds the solution in an iterative fashion. It is faster and easier to apply as the number of iterations depends on the dimension of Ψ and it is quite transparent. The OMP algorithm finds the component with maximum correlation in the measurement signal, eliminates it from the signal, and searches again for the maximum correlation component in the residual signal (Table 1). In particular, the approximation for x is updated in each iteration by projecting y orthogonally on the columns of Ψ associated with the current support set Ti. Therefore, OMP minimizes ‖y-Ψx^‖1 over all x^ with support Ti. Note that the minimization is performed with respect to all the currently selected coefficients as(2)x^Tii=arg⁡min⁡y-Ψx^12Table 1
Orthogonal matching pursuit algorithm.
Step 1 Input:  y and Ψ Initialize:  r0=y, x^0=0, T0=∅  Step 2 for  i=1; i≔i+1 till stopping criteria is met do m i = Ψ ⊤ r i - 1 n i = arg ⁡ m a x n | m n i | / | | ψ n | | 1 T i = T i - 1 ∪ n i  Step 3 x ^ T i i = ( Ψ ( T i ) ⊤ Ψ ( T i ) ) - 1 Ψ ( T i ) ⊤ y, r i = y - Ψ x ^ i  Step 4 end for Output:  ri and x^iThe OMP algorithm runs as follows:(1)
Initialize the residual measurementr0=y, the approximation x^0=0, where x^i∈RN, and set T0=∅. Let the iteration counter be i=1.(2)
Solve the maximization problemni=arg⁡maxn⁡|mni|/‖ψn‖1, and update Ti=Ti-1∪ni.(3)
Solve the least square problem,x^Tii=(Ψ(Ti)⊤Ψ(Ti))-1Ψ(Ti)⊤y, and update ri=y-Ψx^i, where Ψ(Ti)={ψt∣t∈Ti}.(4)
If the stopping criterion is satisfied, stop; otherwisei=i+1 and return to step (2).


## 3. CS-Based Pulsed THz Band Communications

In the CS framework, a set of pilot signals are used to estimate the channel. In other words, reference template reconstruction is performed which is then used for subsequent correlation detection [10, 25, 26].


### 3.1. Transmitted Signal Model

In the THz band communications, information symbols are conveyed by a stream of ultrashort femtosecond-long pulses [20]. The symbol structure is shown in Figure 1. A symbol duration consists of several numbers of frames (Nf), each having a duration of Tf. Each frame has a pulse of ultrashort duration, Tp. The transmitted signal, s(t), can be represented as(3)st=∑i=0Np-1∑m=0Nf-1pt-iNfTf-mTf+∑j=0Ni-1aj∑n=0Nf-1pt-jNfTf-nTf-NpNfTf,where t∈[0,Ts],  Ts(=NsNfTf) is the symbol duration, p(t) is the first-order Gaussian derivative pulse, aj∈{±1} is the binary modulated information symbols, Np is the total number of unmodulated pilot symbols, Ni is total number of information symbols, and Ns(=Np+Ni) is the total number of symbols.Figure 1
Transmitted signaling structure.As shown in Figure1, the signaling scheme is based on pilot symbol aided modulation. Each signaling includes the Np pilot symbols, which are not data modulated, and Ni(=Ns-Np) data modulated symbols. The pilot symbols are used for channel estimation. In addition, the transmitted pulse is the first derivative of the Gaussian given by(4)pt=-kt-μ2πσ3exp⁡-t-μ22σ2,where k is the normalization factor, μ is the mean of the Gaussian pulse, and σ is the root mean square (RMS) width of the pulse.


### 3.2. Channel Model

The Terahertz channel has very-high spreading loss and molecular absorption loss unlike other frequency bands [20, 27]. The absorption loss depends on the concentration of gaseous molecules present in the propagation medium, mainly water vapor molecules. It results in the strong dependence of Terahertz band on the signal frequency, transmission distance, and propagation medium characteristics. For short range, THz band offers incredibly huge bandwidth (almost 10 THz wide window). In addition, the multipath propagation results in very-high reflection losses which depend on the shape, material, and roughness of the reflecting surface affecting the Terahertz wave propagation [28]. For instance, surfaces considered as smooth at lower-frequencies becomes rough at Terahertz frequencies. This is because the level of roughness increases as the wavelength decreases. Moreover, the reflection losses also depend on the incident angles of the reflected waves [29].A simple multipath channel model for the Terahertz band can be given by the following impulse response [28, 29]:(5)ht=F-1Heqf,d,r,with(6)Heqf,d,r=HLoSf,d+∑i=1LHNLoS,if,ri,where F-1[.] is inverse Fourier transform operation, Heq represents the equivalent channel transfer function which is a combination of line-of-sight (LoS) (i.e., HLoS) and i-th non-line-of-sight (NLoS) path’s (i.e., HNLoS,i) channel transfer function [28, 29], L is the total number of indirect rays, d is the LoS distance, ri denotes the NLoS distance of the i-th path between the transmitter and receiver, and f is frequency. Moreover, the LoS and NLoS transfer functions can be written as follows [28, 30]:(7)HLoSf,d=Hsprf,dHabsf,de-j2πfτLoSand(8)HNLoS,if,ri=Hspr,if,riHabs,if,rie-j2πfτNLoSi,where Hspr and Habs are the spreading loss and molecular absorption loss transfer functions [28, 29], respectively, and τLoS and τNLoSi are the propagation delays of the LoS path and the i-th NLoS path, respectively. Figure 2 depicts the Terahertz band path gain model as a function of frequency for various distances. As we can see, for larger distances, various spikes of attenuation occur in the path gain model due to the molecular absorption loss.Figure 2
THz band path gain as a function of frequency for various distances.


### 3.3. Received Signal

After passing through the channel, the received signal can be given as(9)rt=st∗ht+nt,where n(t) is the THz band noise comprising molecular absorption noise [27] and additive white Gaussian noise (AWGN). The received signal in (9) can be expanded as(10)rt=∑i=0Np-1∑m=0Nf-1prt-iNfTf-mTf+∑j=0Ni-1aj∑n=0Nf-1prt-jNfTf-nTf-NpNfTf+nt,where pr(t)(=p(t)∗h(t)) is the noiseless composite pulse-multipath channel.


## 3.1. Transmitted Signal Model

In the THz band communications, information symbols are conveyed by a stream of ultrashort femtosecond-long pulses [20]. The symbol structure is shown in Figure 1. A symbol duration consists of several numbers of frames (Nf), each having a duration of Tf. Each frame has a pulse of ultrashort duration, Tp. The transmitted signal, s(t), can be represented as(3)st=∑i=0Np-1∑m=0Nf-1pt-iNfTf-mTf+∑j=0Ni-1aj∑n=0Nf-1pt-jNfTf-nTf-NpNfTf,where t∈[0,Ts],  Ts(=NsNfTf) is the symbol duration, p(t) is the first-order Gaussian derivative pulse, aj∈{±1} is the binary modulated information symbols, Np is the total number of unmodulated pilot symbols, Ni is total number of information symbols, and Ns(=Np+Ni) is the total number of symbols.Figure 1
Transmitted signaling structure.As shown in Figure1, the signaling scheme is based on pilot symbol aided modulation. Each signaling includes the Np pilot symbols, which are not data modulated, and Ni(=Ns-Np) data modulated symbols. The pilot symbols are used for channel estimation. In addition, the transmitted pulse is the first derivative of the Gaussian given by(4)pt=-kt-μ2πσ3exp⁡-t-μ22σ2,where k is the normalization factor, μ is the mean of the Gaussian pulse, and σ is the root mean square (RMS) width of the pulse.


## 3.2. Channel Model

The Terahertz channel has very-high spreading loss and molecular absorption loss unlike other frequency bands [20, 27]. The absorption loss depends on the concentration of gaseous molecules present in the propagation medium, mainly water vapor molecules. It results in the strong dependence of Terahertz band on the signal frequency, transmission distance, and propagation medium characteristics. For short range, THz band offers incredibly huge bandwidth (almost 10 THz wide window). In addition, the multipath propagation results in very-high reflection losses which depend on the shape, material, and roughness of the reflecting surface affecting the Terahertz wave propagation [28]. For instance, surfaces considered as smooth at lower-frequencies becomes rough at Terahertz frequencies. This is because the level of roughness increases as the wavelength decreases. Moreover, the reflection losses also depend on the incident angles of the reflected waves [29].A simple multipath channel model for the Terahertz band can be given by the following impulse response [28, 29]:(5)ht=F-1Heqf,d,r,with(6)Heqf,d,r=HLoSf,d+∑i=1LHNLoS,if,ri,where F-1[.] is inverse Fourier transform operation, Heq represents the equivalent channel transfer function which is a combination of line-of-sight (LoS) (i.e., HLoS) and i-th non-line-of-sight (NLoS) path’s (i.e., HNLoS,i) channel transfer function [28, 29], L is the total number of indirect rays, d is the LoS distance, ri denotes the NLoS distance of the i-th path between the transmitter and receiver, and f is frequency. Moreover, the LoS and NLoS transfer functions can be written as follows [28, 30]:(7)HLoSf,d=Hsprf,dHabsf,de-j2πfτLoSand(8)HNLoS,if,ri=Hspr,if,riHabs,if,rie-j2πfτNLoSi,where Hspr and Habs are the spreading loss and molecular absorption loss transfer functions [28, 29], respectively, and τLoS and τNLoSi are the propagation delays of the LoS path and the i-th NLoS path, respectively. Figure 2 depicts the Terahertz band path gain model as a function of frequency for various distances. As we can see, for larger distances, various spikes of attenuation occur in the path gain model due to the molecular absorption loss.Figure 2
THz band path gain as a function of frequency for various distances.


## 3.3. Received Signal

After passing through the channel, the received signal can be given as(9)rt=st∗ht+nt,where n(t) is the THz band noise comprising molecular absorption noise [27] and additive white Gaussian noise (AWGN). The received signal in (9) can be expanded as(10)rt=∑i=0Np-1∑m=0Nf-1prt-iNfTf-mTf+∑j=0Ni-1aj∑n=0Nf-1prt-jNfTf-nTf-NpNfTf+nt,where pr(t)(=p(t)∗h(t)) is the noiseless composite pulse-multipath channel.


## 4. CS-Based Correlator Detector

In this section, we propose a simplified correlator-based detector for the THz band communications. The received signal per frame is correlated with a reference template to decode the transmitted information symbol in the corresponding frame. The reference template is the pulse-multipath frame template that is reconstructed using compressed sensing. Therefore, the receiver performs frame-rate sampling on the correlator output to generate sufficient statistics for the detection of the transmitted information symbol. The proposed correlator-based detector is implemented in the analog domain (cf. Figure3). As shown, the first stage is the channel estimation stage and the next stage is the demodulation stage. In the channel estimation stage, based on the received pilot waveforms, the frame-long channel reference template is reconstructed. Let rp(t) be the pilot signal carrying Np pilot symbols with Nf frames in each corresponding symbol. Thus, rp(t) can be represented as(11)rpt=∑i=0Np-1∑m=0Nf-1prt-iNfTf-mTf+nt,where t∈[0,Tpi). Considering that the received signal is observed over nonoverlapping time intervals in the time window frame of t∈[kTf,(k+1)Tf) for k=0,1,2,…,NfNp-1, and assuming perfect timing synchronization, each time interval (i.e., Tf) contains multipath frames contaminated with noise. Therefore, the received pilot symbol per frame can be represented as(12)gkt=kNfprt+nt,where gk(t) is frame long received pilot symbol. In the next subsections, we develop the channel estimation model for both conventional and proposed CS-based correlation receivers that finally lead us to the demodulation stage.Figure 3
Block diagram of proposed CS correlator-based detector.


### 4.1. Conventional CS-Based Channel Estimation

The channel estimation procedure is as follows. First, the compressed samples are taken at frame-rate sampling in the receiver. Second, using OMP, original pulse-multipath channel frame is reconstructed from less number of samples. Exploiting the time sparsity nature of the Terahertz channel, the representation (basis) matrixΦ can be assumed to be an identity matrix [10]. The input to the channel estimation block (i.e., rp(t)) is an analog multipath frame of each pilot symbol and the output (i.e., pi) is a discrete representation of analog multipath frame (cf. Figure 3). In other words, as the received signal is composed of time-shifted versions of multipath template contaminated with noise, by observing the signal in a frame-long interval, and randomly projecting the observed signal, a noisy template can be recovered using OMP algorithm.The discrete-time representation of the continuous multipath frame in each pilot symbol is presented asgk=[gk(0),gk(T),…,gk((N-1)T)]⊤, where N is the number of samples and T is the Nyquist sampling period. The elements of the measurement matrix, ΨM×N, can be chosen as independent and identically distributed (i.i.d.) Gaussian random variables with zero mean and 1/N variance. If the sparsity order of the pulse-multipath frame is given by K, the number of required samples to fulfill the RIP condition and incoherence property is given by(13)M≥CKlog10⁡NK,where C(≥1) is the oversampling factor. Compressed sensing based sampling equation for the k-th frame can be written as(14)rk=Ψgk,where rk=[rk(0),rk(1),…,rk(M-1)]⊤. Since NpNf pilot waveforms are used for channel estimation, the estimated composite pulse-multipath channel is formed by averaging over NpNf noisy templates. In other words, the random projected signals corresponding to the received pilot waveforms are averaged and input to the OMP algorithm.As the random projected signals are averaged before reconstruction to obtain the discrete-time channel template,pi, the sampled vector r is given by(15)r=1NpNf∑k=0NfNp-1rk.Finally, pi is recovered using the following objective function given by(16)pi=mingk1s.t.r=Ψgk,where pi=[pi(0),pi(1),…,pi(N-1)]⊤. Note that the above method is computationally less expensive compared to reconstructing every frame. This is because by using OMP first and then averaging over the NpNf samples, it requires running the OMP only once. Moreover, it implicitly mitigates the effect of noise. The reconstructed pulse-multipath frame template is now used to demodulate the remaining information-bearing symbols.


### 4.2. Proposed CS-Based Channel Estimation

In the conventional method, ensemble of projected samples from pilot symbol is collected and the multipath frame template is then reconstructed after ensemble averaging overNf frames. However, the number of projected measurement samples is usually found to be very large. For instance, if the composite pulse-multipath channel frame is composed of N=256 samples, then, with a sparsity order of 35% and C=1, the minimum value of projected samples, i.e., Mmin, is 40. In other words, the pulse-multipath channel template could be reconstructed with at least 40 random measurements. This will result in 40 numbers of correlator branches at the receiver, which may increase hardware cost. Therefore, we propose a new template reconstruction mechanism which significantly reduces the number of correlator branches (i.e., M) and also improves the performance of the system simultaneously.The proposed reconstruction method exploits the unique symbol structure of the Terahertz band symbols. First, a THz symbol consists of a number of frames, and each frame carries a pulse. Therefore, the received signal is formed by scaled and delayed versions of the transmitted pulse. Since the dictionary should contain elements (atoms) that can fully represent the information carrying symbols, the elements of dictionary are generated so that they closely relate to the pulse waveform. Therefore, the atoms in the dictionary are thus delayed versions of the THz transmitted pulse. Second, the same frame is repeated over the entire pilot symbol duration (i.e.,Tpi). In other words, the frames carry the same information every Tf period. Therefore, it is not necessary to take the Mmin number of samples every frame. Instead, a much lower number of samples per frame can be used as all the frames carry the same information. Therefore, by collecting samples from each frame, we can create a sequence of random vectors. In other words, the proposed method collects M(≪Mmin) measurement samples from each frame to finally create a random vector before template reconstruction. As we collect much lower number of samples per frame, the required number of correlator branches decreases accordingly. Moreover, as the total number of samples for template reconstruction increases, the performance of the proposed scheme improves.Now, the received pilot waveform per frame is given by (12). The measurement matrix is chosen to be i.i.d. with Gaussian random variables having zero mean and 1/N variance. Each frame is sampled by a different Ψ (cf. Figure 4). Therefore, for k-th frame, Ψk can be attributed as a measurement matrix with the dimension M×N. Therefore, the CS operation over k-th frame is given by(17)rk=Ψkgk.Then, the collected samples from each frame are stored as another vector given by(18)r=r1⊤,r2⊤,…,rk⊤,…,rNfNp⊤⊤,where rk⊤ is the transpose of the vector rk given by (14). Similarly, the actual reconstruction matrix (i.e., V) is formed by collecting the measurement matrix used for each frame as(19)V=Ψ1,Ψ2,…,Ψk,…,ΨNpNf⊤.Finally, the objective function for template reconstruction is again based on l1-norm optimization process as(20)pi=mingk1s.t.r=Vgk.Similar to the conventional scheme, we used OMP algorithm for the reconstruction process.Figure 4
Proposed CS-based template reconstruction for a single frame.


### 4.3. Signal Demodulation

After the pulse-multipath frame template reconstruction, the template is used to demodulate the analog information-bearing signal at frame rate using the proposed CS correlator-based demodulation. The discrete form of multipath frame template can be approximated as(21)pi^t=∑n=0N-1pinsinc⁡tT-n,where pi^(t) is the analog approximation of discrete multipath frame pi[n]. Now, using pi^(t), the information-bearing symbols (i.e., ri(t)) can be demodulated. As each symbol consists of Nf frames, thus the decision statistic is given by adding Nf correlator output samples for the i-th symbol as(22)zi=∑j=0Nf-1∫jTf+iTsj+1Tf+iTsritpi^t-jTf-iTsdt.Eventually, the detected symbol is given by(23)ai^=sgn⁡zi,where sgn is a signum function.


## 4.1. Conventional CS-Based Channel Estimation

The channel estimation procedure is as follows. First, the compressed samples are taken at frame-rate sampling in the receiver. Second, using OMP, original pulse-multipath channel frame is reconstructed from less number of samples. Exploiting the time sparsity nature of the Terahertz channel, the representation (basis) matrixΦ can be assumed to be an identity matrix [10]. The input to the channel estimation block (i.e., rp(t)) is an analog multipath frame of each pilot symbol and the output (i.e., pi) is a discrete representation of analog multipath frame (cf. Figure 3). In other words, as the received signal is composed of time-shifted versions of multipath template contaminated with noise, by observing the signal in a frame-long interval, and randomly projecting the observed signal, a noisy template can be recovered using OMP algorithm.The discrete-time representation of the continuous multipath frame in each pilot symbol is presented asgk=[gk(0),gk(T),…,gk((N-1)T)]⊤, where N is the number of samples and T is the Nyquist sampling period. The elements of the measurement matrix, ΨM×N, can be chosen as independent and identically distributed (i.i.d.) Gaussian random variables with zero mean and 1/N variance. If the sparsity order of the pulse-multipath frame is given by K, the number of required samples to fulfill the RIP condition and incoherence property is given by(13)M≥CKlog10⁡NK,where C(≥1) is the oversampling factor. Compressed sensing based sampling equation for the k-th frame can be written as(14)rk=Ψgk,where rk=[rk(0),rk(1),…,rk(M-1)]⊤. Since NpNf pilot waveforms are used for channel estimation, the estimated composite pulse-multipath channel is formed by averaging over NpNf noisy templates. In other words, the random projected signals corresponding to the received pilot waveforms are averaged and input to the OMP algorithm.As the random projected signals are averaged before reconstruction to obtain the discrete-time channel template,pi, the sampled vector r is given by(15)r=1NpNf∑k=0NfNp-1rk.Finally, pi is recovered using the following objective function given by(16)pi=mingk1s.t.r=Ψgk,where pi=[pi(0),pi(1),…,pi(N-1)]⊤. Note that the above method is computationally less expensive compared to reconstructing every frame. This is because by using OMP first and then averaging over the NpNf samples, it requires running the OMP only once. Moreover, it implicitly mitigates the effect of noise. The reconstructed pulse-multipath frame template is now used to demodulate the remaining information-bearing symbols.


## 4.2. Proposed CS-Based Channel Estimation

In the conventional method, ensemble of projected samples from pilot symbol is collected and the multipath frame template is then reconstructed after ensemble averaging overNf frames. However, the number of projected measurement samples is usually found to be very large. For instance, if the composite pulse-multipath channel frame is composed of N=256 samples, then, with a sparsity order of 35% and C=1, the minimum value of projected samples, i.e., Mmin, is 40. In other words, the pulse-multipath channel template could be reconstructed with at least 40 random measurements. This will result in 40 numbers of correlator branches at the receiver, which may increase hardware cost. Therefore, we propose a new template reconstruction mechanism which significantly reduces the number of correlator branches (i.e., M) and also improves the performance of the system simultaneously.The proposed reconstruction method exploits the unique symbol structure of the Terahertz band symbols. First, a THz symbol consists of a number of frames, and each frame carries a pulse. Therefore, the received signal is formed by scaled and delayed versions of the transmitted pulse. Since the dictionary should contain elements (atoms) that can fully represent the information carrying symbols, the elements of dictionary are generated so that they closely relate to the pulse waveform. Therefore, the atoms in the dictionary are thus delayed versions of the THz transmitted pulse. Second, the same frame is repeated over the entire pilot symbol duration (i.e.,Tpi). In other words, the frames carry the same information every Tf period. Therefore, it is not necessary to take the Mmin number of samples every frame. Instead, a much lower number of samples per frame can be used as all the frames carry the same information. Therefore, by collecting samples from each frame, we can create a sequence of random vectors. In other words, the proposed method collects M(≪Mmin) measurement samples from each frame to finally create a random vector before template reconstruction. As we collect much lower number of samples per frame, the required number of correlator branches decreases accordingly. Moreover, as the total number of samples for template reconstruction increases, the performance of the proposed scheme improves.Now, the received pilot waveform per frame is given by (12). The measurement matrix is chosen to be i.i.d. with Gaussian random variables having zero mean and 1/N variance. Each frame is sampled by a different Ψ (cf. Figure 4). Therefore, for k-th frame, Ψk can be attributed as a measurement matrix with the dimension M×N. Therefore, the CS operation over k-th frame is given by(17)rk=Ψkgk.Then, the collected samples from each frame are stored as another vector given by(18)r=r1⊤,r2⊤,…,rk⊤,…,rNfNp⊤⊤,where rk⊤ is the transpose of the vector rk given by (14). Similarly, the actual reconstruction matrix (i.e., V) is formed by collecting the measurement matrix used for each frame as(19)V=Ψ1,Ψ2,…,Ψk,…,ΨNpNf⊤.Finally, the objective function for template reconstruction is again based on l1-norm optimization process as(20)pi=mingk1s.t.r=Vgk.Similar to the conventional scheme, we used OMP algorithm for the reconstruction process.Figure 4
Proposed CS-based template reconstruction for a single frame.


## 4.3. Signal Demodulation

After the pulse-multipath frame template reconstruction, the template is used to demodulate the analog information-bearing signal at frame rate using the proposed CS correlator-based demodulation. The discrete form of multipath frame template can be approximated as(21)pi^t=∑n=0N-1pinsinc⁡tT-n,where pi^(t) is the analog approximation of discrete multipath frame pi[n]. Now, using pi^(t), the information-bearing symbols (i.e., ri(t)) can be demodulated. As each symbol consists of Nf frames, thus the decision statistic is given by adding Nf correlator output samples for the i-th symbol as(22)zi=∑j=0Nf-1∫jTf+iTsj+1Tf+iTsritpi^t-jTf-iTsdt.Eventually, the detected symbol is given by(23)ai^=sgn⁡zi,where sgn is a signum function.


## 5. Simulation Results

### 5.1. Performance Comparison

In this section, we compare the performance of the proposed correlator detector for two CS-based channel estimation schemes described above. Table2 enlists the default simulation parameters unless otherwise mentioned. Average bit error rate (BER) is used as a performance criterion with respect to signal-to-noise ratio (SNR). In the simulation, binary pulse amplitude modulation is used for the information-bearing symbols where the information bits are independent binary symbols with equal probability. The Gaussian monocycle pulse is used for both the pilot and information-bearing symbols. For simplicity, the single-user peer-to-peer communication system and one pulse per frame are considered. The Terahertz channel has been assumed to be concentrated with 10% water vapor molecules. To avoid temporal broadening which causes interframe interference (IFI) and intersymbol interference (ISI), it is assumed that Tf≫Tp+τmax, where τmax is the maximum excess delay of the multipath channel. The maximal delay spread of the channel is 3.22 ps. As the total number of samples per pulse-multipath frame is N, and the actual number of random projections is given by M; the M/N ratio indicates the reduction in the number of samples used to reconstruct pulse-multipath frame. Furthermore, the maximum number of OMP iterations is set to 300 for the target residual energy of 10-4.Table 2
Simulation parameters.
Parameter Values Pulse width parameter (σ) 100 fs Pulse duration (Tp) 0.6 ps Frame duration (Tf) 200 ps Number of frames (Nf) per symbol 5 Total symbol duration (Ts) 1 ns Number of pilot symbols per signal (Np) 1 Number of information symbols per signal (Ni) 1000 Number of samples per pulse-multipath frame (N) 350 Sparsity order (K) 35% Number of Monte Carlo runs 1 0 4 Distance between nanomachines 0.5 mmFigure5 depicts BER performance of the CS correlator for different number of compressive measurements or random projections (i.e., M) given by M/N ratio. When M/N=0.1, the number of compressive measurements is 10% of the pulse-multipath frame length. It can be seen that the proposed method outperforms the conventional method of CS-based reconstruction. This is because of the following two reasons. First is the design of a suitable dictionary to represent the THz signal. Second, the number of samples in the proposed method is increased to MNf by stacking M samples for Nf frame. However, in the conventional method, we input only M samples to the OMP algorithm for the reconstruction. Therefore, even for the lower compression, the proposed method successfully estimates the channel pulse-multipath frame. We can observe that using the proposed CS-based channel estimation, by sampling the signal at 10% of the signal’s sampling rate, similar performance could be achieved while sampling at 30% rate using conventional CS. Moreover, as expected, increase in the number of projections results in better BER even in low SNR region.Figure 5
BER performance for different number of random projections.Figure6 depicts the performance of the proposed detector for both schemes and different number of frames (i.e., Nf) per symbol. The M/N ratio is kept fixed at 0.30. It can be observed that as the frame size increases, BER performance is enhanced. This is because the increase in number of frames per symbol leads to decrease in noise in the correlator. However, with increasing frame size, the data rate would decrease. Therefore, for the same hardware complexity, by increasing the number of frames per symbol, better performance could be achieved. Moreover, our proposed scheme performs better than the conventional channel estimation scheme. We can observe that the performance gap in BER also depends on the number of frames. This is because even if the number of projections (i.e., M) is low, by having more number of frames, the total number of projections increases because of the stacking process. Hence, the performance gap is significant for the case of Nf=10, particularly in the low SNR region. Furthermore, as expected, with increasing SNR, the performance difference between the conventional and the proposed schemes increases.Figure 6
BER performance for different number of frames (Nh), with M/N=0.30 and Np=1.Figure7 depicts the performance of the proposed scheme for different number of pilot symbols (i.e., Np) per signal. The M/N ratio is kept fixed at 0.30 and the Nh is 5. We can observe that the proposed CS-based channel estimation scheme performs better than the conventional CS-based scheme. This is because of the design of the parameterized waveforms of dictionary that closely resembles the information carrying pulses. However, we can observe that there is no significant performance gap between various values of Np, particularly in the proposed scheme. This almost similar performance is because our proposed scheme is not able to exploit the stacking process as the number of frames in every pilot symbol remains the same. However, transmitting more pilot symbols per burst helps in reducing the noise component at the correlator resulting in minor improved performances.Figure 7
BER performance for different number of pilot symbols (Np), with M/N=0.30 and Nh=5.


### 5.2. Complexity Comparisons

#### 5.2.1. Hardware Complexity

Needless to say, as CS-based approach performs template reconstruction from the randomly projected signals sampled at significantly reduced rate; it avoids the use of analog delay units needed in the implementation of conventional analog template-estimate approaches [25, 26]. In addition, the proposed CS-based scheme also reduces the hardware complexity of the conventional CS-based channel estimation scheme. This is given by the reduction in the number of parallel integrator-mixer branches (cf. Figure 3). For instance, considering the sparsity order of 35% (Table 2), using the conventional method (12), the minimum number of parallel branches (i.e., Mmin) comes out to be approximately 56. However, using the proposed scheme, we can stack the M values from Nf frames before feeding it to the OMP algorithm. Therefore, if we stack M=12 samples per frame, we can easily get 60 samples at the end (i.e., MNf=60), which is more than 56, thus satisfying the CS criteria easily. At the same time, we only need 12 parallel mixer-integration branches. This is almost 78% reduction leading to the lower cost and complexity at the receiver end.


#### 5.2.2. Algorithm Complexity

In the proposed scheme, the program complexity is mainly driven by the complexity of the OMP algorithm. The OMP algorithm is used to solve the optimization problem mentioned in (16) and (20). OMP tries to recover the signal by finding the strongest component (atom) in the measurement signal, eliminating it from the signal, and searching again the dictionary for the strongest atom that is present in the residual signal. The computational cost of OMP is dominated by the matrix-vector products. As OMP limits the number of iterations by orthogonalizing the nonselected dictionary vectors (atoms) against those already selected, the algorithm converges in at most M iterations. However, it requires the additional computational cost of orthogonalization at each iteration. The running time of OMP is dominated by step 2 (Table 1), whose total cost is O(CK2N). The least square problem in step 3 is solved using Cholesky decomposition. At iteration i, OMP uses back-substitution to find the least-squares solution with a complexity of O(i2), where i is the number of iterations. Finally, the residual signal is computed with a cost of O(Mi). Thus, the total complexity of the i-th iteration is O(CK2N+Mi+i2). The storage price in the OMP algorithm is paid for the storage of the matrix Ψ which is of size M×N and the storage of Gramian matrix during Cholesky decomposition. Therefore, the storage cost for OMP is given as O(KNlog⁡N).


## 5.1. Performance Comparison

In this section, we compare the performance of the proposed correlator detector for two CS-based channel estimation schemes described above. Table2 enlists the default simulation parameters unless otherwise mentioned. Average bit error rate (BER) is used as a performance criterion with respect to signal-to-noise ratio (SNR). In the simulation, binary pulse amplitude modulation is used for the information-bearing symbols where the information bits are independent binary symbols with equal probability. The Gaussian monocycle pulse is used for both the pilot and information-bearing symbols. For simplicity, the single-user peer-to-peer communication system and one pulse per frame are considered. The Terahertz channel has been assumed to be concentrated with 10% water vapor molecules. To avoid temporal broadening which causes interframe interference (IFI) and intersymbol interference (ISI), it is assumed that Tf≫Tp+τmax, where τmax is the maximum excess delay of the multipath channel. The maximal delay spread of the channel is 3.22 ps. As the total number of samples per pulse-multipath frame is N, and the actual number of random projections is given by M; the M/N ratio indicates the reduction in the number of samples used to reconstruct pulse-multipath frame. Furthermore, the maximum number of OMP iterations is set to 300 for the target residual energy of 10-4.Table 2
Simulation parameters.
Parameter Values Pulse width parameter (σ) 100 fs Pulse duration (Tp) 0.6 ps Frame duration (Tf) 200 ps Number of frames (Nf) per symbol 5 Total symbol duration (Ts) 1 ns Number of pilot symbols per signal (Np) 1 Number of information symbols per signal (Ni) 1000 Number of samples per pulse-multipath frame (N) 350 Sparsity order (K) 35% Number of Monte Carlo runs 1 0 4 Distance between nanomachines 0.5 mmFigure5 depicts BER performance of the CS correlator for different number of compressive measurements or random projections (i.e., M) given by M/N ratio. When M/N=0.1, the number of compressive measurements is 10% of the pulse-multipath frame length. It can be seen that the proposed method outperforms the conventional method of CS-based reconstruction. This is because of the following two reasons. First is the design of a suitable dictionary to represent the THz signal. Second, the number of samples in the proposed method is increased to MNf by stacking M samples for Nf frame. However, in the conventional method, we input only M samples to the OMP algorithm for the reconstruction. Therefore, even for the lower compression, the proposed method successfully estimates the channel pulse-multipath frame. We can observe that using the proposed CS-based channel estimation, by sampling the signal at 10% of the signal’s sampling rate, similar performance could be achieved while sampling at 30% rate using conventional CS. Moreover, as expected, increase in the number of projections results in better BER even in low SNR region.Figure 5
BER performance for different number of random projections.Figure6 depicts the performance of the proposed detector for both schemes and different number of frames (i.e., Nf) per symbol. The M/N ratio is kept fixed at 0.30. It can be observed that as the frame size increases, BER performance is enhanced. This is because the increase in number of frames per symbol leads to decrease in noise in the correlator. However, with increasing frame size, the data rate would decrease. Therefore, for the same hardware complexity, by increasing the number of frames per symbol, better performance could be achieved. Moreover, our proposed scheme performs better than the conventional channel estimation scheme. We can observe that the performance gap in BER also depends on the number of frames. This is because even if the number of projections (i.e., M) is low, by having more number of frames, the total number of projections increases because of the stacking process. Hence, the performance gap is significant for the case of Nf=10, particularly in the low SNR region. Furthermore, as expected, with increasing SNR, the performance difference between the conventional and the proposed schemes increases.Figure 6
BER performance for different number of frames (Nh), with M/N=0.30 and Np=1.Figure7 depicts the performance of the proposed scheme for different number of pilot symbols (i.e., Np) per signal. The M/N ratio is kept fixed at 0.30 and the Nh is 5. We can observe that the proposed CS-based channel estimation scheme performs better than the conventional CS-based scheme. This is because of the design of the parameterized waveforms of dictionary that closely resembles the information carrying pulses. However, we can observe that there is no significant performance gap between various values of Np, particularly in the proposed scheme. This almost similar performance is because our proposed scheme is not able to exploit the stacking process as the number of frames in every pilot symbol remains the same. However, transmitting more pilot symbols per burst helps in reducing the noise component at the correlator resulting in minor improved performances.Figure 7
BER performance for different number of pilot symbols (Np), with M/N=0.30 and Nh=5.


## 5.2. Complexity Comparisons

### 5.2.1. Hardware Complexity

Needless to say, as CS-based approach performs template reconstruction from the randomly projected signals sampled at significantly reduced rate; it avoids the use of analog delay units needed in the implementation of conventional analog template-estimate approaches [25, 26]. In addition, the proposed CS-based scheme also reduces the hardware complexity of the conventional CS-based channel estimation scheme. This is given by the reduction in the number of parallel integrator-mixer branches (cf. Figure 3). For instance, considering the sparsity order of 35% (Table 2), using the conventional method (12), the minimum number of parallel branches (i.e., Mmin) comes out to be approximately 56. However, using the proposed scheme, we can stack the M values from Nf frames before feeding it to the OMP algorithm. Therefore, if we stack M=12 samples per frame, we can easily get 60 samples at the end (i.e., MNf=60), which is more than 56, thus satisfying the CS criteria easily. At the same time, we only need 12 parallel mixer-integration branches. This is almost 78% reduction leading to the lower cost and complexity at the receiver end.


### 5.2.2. Algorithm Complexity

In the proposed scheme, the program complexity is mainly driven by the complexity of the OMP algorithm. The OMP algorithm is used to solve the optimization problem mentioned in (16) and (20). OMP tries to recover the signal by finding the strongest component (atom) in the measurement signal, eliminating it from the signal, and searching again the dictionary for the strongest atom that is present in the residual signal. The computational cost of OMP is dominated by the matrix-vector products. As OMP limits the number of iterations by orthogonalizing the nonselected dictionary vectors (atoms) against those already selected, the algorithm converges in at most M iterations. However, it requires the additional computational cost of orthogonalization at each iteration. The running time of OMP is dominated by step 2 (Table 1), whose total cost is O(CK2N). The least square problem in step 3 is solved using Cholesky decomposition. At iteration i, OMP uses back-substitution to find the least-squares solution with a complexity of O(i2), where i is the number of iterations. Finally, the residual signal is computed with a cost of O(Mi). Thus, the total complexity of the i-th iteration is O(CK2N+Mi+i2). The storage price in the OMP algorithm is paid for the storage of the matrix Ψ which is of size M×N and the storage of Gramian matrix during Cholesky decomposition. Therefore, the storage cost for OMP is given as O(KNlog⁡N).


## 5.2.1. Hardware Complexity

Needless to say, as CS-based approach performs template reconstruction from the randomly projected signals sampled at significantly reduced rate; it avoids the use of analog delay units needed in the implementation of conventional analog template-estimate approaches [25, 26]. In addition, the proposed CS-based scheme also reduces the hardware complexity of the conventional CS-based channel estimation scheme. This is given by the reduction in the number of parallel integrator-mixer branches (cf. Figure 3). For instance, considering the sparsity order of 35% (Table 2), using the conventional method (12), the minimum number of parallel branches (i.e., Mmin) comes out to be approximately 56. However, using the proposed scheme, we can stack the M values from Nf frames before feeding it to the OMP algorithm. Therefore, if we stack M=12 samples per frame, we can easily get 60 samples at the end (i.e., MNf=60), which is more than 56, thus satisfying the CS criteria easily. At the same time, we only need 12 parallel mixer-integration branches. This is almost 78% reduction leading to the lower cost and complexity at the receiver end.


## 5.2.2. Algorithm Complexity

In the proposed scheme, the program complexity is mainly driven by the complexity of the OMP algorithm. The OMP algorithm is used to solve the optimization problem mentioned in (16) and (20). OMP tries to recover the signal by finding the strongest component (atom) in the measurement signal, eliminating it from the signal, and searching again the dictionary for the strongest atom that is present in the residual signal. The computational cost of OMP is dominated by the matrix-vector products. As OMP limits the number of iterations by orthogonalizing the nonselected dictionary vectors (atoms) against those already selected, the algorithm converges in at most M iterations. However, it requires the additional computational cost of orthogonalization at each iteration. The running time of OMP is dominated by step 2 (Table 1), whose total cost is O(CK2N). The least square problem in step 3 is solved using Cholesky decomposition. At iteration i, OMP uses back-substitution to find the least-squares solution with a complexity of O(i2), where i is the number of iterations. Finally, the residual signal is computed with a cost of O(Mi). Thus, the total complexity of the i-th iteration is O(CK2N+Mi+i2). The storage price in the OMP algorithm is paid for the storage of the matrix Ψ which is of size M×N and the storage of Gramian matrix during Cholesky decomposition. Therefore, the storage cost for OMP is given as O(KNlog⁡N).


## 6. Conclusions

In this paper, we propose a new Terahertz band channel estimation and signal detection approach based on the theory of compressed sensing. The compressive detector exploits the signal sparsity model explicitly. A reduced number of random projections of the received ultrabroadband signal were used for signal reconstruction. Simulation results showed that the proposed detector outperforms the conventional compressive detector that does not exploit the unique symbol structure. In the viewpoint of hardware design, the proposed CS-based channel estimation leads to simplified receiver design comparatively. With far fewer measurements, the proposed receiver could be a significant step forward for using the compressive sensing as an alternative solution to the conventional receivers particularly in the ultrabroadband communication systems.



---

*Source: 2408496-2018-09-24.xml*