By Topic

Communications, IEEE Transactions on

Issue 11 • Date November 2010

Filter Results

Displaying Results 1 - 25 of 36
  • Table of contents

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

    Publication Year: 2010 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (58 KB)  
    Freely Available from IEEE
  • On the UEP Capabilities of Several LDPC Construction Algorithms

    Publication Year: 2010 , Page(s): 3041 - 3046
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (235 KB) |  | HTML iconHTML  

    This paper analyzes construction algorithms for low-density parity-check (LDPC) codes with respect to their unequal error protection (UEP) capabilities. We show that the choice of code construction algorithm highly affects the performance and UEP properties of LDPC codes with identical degree distributions. Our results provide an explanation to disagreements in earlier research. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Performance of Single-Threshold Detectors for Binary Communications in the Presence of Gaussian Mixture Noise

    Publication Year: 2010 , Page(s): 3047 - 3053
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (319 KB) |  | HTML iconHTML  

    In this paper, probability of error performance of single-threshold detectors is studied for binary communications systems in the presence of Gaussian mixture noise. First, sufficient conditions are proposed to specify when the sign detector is (not) an optimal detector among all the single-threshold detectors. Then, a monotonicity property of the error probability is derived for the optimal single-threshold detector. In addition, a theoretical limit is obtained on the maximum ratio between the average probabilities of error for the sign detector and the optimal single-threshold detector. Finally, numerical examples are presented to investigate the theoretical results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A New ML Based Interference Cancellation Technique for Layered Space-Time Codes"

    Publication Year: 2010 , Page(s): 3054 - 3055
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (127 KB) |  | HTML iconHTML  

    In this comment, we justify that the computational complexity proposed in the paper "A New ML Based Interference Cancellation Technique for Layered Space-Time Codes" (IEEE Trans. on Communications, vol. 57, no. 4, pp. 930-936, 2009) is O(N3) rather than the claimed O(N2), where N is the number of receive antennas. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference Cancellation Tree Algorithms with k-Signal Memory Locations

    Publication Year: 2010 , Page(s): 3056 - 3061
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (198 KB) |  | HTML iconHTML  

    Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded number of signal memory locations, with MSTs of 0.662 and 0.693, respectively. In this paper, we address the gap between these two algorithms by designing and analyzing two novel general k-signal memory location algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Performance of Cooperative-Diversity Networks with the Nth Best-Relay Selection Scheme

    Publication Year: 2010 , Page(s): 3062 - 3069
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (293 KB) |  | HTML iconHTML  

    In this letter, we consider the adaptive decode-and-forward (DF) and amplify-and-forward (AF) cooperative-diversity systems with the Nth best-relay selection scheme. In the best-relay selection scheme, from the set of M relays the best relay only forwards the source signal to the destination. However, the best relay might be unavailable; hence we might resort to the second, third or generally the Nth best relay. We derive closed-form expressions for the symbol error probability, outage probability and asymptotic error probability. In particular, we derive a closed-form expression for the probability density function (PDF) of the signal-to-noise ratio (SNR) of the relayed signal at the destination node. Then, we find a closed-form expression for the moment generating function (MGF) of the output SNR at the destination. This MGF is used to derive the closed-form expressions of the performance metrics. All these expressions are derived over identical and non-identical Rayleigh fading channels. Results show that with the Nth best relay the diversity order is equal to (M - N + 2) where M is the number of relays. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decode-and-Forward Two-Way Relaying with Network Coding and Opportunistic Relay Selection

    Publication Year: 2010 , Page(s): 3070 - 3076
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (368 KB)  

    In this paper, we study a decode-and-forward two-way relaying network. We propose an opportunistic two-way relaying (O-TR) scheme based on joint network coding and opportunistic relaying. In the proposed scheme, one single "best relay" is selected by MaxMin criterion to perform network coding on two decoded symbols sent from two sources, and then to broadcast the network-coded symbols back to the two sources. The performance of the proposed scheme is analyzed, and verified through Monte Carlo simulations. Results show that the proposed scheme achieves a better performance compared to the fully-distributed space-time two-way relaying (FDST-TR), which has been identified as the best decode-and-forward two-way relaying method so far. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical Modeling of Dual-Polarized MIMO Land Mobile Satellite Channels

    Publication Year: 2010 , Page(s): 3077 - 3083
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (442 KB) |  | HTML iconHTML  

    This Letter addresses the statistical modeling of dual-polarized MIMO-LMS fading channels. In the absence of accurate experimental results, a statistical model for the characterization of MIMO-LMS channels is proposed based on consolidation of available experimental results for SISO-LMS and MIMO wireless channels as well as on their extrapolation to the MIMO-LMS case of interest. Moreover, a step-by-step methodology for the simulation and time-series generation of the proposed MIMO-LMS channel model is provided, which is useful for the design and performance assessment of MIMO-LMS transmission systems. The proposed model incorporates the effects of all relevant critical channel aspects in a flexible and fully-parameterized way. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust L_p-Norm Decoding for BICM-Based Secondary User Systems

    Publication Year: 2010 , Page(s): 3084 - 3090
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (295 KB) |  | HTML iconHTML  

    The frequency bands used by secondary user systems such as cognitive radio and ultra-wideband (UWB) systems are subject to various forms of non-Gaussian noise and interference including co-channel and narrowband interference caused by the primary user and other secondary users as well as man-made impulsive noise. For secondary user systems employing popular bit-interleaved coded modulation (BICM) we propose a robust Lp-norm metric for Viterbi decoding to overcome the harmful effects of non-Gaussian noise and interference. For the resulting system, we derive an approximate upper bound on the bit error rate (BER) and a general analytical expression for the asymptotic BER valid for all practically relevant types of fading, including Rayleigh, Ricean, Nakagami-m, Nakagami-q, and Weibull fading, and all types of noise and interference with finite moments. Simulation and analytical results show that, in non-Gaussian noise and interference, the proposed Lp-norm metric yields large performance gains over the conventional L2-norm metric and outperforms erasure decoding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a Ratio of Functions of Exponential Random Variables and Some Applications

    Publication Year: 2010 , Page(s): 3091 - 3097
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (290 KB) |  | HTML iconHTML  

    Consider L independent and identically distributed exponential random variables (r.vs) X1, X2,...,XL and positive scalars b1, b2,...,bL. In this letter, we present the probability density function (pdf), cumulative distribution function and the Laplace transform of the pdf of the composite r.v Z = (Σ(j=1)L Xj)2/(Σ(j=1}L bj Xj). We show that the r.v Z appears in various communication systems such as i) maximal ratio combining of signals received over multiple channels with mismatched noise variances, ii) M-ary phase-shift keying with spatial diversity and imperfect channel estimation, and iii) coded multi-carrier code-division multiple access reception affected by an unknown narrow-band interference, and the statistics of the r.v Z derived here enable us to carry out the performance analysis of such systems in closed-form. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concise Derivation of Scattering Function from Channel Entropy Maximization

    Publication Year: 2010 , Page(s): 3098 - 3103
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (429 KB) |  | HTML iconHTML  

    In order to provide a concise time-varying SISO channel model, the principle of maximum entropy is applied to scattering function derivation. The resulting model is driven by few parameters that are expressed as moments such as the channel average power or the Doppler spread. Physical interpretations of the model outputs are discussed. In particular, it is shown that common Doppler spectra such as the flat or the Jakes spectrum fit well into the maximum entropy framework. The Matlab code corresponding to the proposed model is available at http://perso.telecom-bretagne.eu/fxsocheleau/software. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outage Performance Analysis of a Dual-Hop Radio Relay System Operating at Frequencies above 10GHz

    Publication Year: 2010 , Page(s): 3104 - 3109
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (450 KB) |  | HTML iconHTML  

    The ever increasing demand for multimedia services has led to the extensive use of fixed wireless outdoor networks, where the transmitted information signals arrive to the final destination through a relay node, creating a dual-hop transmission. Due to the increased demand for bandwidth and the spectral congestion at low frequencies, operation at frequencies above 10GHz satisfying the Line-Of-Sight condition is required. At this frequency range, the dominant fading mechanism exposing spatial and temporal stochastic properties is rain attenuation, typically modeled as a lognormal flat fading channel when expressed in dB (log-lognormal in linear scale). In this paper, the outage performance of a dual hop system using several radio relay types is presented and physical prediction models with analytical formulas are proposed, employing spatially correlated lognormal fading channels. Extended numerical results investigate the impact of various operational, geometrical and geographical radio relay parameters, as well as the impact of the employment of a relay channel estimator, on the end-to-end performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Opportunistic Transmission using Large Scale Channel Effects

    Publication Year: 2010 , Page(s): 3110 - 3114
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (195 KB) |  | HTML iconHTML  

    This paper quantifies the multi-user wireless diversity benefit of basing opportunistic transmission on large scale shadowing. This technique is primarily aimed at wireless sensor nodes. The processing capability of these nodes is limited and transmissions between sensor nodes are very sporadic. It is therefore easier for these devices to track large scale shadowing variations than the small scale shadowing variations normally used for opportunistic transmission. This paper will derive closed form expressions that compare the average SNR improvement provided by opportunistic transmission when based on large scale and small scale channel effects. Closed form bit error rate (BER) expressions will also be used to illustrate that opportunistic transmission based on shadowing can achieve very good performance improvements for modestly sized scheduling groups and realistic indoor shadowing standard deviation values. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes

    Publication Year: 2010 , Page(s): 3115 - 3125
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (362 KB) |  | HTML iconHTML  

    By using rate-compatible (RC) low density parity-check (LDPC) codes with adaptive modulation, we propose an adaptive, discrete-rate multiple-input multiple-output (MIMO) communications system. Given the high spectral efficiency of MIMO and the flexibility of an incremental redundancy (IR) protocol, combined with adaptive coding and modulation (ACM), the designed communications system is capable of achieving high data rates, for a low amount of overhead. A novel ACM power- and bit-allocation protocol is proposed to implement this system. We adapt the existing water-filling algorithm (WFA) to the discrete and finite bit rate constraints inherent in any communications system. This constrained WFA is shown to significantly improve the throughput performance of the communications system, over the case where a regular WFA is used. The results given in this paper show that the combination of IR and ACM with MIMO creates a wireless communications system that can easily adapt to channel fluctuations and provide high-data rates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares

    Publication Year: 2010 , Page(s): 3126 - 3139
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (504 KB) |  | HTML iconHTML  

    Quasi-cyclic LDPC codes are the most promising class of structured LDPC codes due to their ease of implementation and excellent performance over noisy channels when decoded with message-passing algorithms as extensive simulation studies have shown. In this paper, an approach for constructing quasi-cyclic LDPC codes based on Latin squares over finite fields is presented. By analyzing the parity-check matrices of these codes, combinatorial expressions for their ranks and dimensions are derived. Experimental results show that, with iterative decoding algorithms, the constructed codes perform very well over the AWGN and the binary erasure channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes

    Publication Year: 2010 , Page(s): 3140 - 3147
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (275 KB) |  | HTML iconHTML  

    This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scrambling-Based Shaping for Turbo Coded Modulation

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

    We propose a multiple-candidate shaping technique for turbo coded modulation systems. Shaping gains are obtained by encoding each message into multiple turbo coded modulation sequences, called candidates, and then selecting the candidate with the lowest energy for transmission. Multiple candidates are generated by adding various scrambling sequences to each message sequence. The proposed shaping technique can also be applied to turbo coded modulation systems equipped with some other shaping methods to obtain additional shaping gains. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concentric Permutation Source Codes

    Publication Year: 2010 , Page(s): 3154 - 3164
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (525 KB) |  | HTML iconHTML  

    Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the simplicity of encoding while increasing the number of rate-distortion operating points, improving the convex hull of operating points, and increasing design complexity. We show that when the subcodes are designed with the same composition, optimization of the codebook reduces to a lower-dimensional vector quantizer design within a single cone. Heuristics for reducing design complexity are presented, including an optimization of the rate allocation in a shape-gain vector quantizer with gain-dependent wrapped spherical shape codebook. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulated Lattice Vector Quantization: How to Make Quantization Index Modulation an Efficient Variable Rate Source Coder

    Publication Year: 2010 , Page(s): 3165 - 3174
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1445 KB) |  | HTML iconHTML  

    The design of a variable rate joint watermarking and compression (JWC) scheme is examined in this paper. The proposed approach, called modulated lattice vector quantization (MLVQ), is based on dither modulation quantization index modulation (DM-QIM) which allows for embedding information while maintaining good coding performance. In the first part, we propose a specific indexing method to make MLVQ with a multidimensional codebook feasible. Furthermore, a quantization parameter estimation was designed to ensure the invertibility of the embedding. The limitations of the compression performance of JWC schemes are studied in the second part. We show the existence of a coding rate lower bound which depends mainly on the codebook characteristics and dramatically decreases coding performance. To circumvent this drawback, two improved MLVQ schemes are proposed. In the first one, called arbitrary MLVQ, the embedding is performed on part of the signal to ensure a low embedding/coding ratio. In the second one, called deadzone MLVQ, the coding efficiency is further improved by maintaining the sparsity of the quantized host signal. It consists in excluding the sparse signal components from the embedding process then thresholding them. These schemes both applying wavelet coding demonstrate their efficiency as variable rate coders. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An A*-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length

    Publication Year: 2010 , Page(s): 3175 - 3185
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (486 KB) |  | HTML iconHTML  

    Variable length codes (VLCs) are widely adopted in many compression standards due to their good coding efficiency on average codeword length. However, an inherent problem with a VLC is that an error of even one bit can cause serious error propagation and thus loss of synchronization at the receiver, which would lead to a series of non-correctly decoded symbols. Reversible variable length codes (RVLCs) were introduced to significantly mitigate this phenomenon. In this work, a method to find an optimal RVLC in terms of the minimum average codeword length is first formulated as a tree-searching problem, and then, instead of performing an exhaustive search, an A*-based construction algorithm is proposed to find an optimal RVLC. The proposed algorithm has been applied to several benchmarks for sources and has found respective optimal symmetric and asymmetric RVLCs. View full abstract»

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

    Publication Year: 2010 , Page(s): 3186 - 3195
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (506 KB) |  | HTML iconHTML  

    In multiresolution coding a source sequence is encoded into a base layer and a refinement layer. The refinement layer, constructed using a conditional codebook, is in general not decodable without the correct reception of the base layer. By relating multiresolution coding with multiple description coding, we show that it is in fact possible to construct multiresolution codes in certain ways so that the refinement layer alone can be used to reconstruct the source to achieve a nontrivial distortion. As a consequence, one can improve the robustness of the existing multiresolution coding schemes without sacrificing the efficiency. Specifically, we obtain an explicit expression of the minimum distortion achievable by the refinement layer for arbitrary finite alphabet sources with Hamming distortion measure. Experimental results show that the information-theoretic limits can be approached using a practical robust multiresolution coding scheme based on low-density generator matrix codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space Shift Keying (SSK) Modulation with Partial Channel State Information: Optimal Detector and Performance Analysis over Fading Channels

    Publication Year: 2010 , Page(s): 3196 - 3210
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (491 KB) |  | HTML iconHTML  

    Space Shift Keying (SSK) modulation is a new and recently proposed transmission technology for Multiple-Input-Multiple-Output (MIMO) wireless systems, which has been shown to be a promising low-complexity alternative to several state-of-the-art MIMO schemes. So far, only optimal or heuristic transceivers with Full Channel State Information (F-CSI) at the receiver have been investigated, and their performance analyzed over fading channels. In this paper, we develop and study the performance of the optimal Maximum-Likelihood (ML) detector with unknown phase reference at the receiver (i.e., Partial-CSI, P-CSI, knowledge). A very accurate analytical framework for the analysis and optimization of this novel detector over generically correlated and non-identically distributed Nakagami-{m} fading channels is proposed, and its performance compared to the optimal receiver design with F-CSI. Numerical results will point out that: i) the performance of SSK modulation is significantly affected by the characteristics of fading channels, e.g., channel correlation, fading severity, and, particularly, power imbalance among the transmit-receive wireless links, and ii) unlike ordinary modulation schemes, there is a substantial performance loss when the receiver cannot exploit the phase information for optimal receiver design. This latter result highlights the importance of accurate and reliable channel estimation mechanisms for the efficient operation of SSK modulation over fading channels. Analytical frameworks and theoretical findings will also be substantiated via Monte Carlo simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cramer-Rao Lower Bounds for NDA SNR Estimates of Square QAM Modulated Transmissions

    Publication Year: 2010 , Page(s): 3211 - 3218
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (379 KB) |  | HTML iconHTML  

    In this paper, we derive for the first time analytical expressions for the exact Cramér-Rao lower bounds on the variance of unbiased non-data-aided (NDA) signal-to-noise ratio (SNR) estimators of square QAM-modulated signals. The channel is assumed to be constant over the observation interval and the received signal is supposed to be corrupted by additive white Gaussian noise (AWGN). The derived expressions corroborate previous attempts to numerically compute the considered CRLBs. It will be shown that the NDA CRLBs differ widely from one modulation order to another especially at moderate SNR levels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coherent and Differential Space-Time Shift Keying: A Dispersion Matrix Approach

    Publication Year: 2010 , Page(s): 3219 - 3230
    Cited by:  Papers (45)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (903 KB) |  | HTML iconHTML  

    Motivated by the recent concept of Spatial Modulation (SM), we propose a novel Space-Time Shift Keying (STSK) modulation scheme for Multiple-Input Multiple-Output (MIMO) communication systems, where the concept of SM is extended to include both the space and time dimensions, in order to provide a general shift-keying framework. More specifically, in the proposed STSK scheme one out of Q dispersion matrices is activated during each transmitted block, which enables us to strike a flexible diversity and multiplexing tradeoff. This is achieved by optimizing both the space-time block duration as well as the number of the dispersion matrices in addition to the number of transmit and receive antennas. We will demonstrate that the resultant equivalent system model does not impose any Inter-Channel Interference (ICI), and hence the employment of single-stream Maximum Likelihood (ML) detection becomes realistic at a low-complexity. Furthermore, we propose a Differential STSK (DSTSK) scheme, assisted by the Cayley unitary transform, which does not require any Channel State Information (CSI) at the receiver. Here, the usual error-doubling, caused by the differential decoding, gives rise to 3-dB performance penalty in comparison to Coherent STSK (CSTSK). Additionally, we introduce an enhanced CSTSK scheme, which avoids the requirement of Inter-Antenna Synchronization (IAS) between the RF chains associated with the transmit Antenna Elements (AEs) by imposing a certain constraint on the dispersion matrix design, where each column of the dispersion matrices includes only a single non-zero component. Moreover, according to the turbo-coding principle, the proposed CSTSK and DSTSK schemes are combined with multiple serially concatenated codes and an iterative bit-to-symbol soft-demapper. More specifically, the associated STSK parameters are optimized with the aid of Extrinsic Information Transfer (EXIT) charts, for the sake of achieving a near-capacity performance. 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