1
A Compressive Sensing Approach to NBI
Cancellation in Mobile OFDM Systems
Ahmad Gomaa, Student Member, IEEE, and Naofal Al-Dhahir, Fellow, IEEE
The University of Texas at Dallas, USA
Abstract—We propose a novel algorithm based on compres-
sive sensing (CS) theory to estimate narrow band interfer-
ence (NBI) signals experiencing time-varying frequency-selective
fading channels in orthogonal frequency division multiplexing
(OFDM) systems. In addition, we investigate the case of asyn-
chronous jamming where there is a frequency offset between the
NBI and desired signals. Furthermore, we propose a reduced-
complexity implementation for our proposed algorithm with
negligible performance loss. Finally, we show that our proposed
approach can be applied to both cyclic-prefix and zero-padding
OFDM systems. Simulation results show the effectiveness of our
proposed algorithm in mitigating NBI.
I. I NTRODUCTION
Narrow-band interference (NBI) degrades the performance
of various wireline and wireless communications systems em-
ploying orthogonal frequency division multiplexing (OFDM).
For example, Non-intentional NBI impairs the performance
of multi-band (MB) OFDM ultra wide bandwidth (UWB)
systems [1] where the other licensed systems operating in
the same band cause interference to the UWB system in
parts of the operating bandwidth. Wireless local area networks
(WLANs), e.g. 802.11g/n, suffer from NBI generated by Blue-
tooth devices operating in the same band [2]. In addition, NBI
impairs wired systems such as Digital Subscriber Lines (DSL)
and power line communications (PLC) as radio frequency
interference (RFI) from AM and amateur radio. Moreover,
intentional NBI (jamming) may affect wireless networks used
in military applications. In this paper, we use the terms NBI
and jammer interchangeably.
The problem of NBI mitigation for OFDM is not well
investigated in the literature especially for MIMO systems, and
only few techniques have been reported. One of the techniques
is proposed in [3] where a prediction error filter (PEF) is used
to whiten the narrow-band spectrum of the NBI. This method
assumes that the NBI is an auto-regressive (AR) process;
otherwise the PEF length must be very long to whiten the NBI
spectrum. The PEF is also used in [4] as an erasure insertion
mechanism that localizes the erasures to the tones surrounding
the interference without affecting the remaining tones. In [3],
[4], only a single-tone NBI is assumed. However, in this paper,
we consider NBI affecting several OFDM subcarriers. In [5],
the first subcarrier is assumed to be interference free and
the error term between the received and detected signals of
the first subcarrier is used to predict the error term in the
next subcarrier. A major drawback of this method is that
errors in the interference estimate of one tone propagate to
This work is supported by a gift from RIM Inc.
the other tones. This technique was generalized in [6] using
soft decisions of the OFDM symbols from the decoding unit.
Recently, compressive sensing (CS) theory [7], [8] has been
applied to reconstruct a sparse vector from insufficient noisy
measurements. CS theory was first proposed in [9] to estimate
the NBI signal exploiting its inherent sparsity in the frequency-
domain (FD). However, the NBI signal was assumed to
be unfaded and synchronous with the desired signal at the
receiver. Furthermore, only one NBI signal was assumed. In
this paper, we relax these assumptions and show that CS theory
can still be applied to estimate the jammer effectively and we
propose a reduced-complexity implementation. In [9], the CS-
based approach was proposed for zero-padded (ZP) OFDM;
however, in this paper we show that the approach can be
extended to cyclic-prefix (CP) OFDM as well. The rest of this
paper is organized as follows. In the next section, we provide
a review of CS theory. For completeness, we give a review
of the CS-based approach for NBI estimation in Section III.
Section IV shows how the CS-based approach can be applied
to mobile and asynchronous jammers. A reduced-complexity
implementation for the CS-based approach is proposed in
Section V. The extension to CP-OFDM systems is presented
in Section VI. Finally, simulation results and conclusions
are given in Sections VII and VIII, respectively. Notations:
Unless otherwise stated, lower and upper case bold letters
denote vectors and matrices, respectively. The matrices F
and I denote the Fast Fourier Transform (FFT) matrix and
the identity matrix, respectively, and their subscripts denote
theirs sizes. The matrix 0m×n denotes the all-zero matrix of
size m × n. Also, ( )H , ( )∗ , and ( )−1 denote the matrix
complex-conjugate transpose, the complex conjugate, and the
matrix inverse operations, respectively. The j th element in a
is denoted by a(j).
II. C OMPRESSIVE S ENSING BACKGROUND
CS theory [7], [8] asserts that we can recover a sparse vector
x ∈ CN from a measurement vector y ∈ CM where M  N .
In other words, the exact solution of the under-determined
system of equations y = Ax + z can be computed where
A denotes the M × N measurement matrix and z ∈ CM
is a zero-mean random noise vector with covariance matrix
Cz  E(zzH ). The word ”sparse” means that x contains few
nonzero elements. The sparse vector x is recovered by solving
the following l1 -norm constrained minimization problem [10]
min  x̃ 1 subject to  y − Ax̃ 2 ≤  (1)
x̃∈CN
 2

