Open Access

Low-complexity synchronization algorithms for orthogonally modulated IR-UWB systems

  • Rizwan Akbar1, 2Email author,
  • Emanuel Radoi1,
  • Stéphane Azou3 and
  • Muhammad Najam-ul-Islam2
EURASIP Journal on Wireless Communications and Networking20132013:199

Received: 11 February 2013

Accepted: 9 July 2013

Published: 23 July 2013


Timing synchronization is a major issue for any communication system since it is essential to ensure its stable operation and reliable performance. In this paper, we compare two low-complexity synchronization algorithms for impulse radio ultra-wideband (IR-UWB) system, employing orthogonal pulse shape modulation (PSM). The two widely adopted modulation schemes for IR-UWB systems are binary pulse amplitude modulation and binary pulse position modulation. However, the possibility of generating orthogonal UWB pulses in recent years has motivated the use of orthogonal PSM which is particularly attractive as high-order modulation and also due to its possible robustness against ISI, and therefore is the focus of this paper. Relying on the unique signal format, the first algorithm applies simple overlap-add operation followed by energy detection to achieve synchronization. This approach is semi non-data-aided (NDA) because a part of the signal is specifically reserved to help enable synchronization. The other algorithm, on the other hand, exploits the discriminating nature of well-designed polarity codes and employs a series of code word matching and averaging operations to achieve synchronization. This approach is full NDA as there is no need to interrupt the data transmission. Based on the judicious change in the phase of transmitted signal applied for synchronization purposes, the second algorithm can also be used to extract synchronized aggregate templates. These templates are then used in demodulation, resulting in a low-complexity non-coherent alternative to complex Rake receivers. The two compared timing algorithms rely on simple overlap-add operations and thus remain operational under practical UWB settings. Simulation results are provided to demonstrate the efficient performance of proposed timing estimators.

1 Introduction

Ultra-wideband (UWB) radio has seen a growing interest among researchers since its approval as commercial technology for data communications as well as for radar applications by the Federal Communications Commission (FCC) in 2002 [1]. A large swathe of 7.5 GHz spectrum between 3.1 GHz to 10.6 GHz range (which accounts for the name ultra-wideband) with an extremely low power spectral density of −41.25 dBm/MHz is allocated for UWB communications. Impulse radio UWB (IR-UWB) is one potential candidate for implementing UWB systems, characterized by data transmission using trains of nanosecond level pulses in a discontinuous way. The interest in IR-UWB is attributed to many unique features such as its ability to coexist with licensed RF systems in underlay mode, simple baseband transceiver, low probability of interception and detection, high ranging resolution, and the ability to exploit rich multipath diversity are just few to mention [2].

The aforementioned attractive features, however, come at a cost of equally demanding design challenges such as dense multipath channel estimation, precise synchronization, function under severe interference from existing systems, multiple-access support, and receiver design. The stringent timing requirements pose a major challenge to the deployment of IR-UWB systems, and timing accuracy is fundamental to ensure their satisfactory performance. As multiple pulses, each located in its own frame, are used to represent one information-bearing symbol in IR-UWB, synchronization is typically performed in two stages. During the first stage, called acquisition stage, a coarse synchronization is carried out to quickly identify the symbol starting frame. The second stage, known as the tracking stage, aims at refining the acquisition stage estimator and reducing down the timing mismatch to less than a chip duration.

Although synchronization is a tough task to accomplish in any communication system, it becomes much more challenging in IR-UWB due to the need of nanosecond-level precision and low-power impulsive UWB pulses. Indeed, the fine resolution obtained thanks to the wide signal bandwidth, results in large search space for the synchronization while extremely low power transmission means long sequence to be processed in order to develop a reliable synchronization criterion. Many resolvable multipaths due to short UWB pulses can also cause the receiver to lock with more than one arriving multipath component, thus resulting in multiple acquisition phases. Last but not the least, the transmitted signal is distorted by antennas and unknown frequency selective dense multipath channels [3, 4], which further intricate the already challenging task.

Different types of receivers need different levels of synchronization accuracy. The optimal coherent receiver (Rake) needs to align a locally generated template with the incoming received signal with an accuracy at the order of reciprocal of the signal bandwidth, which for UWB is in the order of tens of picoseconds. The low-complexity non-coherent receivers (transmitted reference [5], differential detector [6], etc.) slightly relax the synchronization requirements and typically need an accuracy in the nanoseconds range [7]. Nevertheless, in both cases, the synchronization requirements remain very strict. It was shown in [810] that a slight misalignment at the order of nanoseconds can severely degrade the IR-UWB system performance.

Due to these reasons, synchronization has been much emphasized by UWB researchers, and several timing algorithms have been proposed in the past [1126]. A brief literature review of synchronization techniques is presented in the next section.

1.1 Overview of existing methods

A number of algorithms treat timing synchronization as part of channel estimation and aim at the joint estimation of timing offset and channel taps [1113]. In [11], this is done using maximum likelihood criterion, whereas a least square based method looking for the minimum of Euclidean distance between received signal samples and a local replica of their noiseless components is presented in [12]. However, a formidably high sampling rate up to several gigahertz raises concerns over their implementations. Besides, very fast analog-to-digital converters (ADC) are needed in [12] as it is a fully digital approach. Treating timing estimation as a harmonic retrieval problem, a subspace-based method has been proposed in [13]. The implementation complexity involved in subspace analysis along with possible ill-conditioned Vandermonde systems in closely spaced multipaths limits its application in realistic UWB channels. The abovementioned algorithms require certain assumptions such as the absence of inter-frame interference (IFI) and inter-symbol interference (ISI), known multipath channel, and absence of time-hopping codes, which are rather optimistic assumptions for practical UWB settings.

The design of low-complexity synchronization schemes using either symbol-rate or frame-rate sampling is, therefore, highly motivated in UWB in order to reduce the implementation complexity. One simple approach for synchronization in impulse radio is based on match-filtering the received signal with a locally generated ‘clean template’ and peak-picking the correlation samples. Evidently, the reference template must encompass multipath channel effect which is unknown at synchronization, thus needing a cumbersome task of channel estimation. A scheme, known as timing with dirty templates (TDT), was proposed in [14] to tackle this issue by utilizing a pair of successive symbol-long segments of the received signal, where one segment serves as template for the other. However, the main drawback of this approach is its poor performance due to the noise on noise effect from the dirty templates. An algorithm using orthogonal pulses in an alternative manner and then applying TDT algorithm is presented in [15]. Relying on periodic transmission of non-zero mean symbols, joint timing and template recovery algorithms via energy detection have been developed in [16, 17], with universal applicability in the presence of ISI and multiuser interference (MUI). However, this asymmetric modulation aggravates the received signal-to-noise ratio (SNR), thus deteriorating bit error rate (BER) performance. Also, these algorithms need much longer sequence for reliable synchronization. Another class of synchronization algorithms capitalizes on the fine correlation properties of binary codes. One such algorithm with improved performance using fewer number of symbols is proposed in [18], which can be utilized under both non-data-aided (NDA) and DA scenarios. Exploiting the discriminative nature of similar binary codes, several other timing algorithms resilient to different types of interferences such as IFI and ISI [19], MUI [20], near-far problem [21], and a low-complexity demodulator [22] have also been proposed.

