Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Communications, IEEE Transactions on

Issue 9 • Date September 2011

Filter Results

Displaying Results 1 - 25 of 37
  • Table of contents

    Publication Year: 2011 , Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (68 KB)  
    Freely Available from IEEE
  • [Staff list]

    Publication Year: 2011 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (58 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 2011 , Page(s): 2329
    Save to Project icon | Request Permissions | PDF file iconPDF (30 KB)  
    Freely Available from IEEE
  • Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields

    Publication Year: 2011 , Page(s): 2330 - 2336
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (260 KB) |  | HTML iconHTML  

    A new class of quasi-cyclic LDPC codes whose parity-check matrices are arrays of circulant permutation matrices constructed based on cyclic subgroups of finite fields is presented. This class of codes contains several known classes of algebraic quasi-cyclic LDPC codes as subclasses. Experimental results show that the codes constructed perform very well over the AWGN channel when decoded with iterative decoding based on belief propagation. This class of new QC-LDPC codes contains a subclass of codes which have large minimum distances. Combinatorial expressions for the ranks of the parity-check matrices of a subclass of codes constructed based on fields of characteristic two are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Binary Slepian-Wolf Decoding using Particle Based Belief Propagation

    Publication Year: 2011 , Page(s): 2337 - 2342
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (261 KB) |  | HTML iconHTML  

    A major difficulty that plagues the practical use of Slepian-Wolf (SW) coding (and distributed source coding in general) is that the precise correlation among sources needs to be known a priori. To resolve this problem, we propose an adaptive asymmetric SW decoding scheme using particle based belief propagation (PBP). We explain the adaptive scheme for asymmetric setup in detail and then further extend it to the non-asymmetric setup based on the code partitioning approach. Moreover, we introduce a Metropolis-Hastings (MH) algorithm in the resampling step, which efficiently decreases the number of simulation iterations. We show through experiments that the proposed algorithm can simultaneously reconstruct the compressed sources and estimate the joint correlation among sources. Further, comparing to the conventional SW decoder based on standard belief propagation, the proposed approach can achieve higher compression under varying correlation statistics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity Analysis of Symbol-by-Symbol Linear Equalizers

    Publication Year: 2011 , Page(s): 2343 - 2348
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (265 KB) |  | HTML iconHTML  

    In frequency-selective channels linear receivers enjoy significantly-reduced complexity compared with maximum likelihood receivers at the cost of performance degradation which can be in the form of a loss of the inherent frequency diversity order or reduced coding gain. This paper demonstrates that the minimum mean-square error symbol-by-symbol linear equalizer incurs no diversity loss compared to the maximum likelihood receivers. In particular, for a channel with memory ν, it achieves the full diversity order of (ν+1) while the zero-forcing symbol-by-symbol linear equalizer always achieves a diversity order of one. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel Representations for the Equicorrelated Multivariate Non-Central Chi-Square Distribution and Applications to MIMO Systems in Correlated Rician Fading

    Publication Year: 2011 , Page(s): 2349 - 2354
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (229 KB) |  | HTML iconHTML  

    Novel representations for the multivariate probability density function and cumulative distribution function of the non-central chi-square distribution are derived. The solutions are expressed in terms of well known functions which are available in common mathematical software. When the number of degrees of freedom, m, is even, the new representation has the advantage that only a single-integral computation is needed to compute a N-dimensional distribution. The new representations are used to numerically evaluate the outage probability of multiple input multiple output systems with receiver antenna selection, operating in correlated Rician fading. The well known equal correlation model, which is considered to be a useful model for a closely placed set of antennas, is used for the analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Closed-Form Solutions for the BEP of Decode-and-Forward Cooperative Systems in Nakagami-m Fading Channels

    Publication Year: 2011 , Page(s): 2355 - 2361
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (237 KB) |  | HTML iconHTML  

    The exact average bit error probability (BEP) performance of decode-and-forward (DF) cooperative systems for binary phase shift keying (BPSK) signals in Nakagami-m fading channels for integer values of m is analyzed. Two types of receivers, a λ-maximal ratio combining (λ-MRC) receiver and a piecewise linear (PL) receiver are examined. Closed-form, integral-free, expressions for the BEPs of the λ-MRC receiver and the PL receiver are obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing Source-Sum-Power Consumption in Multi-Sensor Single-Relay Networks

    Publication Year: 2011 , Page(s): 2362 - 2366
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (389 KB) |  | HTML iconHTML  

    This letter provides an exact and optimal power allocation for a sensor network that consists of multiple sensor-destination pairs and a single relay. The objective of the power allocation is to minimize the sum of transmitting powers by the sensors that have a signal-to-noise-ratio (SNR) constraint. After checking the feasibility of power allocation, an optimal solution is provided using Karush-Kuhn-Tucker (KKT) condition. With numerical investigation, the optimality of the proposed solution is illustratively verified and it is also shown that the extent of reduction in the sum-power consumption achieved by introducing the relay depends on the available relaying power and the number of sources. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Spectrally Efficient Detect-and-Forward Scheme with Two-Tier Adaptive Cooperation

    Publication Year: 2011 , Page(s): 2367 - 2372
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (270 KB) |  | HTML iconHTML  

    We propose a simple relay-based adaptive cooperation scheme to improve the spectral efficiency of "Detect-and-Forward" (DetF) half-duplex relaying in fading channels. In a new common framework, we show that the proposed scheme offers considerable gains-in terms of the achievable information rates-compared to conventional DetF relaying schemes for both orthogonal and non-orthogonal source/relay transmissions. The analysis leads on to a general adaptive cooperation strategy based on the maximization of information rates at the destination which needs to observe only the average signal-to-noise ratios of the links. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Diversity-Multiplexing Tradeoff in a Cooperative Network Coding System

    Publication Year: 2011 , Page(s): 2373 - 2376
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    This paper addresses the analysis of diversity-multiplexing tradeoff (DMT) for a decode-and-forward (DF)-based cooperative network coding (CNC) system. The exact outage probability is also provided. Our results show that network coding can assist the relay node to improve multiplexing and diversity gain. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of UWB Systems over the IEEE 802.15.3a Channel Model

    Publication Year: 2011 , Page(s): 2377 - 2382
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (395 KB) |  | HTML iconHTML  

    In this paper, we propose an accurate method for evaluating the performance of Ultra-Wideband systems over the IEEE 802.15.3a channel model. Depending on the severeness of fading, the method consists of approximating the distribution of the captured channel energy by either a Coxian, gamma-mixture or lognormal distribution based on a least square fitting criterion. The proposed approximations lend themselves to simple mathematical analysis and turn out to be useful in evaluating the performance, in terms of average bit-error-rate (BER) and outage probability, over the IEEE 802.15.3a channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel Coding with General Decoding Metrics and Rateless Transmission

    Publication Year: 2011 , Page(s): 2383 - 2393
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (376 KB) |  | HTML iconHTML  

    Multilevel coding (MLC) is the main contender to the celebrated bit-interleaved coded modulation (BICM) technique for combining binary error-control codes with multilevel constellations. Although MLC has a more complex encoding-decoding structure, it can achieve a larger rate in a number of important scenarios such as multiple-input multiple-output (MIMO) and orthogonal modulation transmission. In this paper, we consider two issues related to the application of MLC. First, we examine the use of general decoding metrics in MLC, including mismatched metrics that arise from approximations to reduce detection complexity. We make use of recent advances in the analysis of BICM and apply those techniques to individual MLC transmission layers. Our contributions include rate analysis and metric-mismatch correction to improve throughput performance of MLC. Second, we consider the combination of MLC with binary rateless codes. Such a combination eliminates the need to carefully design code rate for each MLC layer. In slow fading environments, rateless coding can also seamlessly adapt to the instantaneous channel quality and achieve an increased average throughput compared to a fixed-rate MLC transmission. However, due to the MLC structure, we show that a naive combination of MLC and rateless coding can cause a significant rate loss. Thus, we propose a novel rotation rateless scheme which preserves the rate advantage of MLC over BICM. We provide relevant examples with MIMO, frequency-shift keying (FSK), and pulse-position modulation (PPM) signaling to demonstrate that our scheme can achieve throughput gains compared to BICM in a variety of transmission scenarios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Throughput Parallel Fano Decoding

    Publication Year: 2011 , Page(s): 2394 - 2405
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (447 KB) |  | HTML iconHTML  

    In this paper, a bidirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction in the code tree simultaneously. It is shown that the proposed BFA can achieve more than twice the decoding throughput compared to the conventional unidirectional Fano algorithm (UFA) and there is higher throughput improvement at low signal-to-noise ratio (SNR). This new BFA decoding technique is applied in the parallel convolutional decoding architecture in very high throughput systems, such as the WirelessHD system. Due to the variability in the decoding delays of the parallel codewords, a scheduler is introduced in the parallel Fano decoding architecture which can dynamically allocate the idle decoders to assist with decoding the other parallel codewords in a bidirectional manner. It is shown that the proposed parallel Fano decoding with scheduling can dramatically increase the decoding throughput compared to the parallel Fano decoding without scheduling, and its computational complexity is much lower than that of parallel Viterbi decoding, especially at high SNR. The performance of the parallel Fano decoding with different scheduling schemes is also compared and analyzed in detail in the paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EXIT Chart Based System Design for Iterative Source-Channel Decoding with Fixed-Length Codes

    Publication Year: 2011 , Page(s): 2406 - 2413
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (962 KB) |  | HTML iconHTML  

    Audio-visual source encoders for digital wireless communications extract parameter sets on a frame-by-frame basis. Due to delay and complexity constraints these parameters exhibit some residual redundancy which manifests itself in non-uniform parameter distributions and intra- as well as inter-frame correlation. This residual redundancy can be exploited by iterative source-channel decoding (ISCD) to improve the robustness against impairments from the channel. In the design process of ISCD systems the well known EXIT charts play a key role. However, in case of inter-frame parameter correlation, the classic EXIT charts do not provide reliable bounds for predicting the convergence behavior of ISCD. We explain the reasons for the so-called overshooting effect and propose a novel extension to the EXIT chart computation which provide significantly better bounds for the decoding trajectories. Four advanced ISCD system configurations are proposed and investigated using the benefits of the improved EXIT chart based system design. These configurations include regular and irregular redundant index assignments. In addition, we incorporate unequal error protection in the optimization of irregular index assignments. We show how to realize a versatile multi-mode ISCD scheme which operates close to the theoretical limit. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity Analysis for Linear Equalizers over ISI Channels

    Publication Year: 2011 , Page(s): 2414 - 2423
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (389 KB) |  | HTML iconHTML  

    It has been shown in the literature that, with zero-padding prefix (ZPP), the optimum diversity gain of frequency selective channels can be obtained by uncoded signals and zero forcing (ZF) equalizers. In this paper, we derive two important results about linear equalizers over frequency selective channels: 1) With cyclic prefix and any rate-1 unitary precoding, which includes the uncoded/coded-OFDM/SCFDMA systems as special cases, linear equalizers can only obtain order-1 diversity; and 2) Although linear equalizers can achieve the optimum diversity order with zero-padding prefix and uncoded signals, the required SNR (signal-to-noise ratio) is an increasing function of the symbol-length. The second result implies that we may not be able to take advantage of the diversity gain in practice due to the high SNR requirements. Special cases are also investigated to gain some physical insights about the effects of different prefixes on the performance of linear equalizers. The results in this paper can be utilized in the design of up/down-link LTE systems with linear equalizers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Frequency Domain Multi-User Detector for TD-CDMA Systems

    Publication Year: 2011 , Page(s): 2424 - 2433
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (471 KB) |  | HTML iconHTML  

    In this paper, a novel frequency domain multi-user detector is proposed for a time division-code division multiple access (TD-CDMA) up-link. Unlike conventional frequency domain detectors, the proposed detector first transforms the system matrix of TD-CDMA systems into a circulant matrix by cyclic truncation. It subsequently uses a new method to convert the circulant matrix into a frequency domain block diagonalized matrix through discrete Fourier transforms and permutations. Therefore, the proposed detector can utilize the channel frequency domain coherence to further decrease its computational complexity with a controlled performance loss. Moreover, a novel approach is proposed to calculate the frequency domain correlation matrix and matched filter. With the help of this novel approach, the proposed detector expresses significant complexity advantage over other frequency domain detectors for a real TD-CDMA system in a short-time-dispersive channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Sum of Kappa Stochastic Variates and Applications to Equal-Gain Combining

    Publication Year: 2011 , Page(s): 2434 - 2442
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (872 KB) |  | HTML iconHTML  

    In this paper we study the statistics of the sum of not necessarily identically distributed kappa, that is, K, random variables (RV)s. Assuming half-integer values for the shaping parameters, novel closed-form expressions for the probability density function (PDF) of the sum of independent K RVs are obtained, while for arbitrary values of the shaping parameters, a corresponding PDF expression is derived in terms of fast converging infinite series. Furthermore, an infinite series representation for the PDF of the sum of two arbitrarily correlated K RVs is derived. The proposed analysis is employed to the performance analysis of equal-gain combining (EGC) receivers operating over composite fading/shadowing channels modeled by the K distribution. More specifically, the outage and the average bit error probabilities, as well as the average channel capacity of EGC receivers operating over such composite environment are studied. Considering different channel fading/shadowing conditions and correlation effects, various numerical performance evaluation results are presented. These results are complemented by equivalent computer simulated ones that validate the accuracy of the proposed analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Detection of Unknown Signals in Fading and Diversity Reception

    Publication Year: 2011 , Page(s): 2443 - 2453
    Cited by:  Papers (35)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (447 KB) |  | HTML iconHTML  

    A comprehensive performance analysis of the energy detector over fading channels with single antenna reception or with antenna diversity reception is developed. For the no-diversity case and for the maximal ratio combining (MRC) diversity case, with either Nakagami-m or Rician fading, expressions for the probability of detection are derived by using the moment generating function (MGF) method and probability density function (PDF) method. The former, which avoids some difficulties of the latter, uses a contour integral representation of the Marcum-Q function. For the equal gain combining (EGC) diversity case, with Nakagami-m fading, expressions for the probability of detection are derived for the cases L =2,3,4 and L >; 4, where L is the number of diversity branches. For the selection combining (SC) diversity, with Nakagami-m fading, expressions for the probability of detection are derived for the cases L =2 and L >; 2. A discussion on the comparison between MGF and PDF methods is presented. We also derive several series truncation error bounds that allow series termination with a finite number of terms for a given figure of accuracy. These results help quantify and understand the achievable improvement in the energy detector's performance with diversity reception. Numerical and simulation results are also provided. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analogue Signalling by Phase Shifting

    Publication Year: 2011 , Page(s): 2454 - 2462
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (430 KB) |  | HTML iconHTML  

    This paper presents a novel method for overlaying an analogue value on top of a digital signal. By adding a phase rotation and a signature sequence to a block of digitally modulated data symbols, this analogue value can be conveyed to a receiver without significant degradation to the underlying digital data. A near-ML estimator is derived which is non-data driven and hence independent of the digital data sequence. It is shown that this method of signalling a value is superior to quantising it and adding it to the digital data stream. We analyse the performance of the analogue and digital methods and also compare them using simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact and Closed-Form Error Performance Analysis for Hard MMSE-SIC Detection in MIMO Systems

    Publication Year: 2011 , Page(s): 2463 - 2477
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (552 KB) |  | HTML iconHTML  

    We investigate the exact error performance of hard minimum mean-squared error (MMSE) detection possibly with successive interference cancellation (SIC) in multiple-input multiple-output (MIMO) systems. To facilitate the analysis, we start with an exact bit-error rate (BER) analysis for a general system with decision statistic, z=ax+u, where a>;0, x is the transmitted signal, and u is an arbitrarily distributed noise component which is possibly dependent on the signal component x. For this general system, we derive the exact and closed-form BER expressions for M-ary pulse amplitude modulation (PAM) and arbitrary rectangular quadrature amplitude modulation (QAM), which include the well-known BER result of as a special case. Furthermore, by formulating the MIMO MMSE decision statistics in the same form as z in the general system, we derive the exact and closed-form instantaneous BER and symbol-error rate (SER) expressions for MIMO hard MMSE detection with/without SIC employing PAM and QAM. Finally, the validity of our derived error probability expressions is verified through extensive Monte Carlo simulations and the results reported in the literature. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytic Method for the Computation of the Total Harmonic Distortion by the Cauchy Method of Residues

    Publication Year: 2011 , Page(s): 2478 - 2491
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (571 KB) |  | HTML iconHTML  

    The total harmonic distortion (THD) is an important performance criterion for almost any communication device. In most cases, the THD of a periodic signal, which has been processed in some way, is either measured directly or roughly estimated numerically, while analytic methods are employed only in a limited number of simple cases. However, the knowledge of the theoretical THD may be quite important for the conception and design of the communication equipment (e.g. transmitters, power amplifiers). The aim of this paper is to present a general theoretic approach, which permits to obtain an analytic closed-form expression for the THD. It is also shown that in some cases, an approximate analytic method, having good precision and being less sophisticated, may be developed. Finally, the mathematical technique, on which the proposed method is based, is described in the appendix. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IDMA Using Non-Gray Labelled Modulation

    Publication Year: 2011 , Page(s): 2492 - 2501
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (538 KB) |  | HTML iconHTML  

    Interleave-division multiple-access (IDMA) is a multiple-access technique, which uses an elementary signal estimator (ESE) to achieve simple chip-by-chip detection. In this paper, we propose a new ESE which can be calculated directly based on the two-dimensional received signals. Hence, the proposed ESE can be applied to IDMA using signal modulation with either Gray labelling or non-Gray labelling. In contrast, the original ESE is calculated either based on the one-dimensional received signals or separately based on the real parts and the imaginary parts of the two-dimensional received signals. In fact, the original ESE can only be applied to IDMA using BPSK or Gray-labelled QPSK. From the proposed ESE, we can predict that the IDMA using the non-Gray labelling will be superior to the IDMA using the Gray labelling at the high signal-to-noise ratio (SNR) region. With EXIT (extrinsic information transfer) chart analysis, we can estimate the SNR region for which there is advantage of using non-Gray labelling for IDMA. The simulation results fit well with the theoretical analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Network Coding Strategies for Wireless Relay Networks with Backhaul

    Publication Year: 2011 , Page(s): 2502 - 2514
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (837 KB) |  | HTML iconHTML  

    We investigate cooperative network coding strategies for relay-aided two-source two-destination wireless networks with a backhaul connection between the source nodes. Each source multicasts information to all destinations using a shared relay. We study cooperative strategies based on different network coding schemes, namely, finite field and linear network coding, and lattice coding. To further exploit the backhaul connection, we also propose network coding based beamforming. We measure the performance in term of achievable rates over Gaussian channels, and observe significant gains over benchmark schemes. We derive the achievable rate regions for these schemes and find the cut-set bound for our system. We also show that the cut-set bound can be achieved by network coding based beamforming when the signal-to-noise ratios lie in the sphere defined by the source-relay and relay-destination channel gains. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Position Selection of Relays in Diamond Relay Networks

    Publication Year: 2011 , Page(s): 2515 - 2527
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1336 KB) |  | HTML iconHTML  

    The diamond relay network is an efficient cooperative networking configuration in which the source node cooperates with two selected neighbors. For such networks, we investigate the impact of the relay positioning on the performance. In particular, considering an opportunistic protocol based on the use of relaying buffers, we provide sets of constraints which, when satisfied, give sufficient conditions for simultaneously guaranteeing network stability and throughput improvement. These results are given for both symmetric and asymmetric relay locations. In contrast to prior work dealing with the diamond relay network, we also break the strong hypothesis of no interlink interference between the source and relay transmissions. Our results provide design guidelines for relay selection by establishing areas of feasible relay locations, whilst also identifying optimal positions which lead to maximum throughput gain. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Robert Schober
University of British Columbia