where  . 1 and  . 2 denote the l1 -norm and the l2 -norm, this end, W is designed to be the projection matrix on the left
respectively, and  is chosen such that it bounds the amount null-subspace of Λ̃ as follows 2
of noise in the measurements. In fact, the convex optimization
problem in (1) is a second-order cone program and can be W = IP − Λ̃Λ̃† (6)
solved efficiently [11]. After solving (1), the support of x is
estimated with I = {k : x̃k = 0} which contains the estimated
indices of the nonzero elements in x. Then, x can be written
as x = Sd where d is a vector containing the values of the
nonzero elements of x. In addition, S is called the selection
matrix whose elements are all zeros except for a single ’1’ in
each column, and the indices of the rows containing these ’1’s
= WY = WJ + WZ .
are included in I. We can write y as y = ASd + z, and use
the weighted least squares (WLS) estimation technique [12]
to estimate d as follows
 −1 H H −1
d̃ = SH AH C−1 z AS S A Cz y (2)
III. NBI E STIMATION USING CS THEORY
As will be justified later, our proposed techniques utilize
the guard sequences between successive OFDM blocks. To
avoid inter-block interference (IBI), we use zero padding as
the guard sequence instead of a cyclic prefix [13]. Denoting
the guard sequence length by ν and the data length by N , the
received OFDM symbol in ZP-OFDM is given by
 H
y = H FN 0N ×ν X + z + j (3)
 
:=Fzp
where H is the P × P Circulant channel matrix where
P = N + ν, X is the frequency-domain (FD) data vector, z
is the time-domain (TD) noise vector, j is the TD NBI signal,
and Fzp is called the ZP transmission matrix. Note that H
is considered Circulant thanks to the all-zero matrix 0N ×ν in
Fzp [13]. The TD NBI vector j can be expressed as j = FH PJ
where J is its FD vector whose elements are modeled as
each side where D depends on the Doppler frequency of
dk , f ≤ k ≤ t
J(k) = (4)
0, otherwise
where dk ∈ C denotes the NBI amplitude at the k-th
subcarrier, and f and t denote the first and last indices
(subcarriers) of NBI, respectively. The NBI width is denoted
by r  t − f + 1. Converting y into FD yields
Y = FP y = 
ΛV X + Z + J (5)
:=Λ̃
where V  FP Fzp , Z  FP z, and Λ  FP HFH
P is a
diagonal matrix whose diagonal is the P -point discrete Fourier
transform (DFT) of the first column of H. Note that Λ̃ is a
tall matrix of size P × N as defined in (5). Our goal is to
estimate the NBI frequency support (NBI subcarrier indices f
through t) and the NBI amplitudes df through dt . Note that
J can be considered as a sparse signal since it represents a
narrow-band interference. Hence, J can be recovered from Y
using CS theory but X and Z are unknown so they are modeled
as noise. To reduce the noise level, we cancel the unknown
data term in (5). Assuming knowledge1 of Λ and, hence, Λ̃
at the receiver, we multiply Y by W such that WΛ̃ = 0. To
1 Channel estimation is investigated in [14]
 −1