The above-referenced methods inevitably apply serial searching over all possible candidate time shifts. The large search space of IR-UWB systems, thanks to their extremely wide bandwidth, means that such linear search will lead to an increased mean synchronization time (MST). A class of algorithms skipping the serial search technique has therefore been developed [23, 24]. In [23], it is shown that bin reversal search is the most efficient search technique with much reduced MST. Two-stage synchronization is adopted in [24], where the first stage performs a rapid coarse search and reduces the search space to a small subset while the second stage identifies exact timing using serial search in this subset. A class of optimal search strategies is presented in [25] where fundamental limits on achievable MST are also provided, and it is shown that conventional serial search results in maximum MST. A promising algorithm is proposed in [26], which uses orthogonal UWB pulses and avoids searching. These rapid synchronization algorithms, however, mostly focus on coarse acquisition and lack the accuracy compared to serial searching-based approaches.

1.2 Contributions

One common characteristic of the synchronization techniques in the literature is that they are valid only for binary pulse amplitude modulation (BPAM) or/and binary pulse position modulation (BPPM), the two most popular modulation schemes in IR-UWB. These modulation schemes were widely adopted in the early years of UWB technology because of the difficulty to generate appropriate UWB pulses which can respect the severe FCC power constraints, thus limiting the choice. However, in recent years, the possibility of generating multiple mutually orthogonal and spectrally efficient pulses with the same widths [27, 28] has encouraged the use of alternative orthogonal modulation (OM) schemes [29] for IR-UWB. Pulse shape modulation (PSM) is an interesting OM scheme in which information is conveyed by the shape of pulse [30, 31]. These OM schemes are particularly attractive as high-rate multidimensional modulations, compared to high-order PAM and PPM [32]. This feature along with possible robustness of PSM against MUI and ISI makes it the focus of research work presented in this paper.

The main objective in this paper is to develop and compare low-complexity NDA synchronization algorithms for IR-UWB systems, employing orthogonal PSM. NDA algorithms are preferred as they do not interrupt the data transmission and can operate under ‘cold start-up’ scenarios where the receiver is not aware of the transmission start time. The target metric is the improved performance with low-complexity rather than reduced MST; therefore, we assume linear search for simplicity in our algorithms.

Most of the low-complexity algorithms presented in the second paragraph of Section 1.1 cannot be applied in PSM-modulated IR-UWB systems. For example, the algorithms based on matched filtering the received signal with either ‘clean’ or ‘dirty’ templates will not function for PSM in the NDA context as we are not aware of the orthogonal pulse being received. The algorithms based on the alternate periodic transmission of non-zero mean symbols followed by energy detection will also not function as there will be no zero-mean region after the first order averaging in the observation signal in the case of PSM, contrary to PAM. Similarly, the algorithms which benefit from the fine correlation properties of binary codes will result in inferior performance because in the NDA context, the two neighboring symbols may have different pulses and thus the impulsive nature of correlation is lost.

In order to deal with these issues, we developed in [33] an energy detection-based synchronization (EDS) algorithm exploiting the first order averaging and a judiciously designed transmitted signal, in a way that by simple overlap-add operation followed by energy detection, one can estimate the synchronization time. This algorithm has the advantage of achieving synchronization with no a-priori knowledge and remains equally valid for higher-order PSM. It will serve as a reference in the framework of this paper for a new synchronization algorithm, which is proposed along with a new SAT-based demodulation technique.

The two key contributions of this paper can be then summarized as follows.
  1. 1.

    The main limitation of EDS algorithm is that the judicious change in the signal format results in the loss of one frame per symbol, thereby making it a semi-NDA algorithm. Thus, we propose another approach, which exploits the discriminating nature of well-designed binary codes and does not incur any data loss. It estimates the timing offset by code matching followed by aggregating received signal segments and energy detection. This new code matching-based synchronization (CMS) algorithm provides much improved performance than EDS, especially in the case of relatively high number of symbols. Both of these algorithms remain functional under practical UWB settings of the unknown channel, pulse distortions by antennas, TH spreading, the presence of IFI and a moderate ISI, and even when multiple users are present.

  2. 2.

    In the course of establishing synchronization using CMS algorithm, we also get as a by-product an aggregate template which can be used to develop a non-coherent demodulation scheme for PSM, similar to the one proposed for BPAM in [16].


To the best of our knowledge, EDS and CMS are the first synchronization algorithms proposed in the literature in the framework of PSM-modulated IR-UWB signals.

The rest of this paper is organized as follows: Section 2 outlines the signal model, propagation channel, and synchronization preliminaries. The two synchronization algorithms and the non-coherent demodulation procedure along with the merits and feasibility discussion are presented in Section 3. Numerical results are provided in Section 4 to compare and validate the two algorithms, while conclusions are drawn in Section 5.

1.3 Notation

. and . represent integer floor and ceil operations, respectively, and [.] B denotes the modulo operation with base B.

2 System model and preliminaries

2.1 PSM transmission model

For a typical IR-UWB system in a single-user scenario, equipped with TH codes and employing orthogonal PSM, the transmitted signal can be expressed as
s ( t ) = i p T , d ( i ) ( t i T s ) p T , d ( i ) ( t ) : = j = 0 N f 1 ψ d ( i ) ( t j T f c j T c ) ,

where pT,d(i)(t) is the symbol-long transmitted waveform. Each information-bearing symbol d(i){0,1,...,M−1} is conveyed using one of the ultra-narrow orthogonal UWB pulse in the set S={ψ0(t),ψ1(t),…,ψM−1(t)}, where M is the modulation order. Each pulse has a duration T ψ and satisfies 0 T ψ ψ i ( t ) ψ j ( t ) = E ψ δ ( i j ) , ( i , j ) 0 , 1 , ... , M 1 , where E ψ = ψ 2 ( t ) dt is the pulse energy. Due to severe limitations imposed by FCC on transmission power, effective SNR per symbol is increased by repeating UWB pulses over N f frames with one pulse per frame to represent each data bit d(i). The symbol duration is thus T s =N f T f where T f is the frame duration. Spectrum smoothing and multiaccess are established by time shifting UWB pulses at multiples of chip duration T c using user-specific pseudo-random TH codes c j [0,N h ), with N h N c where N c is the number of chips per frame satisfying T f =N c T c . These TH codes are symbol periodic, i.e., c j = c j + i N f , i and j [0,N f ).

2.2 Reception model

