Browsing by Author "Duman, T. M."
Now showing 1 - 20 of 26
Results Per Page
Sort Options
Item Open Access Achieving Delay Diversity in Asynchronous Underwater Acoustic (UWA) Cooperative Communication Systems(IEEE, 2014-03) Rahmati, M.; Duman, T. M.In cooperative UWA systems, due to the low speedof sound, a node can experience significant time delays amongthe signals received from geographically separated nodes. Oneway to combat the asynchronism issues is to employ orthogonalfrequency division multiplexing (OFDM)-based transmissions atthe source node by preceding every OFDM block with anextremely long cyclic prefix (CP) which reduces the transmissionrates dramatically. One may increase the OFDM block lengthaccordingly to compensate for the rate loss which also degradesthe performance due to the significantly time-varying nature ofUWA channels. In this paper, we develop a new OFDM-basedscheme to combat the asynchronism problem in cooperativeUWA systems without adding a long CP (in the order of thelong relative delays) at the transmitter. By adding a muchmore manageable (short) CP at the source, we obtain a delaydiversity structure at the destination for effective processing andexploitation of spatial diversity by utilizing a low complexityViterbi decoder at the destination, e.g., for a binary phase shiftkeying (BPSK) modulated system, we need a two-state Viterbidecoder. We provide pairwise error probability (PEP) analysisof the system for both time-invariant and block fading channelsshowing that the system achieves full spatial diversity. We findthrough extensive simulations that the proposed scheme offers asignificantly improved error rate performance for time-varyingchannels (typical in UWA communications) compared to theexisting approaches.Item Open Access Adaptive OFDM modulation for underwater acoustic communications: Design considerations and experimental results(Institute of Electrical and Electronics Engineers Inc., 2014) Radosevic, A.; Ahmed, R.; Duman, T. M.; Proakis, J. G.; Stojanovic, M.In this paper, we explore design aspects of adaptive modulation based on orthogonal frequency-division multiplexing (OFDM) for underwater acoustic (UWA) communications, and study its performance using real-time at-sea experiments. Our design criterion is to maximize the system throughput under a target average bit error rate (BER). We consider two different schemes based on the level of adaptivity: in the first scheme, only the modulation levels are adjusted while the power is allocated uniformly across the subcarriers, whereas in the second scheme, both the modulation levels and the power are adjusted adaptively. For both schemes we linearly predict the channel one travel time ahead so as to improve the performance in the presence of a long propagation delay. The system design assumes a feedback link from the receiver that is exploited in two forms: one that conveys the modulation alphabet and quantized power levels to be used for each subcarrier, and the other that conveys a quantized estimate of the sparse channel impulse response. The second approach is shown to be advantageous, as it requires significantly fewer feedback bits for the same system throughput. The effectiveness of the proposed adaptive schemes is demonstrated using computer simulations, real channel measurements recorded in shallow water off the western coast of Kauai, HI, USA, in June 2008, and real-time at-sea experiments conducted at the same location in July 2011. We note that this is the first paper that presents adaptive modulation results for UWA links with real-time at-sea experiments.Item Open Access Bounds on the capacity of random insertion and deletion-additive noise channels(IEEE, 2013) Rahmati, M.; Duman, T. M.We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and output sequences. For the deletion channel, we consider two different models: i.i.d. deletion-substitution channel and i.i.d. deletion channel with additive white Gaussian noise (AWGN). These two models are considered to incorporate effects of the channel noise along with the synchronization errors. For the insertion channel case, we consider Gallager's model in which the transmitted bits are replaced with two random bits and uniform over the four possibilities independently of any other insertion events. The general approach taken is similar in all cases, however the specific computations differ. Furthermore, the approach yields a useful lower bound on the capacity for a wide range of deletion probabilities of the deletion channels, while it provides a beneficial bound only for small insertion probabilities (less than 0.25) of the insertion model adopted. We emphasize the importance of these results by noting that: 1) our results are the first analytical bounds on the capacity of deletion-AWGN channels, 2) the results developed are the best available analytical lower bounds on the deletion-substitution case, 3) for the Gallager insertion channel model, the new lower bound improves the existing results for small insertion probabilities. © 1963-2012 IEEE.Item Open Access Capacity bounds and concatenated codes over segmented deletion channels(IEEE, 2013) Wang, F.; Duman, T. M.; Aktas, D.We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is independently deleted with an equal probability, the segmentation assumption imposes certain constraints, i.e., in a block of bits of a certain length, only a limited number of deletions are allowed to occur. This channel model has recently been proposed and motivated by the fact that for practical systems, when a deletion error occurs, it is more likely that the next one will not appear very soon. We first argue that such channels are information stable, hence their channel capacity exists. Then, we introduce several upper and lower bounds with two different methods in an attempt to understand the channel capacity behavior. The first scheme utilizes certain information provided to the transmitter and/or receiver while the second one explores the asymptotic behavior of the bounds when the average bit deletion rate is small. In the second part of the paper, we consider a practical channel coding approach over a segmented deletion channel. Specifically, we utilize outer LDPC codes concatenated with inner marker codes, and develop suitable channel detection algorithms for this scenario. Different maximum-a-posteriori (MAP) based channel synchronization algorithms operating at the bit and symbol levels are introduced, and specific LDPC code designs are explored. Simulation results clearly indicate the advantages of the proposed approach. In particular, for the entire range of deletion probabilities less than unity, our scheme offers a significantly larger transmission rate compared to the other existing solutions in the literature.Item Open Access Cooperative precoding and artificial noise design for security over interference channels(Institute of Electrical and Electronics Engineers Inc., 2015) Özçelikkale, A.; Duman, T. M.We focus on linear precoding strategies as a physical layer technique for providing security in Gaussian interference channels. We consider an artificial noise aided scheme where transmitters may broadcast noise in addition to data in order to confuse eavesdroppers. We formulate the problem of minimizing the total mean-square error at the legitimate receivers while keeping the error values at the eavesdroppers above target levels. This set-up leads to a non-convex problem formulation. Hence, we propose a coordinate block descent technique based on a tight semi-definite relaxation and design linear precoders as well as spatial distribution of the artificial noise. Our results illustrate that artificial noise can provide significant performance gains especially when the secrecy levels required at the eavesdroppers are demanding. © 1994-2012 IEEE.Item 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.Item 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.Item Open Access Design of LDPC codes for two-way relay systems with physical-layer network coding(IEEE, 2013) Tanc, A. K.; Duman, T. M.; Tepedelenlioglu, C.This letter presents low-density parity-check (LDPC) code design for two-way relay (TWR) systems employing physical-layer network coding (PLNC). We focus on relay decoding, and propose an empirical density evolution method for estimating the decoding threshold of the LDPC code ensemble. We utilize the proposed method in conjunction with a random walk optimization procedure to obtain good LDPC code degree distributions. Numerical results demonstrate that the specifically designed LDPC codes can attain improvements of about 0.3 dB over off-the-shelf LDPC codes (designed for point-to-point additive white Gaussian noise channels), i.e., it is new code designs are essential to optimize the performance of TWR systems.Item Open Access Differential modulation for asynchronous two-way relay systems over frequency-selective fading channels(John Wiley and Sons Ltd, 2016) Salim, A.; Duman, T. M.We propose two schemes for asynchronous multi-relay two-way relay (MR-TWR) systems in which neither the users nor the relays know the channel state information. In an MR-TWR system, two users exchange their messages with the help of NR relays. Most of the existing works on MR-TWR systems based on differential modulation assume perfect symbol-level synchronization between all communicating nodes. However, this assumption is not valid in many practical systems, which makes the design of differentially modulated schemes more challenging. Therefore, we design differential modulation schemes that can tolerate timing misalignment under frequency-selective fading. We investigate the performance of the proposed schemes in terms of either probability of bit error or pairwise error probability. Through numerical examples, we show that the proposed schemes outperform existing competing solutions in the literature, especially for high signal-to-noise ratio values. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.Item Open Access Discrete-phase constant envelope precoding for massive MIMO systems(Institute of Electrical and Electronics Engineers Inc., 2017) Kazemi, M.; Aghaeinia, H.; Duman, T. M.We consider downlink of a multiuser massive multiple-input multiple-output (MIMO) system and focus on reducing the hardware costs by using a single common power amplifier and separate phase shifters (PSs) for antenna front-ends. In the previous literature, the use of analog PSs in this setup has been considered. Here, we study the use of practical digital PSs, which only support a limited set of discrete phases. Considering the sum of interference powers as a metric, we formulate the corresponding nonlinear discrete optimization problem and solve for the phases to be used during transmission. We devise a low-complexity algorithm, which employs a trellis structure providing suboptimal, but efficient and effective solutions. We demonstrate via examples that the proposed solutions have comparable performance to conventional analog PS-based algorithms. Furthermore, we prove that by utilizing discrete-phase constant envelope precoding, the interference can be made arbitrarily small by increasing the number of antennas. Therefore, the asymptotic gains promised by massive MIMO systems are preserved. We also obtain closed-form expressions for the rate loss due to errors in the phase and amplitude of the PSs, for both low and high SNR regimes.Item Open Access Efficient channel estimation for reconfigurable MIMO antennas: training techniques and performance analysis(Institute of Electrical and Electronics Engineers Inc., 2017) Bahceci, I.; Hasan, M.; Duman, T. M.; Cetiner, B. A.Multifunctional and reconfigurable multiple-input multiple-output (MR-MIMO) antennas are capable of dynamically changing the operation frequencies, polarizations, and radiation patterns, and can remarkably enhance system capabilities. However, in coherent communication systems, using MR-MIMO antennas with a large number of operational modes may incur prohibitive complexity due to the need for channel state estimation for each mode. To address this issue, we derive an explicit relation among the radiation patterns for the antenna modes and the resulting channel gains. We propose a joint channel estimation/prediction scheme where only a subset of all the antenna modes is trained for estimation, and then, the channels associated with the modes that are not trained are predicted using the correlations among the different antenna modes. We propose various training mechanisms with reduced overhead and improved estimation performance, and study the impact of channel estimation error and training overhead on the MR-MIMO system performance. We demonstrate that one can achieve significantly improved data rates and lower error probabilities utilizing the proposed approaches. For instance, under practical settings, we observe about 25% throughput increase or about 3-dB signal-to-noise ratio improvement under the same training overhead with respect to non-reconfigurable antenna systems.Item Open Access Exchange of correlated binary sources in two-way relay networks using LDPC codes(Institute of Electrical and Electronics Engineers Inc., 2017) Salim, A.; Duman, T. M.We consider the problem of exchanging messages in two-way relay (TWR) systems when the sources are correlated binary sequences. In a TWR system, two users communicate simultaneously in both directions to exchange their messages with the help of a relay. Harnessing the fact that the users have access to their own non-compressed messages as side information, each user can compress its message according to the Slepian-Wolf coding strategy by using low-density parity-check codes, particularly, the syndrome approach. Through numerical examples, we show that the proposed scheme offers significant improvements in compression rates compared to the existing solutions in the literature.Item Open Access Implementing the Han-Kobayashi scheme using low density parity check codes over Gaussian interference channels(Institute of Electrical and Electronics Engineers Inc., 2015) Sharifi S.; Tanc, A. K.; Duman, T. M.We focus on Gaussian interference channels (GICs) and study the Han-Kobayashi coding strategy for the two-user case with the objective of designing implementable (explicit) channel codes. Specifically, low-density parity-check codes are adopted for use over the channel, their benefits are studied, and suitable codes are designed. Iterative joint decoding is used at the receivers, where independent and identically distributed channel adapters are used to prove that log-likelihood-ratios exchanged among the nodes of the Tanner graph enjoy symmetry when BPSK or QPSK with Gray coding is employed. This property is exploited in the proposed code optimization algorithm adopting a random perturbation technique. Code optimization and convergence threshold computations are carried out for different GICs employing finite constellations by tracking the average mutual information. Furthermore, stability conditions for the admissible degree distributions under strong and weak interference levels are determined. Via examples, it is observed that the optimized codes using BPSK or QPSK with Gray coding operate close to the capacity boundary for strong interference. For the case of weak interference, it is shown that nontrivial rate pairs are achievable via the newly designed codes, which are not possible by single user codes with time sharing. Performance of the designed codes is also studied for finite block lengths through simulations of specific codes picked with the optimized degree distributions with random constructions, where, for one instance, the results are compared with those of some structured designs. © 1972-2012 IEEE.Item Open Access Joint precoder and artificial noise design for MIMO wiretap channels with finite-alphabet inputs based on the cut-off rate(Institute of Electrical and Electronics Engineers Inc., 2017) Aghdam, S. R.; Duman, T. M.We consider precoder and artificial noise (AN) design for multi-antenna wiretap channels under the finite-alphabet input assumption. We assume that the transmitter has access to the channel coefficients of the legitimate receiver and knows the statistics of the eavesdropper's channel. Accordingly, we propose a secrecy rate maximization algorithm using a gradient descent-based optimization of the precoder matrix and an exhaustive search over the power levels allocated to the AN. We also propose algorithms to reduce the complexities of direct ergodic secrecy rate maximization by: 1) maximizing a cut-off rate-based approximation for the ergodic secrecy rate, simplifying the mutual information expression, which lacks a closed-form and 2) diagonalizing the channels toward the legitimate receiver and the eavesdropper, which allows for employing a per-group precoding-based technique. Our numerical results reveal that jointly optimizing the precoder and the AN outperforms the existing solutions in the literature, which rely on the precoder optimization only. We also demonstrate that the proposed low complexity alternatives result in a small loss in performance while offering a significant reduction in computational complexity.Item Open Access LDPC code design for the two-user Gaussian multiple access channel(Institute of Electrical and Electronics Engineers Inc., 2016) Sharifi S.; Tanc, A. K.; Duman, T. M.We study code design for two-user Gaussian multiple access channels (GMACs) under fixed channel gains and under quasi-static fading. We employ low-density parity-check (LDPC) codes with BPSK modulation and utilize an iterative joint decoder. Adopting a belief propagation (BP) algorithm, we derive the PDF of the log-likelihood-ratios (LLRs) fed to the component LDPC decoders. Via examples, it is illustrated that the characterized PDF resembles a Gaussian mixture (GM) distribution, which is exploited in predicting the decoding performance of LDPC codes over GMACs. Based on the GM assumption, we propose variants of existing analysis methods, named modified density evolution (DE) and modified extrinsic information transfer (EXIT). We derive a stability condition on the degree distributions of the LDPC code ensembles and utilize it in the code optimization. Under fixed channel gains, the newly optimized codes are shown to perform close to the capacity region boundary outperforming the existing designs and the off-the-shelf point-to-point (P2P) codes. Under quasi-static fading, optimized codes exhibit consistent improvements upon the P2P codes as well. Finite block length simulations of specific codes picked from the designed ensembles are also carried out and it is shown that optimized codes perform close to the outage limits. © 2015 IEEE.Item Open Access Linear precoder design for simultaneous information and energy transfer over two-user MIMO interference channels(Institute of Electrical and Electronics Engineers, 2015) Özçelikkale, A.; Duman, T. M.Communication strategies that utilize wireless media for simultaneous information and power transfer offer a promising perspective for efficient usage of energy resources. With this motivation, we focus on the design of optimal linear precoders for interference channels utilizing such strategies. We formulate the problem of minimizing the total minimum mean-square error while keeping the energy harvested at the energy receivers above given levels. Our framework leads to a non-convex problem formulation. For point-to-point multiple-input multiple-output channels, we provide a characterization of the optimal solutions under a constraint on the number of transmit antennas. For the general interference scenario, we propose two numerical approaches, one for the single antenna information receivers case, and the other for the general case. We also investigate a hybrid signalling scheme, where the transmitter sends a superposition of two signals: a deterministic signal optimized for energy transfer and an information carrying signal optimized for information and energy transfer. It is illustrated that if hybrid signalling is not incorporated into the transmission scheme, interference can be detrimental to the system performance when the number of antennas at the receivers is low.Item Open Access Multi-input multi-output deletion channel(Institute of Electrical and Electronics Engineers, 2012) Wang F.; Duman, T. M.We describe a new channel model suitable in certain applications, namely the multi-input multi-output (MIMO) deletion channel. This channel models the scenarios where multiple transmitters and receivers suffering from synchronization errors are employed. We then consider a coding scheme over such channels based on a serial concatenation of a low-density parity check (LDPC) code, a marker code and a layered space-time code. We design two detectors operating at the bit level which jointly achieve synchronization for the deletion channel (with the help of the marker code) and detection for the MIMO channel. Utilizing the proposed detector together with an LDPC code with powerful error-correction capabilities, we demonstrate that reliable transmission over a MIMO deletion channel is feasible.Item Open Access Multiple-resampling receiver design for OFDM over Doppler-distorted underwater acoustic channels(2013) Tu, K.; Duman, T. M.; Stojanovic, M.; Proakis J. G.In this paper, we focus on orthogonal frequency-division multiplexing (OFDM) receiver designs for underwater acoustic (UWA) channels with user-and/or path-specific Doppler scaling distortions. The scenario is motivated by the cooperative communications framework, where distributed transmitter/receiver pairs may experience significantly different Doppler distortions, as well as by the single-user scenarios, where distinct Doppler scaling factors may exist among different propagation paths. The conventional approach of front-end resampling that corrects for common Doppler scaling may not be appropriate in such scenarios, rendering a post-fast-Fourier-transform (FFT) signal that is contaminated by user-and/or path-specific intercarrier interference. To counteract this problem, we propose a family of front-end receiver structures that utilize multiple-resampling (MR) branches, each matched to the Doppler scaling factor of a particular user and/or path. Following resampling, FFT modules transform the Doppler-compensated signals into the frequency domain for further processing through linear or nonlinear detection schemes. As part of the overall receiver structure, a gradient-descent approach is also proposed to refine the channel estimates obtained by standard sparse channel estimators. The effectiveness and robustness of the proposed receivers are demonstrated via simulations, as well as emulations based on real data collected during the 2010 Mobile Acoustic Communications Experiment (MACE10, Martha's Vineyard, MA) and the 2008 Kauai Acomms MURI (KAM08, Kauai, HI) experiment.Item Open Access On capacity and coding for segmented deletion channels(IEEE, 2011) Wang, F.; Aktaş, Defne; Duman, T. M.We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.Item Open Access On code design for joint energy and information transfer(Institute of Electrical and Electronics Engineers Inc., 2016) Dabirnia M.; Duman, T. M.Harvesting energy from radio frequency signals along with transmitting data through them is appealing for different wireless communication scenarios, such as radio frequency identification (RFID) systems and implantable devices. In this paper, we propose a technique to design nonlinear codes for the use in such systems taking into account both energy transmission and error rate requirements. In particular, we propose using concatenation of a nonlinear trellis code (NLTC) with an outer low-density parity-check (LDPC) code. We design the NLTC based on maximization of its free distance. We give necessary and sufficient conditions for its catastrophicity; in order to avoid catastrophic codes, we connect each designed NLTC to a corresponding linear convolutional code allowing for the use of simpler conditions for verification. Furthermore, we use EXIT charts to design the outer LDPC code while fixing the inner NLTC. Via examples, we demonstrate that our designed codes operate at ∼ 0.8 dB away from the information theoretic limits, and they outperform both regular LDPC codes and optimized irregular LDPC codes for additive white Gaussian noise (AWGN) channels. In addition, we show that the proposed scheme outperforms the reference schemes of concatenating LDPC codes with nonlinear memoryless mappers and using classical linear block codes in a time switching mode. © 2016 IEEE.