where Λ̃†  Λ̃H Λ̃ Λ̃H is the pseudo-inverse matrix [15].
Since Λ̃ is a tall matrix, it has a nontrivial (i.e. non-zero) left
null-subspace. Now, it is clear that we keep the received guard
sequences to make Λ̃ a tall matrix. Multiplying Y by W, we
get
Y (7)

:=Z̃
Then, the convex program in (1) is solved to estimate the NBI
locations where W is the measurement matrix. Note that W
is a rank-ν matrix. Hence, the linear system in (7) is under-
determined. Next, WLS is used to estimate the NBI amplitudes
before cancelling the NBI signal from Y.
IV. P RACTICAL NBI MODELS
A. Mobile Jammer
In this section, we consider the case where the NBI source
is mobile and its channel is dispersive. Hence, the NBI signal
experiences a fast frequency-selective (FS) fading channel.
Denoting the channel matrix of the jammer by HJ , the received
faded NBI signal can be expressed as
jM = HJ j = FH
P FP HJ FP J = FP 
H H
ΛJ J  FH
P JM (8)
 
:=ΛJ :=JM
where j  FH P J is the transmitted NBI signal. According
to [16], ΛJ can be approximated as a banded matrix with
2D + 1 main diagonals. When multiplied by J, ΛJ causes
the FD NBI signal to spill over D adjacent subcarriers from
the jammer. Hence, higher jammer mobility results in larger
jammer spectral width but JM can still be considered sparse.
So, CS theory can still be used to recover JM as before.
Note that we follow this approach since we do not have any
knowledge about HJ because we can not ask the jammer to
send us pilots to estimate its channel!
B. Asynchronous Jammer
Now, we discuss the important case where the jammer is
not synchronous with the desired the signal; i.e. there is some
frequency offset between the jammer and the desired signal at
the receiver. In this case, the nth element of the received TD
NBI vector joffset is given by
t
d 2π
joffset (n) = √k ei P (k+α)n (9)
k=f
P
√
where i  −1 and the frequency offset is represented
  by α
which is uniformly distributed over the interval − 12 , 12 . The
2 Note that if P projects on the column subspace, then I − P projects on
its orthogonal complement which is the left null-subspace.
 3

interference component on the lth subcarrier in FD can then function of α. The estimate of α, denoted by α̂, is chosen to
be written as maximize the following cost function
   2
t
1 − ei2πα  
dk  s ( 1−ei2πα
) 
Joffset (l) =  . (10)  n=1 Jˆoffset
∗
(ln )  i 2π (k−ln +α)  
P 1 − ei 2π
P (k−l+α)
 1−e P 
k=f
ζ(α) =  2 (15)
 
When α = 0, we get the expression in (4). Hence, the effect
of the frequency offset is jammer spectral spreading. To see
the spreading in matrix notation, we express joffset as
joffset = Hoffset j = Hoffset FH
PJ (11)
i 2παn
where Hoffset is a diagonal matrix with Hoffset (n, n) = e , P
n = 0, 1, .., P − 1. Note that Hoffset can be considered as
the time-varying channel matrix HJ defined in Section IV-A
but with a single channel tap. Hence, Λoffset  FP Hoffset FH
P
is a Circulant banded matrix and the number of its main
(significant) diagonals depends on α. Then,
joffset = FH Λoffset J  FH
P  P Joffset (12)
 frequency support of J. If this estimate differs from k̂, we re-