The UWB indoor propagation channel is frequency selective and can be modeled by a stochastic tapped delay line [3]. The frequency-selective nature of channel can lead to distortion of transmitted pulse which varies from path to path. A typical UWB channel impulse response can be expressed as
h ( t ) = l = 0 L 1 λ l f l ( t τ l ) ,
where λ l , τ l l = 0 L 1 are channel path gains and delays, respectively, satisfying τ l <τl+1, l. The function f k (t) includes the combined effect of individual pulse distortion and transmit/receive antenna effect. The UWB channel is also assumed to be quasi-static, i.e., channel taps remain invariant over a block of several symbols but may vary from block to block. For the purpose of elaboration simplicity, we may represent the channel as a weighted sum of time-shifted Dirac delta functions, i.e., h ( t ) = l = 0 L 1 λ l δ ( t τ l ) . This simplification does not affect the proposed algorithms as they are unaffected by the channel and antenna characteristics. In order to isolate propagation delay τ0 from channel delays, channel response can be rewritten as h ( t ) = l = 0 L 1 λ l δ ( t τ l , 0 τ 0 ) where τl,0=τ l τ0 is the relative path delay. The received signal is then obtained as the convolution product s(t)h(t), corrupted by an additive white Gaussian noise n(t) with double-sided power spectral density N0/2:
r ( t ) = i p R , d ( i ) ( t i T s τ 0 ) + n ( t ) p R , d ( i ) ( t ) : = j = 0 N f 1 g d ( i ) ( t j T f c j T c ) ,

where pR,d(i)(t) is the received aggregate symbol-long waveform with g d ( i ) ( t ) = l = 0 L 1 λ l ψ d ( i ) ( t τ l , 0 ) representing the channel response to a single UWB pulse ψd(i)(t+τ0). Let T g :=sup{t|gd(i)(t)≠0} with T g =T ψ +τL−1,0 and T R :=sup{t|pR,d(i)(t)≠0} with T R =(N f −1)T f +c N f −1T c +T g . To develop our synchronization algorithms, we assume that both IFI and ISI are absent. This condition can be easily met by choosing (N h −1)T c +T g T f . Note that this assumption is only imposed for analytic simplicity, and we will show the robustness of our algorithms against IFI and a moderate ISI with numerical results.

2.3 Problem formulation

In practical scenarios, the receiver is unaware of transmission starting time and channel propagation delay τ0. We assume that the receiver initiates the synchronization at time t0τ0, and we set τ0=0 as it is only serving as a reference. Denoting t0=N T s t ϕ , with N=t0/T s , the observation signal can be written as
x ( t ) = r ( t + t 0 ) = i p R , d ( i ) ( t i T s + t 0 ) + n ( t + t 0 ) = i p R , d ( i ) ( t ( i N ) T s t ϕ ) + n ( t + N T s t ϕ ) .

As the receiver aims at aligning to the starting time of the first information symbol after t0, i.e., to the time t=t0+t ϕ , thus the required synchronization parameter to be estimated is t ϕ [0,T s ).

3 Low-complexity synchronization algorithms

3.1 Energy detection based algorithm

In order to achieve synchronization with energy detection, we first judiciously modify the conventional PSM symbol format in (1) as follows:
p T , d ( i ) ( t ) = ψ 0 ( t c 0 T c ) + γ i j = 1 N f 1 ψ d ( i ) ( t j T f c j T c ) ,
γ i = m α i m β i m , m = 0 , 1 , ... , M 1
β i m = β i 1 m 1 2 α i m α i m = | d ( i ) m | + M M 2 ,
where α i m { 0 , 1 } and { β i m , γ i } = ± 1 . From (5), it is clear that two changes have been made. First, the starting frame of each symbol is reserved and can be regarded as information-free pulse. Without loss of generality, we set c0=0 hereafter. Secondly, pulses with alternate phase are used to represent a particular symbol, i.e., the data symbol d(i) is transmitted using ψd(i)(t) and −ψd(i)(t) alternately. The graphical explanation of these changes can be observed in Figure 1.
Figure 1

Received signal with the synchronization parameter t ϕ and N f = 3. (a) Original PSM signal format. (b) Alternate signal inversion. (c) Information-free first frame, resulting in modified PSM signal format.

This modified transmitted symbol will correspondingly result in a modified received symbol as follows:
p R , d ( i ) ( t ) = g 0 ( t ) + γ i j = 1 N f 1 g d ( i ) ( t j T f c j T c ) .
Now, given x(t) with pR,d(i)(t) defined as in (8), a simple energy detection-based algorithm is proposed exploiting the judiciously designed signal format of (5). First, we take T s -long K segments from the received signal x(t), given by
x k ( t ) = x ( t + k T s ) , k [ 0 , K 1 ] , t 0 , T s = i p R , d ( i ) ( t ( i N k ) T s t ϕ ) + η ( t ) ,
where η(t)=n(t+(N+k)T s t ϕ ). As we have assumed that both IFI and ISI are absent, therefore it is easy to observe that each segment x k (t) of size T s will span at most two successive symbols of pR,d(i)(t). Letting i=N+k+q where q=0 or q=−1, (9) can be rewritten as
x k ( t ) = q = 1 0 p R , d ( N + k + q ) ( t q T s t ϕ ) + η ( t ) .
Next, the mean of observation signal is found using sample mean estimator obtained from K segments as follows:
x ̄ ( t ) = 1 K k = 0 K 1 x k ( t ) = 1 K k = 0 K 1 q = 1 0 p R , d ( N + k + q ) ( t q T s t ϕ ) + η ̄ ( t ) ,
where η ̄ ( t ) is averaged noise. Ignoring noise brevity and substituting (8) in (11), we get
x ̄ ( t ) = q = 1 0 g 0 ( t q T s t ϕ ) + 1 K q = 1 0 k = 0 K 1 j = 1 N f 1 γ N + k + q g d ( N + k + q ) ( t q T s j T f c j T c t ϕ ) .
From (7), it can be seen that
α i m = 1 if d ( i ) = m 0 otherwise , β i m = β i 1 m if d ( i ) = m β i 1 m otherwise ;
therefore, α i m β i m = β i 1 m for d(i) = m, resulting in mean of
1 K k = 0 K 1 α k m β k m = 1 / K if p m is odd 0 otherwise ,
where p m is the total number of symbols in a sequence of length K having d(k)=m. As K is sufficiently large, the sample mean can approximate to 0 even when p m is odd. Consequently,
1 K k = 0 K 1 γ N + k + q = 1 K m k = 0 K 1 α N + k + q m β N + k + q m 0 .
Exploiting the above fact, (12) can be simplified to
x ̄ ( t ) = g 0 ( t t ϕ ) + g 0 ( t + T s t ϕ ) , t 0 , T s .
From (16), it is clear that x ̄ ( t ) will have non-zero region only around t ϕ . Exploiting the zero guards, the objective function to estimate t ϕ can be developed as
t ̂ ϕ = arg max τ 0 , T s J ( τ )
J ( τ ) = 0 T I x ̄ ( t + τ ) T s 2 dt ,

