Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Communications, IEEE Transactions on

Issue 5 • Date May 2006

Filter Results

Displaying Results 1 - 25 of 35
  • Table of contents

    Publication Year: 2006 , Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (50 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Communications publication information

    Publication Year: 2006 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • Residual frequency offset compensation using the approximate SAGE algorithm for OFDM system

    Publication Year: 2006 , Page(s): 765 - 769
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    In this letter, we propose an iterative detection scheme in the presence of residual frequency offset (RFO) for orthogonal frequency-division multiplexing systems using an approximate application of the space-alternating generalized expectation-maximization (SAGE) algorithm. In the proposed scheme, the expectation step intends to divide the received signal into the desired signal and the interference signal. In the maximization step, the desired signal is used to estimate required parameters (i.e., RFO, data symbols, and channel state information) sequentially. Simulation results present that the proposed scheme shows almost ideal performance as long as the normalized RFO value is within 0.2. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic performance of hybrid-selection/maximal-ratio combining over fading channels

    Publication Year: 2006 , Page(s): 770 - 777
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (384 KB) |  | HTML iconHTML  

    In this letter, we study the asymptotic performance of hybrid-selection/maximal-ratio combining (HS/MRC) and postdetection HS/equal-gain combining (HS/EGC) over generalized fading channels for large average signal-to-noise ratios (ASNRs). By evaluating the asymptotic moment generating function of the HS/MRC output SNR at high ASNR, we derive the diversity and coding gains for HS/MRC for a large class of modulation formats and versatile fading conditions, including different types of fading channels and nonidentical SNR statistics across diversity branches. Our analytical results reveal that the diversity gains of HS/MRC and HS/EGC are equivalent to that of MRC, and the difference in the coding gains for different modulation formats is manifested in terms of a modulation factor defined in this letter. Some new analytical results about effects of the number of combined branches for HS/MRC and noncoherent combining loss of HS/EGC are also provided. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A neural network approach to MMSE receivers in a DS-CDMA multipath fading environment

    Publication Year: 2006 , Page(s): 778 - 782
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (256 KB) |  | HTML iconHTML  

    This letter deals with an advanced minimum mean-squared error receiver for applications to uplink transmissions in a multiuser code-division multiple-access system. The receiver is implemented by means of a suitable neural network in order to enhance the receiver convergence speed in the case of fast fading. Performance comparisons with classical approaches highlights a better behavior for the proposed scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The soft-feedback equalizer for turbo equalization of highly dispersive channels

    Publication Year: 2006 , Page(s): 783 - 788
    Cited by:  Papers (31)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (280 KB) |  | HTML iconHTML  

    The complexity of a turbo equalizer based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is manageable only for mildly dispersive channels having a small amount of memory. To enable turbo equalization of highly dispersive channels, we propose the soft-feedback equalizer(SFE). The SFE combines linear equalization and soft intersymbol-interference cancellation. Its coefficients are chosen to minimize the mean-squared error(MSE) between the equalizer output and the transmitted sequence, under a Gaussian approximation to the a priori information and the SFE output. The resulting complexity grows only linearly with the number of coefficients, as opposed to the quadratic complexity of previously reported minimum-MSE structures. We will see that an SFE-based turbo equalizer consistently outperforms another structure of similar complexity, and can outperform a BCJR-based scheme when complexity is taken into account. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Greedy scheduling performance for a zero-forcing dirty-paper coded system

    Publication Year: 2006 , Page(s): 789 - 793
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    This letter presents two results for multiuser wireless systems employing dirty-paper coding strategies along with greedy scheduling over the broadcast multiple-input multiple-output channel. Specifically, an efficient and suboptimal downlink scheduler is proposed to approximate the maximum sum rate using equal power allocation, and it is shown to approach the maximum sum rate of optimal power allocation for a large number of users under optimal scheduling. The second result demonstrates that the average maximum sum rate can be tightly upper bounded when spatial multiplexing is maximized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient design of FMT systems

    Publication Year: 2006 , Page(s): 794 - 797
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (192 KB) |  | HTML iconHTML  

    An efficient channel-independent design method for the prototype filter of a filtered multitone (FMT) transceiver is proposed, along with an iterative power-loading algorithm for FMT. The insight gained from this design is used to choose the number of subchannels in an FMT system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential modulation and cyclic delay diversity in orthogonal frequency-division multiplex

    Publication Year: 2006 , Page(s): 798 - 801
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    We propose a new scheme for differential modulation in orthogonal frequency-division multiplexing (OFDM) with cyclic delay diversity. Delay diversity is done in a cyclic manner in order not to exceed the guard interval. However, the increased frequency selectivity, and consequently, reduced coherence bandwidth, causes problems for noncoherent detection of differential modulation in frequency direction. Our proposal is able to cope with the increased frequency selectivity,and enables picking up the spatial diversity in frequency-selective channels with unknown delay spread in combination with standard differential modulation techniques. The new scheme is less complex than differential unitary space-time modulation. The overhead due to reference symbols is minimized and the detection delay is reduced, compared with differential modulation in time direction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A useful integral for wireless communication theory and its application to rectangular signaling constellation error rates

    Publication Year: 2006 , Page(s): 802 - 805
    Cited by:  Papers (45)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (168 KB) |  | HTML iconHTML  

    A useful integral, representing the average over Rayleigh fading of the product of two Gaussian Q-functions, is solved in closed-form. A closed-form solution for the symbol-error probability of general rectangular quadrature amplitude modulation in Rayleigh fading is derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the bit-error probability of differentially encoded QPSK and offset QPSK in the presence of carrier synchronization

    Publication Year: 2006 , Page(s): 806 - 812
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (304 KB) |  | HTML iconHTML  

    We investigate the differences between allowable differential encoding strategies and their associated bit-error probability performances for quadrature phase-shift keying (QPSK) and offset QPSK modulations when the carrier demodulation reference signals are supplied by the optimum (motivated by maximum a posteriori estimation of carrier phase) carrier-tracking loop suitable for that modulation. In particular, we show that in the presence of carrier-synchronization phase ambiguity but an otherwise ideal loop, both the symbol and bit-error probabilities in the presence of differential encoding are identical for the two modulations. On the other hand, when in addition the phase error introduced by the loop's finite signal-to-noise ratio is taken into account, it is shown that the two differentially encoded modulations behave differently, and their performances are no longer equivalent. A similar statement has previously been demonstrated for the same modulations when the phase ambiguity was assumed to have been perfectly resolved by means other than differential encoding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Carrier frequency offset estimation for OFDM systems using subcarriers

    Publication Year: 2006 , Page(s): 813 - 823
    Cited by:  Papers (38)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (592 KB) |  | HTML iconHTML  

    Carrier frequency offset (CFO) in orthogonal frequency-division multiplexing(OFDM) systems, which can induce the loss of orthogonality among subcarriersand result in significant performance degradation, is critical to be estimatedand compensated for. In this paper, a suboptimal scheme is proposed to estimatethe CFO using subcarriers. In the proposed scheme, the CFO is dividedinto the fractional part and the integer part, with the fractional CFO estimatedfollowed by the integer CFO estimation. Compared with previous work using subcarriers and exhaustive search, the implementation complexity of theproposed scheme is significantly lower due to the fact that the main componentrequired is a simple correlator. Furthermore, with only one trainingOFDM symbol and proper subcarrier allocation, the estimation range ofthe proposed scheme can be the inverse of the sampling duration. In contrast,conventional schemes with the same estimation range and complexity require two OFDM symbols. To achieve good performance,it will be shown that the subcarrier allocation should be based uponsome specific binary sequences such as the proposed extended m-sequences. It willalso be shown by simulations that the same subcarrier allocation criterionshould be employed for optimal maximum-likelihood CFO estimation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum bit-error rate design for space-time equalization-based multiuser detection

    Publication Year: 2006 , Page(s): 824 - 832
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB) |  | HTML iconHTML  

    A novel minimum bit-error rate (MBER) space-time-equalization (STE)-based multiuser detector (MUD) is proposed for multiple-receive-antenna-assisted space-division multiple-access systems. It is shown that the MBER-STE-aided MUD significantly outperforms the standard minimum mean-square error design in terms of the achievable bit-error rate (BER). Adaptive implementations of the MBER STE are considered, and both the block-data-based and sample-by-sample adaptive MBER algorithms are proposed. The latter, referred to as the least BER (LBER) algorithm, is compared with the most popular adaptive algorithm,known as the least mean square (LMS) algorithm. It is shown that in case of binary phase-shift keying, the computational complexity of the LBER-STE is about half of that required by the classic LMS-STE. Simulation results demonstrate that the LBER algorithm performs consistently better than the classic LM Salgorithm, both in terms of its convergence speed and steady-state BER performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A least-squares/Newton method for digital predistortion of wideband signals

    Publication Year: 2006 , Page(s): 833 - 840
    Cited by:  Papers (33)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (648 KB) |  | HTML iconHTML  

    Power amplifiers (PAs) are essential in communication systems, but are inherently nonlinear. To achieve linearity with good efficiency, PA linearization is necessary. Digital baseband predistortion is a highly cost-effective way to linearize PAs, but most existing architectures assume that the PA has a memoryless nonlinearity. For wider bandwidth applications, such as wideband code-division multiple access, PA memory effects can no longer be ignored. Therefore, in order to achieve good linearization performance, the predistorter needs to also have memory structure. In this paper, we propose a new model for the wideband predistorter and a least-squares(LS)/Newton algorithm to estimate the model parameters. Performance of the LS/Newton algorithm is studied through computer simulations. Good linearization performance is achieved by using the new model in an experimental testbed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SNR estimation in time-varying fading channels

    Publication Year: 2006 , Page(s): 841 - 848
    Cited by:  Papers (27)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (448 KB) |  | HTML iconHTML  

    Signal-to-noise ratio (SNR) estimation is considered for phase-shift keying communication systems in time-varying fading channels. Both data-aided (DA) estimation and nondata-aided (NDA) estimation are addressed. The time-varying fading channel is modeled as a polynomial-in-time. Inherent estimation accuracy limitations are examined via the Cramer-Rao lower bound, where it is shown that the effect of the channel's time variation on SNR estimation is negligible. A novel maximum-likelihood (ML) SNR estimator is derived for the time-varying channel model. In DA scenarios, where the estimator has a simple closed-form solution, the exact performance is evaluated both with correct and incorrect (i.e., mismatched) polynomial order. In NDA estimation, the unknown data symbols are modeled as random, and the marginal likelihood is used. The expectation-maximization algorithm is proposed to iteratively maximize this likelihood function. Simulation results show that the resulting estimator offers statistical efficiency over a wider range of scenarios than previously published methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mixed-Q linear space-time codes

    Publication Year: 2006 , Page(s): 849 - 857
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (560 KB) |  | HTML iconHTML  

    A new modulation method for linear space-time codes is proposed based on using constellations of different sizes for different symbols. It is shown that the proposed method significantly reduces the complexity of the sphere decoding algorithm. The complexity reduction is more pronounced in high-rate codes, where each code matrix carries a large number of symbols. We also show that the choice of constellation size provides a tradeoff between performance and complexity. Using this, some guidelines for choosing constellation size are presented. As one introduces more constellation disparity in the code, the complexity is further reduced, while the performance loss grows. Typically, a complexity reduction of one to two orders of magnitude can be achieved at the expense of about 3 dB coding gain. We suggest a simple modification in our design to reduce this loss to about 2 dB. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless access with blind collision-multiplicity detection and retransmission diversity for quasi-static channels

    Publication Year: 2006 , Page(s): 858 - 867
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (600 KB) |  | HTML iconHTML  

    Wireless multiple-access protocols using retransmission diversity resolve packet collisions through source separation techniques. Retransmissions are applied to achieve the necessary diversity level to determine the collision multiplicity blindly, whose proper detection is essential for good resolution performance. The so-called network-assisted diversity multiple access (NDMA) employs the rank test (RT) method for blind multiplicity detection, but static channel parameters throughout the retransmissions and the tight control of the transmitter phase are required. In this paper, a superior blind collision multiplicity-detection technique is introduced by combining the minimum description length criterion and a variation of the RT method. Collision resolution is accomplished through independent component analysis (ICA). Unlike blind NDMA,the new protocol, named ICA-NDMA, works in quasi-static fading channels, and does not need any phase control. Extensive performance analyses corroborate the performance advantages offered by ICA-NDMA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving phase-noise Fokker-Planck equations using the motion-group Fourier transform

    Publication Year: 2006 , Page(s): 868 - 877
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (664 KB) |  | HTML iconHTML  

    A quantity of importance in coherent optical communications is the probability density of a filtered signal in the presence of phase noise (PN). The Fokker-Planck(FP) approach has been recognized as a rigorous way to describe these statistical properties. However, computational difficulties in solving these FP equation shave prevented their widespread application. In this paper, we present a new and simple computational solution method based on techniques from noncommutative harmonic analysis on motion groups. This proposed method can easily solve all the PN FP equations with any kind of intermediate frequency filter. We also present a new derivation of PN FP equations from the viewpoint of stochastic processes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity analysis for frequency-selective MIMO-OFDM systems with general spatial and temporal correlation model

    Publication Year: 2006 , Page(s): 878 - 888
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (720 KB) |  | HTML iconHTML  

    In this paper, the effect of a general spatial and temporal fading correlation structure on the performance of coded multiple-input multiple-output (MIMO)-orthogonal frequency-division multiplexing (OFDM) systems is studied. The analysis handles an arbitrary joint transmit-receive spatial correlation model, including the non-Kronecker model. An upper bound on the maximum achievable diversity order for frequency-selective MIMO-OFDM systems with general temporal and spatial correlation is derived. Furthermore, a space-time-frequency code design that can achieve the upper bound for any arbitrarily correlated channel scenario is provided. The general framework of the analysis includes space-frequency (SF)-coded systems as a special case. For the SF-coded MIMO-OFDM system, it is shown that any SF code designed to achieve full diversity in the independent fading channel can achieve full diversity in an arbitrary spatially correlated channel. The derived analytical results are consistent with those in the existing literature for special correlation structures. Extensive simulation results are provided to confirm the theoretical analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noncoherent data transition tracking loops for symbol synchronization in digital communication receivers

    Publication Year: 2006 , Page(s): 889 - 899
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB) |  | HTML iconHTML  

    Starting with the maximum a posteriori (MAP)estimation approach, this paper derives the optimum (in the MAP estimation sense) means for performing symbol-timing recovery in the absence of carrier-phase information (i.e., prior to carrier-phase recovery). Specifically, we examine the necessary modification of a well-known form of coherent symbol synchronizer,namely, the data transition tracking loop (DTTL), to allow its operation in the absence of carrier-phase information, i.e., as a so-called noncoherent symbol sync loop. By employing such a noncoherent scheme, one can eliminate the need for iteration between the carrier and symbol sync functions,as typically takes place in receivers that more commonly perform carrier tracking and acquisition prior to symbol timing. The performance of both the linear and nonlinear versions of this noncoherent DTTL is obtained by a combination of analysis and simulation, and compared with that of the corresponding coherent DTTLs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision-feedback detection for block differential space-time modulation

    Publication Year: 2006 , Page(s): 900 - 910
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (560 KB) |  | HTML iconHTML  

    Time variation on fading channels hinders accurate channel estimation in differential space-time modulation and deteriorates the performance. Decision-feedback differential detection is studied for block differential space-time modulation, and compared with conventional differential space-time modulation. It is observed that the proposed scheme does not suffer effective fading bandwidth expansion, as does the conventional scheme. An improved effective signal-to-noise ratio approach is proposed for analyzing the performance of the proposed scheme in time-varying flat Rayleigh fading. Theoretical analysis and simulations show the improved performance of the proposed scheme over the conventional scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum DCT-based multicarrier transceivers for frequency-selective channels

    Publication Year: 2006 , Page(s): 911 - 921
    Cited by:  Papers (19)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (640 KB) |  | HTML iconHTML  

    We derive conditions on the impulse response and input signal of a frequency-selective finite-impulse response channel to be diagonalized by the discrete cosine transform (DCT) into parallel, decoupled, and memoryless subchannels. We show how these conditions can be satisfied in a practical multicarrier transceiver through a novel design of the guard sequence and the front-end prefilter. This DCT-based design results in complete elimination of interblock and intercarrier interference without channel knowledge at the transmitter and at the same guard sequence overhead, compared with DFT-based multicarrier transceivers. Extensions to multiinput multioutput frequency-selective channels are also described. Finally, we present numerical examples from wireline and wireless communications scenarios to illustrate the viability and practicality of the DCT as a modulation/demodulation basis for baseband and passband signaling over frequency-selective channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal multiuser spectrum balancing for digital subscriber lines

    Publication Year: 2006 , Page(s): 922 - 933
    Cited by:  Papers (149)  |  Patents (14)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (576 KB) |  | HTML iconHTML  

    Crosstalk is a major issue in modern digital subscriber line (DSL) systems such as ADSL and VDSL. Static spectrum management, which is the traditional way of ensuring spectral compatibility, employs spectral masks that can be overly conservative and lead to poor performance. This paper presents a centralized algorithm for optimal spectrum balancing in DSL. The algorithm uses the dual decomposition method to optimize spectra in an efficient and computationally tractable way. The algorithm shows significant performance gains over existing dynamics spectrum management (DSM) techniques, e.g., in one of the cases studied, the proposed centralized algorithm leads to a factor-of-four increase in data rate over the distributed DSM algorithm iterative waterfilling. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum subpacket transmission for hybrid ARQ systems

    Publication Year: 2006 , Page(s): 934 - 942
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (512 KB) |  | HTML iconHTML  

    Hybrid automatic-repeat-request (ARQ) is a flexible and efficient technique for data transmissions. In hybrid ARQ, subpacket schemes are more attractive for systems with burst errors than complete packet schemes. Although subpacket schemes were proposed in ARQ systems, optimum subpacket transmission is more effective to maximize throughput in a dynamic channel. Since convolutional codes have properties of burst errors in decoding, the optimum subpacket can be applied to convolutional codes. This paper investigates the performance of subpacket transmission for convolutionally coded systems. An efficient method is proposed to estimate the optimum number of subpackets, and adaptive subpacket schemes, i.e., schemes that enable a system to employ different optimum numbers of subpackets under various conditions, are suggested to achieve the maximum throughput of the system. Numerical and simulation results show that the adaptive subpacket scheme is very effective for the convolutionally coded hybrid ARQ system, and it can provide higher throughput, smaller delay,and lower dropping rate than complete packet schemes. Moreover, the adaptive subpacket scheme can be flexibly used with packet combining techniques to further improve the system throughput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benefit of pattern diversity via two-element array of circular patch antennas in indoor clustered MIMO channels

    Publication Year: 2006 , Page(s): 943 - 954
    Cited by:  Papers (53)  |  Patents (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1560 KB) |  | HTML iconHTML  

    In this paper, we analyze a multiple-input multiple-output (MIMO) array consisting of two circular microstrip antennas, designed to exploit pattern diversity. We analytically derive the spatial correlation coefficients of this array as a function of the mode excited, for realistic clustered MIMO channel models. We compare the performance of the circular patch array (CPA) against an array of two spaced dipoles. In particular, we compute a theoretical tradeoff to predict when the pattern diversity provided by the CPA is more effective than space diversity from the uniform linear array (ULA), based on the eigenvalues of the spatial correlation matrix. Through simulations, we show that CPAs yield better performance or satisfy more restrictive size constraints than ULAs in clustered MIMO channels, depending on the element spacing of the ULA. These results make the CPA an attractive solution for miniaturized MIMO arrays for portable devices or access points. 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