:=Joffset
Since Λoffset is banded, Joffset becomes a spread version of
J. Considering Joffset as an approximately sparse vector, we
can use the CS-based approach to estimate it as done in
Section IV-A for the case of mobile jammers. This technique
is labelled as ”without estimating α” in Section VII. However,
if Λoffset is known at the receiver, then the CS approach can
be applied to recover J instead of Joffset . This is achieved by
absorbing Λoffset into the measurement matrix. To show this,
we write Y
as ”with estimating α” in Section VII. In [14], we use another
= WY = WJoffset + WZ = WΛoffset J + WZ.
Y (13)
If Λoffset is not known at the receiver, then we apply CS theory
to estimate Joffset . In this case, the measurement matrix is W.
On the other hand, if Λoffset is known at the receiver, then we
apply CS theory to estimate J. In this case, the measurement
matrix is WΛoffset . Since J is exactly sparse unlike Joffset ,
the solution of the l1 -norm constrained minimization problem
for J will be more accurate than that for Joffset . This is
because CS-based algorithms are designed for sparse vectors.
Consequently, better NBI estimation and cancellation can be
achieved if Λoffset is known at the receiver. Note that the matrix
Λoffset is completely determined by α. Hence, we propose the
1 = G1 Y = Fzp X + G1 Z + G1 J
following technique to estimate α for single-tone jammers and
believe that the extension to multiple-tone jammers is possible.
First, we apply CS theory to get an initial estimate of Joffset .
Since this estimate is sparse, we extract its largest s nonzero
elements. These extracted elements can be expressed as
1 by G2  0ν×N Iν to null out the
 
dk 1 − ei2πα /P
  (1−ei2πα )  
 2π 
 1−ei P (k−ln +α) 
where |.| denotes the absolute value. This maximization can
be implemented using grid search over  possible
 values of α
as follows. We quantize the interval − 21 , 12 into Nq levels,
substitute each level for α in ζ(α), and set α̂ to the level
that maximizes the cost function. Note that ζ(α) depends on
k which is the location of the jammer tone. As an estimate
 
of k, we use k̂ = arg max Jˆoffset (ln ). Using α̂, we form
n
an estimate for Λoffset , denoted by Λ̂offset . Then, we form
the measurement matrix as WΛoffset and solve the l1 -norm
constrained minimization problem to get an estimate for the
estimate α using the new estimate of k. This refined estimate
of α is only used to re-calculate Λ̂offset and the measurement
matrix. Finally, we perform the WLS step to estimate the
amplitude of the jammer and output the estimate of J denoted
by Ĵ. The new estimate for Joffset is given by
J̃offset = Λ̂offset Ĵ. (16)
Next, Joffset is cancelled from the received signal prior to the
detection and decoding steps. This technique is labelled as
technique to deal with asynchronous jammers, viz. we use
receiver windowing to spectrally contain the jammer.
V. A LTERNATIVE N ULLING M ETHOD
In Section III, we set W to be the projection matrix onto the
left null-subspace of Λ̃ to null out (cancel) the unknown data
term. However, computing W requires the inversion of a P ×P
matrix which is computationally intense although the diagonal
structure of Λ can be utilized to reduce the complexity. In this
section, we propose a simpler method to null out the unknown
data term where we utilize the tall structure of Fzp . First, we
−1
multiply Y by G1  FH PΛ to get
Y (17)
where Λ−1 is easily computed since Λ is diagonal and the
multiplication by FHP is efficiently implemented using the
inverse FFT operation. Recalling the structure
 of Fzp , we
simply multiply Y
unknown data term as follows
Jˆoffset (ln ) =   + e(ln ), 1 ≤ n ≤ s (14)
2 = G2 Y
Y
1 = G2 G1 J + G 2 G1 Z (18)
2π
1 − ei P (k−ln +α)    
A Z̃

where e(ln ) is some error term at the (ln ) element, dk th