where . T s is included as x ̄ ( t ) has size T s while integration in (17) needs periodic extension of x ̄ ( t ) , and T I is the integration interval. In the sequel, we will show that J(τ) achieves its unique maximum only at t ϕ , i.e., J ( t ϕ ) = 0 T I g 0 2 ( t ) dt . Let Δ t=τt ϕ be the relative misalignment between t ϕ and candidate time shift τ with Δ t(−T s ,T s ). As the value of Δ t leads to different results, we consider the two cases: Δ t(−T s ,0] and Δ t(0,T s ], separately.

Specifically, if Δ t(−T s ,0], the objective function J(τ) can be given as
J ( τ ) = 0 T I g 0 2 ( t + Δt ) dt + 0 T I g 0 2 ( t + T s + Δt ) dt.
Recalling that g(t) has a finite non-zero support within [0,T g ), we get J ( τ ) = 0 T I + Δt g 0 2 ( t ) dt + T s + Δt T I g 0 2 ( t ) dt , which can be rearranged as
J ( τ ) = J ( t ϕ ) T I + Δt T s + Δt g 0 2 ( t ) dt.
Clearly, the objective function J(τ) is lower bounded by positive integral T I + Δt T s + Δt g 0 2 dt > 0 , thus yielding a unique maximum if and only if (iff) Δ t=0 or τ=t ϕ . Likewise, following the same steps when Δ t[0,T s ), we obtain
J ( τ ) = J ( t ϕ ) T I + Δt T s Δt g 0 2 dt.

Again, by a similar argument, we can conclude that J(τ) will achieve its maximum iff τ=t ϕ , thus validating the algorithm.

3.1.1 Demodulation

The detection statistic for i-th symbol in conventional correlation-based Rake receiver is given as
d ̂ ( i ) = arg max m 0 , M 0 T s x ( t + i T s + t ̂ ϕ ) v m ( t ) dt ,
v m ( t ) = l = 0 L 1 λ ̂ l p T , m ( t τ ̂ l , 0 )

is the reference signal with { λ ̂ l , τ ̂ l , 0 } l = 0 L 1 representing estimated channel parameters and pT,m(t) is as given in (5) with γ i =1.

Note that the above-mentioned synchronization method can also be used for synchronization in BPSK-modulated IR-UWB systems, only by reserving the first frame as the other modification of alternate phase change is inherently available in BPSK. It is worth mentioning at this point that the reservation of one frame for synchronization purpose does not influence the BER performance to a large extent. For example, considering modified binary PSM signaling as in (5), the BER using the correlation-based detector of (21) can be found as
P e = 1 2 erfc E b 2 N 0 + 1 2 erfc N f 2 N f E b 2 N 0 erfc E b 2 N 0 ,

where erfc ( x ) = ( 2 / π ) x e t 2 dt is the complementary error function. The term (N f −2)/N f is the result of one reserved frame; however, as N f is chosen sufficiently large in IR-UWB in order to increase effective SNR per symbol, it is reasonable to approximate this term to 1. Also, it is important to clarify at this point that this information-free frame is adapted only during the synchronization phase. After the synchronization is done, the transmitter returns to the conventional PSM scheme. As this synchronization phase constitutes a very small fraction (say less than 5%) of the total transmission time [16], the effect on the overall demodulation performance will be negligible.

Although the Rake receiver is considered to be optimal, unfortunately it needs L parallel correlators which make its implementation unfeasible for practical UWB channels. Also, the performance of Rake receiver is very sensitive to mistiming [8, 9] and channel estimation errors [34]. These limitations of the Rake receiver motivate the use of non-coherent receivers for UWB [57], where the correlation between the received signal and a template derived from the received signal itself is performed. Another interesting alternative to the Rake receiver is proposed in [16] where a template, called synchronized aggregate template (SAT), is achieved as a by-product of the synchronization algorithm. This SAT-based receiver has much lower complexity and exhibits very attractive performance in the SNR range of practical interest. In the following section, we will show that by carefully designing the transmitted signal, we can develop a low-complexity SAT-based receiver for PSM-IR-UWB systems along with an improved synchronization algorithm.

3.2 Code matching based algorithm and SAT extraction

Analyzing the mean of observation signal in (12), it is evident that the symbol-long segments of x ̄ ( t ) contain a version of pR,d(i)(t) circularly shifted by t ϕ . Due to the careful change brought in the signal format by introducing γ i in (5), the second part in the summation in (12) cancels out, leaving behind only the first frame. However, if we assume γ i =1, i.e., do not modify the original PSM signal format and if t ϕ is estimated correctly, then (12) will result with binary PSM in
p ̂ R ( t ) = 1 K k = 0 K 1 x k ( t + t ̂ ϕ ) = p ̂ R , 0 ( t ) + p ̂ R , 1 ( t ) .

Applying the law of large numbers, one can see that lim K p ̂ R ( t ) = p R ( t ) , i.e., p ̂ R , 0 ( t ) = p R , 0 ( t ) = v 0 ( t ) and p ̂ R , 1 ( t ) = p R , 1 ( t ) = v 1 ( t ) . Clearly, if we can separate the two parts of p ̂ R ( t ) in (23), we will get the two desired reference signals as required for demodulation in (21) in case of binary PSM. This inspires us to think about an alternative solution which can provide not only the timing estimation but can also help in extracting the reference signals for demodulation.

Owing to the fact that the demodulator in (21) makes decision on the basis of the UWB waveform orthogonality, we may change the phase of the transmitted waveform in a way that it not only estimates the synchronization parameter but also separates the two template waveforms. Thus, instead of using ψd(i)(t) for modulation, we will multiply ψd(i)(t) with β i , defined as
β i = d ( i ) + i / Q 2 + 1 α i 1 + d ( i ) i Q , β i ± 1 , ± 2 α i : = α i 1 2 i / Q 1 1 2 d ( i ) , α i 1 , 1 ,

where QK, with K being the number of symbols used for synchronization and Q being the number of symbols used for SAT recovery.

As d(i) are independent and identically distributed (i.i.d) symbols taking the values {0,1} equiprobably, we can split them into two groups, denoted as G 0 ( i ) : = i : d ( i ) = 0 and G 1 ( i ) : = i : d ( i ) = 1 . Choosing Q sufficiently large and using (24), the mean of the transmitted pulses can be shown to be
1 Q i = 0 Q 1 β i ψ d ( i ) ( t ) = 1 Q i = 0 Q 1 d ( i ) + 1 α i 1 + d ( i ) ψ d ( i ) ( t ) 1 Q i G 0 ( i ) α i ψ 0 ( t ) + i G 1 ( i ) 2 α i 2 ψ 1 ( t ) ψ 1 ( t ) .
Similarly, we can show that 1 / Q i = Q 2 Q 1 β i ψ d ( i ) ( t ) ψ 0 ( t ) . Thus, by judiciously changing the phase of the basic UWB pulse and performing two separate averaging operations once t ̂ ϕ is known, SAT can be recovered from (12) as
p ̂ R , 1 ( t ) = Q 1 k = 0 Q 1 x k ( t + t ̂ ϕ ) = v ̂ 1 ( t ) , p ̂ R , 0 ( t ) = Q 1 k = Q 2 Q 1 x k ( t + t ̂ ϕ ) = v ̂ 0 ( t ) .

