690 research outputs found
Cramer-Rao bounds in the estimation of time of arrival in fading channels
This paper computes the Cramer-Rao bounds for the time of arrival estimation in a multipath Rice and Rayleigh fading scenario, conditioned to the previous estimation of a set of propagation channels, since these channel estimates (correlation between received signal and the pilot sequence) are sufficient statistics in the estimation of delays. Furthermore, channel estimation is a constitutive block in receivers, so we can take advantage of this information to improve timing estimation by using time and space diversity. The received signal is modeled as coming from a scattering environment that disperses the signal both in space and time. Spatial scattering is modeled with a Gaussian distribution and temporal dispersion as an exponential random variable. The impact of the sampling rate, the roll-off factor, the spatial and temporal correlation among channel estimates, the number of channel estimates, and the use of multiple sensors in the antenna at the receiver is studied and related to the mobile subscriber positioning issue. To our knowledge, this model is the only one of its kind as a result of the relationship between the space-time diversity and the accuracy of the timing estimation.Peer ReviewedPostprint (published version
Design and Performance Analysis of Non-Coherent Detection Systems with Massive Receiver Arrays
Harvesting the gain of a large number of antennas in a mmWave band has mainly
been relying on the costly operation of channel state information (CSI)
acquisition and cumbersome phase shifters. Recent works have started to
investigate the possibility to use receivers based on energy detection (ED),
where a single data stream is decoded based on the channel and noise energy.
The asymptotic features of the massive receiver array lead to a system where
the impact of the noise becomes predictable due to a noise hardening effect.
This in effect extends the communication range compared to the receiver with a
small number of antennas, as the latter is limited by the unpredictability of
the additive noise. When the channel has a large number of spatial degrees of
freedom, the system becomes robust to imperfect channel knowledge due to
channel hardening. We propose two detection methods based on the instantaneous
and average channel energy, respectively. Meanwhile, we design the detection
thresholds based on the asymptotic properties of the received energy.
Differently from existing works, we analyze the scaling law behavior of the
symbol-error-rate (SER). When the instantaneous channel energy is known, the
performance of ED approaches that of the coherent detection in high SNR
scenarios. When the receiver relies on the average channel energy, our
performance analysis is based on the exact SER, rather than an approximation.
It is shown that the logarithm of SER decreases linearly as a function of the
number of antennas. Additionally, a saturation appears at high SNR for PAM
constellations of order larger than two, due to the uncertainty on the channel
energy. Simulation results show that ED, with a much lower complexity, achieves
promising performance both in Rayleigh fading channels and in sparse channels
Joint Channel Estimation and Pilot Allocation in Underlay Cognitive MISO Networks
Cognitive radios have been proposed as agile technologies to boost the
spectrum utilization. This paper tackles the problem of channel estimation and
its impact on downlink transmissions in an underlay cognitive radio scenario.
We consider primary and cognitive base stations, each equipped with multiple
antennas and serving multiple users. Primary networks often suffer from the
cognitive interference, which can be mitigated by deploying beamforming at the
cognitive systems to spatially direct the transmissions away from the primary
receivers. The accuracy of the estimated channel state information (CSI) plays
an important role in designing accurate beamformers that can regulate the
amount of interference. However, channel estimate is affected by interference.
Therefore, we propose different channel estimation and pilot allocation
techniques to deal with the channel estimation at the cognitive systems, and to
reduce the impact of contamination at the primary and cognitive systems. In an
effort to tackle the contamination problem in primary and cognitive systems, we
exploit the information embedded in the covariance matrices to successfully
separate the channel estimate from other users' channels in correlated
cognitive single input multiple input (SIMO) channels. A minimum mean square
error (MMSE) framework is proposed by utilizing the second order statistics to
separate the overlapping spatial paths that create the interference. We
validate our algorithms by simulation and compare them to the state of the art
techniques.Comment: 6 pages, 2 figures, invited paper to IWCMC 201
An OFDM Signal Identification Method for Wireless Communications Systems
Distinction of OFDM signals from single carrier signals is highly important
for adaptive receiver algorithms and signal identification applications. OFDM
signals exhibit Gaussian characteristics in time domain and fourth order
cumulants of Gaussian distributed signals vanish in contrary to the cumulants
of other signals. Thus fourth order cumulants can be utilized for OFDM signal
identification. In this paper, first, formulations of the estimates of the
fourth order cumulants for OFDM signals are provided. Then it is shown these
estimates are affected significantly from the wireless channel impairments,
frequency offset, phase offset and sampling mismatch. To overcome these
problems, a general chi-square constant false alarm rate Gaussianity test which
employs estimates of cumulants and their covariances is adapted to the specific
case of wireless OFDM signals. Estimation of the covariance matrix of the
fourth order cumulants are greatly simplified peculiar to the OFDM signals. A
measurement setup is developed to analyze the performance of the identification
method and for comparison purposes. A parametric measurement analysis is
provided depending on modulation order, signal to noise ratio, number of
symbols, and degree of freedom of the underlying test. The proposed method
outperforms statistical tests which are based on fixed thresholds or empirical
values, while a priori information requirement and complexity of the proposed
method are lower than the coherent identification techniques
Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies
The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy
Independent component analysis applications in CDMA systems
Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2004Includes bibliographical references (leaves: 56)Text in English; Abstract: Turkish and Englishxi, 96 leavesBlind source separation (BSS) methods, independent component analysis (ICA) and independent factor analysis (IFA) are used for detecting the signal coming to a mobile user which is subject to multiple access interference in a CDMA downlink communication. When CDMA models are studied for different channel characteristics, it is seen that they are similar with BSS/ICA models. It is also showed that if ICA is applied to these CDMA models, desired user.s signal can be estimated successfully without channel information and other users. code sequences. ICA detector is compared with matched filter detector and other conventional detectors using simulation results and it is seen that ICA has some advantages over the other methods.The other BSS method, IFA is applied to basic CDMA downlink model. Since IFA has some convergence and speed problems when the number of sources is large, firstly basic CDMA model with ideal channel assumption is used in IFA application.With simulation of ideal CDMA channel, IFA is compared with ICA and matched filter.Furthermore, Pearson System-based ICA (PS-ICA) method is used forestimating non-Gaussian multipath fading channel coefficients. Considering some fading channel measurements showing that the fading channel coefficients may have an impulsive nature, these coefficients are modeled with an -stable distribution whose shape parameter takes values close to 2 which makes the distributions slightly impulsive. Simulation results are obtained to compare PS-ICA with classical ICA.Also IFA is applied to the single path CDMA downlink model to estimate fading channel by using the advantage of IFA which is the capability to estimate sources with wide class of distributions
- …