and k denote the amplitude and the location of the single
1 . Next, we apply
jamming tone, respectively. The idea is to estimate α from
{Jˆoffset (ln ), n = 1, 2, .., s} using the non-linear least squares
estimation technique [12] because Jˆoffset (ln ) is a non-linear
Note that the multiplication by G2 is equivalent to extract-
ing the last ν elements of the vector Y
the CS-based technique to (18) to estimate J. However, the
disadvantage of this nulling scheme is the multiplication by
Λ−1 which may amplify the noise if the channel frequency

response has nulls near the P -point DFT grid. As a remedy−1
in (20) would be H
:= HK where K is a sub-matrix
for this problem, we replace Λ−1 by ΛH ΛΛH + δIP
where δ is a small constant proportional to the noise power.
This remedy is inspired from the minimum mean square error
criterion as an alternative to the zero forcing criterion.
VI. CS-BASED A PPROACH FOR CP-OFDM
The reason we did not use CP-OFDM in [9] is to avoid
the IBI in the guard sequence needed to get a tall matrix in
front of the unknown data term. In this section we present a
method to obtain a tall matrix in CP-OFDM without keeping
the guard sequence. This method is based on the fact that the
FD data vector X contains elements known at the receiver.
In WLANs, for example, X contains 12 null subcarriers and 4
pilot subcarriers. We denote the number of the known elements
of X as u. We denote the indices of the known and unknown
elements of X as IK and IU , respectively.
The received CP-OFDM symbol after removing the cyclic
prefix can be written as follows
y = HFH
N QX + z + j (19)
where H is the N ×N Circulant channel matrix, Q is an N ×N
pre-coding matrix inserted at the transmitter side, and z and j
are defined as before. The reason for inserting Q will become
clear shortly. To get a tall matrix in front of the unknown data
term, we do the following operation
y1 = y − HFH
N Q1 X1 = HFN Q2 X2 + z + j
H
(20)
  form the WLS step; instead we take the solution of the l1 -norm
:=H
where Q1 and Q2 are sub-matrices of Q containing the
columns corresponding to IK and IU , respectively. Similarly,
X1 and X2 are sub-vectors of X containing the known and
unknown elements of X, respectively. Observe that H
is an jamming power. The asynchronous jammer case is investigated
N × (N − u) tall matrix in front of the unknown vector X2 .
Consequently, we can multiply y1 by W  = IN − H
H
† to approach with/without estimating α and with perfect knowl-
cancel the unknown data term and, then, apply the CS-based
technique to estimate the NBI signal. However, to avoid the
inversion of a channel-dependent matrix, we follow a similar
approach to that in Section V. We convert y1 into FD to get
Y1 = FN y1 = ΛQ2 X + Z + J (21)
where Λ is a diagonal matrix defined as Λ = FN HFH
N.
Next,
we multiply Y1 by Λ−1 , which can computed easily since Λ
is diagonal, to get
1 = Λ−1 Y1 = Q2 X + Λ−1 Z + Λ−1 J. does not require the inversion of a channel-dependent matrix.
Y (22)
1 by G = IN −Q2 Q†
Since Q2 is a tall matrix, we multiply Y
2
to null out the unknown data term as follows
2 = GY
Y
1 = GΛ−1 J + GΛ−1 Z . (23)
    emphasize that our approach requires no prior knowledge