Once SAT is recovered, we may proceed with our demodulation procedure in (21). It is worth mentioning that under the condition of large Q and equiprobable symbols, only Q out of 2Q symbols used for SAT recovery are modulated by twice the amplitude of the others. As this value of Q is very small compared to the channel coherence time [16], received SNR will not be greatly aggravated and thus the impact on BER performance will be negligible.

This alternation of the symbol phase according to (24) can therefore effectively extract the SATs for demodulation as long as we know t ϕ . Thus, the next target is to estimate the synchronization parameter while preserving the phase alternation. To achieve that purpose, the frames within a symbol are first multiplied with a bipolar code b having periodic autocorrelation function defined as
R ( n ) = j = 0 N f 1 b j b j + n N f = N f n = k N f ± 1 otherwise
with k=0,1,2,…. Many sequences exhibit the above autocorrelation property (ACP), such as maximum length shift register sequences (m-sequence), Barker codes, etc. Applying these modifications to the transmitted symbol, we get accordingly the received and observation symbols as follows:
p R , d ( i ) ( t ) = j = 0 N f 1 b j g d ( i ) ( t j T f c j T c ) x ( t ) = i β i p R , d ( i ) ( t ( i N ) T s t ϕ ) + n ( t + N T s t ϕ ) .
A graphical explanation of changes applied to transmitted signal can be seen in Figure 2.
Figure 2

Observation signal with amplitude and phase alternation: N f = 3 and b = [1,1,−1]. (a) 0 ≤ i ≤ (Q−1). (b) Qi≤ (2Q−1).

The mean of observation signal is given as
x ̄ ( t ) = 1 K k = 0 K 1 x ( t + k T s ) , K Q , t 0 , T s = 1 K k = 0 K 1 i β i p R , d ( i ) ( t ( i N k ) T s t ϕ ) .
Next, we take frame-long segments from x k (t) and compensate for random TH delays and binary code { b j } j = 0 N f 1 , followed by the signal aggregation operation.
x ̄ b ( t , τ ) = m = 0 N f 1 b m x ̄ ( t + m T f + c m T c + τ ) , t 0 , T f = 1 K k = 0 K 1 i β i m = 0 N f 1 b m p R , d ( i ) ( t ( i N k ) T s t ϕ + m T f + c m T c + τ ) ,
where τ[0,T s ) is the candidate time shift and the noise term is ignored for brevity hereafter. Synchronization parameter t ϕ and candidate shift τ both can be expressed as an integer multiple of T f plus a remnant, i.e., t ϕ =n ϕ T f + ϕ ,n ϕ =t ϕ /T f [0,N f ), ϕ [0,T f ) and τ=n τ T f + τ ,n τ =τ/T f [0,N f ), τ [0,T f ). Thus, the relative misalignment at any specific time shift can be denoted as t e = τ t ϕ = n τ n ϕ T f + τ ϕ = ñ T f + ~ , where ñ n ϕ , N f 1 n ϕ and ~ ϕ , T f ϕ . Consequently, (30) can be rewritten as
x ̄ b ( t , τ ) = 1 K k = 0 K 1 i β i m = 0 N f 1 b m p R , d ( i ) ( t ( i N k ) T s + m + ñ T f + c m T c + ~ ) .
Substituting pR,d(i)(t) from (28), we get
x ̄ b ( t , τ ) = 1 K k = 0 K 1 i β i m = 0 N f 1 j = 0 N f 1 b m b j g d ( i ) ( t ( i N k ) T s + m + ñ j T f + c m c j T c + ~ ) .
To this end, it is worth noting that the dual purposes served by TH codes (i.e., spectrum smoothing and multiaccess) can be equally achieved by the user-specific orthogonal polarity codes b. Thus, we assume c m =c j =0, (m,j). As a result, (32) can be simplified as
x ̄ b ( t , τ ) = 1 K k = 0 K 1 i β i m = 0 N f 1 j = 0 N f 1 b m b j g d ( i ) ( t ( i N k ) T s + m + ñ j T f + ~ ) .
As the value of ~ leads to different results, we first consider the case when ~ ϕ , 0 . Since the observed segments x ̄ b ( t , τ ) have a finite support [0,T f ), only finite values of i, j will contribute to non-zero summands in (32) under the assumption of no IFI and ISI. Thus, it is easy to find that
i = N + k , j = m + ñ + q , q 1 , 0 .
Also, by the explanation in (25) about the averaging operation, it is clear that ( 1 / K ) k = 0 K 1 β k g d ( k ) ( t ) g 1 ( t ) . Applying these simplifications, (33) can be expressed as
x ̄ b ( t , τ ) = m = 0 N f 1 q = 1 0 b m b m + ñ + q g 1 ( t q T f + ~ ) = m = 0 N f 1 b m b m + ñ g 1 ( t + ~ ) + m = 0 N f 1 b m b m + ñ 1 g 1 ( t + T f + ~ ) .
Capitalizing on the ACP of bipolar code b defined in (27), (35) simply reduces to
x ̄ b ( t , τ ) = N f g 1 ( t + ~ ) , n τ = n ϕ N f g 1 ( t + T f + ~ ) , n τ = n ϕ + 1 0 , otherwise .

It is easy to observe that when ~ = 0 , the term corresponding to n τ =n ϕ +1 in (36) disappears due to the fact that T g T f in the absence of IFI. Applying energy detection operation afterwards with integration interval equal to T g , it is thus clear that x b (t,τ) achieves its maximum energy of N f 2 E g only when ñ = 0 , ~ = 0 , i.e., τ=t ϕ , where E g = 0 T g g 2 ( t ) dt is the energy of aggregate received segment.

Similarly, when ~ 0 , T f ϕ , we can show following the same procedure that
x ̄ b ( t , τ ) = N f g 1 ( t T f + ~ ) , n τ = n ϕ 1 N f g 1 ( t + ~ ) , n τ = n ϕ 0 , otherwise .
Again, by similar argument we can conclude that x ̄ b ( t , τ ) attains its maximum iff τ=t ϕ . Building on the above analytic analysis, timing offset t ϕ can be estimated in NDA mode using the following optimization
t ̂ ϕ = arg max τ 0 , T s J ( τ ) ,
J ( τ ) = 0 T I x ̄ b ( t , τ ) 2 dt.

Note that x ̄ ( t ) has a size T s , whereas integration in (38) requires its periodic extension; thus, a . T s operation is required, i.e., x ̄ b ( t , τ ) = m = 0 N f 1 b m x ̄ ( t + m T f + τ ) T s .

