Browsing by Subject "Communication channels (information theory)"

Now showing 1 - 20 of 29

Open Access
Autofocused spotlight SAR image reconstruction of off-grid sparse scenes
(Institute of Electrical and Electronics Engineers Inc., 2017) Camlıca, S.; Gurbuz, A. C.; Arıkan, Orhan
Synthetic aperture radar (SAR) has significant role in remote sensing. Phase errors due to uncompensated platform motion, measurement model mismatch, and measurement noise can cause degradations in SAR image reconstruction. For efficient processing of the measurements, image plane is discretized and autofocusing algorithms on this discrete grid are employed. However, in addition to the platform motion errors, the reflectors, which are not exactly on the reconstruction grid, also degrade the image quality. This is called the off-grid target problem. In this paper, a sparsity-based technique is developed for autofocused spotlight SAR image reconstruction that can correct phase errors due to uncompensated platform motion and provide robust images in the presence of off-grid targets. The proposed orthogonal matching pursuit-based reconstruction technique uses gradient descent parameter updates with built in autofocus. The technique can reconstruct high-quality images by using sub Nyquist rate of sampling on the reflected signals at the receiver. The results obtained using both simulated and real SAR system data show that the proposed technique provides higher quality reconstructions over alternative techniques in terms of commonly used performance metrics.
Open Access
Broadcast erasure channel with feedback: The two multicast case-Algorithms and bounds
(IEEE, 2013) Onaran, Efe; Gatzianas, M.; Fragouli, C.
We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of N users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages [1], [2], we propose a virtual queue based session-mixing algorithm, which does not require knowledge of channel statistics and achieves capacity for N = 2 and iid erasures. Since the extension of this algorithm to N > 2 is not straightforward, we describe a simple algorithm which outperforms standard timesharing for arbitrary N and is actually asymptotically better than timesharing, for any finite N, as the erasure probability goes to zero. We finally provide, through an information-theoretic analysis, sufficient but not necessary asymptotic conditions between N and n (the number of transmissions) for which the achieved sum rate, under any coding scheme, is essentially identical to that of timesharing. © 2013 IEEE.
Open Access
Capacity bounds for an ultra-wideband channel model
(IEEE, 2004-10) Arıkan, Erdal
There is an ongoing effort by the IEEE 802.15.3a subcommittee to reach a UWB personal area network standard. We estimate the achievable rates for such networks using a channel model specified by the same group. The analysis of this channel model is of interest in light of recent information-theoretic work on multipath fading channels which show that in order to take full advantage of such channels' capacity the transmitted signals have to be "peaky" in a certain sense. The immense bandwidth of the UWB channel also suggests at first that peaky signals should be used. However, unlike the many other wireless systems where the transmitter energy is limited, in the UWB channel only the power spectral density of the transmitted signal is constrained. As a result, the signal power can grow in proportion to the utilized bandwidth and peaky signals are not needed. © 2004 IEEE.
Open Access
Communication efficient channel estimation over distributed networks
(IEEE, 2014) Sayın, Muhammed O.; Vanlı, N. Denizcan; Göze, T.; Kozat, Süleyman Serdar
We study diffusion based channel estimation in distributed architectures suitable for various communication applications such as cognitive radios. Although the demand for distributed processing is steadily growing, these architectures require a substantial amount of communication among their nodes (or processing elements) causing significant energy consumption and increase in carbon footprint. Due to growing awareness of telecommunication industry's impact on the environment, the need to mitigate this problem is indisputable. To this end, we introduce algorithms significantly reducing the communication load between distributed nodes, which is the main cause in energy consumption, while providing outstanding performance. In this framework, after each node produces its local estimate of the communication channel, a single bit or a couple of bits of information is generated using certain random projections. This newly generated data is diffused and then used in neighboring nodes to recover the original full information, i.e., the channel estimate of the desired communication channel. We provide the complete state-space description of these algorithms and demonstrate the substantial gains through our experiments.
Open Access
Cost-efficient approximation of linear systems with repeated and multi-channel filtering configurations
(IEEE, 1998-05) Kutay, Mehmet Alper; Erden, M. F.; Özaktaş, Haldun M.; Arıkan, Orhan; Candan, Ç.; Güleryüz, Ö.
It is possible to obtain either exact realizations or useful approximations of linear systems or matrix-vector products arising in many different applications, by synthesizing them in the form of repeated or multi-channel filtering operations in fractional Fourier domains, resulting in much more efficient implementations with acceptable decreases in accuracy. By varying the number and configuration of filter blocks, which may take the form of arbitrary flow graphs, it is possible to trade off between accuracy and efficiency in the desired manner. The proposed scheme constitutes a systematic way of exploiting the information inherent in the regularity or structure of a given linear system or matrix, even when that structure is not readily apparent.
Open Access
Decentralized stabilization: characterization of all solutions and genericity aspects
(Taylor & Francis, 1992) Ünyelioğlu, Konur Alp; Özgüler, Arif Bülent
Electrical and The decentralized stabilization problem of multivariable finite-dimensional systems is considered in a fractional set-up. A new synthesis procedure for decentralized stabilizing compensators is proposed. The class of all admissible local compensators that can be applied to a specified channel as an element of a decentralized compensator is identified. The conditions under which the class of admissible local compensators is generic are investigated. The problem of making a multi-channel system stabilizable and detectable from a single channel applying decentralized feedback around the other channels has been shown to be generically solvable for a given set of dynamic compensators if and only if the plant is strongly connected.
Open Access
Decoding strategies at the relay with physical-layer network coding
(Institute of Electrical and Electronics Engineers, 2012) Bhat, U.; Duman, T. M.
A two-way relay channel is considered where two users exchange information via a common relay in two transmission phases using physical-layer network coding (PNC). We consider an optimal decoding strategy at the relay to decode the network coded sequence during the first transmission phase, which is approximately implemented using a list decoding (LD) algorithm. The algorithm jointly decodes the codewords transmitted by the two users and sorts the L most likely pair of sequences in the order of decreasing a-posteriori probabilities, based on which, estimates of the most likely network coded sequences and the decoding results are obtained. Using several examples, it is observed that a lower complexity alternative, that jointly decodes the two transmitted codewords, has a performance similar to the LD based decoding and offers a near-optimal performance in terms of the error rates corresponding to the XOR of the two decoded sequences. To analyze the error rate at the relay, an analytical approximation of the word-error rate using the joint decoding (JD) scheme is evaluated over an AWGN channel using an approach that remains valid for the general case of two users adopting different codebooks and using different power levels. We further extend our study to frequency selective channels where two decoding approaches at the relay are investigated, namely; a trellis based joint channel detector/physical-layer network coded sequence decoder (JCD/PNCD) which is shown to offer a near-optimal performance, and a reduced complexity channel detection based on a linear receiver with minimum mean squared error (MMSE) criterion which is particularly useful where the number of channel taps is large.
Open Access
A delay-tolerant asynchronous two-way-relay system over doubly-selective fading channels
(Institute of Electrical and Electronics Engineers Inc., 2015) Salim, A.; Duman, T. M.
We consider design of asynchronous orthogonal frequency division multiplexing (OFDM) based diamond two-way-relay (DTWR) systems in a time-varying frequency-selective (doubly-selective) fading channel. In a DTWR system, two users exchange their messages with the help of two relays. Most of the existing works on asynchronous DTWR systems assume only small relative propagation delays between the received signals at each node that do not exceed the length of the cyclic-prefix (CP). However, in certain practical communication systems, significant differences in delays may take place, and hence existing solutions requiring excessively long CPs may be highly inefficient. In this paper, we propose a delay-independent CP insertion mechanism in which the CP length depends only on the number of subcarriers and the maximum delay spread of the corresponding channels. We also propose a symbol detection algorithm that is able to tolerate very long relative delays, that even exceed the length of the OFDM block itself, without a large increase in complexity. The proposed system is shown to significantly outperform other alternatives in the literature through a number of specific examples. © 2015 IEEE.
Open Access
Input sequence estimation and blind channel identification in HF communication
(IEEE, 2000) Khames, Mariam; Miled, B. H.; Arıkan, Orhan
A new algorithm is proposed for reliable communication over HF tropospheric links in the presence of rapid channel variations. In the proposed approach, using fractionally space channel outputs, sequential estimation of channel characteristics and input sequence is performed by utilizing subspace tracking and Kalman filtering. Simulation based comparisons with the existing algorithms show that the proposed approaches significantly improve the performance of the communication system and enable us to utilize HF communication in bad conditions.
Open Access
Joint source-channel coding and guessing
(IEEE, 1997-06-07) Arıkan, Erdal; Merhav, N.
We consider the joint source-channel guessing problem, define measures of optimum performance, and give single-letter characterizations. As an application, sequential decoding is considered.
Open Access
Joint source-channel coding and guessing with application to sequential decoding
(Institute of Electrical and Electronics Engineers, 1998-09) Arikan, E.; Merhav, N.
We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met. The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev and Hellman. Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding.
Open Access
Large deviations of probability rank
(IEEE, 2000) Arıkan, Erdal
Consider a pair of random variables (X,Y) with distribution P. The probability rank function is defined so that G(x|y) = 1 for the most probable outcome x conditional on Y = y, G(x|y) = 2 for the second most probable outcome, and so on, resolving ties between elements with equal probabilities arbitrarily. The function G was considered in [1] in the context of finding the unknown outcome of a random experience by asking question of the form 'Is the outcome equal to x?' sequentially until the actual outcome is determined. The primary focus in [1], and the subsequent works [2], [3], was to find tight bounds on the moments E[G(X|Y)θ]. The present work is closely related to these works but focuses more directly on the large deviations properties of the probability rank function.
Open Access
A low-complexity time-domain MMSE channel estimator for space-time/frequency block-coded OFDM systems
(Hindawi Publishing Corporation, 2006) Şenol, H.; Çırpan, H. A.; Panayırcı, E.; Çevik, M.
Focusing on transmit diversity orthogonal frequency-division multiplexing (OFDM) transmission through frequency-selective channels, this paper pursues a channel estimation approach in time domain for both space-frequency OFDM (SF-OFDM) and space-time OFDM(ST-OFDM) systems based on AR channel modelling. The paper proposes a computationally efficient, pilot-aided linear minimum mean-square-error (MMSE) time-domain channel estimation algorithm for OFDM systems with transmitter diversity in unknown wireless fading channels. The proposed approach employs a convenient representation of the channel impulse responses based on the Karhunen-Loeve (KL) orthogonal expansion and finds MMSE estimates of the uncorrelated KL series expansion coefficients. Based on such an expansion, no matrix inversion is required in the proposed MMSE estimator. Subsequently, optimal rank reduction is applied to obtain significant taps resulting in a smaller computational load on the proposed estimation algorithm. The performance of the proposed approach is studied through the analytical results and computer simulations. In order to explore the performance, the closed-form expression for the average symbol error rate (SER)probability is derived for the maximum ratio receive combiner(MRRC). We then consider the stochastic Cramer-Rao lower bound(CRLB) and derive the closed-form expression for the random KL coefficients, and consequently exploit the performance of the MMSE channel estimator based on the evaluation of minimum Bayesian MSE. We also analyze the effect of a modelling mismatch on the estimator performance. Simulation results confirm our theoretical analysis and illustrate that the proposed algorithms are capable of tracking fast fading and improving overall performance. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved.
Open Access
Mode separation and direction of arrival estimation in HF links
(Wiley-Blackwell Publishing, 2003) Arikan, F.; Yilmaz, N.; Arıkan, Orhan; Miled, M. K. B. H.
Estimation of arrival angles and incoming signals is a challenging problem for HF channels where the signals are correlated and the separation between the signals can be as low as a couple of degrees. In this paper, a new algorithm, Multipath Separation- Direction of Arrival (MS-DOA), is developed to estimate both the arrival angles in elevation and azimuth and the incoming signals at the output of the reference antenna with very high accuracy. The MS-DOA algorithm provides reliable angle and signal estimates even with small separation of arrival angles and for low SNRs. The minimum number of antennas that are required by the algorithm is only one more than the number of incoming signals. In a narrowed down region of interest and for a few incoming signals, the computational search time for MS-DOA is only a couple of minutes in a Standard PC.
Open Access
Multi-resampling Doppler compensation in cooperative underwater OFDM systems
(IEEE, 2013) Karakaya, B.; Hasna, M.O.; Duman, Tolga M.; Uysal, M.; Ghrayeb, A.
We consider a multi-carrier cooperative underwater acoustic communication (UWAC) system and investigate the Doppler scaling problem arising due to the motion of different nodes. Specifically, we assume an orthogonal frequency division multiplexing (OFDM) system with amplify and forward (AF) relaying. Our channel model is built on large-scale path loss along with the short-term frequency-selective fading. For Doppler scaling compensation, we use multi-resampling (MR) receiver designs both at the relay and destination nodes. We present an extensive Monte Carlo simulation study to evaluate the error rate performance of the proposed UWAC system. In simulations, we use the publicly available VirTEX software in conjunction with the ray-tracing based BELLHOP software to precisely reflect the characteristics of an underwater geographical location and the movement of the nodes. © 2013 IEEE.
Open Access
Multiperson tracking with a network of ultrawideband radar sensors based on gaussian mixture PHD filters
(Institute of Electrical and Electronics Engineers Inc., 2015) Gulmezoglu, B.; Guldogan, M. B.; Gezici, Sinan
In this paper, we investigate the use of Gaussian mixture probability hypothesis density filters for multiple person tracking using ultrawideband (UWB) radar sensors in an indoor environment. An experimental setup consisting of a network of UWB radar sensors and a computer is designed, and a new detection algorithm is proposed. The results of this experimental proof-of-concept study show that it is possible to accurately track multiple targets using a UWB radar sensor network in indoor environments based on the proposed approach. © 2014 IEEE.
Open Access
Noncoherent space-time coding: an algebraic perspective
(IEEE, 2005-06) El Gamal, H.; Aktas, D.; Damen, M. O.
The design of space-time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space-time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space-time signals which allows for a low complexity decoder. Within this class, space-time constellations based on the threaded algebraic space-time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus-rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space-time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space-time codes is shown to offer a very efficient solution to the noncoherent space-time communication paradigm.
Open Access
Nondata-aided channel estimation for OFDM systems with space-frequency transmit diversity
(Institute of Electrical and Electronics Engineers, 2006) Cırpan, H. A.; Panayırcı, E.; Doğan, H.
This paper proposes a computationally efficient nondata-aided maximum a posteriori (MAP) channel-estimation algorithm focusing on the space-frequency (SF) transmit diversity orthogonal frequency division multiplexing (OFDM) transmission through frequency-selective channels. The proposed algorithm properly averages out the data sequence and requires a convenient representation of the discrete multipath fading channel based on the Karhunen-Loeve (KL) orthogonal expansion and estimates the complex channel parameters of each subcarrier iteratively, using the expectation maximization (EM) method. To further reduce the computational complexity of the proposed MAP algorithm, the optimal truncation property of the KL expansion is exploited. The performance of the MAP channel estimator is studied based on the evaluation of the modified Cramer-Rao bound (CRB). Simulation results confirm the proposed theoretical analysis and illustrate that the proposed algorithm is capable of tracking fast fading and improving overall performance. © 2006 IEEE.
Open Access
Nonthermal Quantum Channels as a Thermodynamical Resource
(American Physical Society, 2015) Navascués, M.; García-Pintos L.P.
Quantum thermodynamics can be understood as a resource theory, whereby thermal states are free and the only allowed operations are unitary transformations commuting with the total Hamiltonian of the system. Previous literature on the subject has just focused on transformations between different state resources, overlooking the fact that quantum operations which do not commute with the total energy also constitute a potentially valuable resource. In this Letter, given a number of nonthermal quantum channels, we study the problem of how to integrate them in a thermal engine so as to distill a maximum amount of work. We find that, in the limit of asymptotically many uses of each channel, the distillable work is an additive function of the considered channels, computable for both finite dimensional quantum operations and bosonic channels. We apply our results to bound the amount of distillable work due to the natural nonthermal processes postulated in the Ghirardi-Rimini-Weber (GRW) collapse model. We find that, although GRW theory predicts the possibility of extracting work from the vacuum at no cost, the power which a collapse engine could, in principle, generate is extremely low. © 2015 American Physical Society. © 2015 American Physical Society.
Open Access
On secrecy rate analysis of spatial modulation and space shift keying
(IEEE, 2015) Aghdam, Sina Rezaei; Duman, Tolga M.; Di Renzo, M.
Spatial modulation (SM) and space shift keying (SSK) represent transmission methods for low-complexity implementation of multiple-input multiple-output (MIMO) wireless systems in which antenna indices are employed for data transmission. In this paper, we focus our attention on the secrecy behavior of SSK and SM. Using an information-theoretic framework, we derive expressions for the mutual information and consequently compute achievable secrecy rates for SSK and SM via numerical evaluations. We also characterize the secrecy behavior of SSK by showing the effects of increasing the number of antennas at the transmitter as well as the number of antennas at the legitimate receiver and the eavesdropper. We further evaluate the secrecy rates achieved by SM with different sizes of the underlying signal constellation and compare the secrecy performance of this scheme with those of general MIMO and SIMO systems. The proposed framework unveils that SM is capable of achieving higher secrecy rates than the conventional single-antenna transmission schemes. However, it underperfoms compared to a general MIMO system in terms of the achievable secrecy rates.