A Z̃
Next, our CS-based approach is applied to estimate J. Note
that G is computed only once at the receiver since it depends
only on Q2 which is known apriori at the receiver. To simplify
the detection process and to keep the transmitted power
unchanged, we choose the pre-coding matrix Q to be unitary,
i.e. QH Q = IN , and, hence, Q†2 = QH 2 . If Q is not present,
4
then H
of FH N constructed from the columns corresponding to IU .
Multiplying y1 by W nulls the unknown data term and yields a
measurement matrix A = WF  H . The reader can easily verify
N
that all columns of A are zeros except those corresponding to
IK . Hence, AJ is zero and Wy contains only noise unless
1
the jammed subcarriers indices were equal to IK .
VII. S IMULATION RESULTS
We simulate the performance of an OFDM-based wireless
system with N = 64, ν = 16, and L = 3 complex Gaussian
channel taps of equal power in the presence of NBI. We
employ a nonsystematic rate-1/2 convolutional code (CC) with
octal generator (133,171) and constraint length = 7. Coded
bits are quadrature phase shift keying (QPSK) modulated. The
signal-to-noise ratio (SNR) is defined as NEb
, and the signal-to-
o
interference ratio (SIR) is defined as  t E|db |2 /r where Eb
( k=f k )
is the bit energy. The case of a mobile jammer with Doppler
frequency normalized to 5% of the subchannel spacing is
investigated in Fig. 1 where the BER is plotted against the
SNR for r = 1 and 4 jammed subcarriers. The case of r = 4 is
encountered in WLANs with the frequency-hopping Bluetooth
signal acting as NBI. We also show the performance of the
interference-free case and the case where NBI is ignored at
the receiver. The jammer Doppler frequency assumed in this
paper corresponds to D = 1, i.e. 3 main diagonals. It worth
mentioning that in the case of a mobile jammer, we do not per-
constrained minimization problem as the jammer estimate and
cancel it from the received signal. The reason is that the mobile
jammer will spread over all the subcarriers and, hence, all the
subcarriers will be jammed although with different amounts of
in Fig. 2 where we show the performance of our CS-based
edge of α at the receiver. The performance with estimating
α is shown for various values of Nq where we observe that
estimating α significantly improves the performance even for
small Nq where the complexity of the grid search is small. The
performance of the alternative nulling method for ZP-OFDM,
proposed in Section V, is compared with the conventional
method in Fig. 3. Although the alternative nulling method
shows a small performance loss compared to the conventional
one, the complexity of the latter is significantly reduced as it
Finally, the performance of our CS-based approach for CP-
OFDM systems is shown in Fig. 4 where it can effectively
cancel the NBI and, thus, significantly improves the BER.
Figure 5 shows the BER performance versus the SIR. We
about the jammer statistics, location, or power.
VIII. C ONCLUSION
In this paper, we showed how to apply the recent CS
theory to estimate mobile NBI signals experiencing fast and
frequency-selective (FS) fading channels in OFDM-based sys-
tems. In addition, we investigate the asynchronous scenario
 5

0 0
10 10

−1
10
−1
10 No NBI
r = 4 jamming tones
−2 Conventional Nulling Method
10
Alternative Nulling Method
BER

BER
−2
10
−3 No NBI Ignoring NBI
10
Ignoring NBI
−3
CS−based Approach 10
−4
10 r = 1 jamming tone

−5 −4
10 10
0 2 4 6 8 10 12 14 16 18 20 22 0 2 4 6 8 10 12 14 16 18 20
SNR (dB) Jammer length (r)

Fig. 1. BER versus SNR for 2 × 1 ZP-OFDM systems jammed by a mobile Fig. 3. BER versus jammer width for 2 × 1 ZP-OFDM systems using
jammer with SIR = -17 dB. conventional and alternative nulling methods. SNR = 18dB and SIR = -17dB.
0 0
10 10

−1
10
−1
10

−2 No NBI
10
BER

BER
−2 CS−based Approach
10
−3
10 Ignoring NBI
Our approach without estimating α
Our approach with estimating α, Nq = 40
−3
−4 Our approach with estimating α, Nq = 20 10
10
Our approach with known α
No NBI
−5 −4
10 10
0 2 4 6 8 10 12 14 16 18 20 22 0 2 4 6 8 10 12 14 16 18 20
SNR (dB) Jammer length (r)

Fig. 2. BER versus SNR for 2 × 1 ZP-OFDM systems jammed by a single-  Fig. 4. BER versus jammer width for 2 × 1 CP-OFDM systems with SNR
tone asynchronous jammer with SIR = -17dB, s = 10, and α ∈ U − 21 , 12 . = 18dB and SIR = -17dB.
0
10
when there is a frequency offset between the jammer and the No NBI
desired signal where we integrate CS theory with non-linear CS−based approach