3.3 Discussion

In terms of a-priori knowledge, both algorithms need minimal information. EDS algorithm, however, has an edge over the second one because it is totally blind in the sense that it does not need any knowledge whatsoever about the transmitted signal. CMS algorithm, on the other hand, does need a-priori knowledge about the user-specific TH and binary codes. From the applicability viewpoint, the first algorithm is relatively more promising in the case of M-ary PSM as γ i in (6) changes the phase for all modulation indices m=0,1,…,M−1 alternately. Therefore, increasing the modulation order will not affect the algorithm as long as the first frame is reserved and carries the same waveform throughout. The integration region T I has an impact on the synchronization accuracy of both algorithms as it is responsible for the signal energy capture. Ideally, it should be equal to the channel delay spread plus UWB pulse duration, i.e., T I =T g . However, if this value is not known, we can set it to T I =T f N h T c in the presence of TH codes and T I =T f otherwise, provided that it captures sufficient energy.

With regard to implementation complexity, it mainly amounts to two factors: (a) shifting of observation signal in (9) and (29) and (b) maximization of objective function J(τ) in (17) and (38), respectively, for the two algorithms. The shifting can be done both in analog as well as in digital domain. Analog approaches have the advantage of avoiding the sampling which can be very high in UWB regime. However, they need analog delay lines (on the order of symbol duration) for shifting which can be demanding especially for low-power circuits. Nonetheless, chips implementing analog delays from 20 to 2,000 ns are available and can be used to implement the algorithms [35]. On the other hand, the digital implementation is relatively simple from the signal processing viewpoint, and digital operations can be performed efficiently in modern on-chip technologies. However, it will need UWB receiver to digitize the signal at the Nyquist rate (usually several gigahertz). Thus, the primary concern in digital implementation is the design of ultra-fast ADCs. Parallel ADCs can be used to achieve this feat where each ADC operates at a fraction of the effective sampling frequency [36]. Nevertheless, if ultra-fast ADCs are available [37], both algorithms can be implemented in full digital format. As far as the maximization itself is concerned, it is obvious that the continuous search over [0,T s ) will result in prohibitive complexity. In practice, the objective function J(τ) is evaluated over a grid of finite equispaced values τ=n T δ where n[0,T s /T δ ) and T δ is the step interval.
n ̂ = arg max n 0 , T s / T δ J ( n T δ ) .

The estimated synchronization parameter will be then t ̂ ϕ = n ̂ T δ with an ambiguity of T δ . It is worth mentioning that the synchronization at any precision can be achieved by the proposed algorithms and is only constrained by the affordable complexity.

From the perspective of possible application area, we envision a similar context and application framework for our methods as described in [16, 17] for UWB ad hoc networks such as wireless sensor networks. Consider a single piconet consisting of multiple nodes. A likely configuration of the overall protocol is outlined in [16] (see paragraph before section 4 in [16]). Under multiuser interference, the essence of the proposed algorithms is that at any time, there is only one node (but not the same one all the time) which transmits peculiar signal format. This node is designated as a ‘master’ node and takes the responsibility of synchronizing the other nodes designated as ‘slave’ nodes. This is effectively the case with star or clustered topologies of ad hoc networks.

4 Simulations and comparisons

In this section, simulations are carried out to evaluate the performance of the two synchronization algorithms in terms of probability of acquisition (P A ), normalized mean square error (NMSE), and BER. In all ensuing simulations, specially designed B-spline-based orthogonal UWB pulses are used with duration T ψ =1.28 ns [28]. Each symbol consists of N f =13 frames, while each frame contains N c =15 chips. The chip duration T c is the same as the pulse duration T ψ , resulting in a frame duration of T f =19.2 ns. The binary code is selected as b=202 in decimal for CMS algorithm. We used TH codes randomly taking integer values from [0,N h ), where N h =5. The multipath channel employed in simulations is CM1 indoor channel proposed by IEEE 802.15.3a working group [4], having RMS delay spread equal to 5 ns. The synchronization parameter t ϕ is randomly generated from a uniform distribution over [0,T s ) at each Monte Carlo trial.

4.1 Synchronization performance

We first evaluate the synchronization accuracy of the proposed algorithms in terms of acquisition probability which is defined as P A = Pr t ̂ ϕ t ϕ T δ . The integration interval T I is set equal to T g . SNR is defined as P g /σ2 where P g is the received power per pulse (after the convolution of transmitted pulse with channel impulse response). The synchronization performance is assessed under three different conditions, namely (1) absence of IFI, (2) addition of moderate IFI and ISI, and (3) introduction of MUI. The no IFI condition is met by truncating the channel beyond (T f N h T c )=12.8 ns. Addition of moderate IFI is ensured by extending channel delay spread up to T f and hence spreading N h T c long tail of dispersed pulse into the subsequent frame. The tail of the last frame in each symbol will also spread into the first frame of subsequent symbol, thereby also inducing a small ISI. Finally, MUI is introduced by two interfering users who transmit conventional PSM symbols. As N h =5, the user-specific TH codes cannot widely separate the three users; thus, a severe interference exists among them.

We set step interval T δ =T f , and the resulting performance curves are shown in Figures 3,4,5. The two algorithms are also compared with [16] and [18], respectively. The reason for this choice is that the method in [16] is also based on energy detection like our first algorithm, while the one in [18] exploits bipolar codes much like our second proposed scheme, thus providing a good basis for relative comparison. It is worth mentioning, however, that both of these algorithms deal with IR-UWB systems employing BPAM and are used only to give a benchmark performance. A pronounced improvement in performance is evident with proposed algorithms compared to referenced algorithms under all operating conditions. Between the two approaches, the CMS algorithm exhibits much better performance, thanks to the fine ACP of bipolar codes. We can observe that the performance degradation is more severe in the case of interfering users than IFI. However, the performance is not degraded dramatically compared to the ideal case of no interference, and the synchronization parameter can still be estimated with reasonable precision. This proves the robustness of proposed schemes under the practical operating conditions. Also, in the case of CMS algorithm, we have considered the worst scenario where the two interfering users also employ the same binary codes as the desired user. Therefore, it is reasonable to assume that by choosing orthogonal binary codes for different users in CMS algorithm and larger separation by TH codes in both algorithms, the performance under MUI may further improve. Figure 6 employs NMSE metric to compare the performance of proposed algorithms. The NMSE curves decrease monotonically for both algorithms before reaching an error floor. This error floor is obvious since synchronization is performed with finite resolution of either T f or 3T c only. The error floor is almost 6×10−4 for the T f resolution case corresponding to a timing error standard deviation around 6.11 ns, which is less than the intended accuracy of T f =19.2 ns. Similarly, for 3T c resolution case, the error floor is around 4×10−5 resulting in timing error standard deviation of about 1.58 ns, which is again less than the intended accuracy of 3T c =3.84 ns. This figure also proves the ability of both algorithms to achieve synchronization at any desired resolution.
Figure 3

Acquisition probability comparison between EDS algorithm and[16]under different operating conditions with K = 64, T δ = T f .

Figure 4

Acquisition probability comparison between CMS algorithm and [18] under different operating conditions with K = 64, T δ = T f .

Figure 5

Comparison of EDS and CMS algorithms in terms of acquisition probability under different operating conditions with K = 64, T δ = T f .

Figure 6

NMSE performance comparison between EDS and CMS algorithms with K = 64 at different time resolutions.

Next, the effect of various lengths of the observation window K on acquisition probability can be seen in Figure 7. It is clear that the performance is improved with increasing K due to the fact that the signal averaging operation employed by both algorithms can better mitigate the noise effect with large K. Also, Figure 7 demonstrates the impact of different step intervals T δ . The higher the synchronization precision desired, the more will be the number of symbols K needed. Nevertheless, again any level of precision can be achieved with the proposed algorithms. In Figure 8, the performance is compared in both line-of-sight (LOS, CM1) and non-line-of-sight (NLOS, CM2) propagation channels of the IEEE 802.15.3a standard with T δ =T f . The frame duration T f is increased to 25.6 ns so that enough of the channel energy can still be captured in the case of NLOS channel. The simulation results in Figure 8 show that the performance is almost identical in LOS and NLOS channels. Finally, the effect of the number of frames N f on the acquisition probability of proposed algorithms is observed in Figure 9. Due to the correlation properties of bipolar codes, it is obvious that the performance of CMS algorithm should increase with the code length which can be verified from Figure 9. However, the number of frames does not have any significant effect on the performance of EDS algorithm. In fact, the performance may degrade because with increasing N f , there will be more discrete bins to be linearly searched, thereby increasing the probability of wrong estimation.
Figure 7

Acquisition probability of EDS and CMS algorithms as a function of K with SNR = −20 dB.

Figure 8

Acquisition probability of EDS and CMS algorithms for LOS and NLOS channel with K = 64, T δ = T f .

Figure 9

Acquisition probability of EDS and CMS algorithms as a function of N f with K = 64, T δ = 3T c .

4.2 BER performance

We now translate the synchronization performance into BER performance. Figures 10 and 11 exhibit BER using demodulator of (21), after estimating synchronization parameter by EDS and CMS algorithms, respectively. We suppose that channel estimation is done after synchronization and that it was error free. We average over 10 3 channel realizations where in each realization after estimating t ϕ , we demodulate 10 3 symbols using all-Rake (A-Rake). We also plot BER using A-Rake under perfect timing as a reference. As CMS algorithm can precisely synchronize with much fewer symbols, we can achieve BER similar to the case of perfect timing even with K=32 and almost similar with K=16. However, EDS algorithm needs relatively large number of symbols to achieve reasonable BER performance.
Figure 10

BER performance comparison between perfect timing and estimated timing using EDS algorithm with various values of K.

Figure 11

BER performance comparison between perfect timing and estimated timing using CMS algorithm with various values of K .

Finally, we compare SAT-based receiver (26) with selective-Rake (S-Rake), which is practically a more viable solution compared to A-Rake. Synchronization is first performed using CMS algorithm and then symbols are demodulated using SAT-based receiver. The results shown in Figure 12 demonstrate that the performance of SAT-based receiver is better than S-Rake with five fingers corresponding to the strongest paths under perfect timing. SAT-based receiver can simply outperform S-Rake by increasing the number of averaging symbols Q, while S-Rake on the other hand is dependent on the number of fingers to capture sufficient energy. At high SNR, SAT-based receiver with reasonable averaging can even come very close to ideal A-Rake.
Figure 12

BER performance comparison of Rake and SAT-based receiver of CMS algorithm.

5 Conclusions

In this paper, the issue of synchronization in time-hopping IR-UWB systems employing pulse shape modulation is addressed and two low-complexity algorithms are compared. The first algorithm exploits a judiciously designed signal format to enable synchronization using simple overlap-add operation followed by energy detection. This algorithm is particularly interesting for systems using high-order orthogonal PSM modulation. On the other hand, the modified signal format results in the loss of one frame per symbol, so an alternate algorithm is proposed to avoid this small data loss. Exploiting impulsive autocorrelation function of bipolar codes, we develop a synchronization criterion using a series of code matching, overlap-add and energy detection operations. Based on this criterion, a new low-complexity NDA synchronization algorithm is then proposed. Code matching and averaging greatly suppress the interference and noise, resulting in an improved performance. Both the proposed algorithms remain functional in the presence of TH codes, unknown channel, and distortion due to Tx/Rx antennas. Simulation results confirm precise synchronization of the two algorithms and their robustness in the presence of IFI and MUI. Furthermore, a new low-complexity demodulation scheme was also derived using synchronized aggregate templates. This receiver bypasses the cumbersome task of channel estimation and can collect the full multipath energy. Also, it inherently captures the pulse distortion caused by antennas and other receiver effects. Results show that it can achieve performance comparable to the widely adopted Rake in medium-to-high SNR range. In the future, we plan to investigate synchronization performance in the presence of severe IFI and ISI. Also, the large search space due to fine timing resolution of UWB systems leads to an increased synchronization time. Thus, it would be interesting to investigate rapid synchronization schemes for UWB. Additionally, the analytic performance analysis of SAT receiver is necessary to conclude on its advantages and drawbacks compared to conventional Rake.


Authors’ Affiliations