least squares to estimate this frequency offset. Furthermore, 10

−1 Ignoring NBI

we propose a reduced-complexity implementation for our CS-

based approach where the inversion of a channel-dependent
BER

−2
10
matrix is avoided. Finally, we show that the CS-based ap- r = 1 jammed r = 4 jammed subcarriers
proach for NBI estimation is applicable not only to ZP-OFDM subcarrier

systems but also to CP-OFDM systems as well. 10

−3

R EFERENCES
[1] A. Batra, J. Balakrishnan, G. Aiello, J. Foerster, and A. Dabak, “Design
of a Multiband OFDM System for Realistic UWB Channel Environ-
ments,” IEEE Trans. on Microwave Theory and Techniques, vol. 52, pp.
2123–2138, 2004.
[2] J. Park, D. Kim, C. Kang, and D. Hong, “Effect of bluetooth interference
on OFDM-based WLAN,” in IEEE VTC-Fall, 2003.
[3] A. Batra and J. Zeidler, “Narrowband interference mitigation in OFDM
systems,” in IEEE MILCOMM, 2008.
[4] ——, “Narrowband interference mitigation in BICM OFDM systems,”
in IEEE ICASSP, Apr. 2009.
[5] D. Darsena, “Successive narrowband interference cancellation for
OFDM systems,” IEEE Commun. Letters, vol. 11, pp. 1–3, Jan. 2007.
[6] D. Darsena and F. Verde, “Successive NBI cancellation using soft
decisions for OFDM systems,” IEEE Signal Processing Letters, vol. 15,
pp. 873–876, 2007.
[7] E. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact
signal reconstruction from highly incomplete frequency information,”
IEEE Trans. on Info. Theory, vol. 52, no. 2, pp. 489 – 509, Feb. 2006.
[8] D. Donoho, “Compressed sensing,” IEEE Trans. on Information Theory,
vol. 52, no. 4, pp. 1289 – 1306, April 2006.
[9] A. Gomaa, K. M. Zahidul Islam, and N. Al-Dhahir, “Two novel
compressed-sensing algorithms for NBI detection in OFDM systems,”
in IEEE ICASSP, March 2010.
−4
10
−20 −15 −10 −5 0 5 10 15 20
SIR (dB)
Fig. 5. BER versus SIR for ZP-OFDM systems with r = 1 (dashed lines)
and 4 (solid lines) jammed subcarriers and SNR = 18dB.
[10] E. Candes, J. Romberg, and T. Tao, “Stable signal recovery from
incomplete and inaccurate measurements,” Comm. on Pure and Appl.
Math, vol. 59, no. 9, pp. 1207–1223, 2006.
[11] S. Boyd and L. Vandenberghe, Convex Optimization. New York, NY:
cambridge Univ. Press, 2004.
[12] S. M. Kay, Fundamentals Of Statistical Signal Processing: Estimation
Theory. New Jersey: Prentice Hall, 1993.
[13] B. Muquet, Z. Wang, G. Giannakis, M. Courville, and P. Duhamel,
“Cyclic prefixing or zero padding for wireless multicarrier transmis-
sions?” IEEE Trans. on Comm., vol. 50, pp. 2136–2148, Dec. 2002.
[14] A. Gomaa and N. Al-Dhahir, “A novel sparsity aware approach for NBI
estimation in MIMO-OFDM,” Submitted,.
[15] G. H. Golub and C. F. V. Loan, Matrix Computations-Third Edition.
Baltimore, MD: Johns Hopkins Univ. Press, 1996.
[16] W. G. Jeon, K. H. Chang, and Y. S. Cho, “An equalization technique
for orthogonal frequency-division multiplexing systems in time-variant
multipath channels,” IEEE Trans. on Comm., vol. 47, pp. 27–32, 1999.