Université Européenne de Bretagne, Université de Brest, CNRS
Department of Electrical Engineering, Bahria University
Ecole Nationale d’Ingénieurs de Brest (ENIB), CNRS


  1. Federal Communications Commission, First report and order: revision of part 15 of the Commission’s rules regarding ultra-wideband transmission systems Technical report . Accessed 17 July 2013
  2. Yang L, Giannakis GB: Ultra-wideband communications: an idea whose time has come. IEEE Signal Process. Mag. 2004, 21(6):26-54.View ArticleGoogle Scholar
  3. Cassioli D, Win MZ, Molisch AF: The ultra-wide bandwidth indoor channel: from statistical model to simulations. IEEE J. Sel. Areas Commun. 2002, 20(6):1247-1257.View ArticleGoogle Scholar
  4. Molisch AF, Foerster JR, Pendergrass M: Channel models for ultrawideband personal area networks. IEEE Wireless Commun. 2003, 10(6):14-21.View ArticleGoogle Scholar
  5. Hoctor RT, Tomlinson HW: An Overview of Delay-Hopped, Transmitted-Reference RF Communications. GE Research and Development Center, Technical Information Series pp. 1-29.Google Scholar
  6. Ho M, Somayazulu VS, Foerster J, Roy S: A differential detector for an ultra-wideband communications system. In Proceedings of the IEEE Vehicular Technol. Conf.,. : ; 2002:1896-1900.Google Scholar
  7. Witrisal K, Leus G, Janssen G, Pausini M, Troesch F, Zasowski T, Romme J: Noncoherent ultra-wideband systems. IEEE Signal. Process. Mag. 2009, 26(4):48-66.View ArticleGoogle Scholar
  8. Tian Z, Giannakis GB: BER sensitivity to mistiming in ultra-wideband impulse Radios - part I: nonrandom channels. IEEE Trans. Signal Process. 2005, 53(4):1550-1560.MathSciNetView ArticleGoogle Scholar
  9. Tian Z, Giannakis GB: BER sensitivity to mistiming in ultra-wideband impulse radios - part II: fading channels. IEEE Trans. Signal Process. 2005, 53(5):1897-1907.MathSciNetView ArticleGoogle Scholar
  10. He N, Tepedelenlioglu C: Performance analysis of non-coherent UWB receivers at different synchronization levels. IEEE Trans. Wireless Commun. 2006, 5(6):1266-1273.View ArticleGoogle Scholar
  11. Lottici V, D’Andrea A, Mengali U: Channel estimation for ultra-wideband communications. IEEE J. Sel. Areas Commun. 2002, 20(9):1638-1645.View ArticleGoogle Scholar
  12. Carbonelli C, Mengali U: Synchronization algorithms for UWB signals. IEEE Trans. Commun. 2006, 54(2):329-338.View ArticleGoogle Scholar
  13. Maravic I, Kusuma J, Vetterli M: Low-sampling rate UWB channel characterization and synchronization. J. Commun. Netw. 2003, 5(4):319-327.View ArticleGoogle Scholar
  14. Yang L, Giannakis GB: Timing ultra-wideband signals with dirty templates. IEEE Trans. Commun. 2005, 53(11):1952-1963.View ArticleGoogle Scholar
  15. Ouertani M, Xu H, Besbes H, Yang L, Bouallègue A: Orthogonal bi-pulse UWB: Timing and (de)modulation. Physical Communication (PHYCOM) 2008, 1(4):237-247.View ArticleGoogle Scholar
  16. Luo X, Giannakis GB: Low-complexity blind synchronization and demodulation for (ultra-)wideband multi-user ad hoc access. IEEE Trans. Wireless Commun. 2006, 5(7):1930-1941.View ArticleGoogle Scholar
  17. Luo X, Giannakis GB: Raise your voice at a proper pace to synchronize in multiple ad hoc piconets. IEEE Trans. Signal Process. 2007, 55: 267-278.MathSciNetView ArticleGoogle Scholar
  18. Ying Y, Ghogho M, Swami A: Code-assisted synchronization for UWB-IR systems: algorithms and analysis. IEEE Trans. Signal Process. 2008, 56(10):5169-5180.MathSciNetView ArticleGoogle Scholar
  19. Liu B, Lv T, Gao H: Blind synchronization and demodulation for noncoherent ultra-wideband system with robustness against ISI and IFI. In Proceedings of the IEEE International Conference on Communications (ICC’10). Cape Town: ; 23–27 May 2010:1-5.Google Scholar
  20. Wu L, Lottici V, Tian Z: Maximum likelihood multiple access timing synchronization for UWB communications. IEEE Trans. Wireless Commun. 2008, 7(11):4497-4501.View ArticleGoogle Scholar
  21. Li L, Townsend JK: Near-far resistant synchronization for UWB communications. IEEE Trans. Wireless Commun. 2011, 10(2):519-529.View ArticleGoogle Scholar
  22. Lv T, Qiao Y, Wang Z: Training-based synchronization and demodulation with low complexity for UWB signals. IEEE Trans. Veh. Technol. 2011, 60(8):3736-3747.View ArticleGoogle Scholar
  23. Homier EA, Scholtz RA: Rapid acquisition of ultra-wideband signals in the dense multipath channel. In Proceedings of the IEEE Conference on Ultra Wideband Systems and Technologies. Digest of Papers. Baltimore: ; 21–23 May 2002:105-109.Google Scholar
  24. Aedudodla S, Vijayakumaran S, Wong TF: Rapid ultra-wideband signal acquisition. In Proceedings of the IEEE Wireless Communications and Networking Conference. Atlanta: ; 21–25 Mar 2004:1148-1153.Google Scholar
  25. Suwansantisuk W, Win MZ: Multipath aided rapid acquisition: optimal search strategies. IEEE Trans. Inf. Theory 2007, 53: 174-193.MathSciNetView ArticleMATHGoogle Scholar
  26. Akbar R, Radoi E, Azou S: A non-data-aided rapid synchronization method for UWB impulse radio. IEEE Commun. Lett. 2012, 16(8):1308-1311.View ArticleGoogle Scholar
  27. Dotlic I, Kohno R: Design of the family of orthogonal and spectrally efficient UWB waveforms. IEEE J. Sel. Topics Signal Process. 2007, 1: 21-30.View ArticleGoogle Scholar
  28. Wang M, Yang S, Wu S: A GA-based UWB pulse waveform design method. Digital Signal Processing 2008, 18: 65-74.View ArticleGoogle Scholar
  29. Majhi S, Madhukumar AS, Premkumar AB, Chin F: Modulation schemes based on orthogonal pulses for time hopping ultra wideband radio systems. In Proceedings of the IEEE International Conference on Communications. Glasgow: ; 24–28 June 2007:4185-4190.Google Scholar
  30. Ghavami M, Michael LB, Haruyama S, Kohno R: A novel UWB pulse shape modulation system. Wireless Pers. Commun. 2002, 23: 105-120.View ArticleGoogle Scholar
  31. de Abreu GTF, Mitchell CJ, Kohno R: On the design of orthogonal pulse-shape modulation for UWB systems using Hermite pulses. J. Commun. and Networks 2003, 5(4):328-343. [special issue on UWB Communications]View ArticleGoogle Scholar
  32. Proakis JG: Digital Communications. New York: McGraw-Hill,; 2000.MATHGoogle Scholar
  33. Akbar R, Radoi E, Azou S: Energy detection based blind synchronization for pulse shape modulated IR-UWB systems. In Proceedings of the IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC’11). Toronto: ; 11–14 Sept 2011:864-868.View ArticleGoogle Scholar
  34. Niu H, Ritcey JA, Liu H: Performance of UWB RAKE receivers with imperfect tap weights. In Proceedings of the IEEE Intl. Conf. Acoustics, Speech, Signal Process.,. : ; 2003:125-128.Google Scholar
  35. Allen Avionics, Inc. Analog and digital delay lines . Accessed 17 July 2013 Analog and digital delay lines . Accessed 17 July 2013
  36. O’Donnell I, Brodersen RW: An ultra-wideband transceiver architecture for low power, low rate, wireless systems. IEEE Trans. Veh. Technol. 2005, 54(5):1623-1631.View ArticleGoogle Scholar
  37. Texas Instruments: Data Converters. . Accessed 17 July 2013


© Akbar et al.; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.