By Topic

Selected Areas in Communications, IEEE Journal on

Issue 2 • Date February 2013

Filter Results

Displaying Results 1 - 25 of 29
  • Table of contents

    Publication Year: 2013 , Page(s): c1 - c4
    Save to Project icon | Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • Staff List

    Publication Year: 2013 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (39 KB)  
    Freely Available from IEEE
  • Guest Editorial: Large-Scale Multiple Antenna Wireless Systems

    Publication Year: 2013 , Page(s): 113 - 116
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | PDF file iconPDF (953 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • On the Capacity of Large-MIMO Block-Fading Channels

    Publication Year: 2013 , Page(s): 117 - 132
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1179 KB) |  | HTML iconHTML  

    We characterize the capacity of Rayleigh block-fading multiple-input multiple-output (MIMO) channels in the noncoherent setting where transmitter and receiver have no a priori knowledge of the realizations of the fading channel. We prove that unitary space-time modulation (USTM) is not capacity-achieving in the high signal-to-noise ratio (SNR) regime when the total number of antennas exceeds the coherence time of the fading channel (expressed in multiples of the symbol duration), a situation that is relevant for MIMO systems with large antenna arrays (large-MIMO systems). This result settles a conjecture by Zheng & Tse (2002) in the affirmative. The capacity-achieving input signal, which we refer to as Beta-variate space-time modulation (BSTM), turns out to be the product of a unitary isotropically distributed random matrix, and a diagonal matrix whose nonzero entries are distributed as the square-root of the eigenvalues of a Beta-distributed random matrix of appropriate size. Numerical results illustrate that using BSTM instead of USTM in large-MIMO systems yields a rate gain as large as 13% for SNR values of practical interest. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Capacity of Large-Scale MIMO Multiple Access Channels with Distributed Sets of Correlated Antennas

    Publication Year: 2013 , Page(s): 133 - 148
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1595 KB) |  | HTML iconHTML  

    In this paper, a deterministic equivalent of ergodic sum rate and an algorithm for evaluating the capacity-achieving input covariance matrices for the uplink large-scale multiple-input multiple-output (MIMO) antenna channels are proposed. We consider a large-scale MIMO system consisting of multiple users and one base station with several distributed antenna sets. Each link between a user and an antenna set forms a two-sided spatially correlated MIMO channel with line-of-sight (LOS) components. Our derivations are based on novel techniques from large dimensional random matrix theory (RMT) under the assumption that the numbers of antennas at the terminals approach to infinity with a fixed ratio. The deterministic equivalent results (the deterministic equivalent of ergodic sum rate and the capacity-achieving input covariance matrices) are easy to compute and shown to be accurate for realistic system dimensions. In addition, they are shown to be invariant to several types of fading distribution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large System Analysis of Sum Capacity in the Gaussian MIMO Broadcast Channel

    Publication Year: 2013 , Page(s): 149 - 159
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (613 KB) |  | HTML iconHTML  

    We analyze the achievable sum rate of the Gaussian MIMO broadcast channel. We first consider Multiple-Input Single-Output (MISO) channels and derive the large system limit of the sum capacity as the number of users and transmit antennas go to infinity with a fixed ratio. We then consider Multiple-Input Multiple-Output (MIMO) broadcast channels and fix the number of users and let the number of transmit and receive antennas tend to infinity with fixed ratio. As in this case an asymptotic expression for sum capacity is hard to obtain, we evaluate the large system sum rate corresponding to successive zero-forcing beamforming with Dirty-Paper Coding. The analysis gives a lower bound on the large system sum capacity, which is numerically observed to be quite close. In addition, large system analysis is applied to estimate the relatively small performance losses with respect to sum capacity of successive zero-forcing beamforming with and without Dirty-Paper Coding in finite MISO systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massive MIMO in the UL/DL of Cellular Networks: How Many Antennas Do We Need?

    Publication Year: 2013 , Page(s): 160 - 171
    Cited by:  Papers (130)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1741 KB) |  | HTML iconHTML  

    We consider the uplink (UL) and downlink (DL) of non-cooperative multi-cellular time-division duplexing (TDD) systems, assuming that the number N of antennas per base station (BS) and the number K of user terminals (UTs) per cell are large. Our system model accounts for channel estimation, pilot contamination, and an arbitrary path loss and antenna correlation for each link. We derive approximations of achievable rates with several linear precoders and detectors which are proven to be asymptotically tight, but accurate for realistic system dimensions, as shown by simulations. It is known from previous work assuming uncorrelated channels, that as N→∞ while K is fixed, the system performance is limited by pilot contamination, the simplest precoders/detectors, i.e., eigenbeamforming (BF) and matched filter (MF), are optimal, and the transmit power can be made arbitrarily small. We analyze to which extent these conclusions hold in the more realistic setting where N is not extremely large compared to K. In particular, we derive how many antennas per UT are needed to achieve η% of the ultimate performance limit with infinitely many antennas and how many more antennas are needed with MF and BF to achieve the performance of minimum mean-square error (MMSE) detection and regularized zero-forcing (RZF), respectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Conjugate and Zero-Forcing Beamforming in Large-Scale Antenna Systems

    Publication Year: 2013 , Page(s): 172 - 179
    Cited by:  Papers (38)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (337 KB) |  | HTML iconHTML  

    Large-Scale Antenna Systems (LSAS) is a form of multi-user MIMO technology in which unprecedented numbers of antennas serve a significantly smaller number of autonomous terminals. We compare the two most prominent linear pre-coders, conjugate beamforming and zero-forcing, with respect to net spectral-efficiency and radiated energy-efficiency in a simplified single-cell scenario where propagation is governed by independent Rayleigh fading, and where channel-state information (CSI) acquisition and data transmission are both performed during a short coherence interval. An effective-noise analysis of the pre-coded forward channel yields explicit lower bounds on net capacity which account for CSI acquisition overhead and errors as well as the sub-optimality of the pre-coders. In turn the bounds generate trade-off curves between radiated energy-efficiency and net spectral-efficiency. For high spectral-efficiency and low energy-efficiency zero-forcing outperforms conjugate beamforming, while at low spectral-efficiency and high energy-efficiency the opposite holds. Surprisingly, in an optimized system, the total LSAS-critical computational burden of conjugate beamforming may be greater than that of zero-forcing. Conjugate beamforming may still be preferable to zero-forcing because of its greater robustness, and because conjugate beamforming lends itself to a de-centralized architecture and de-centralized signal processing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sum Rate Analysis of ZF Receivers in Distributed MIMO Systems

    Publication Year: 2013 , Page(s): 180 - 191
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1566 KB) |  | HTML iconHTML  

    The performance of single-cell distributed multiple-input multiple-output (D-MIMO) systems is not only affected by small-scale Rayleigh fading but also from large-scale fading and path-loss. In this paper, we elaborate on the sum rate of D-MIMO systems employing linear zero-forcing receivers, accounting for both large and small-scale fading effects, as well as spatial correlation at the transmit side. In particular, we consider the classical lognormal model and propose closed-form upper and lower bounds on the achievable sum rate. Using these bounds as a starting point, we pursue a "large-system" analysis and provide asymptotic expressions when the number of antennas at the base station (BS) grow large, and when the number of antennas at both ends grow large with a fixed and finite ratio. A detailed characterization in the asymptotically high and low signal to noise ratio regimes is also provided. An interesting observation from our results is that in order to maximize the sum rate, the RPs should be placed at unequal distances to the BS when they experience the same level of shadowing. The resulting closed-form expressions are compared with the corresponding results on MIMO optimal receivers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inter-Cell Interference in Noncooperative TDD Large Scale Antenna Systems

    Publication Year: 2013 , Page(s): 192 - 201
    Cited by:  Papers (26)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (613 KB) |  | HTML iconHTML  

    In this paper we study the performance of cellular networks when their base stations have an unlimited number of antennas. In previous work, the asymptotic behavior of the signal to interference plus nose ratio (SINR) was obtained. We revisit these results by deriving the rigorous expression for the SINR of both downlink and uplink in the scenario of infinite number of antennas. We show that the contamination of the channel estimates happens whenever a pilot sequence is received at a base station simultaneously with non-orthogonal signals coming from other users. We propose a method to avoid such simultaneous transmissions from adjacent cells, thus significantly decreasing interference. We also investigate the effects of power allocation in this interference-limited scenario, and show that it results in gains of over 15dB in the signal to interference ratio for the scenario simulated here. The combination of these two techniques results in rate gains of about 18 times in our simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial Degrees of Freedom of Large Distributed MIMO Systems and Wireless Ad Hoc Networks

    Publication Year: 2013 , Page(s): 202 - 214
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (470 KB) |  | HTML iconHTML  

    We consider a large distributed MIMO system where wireless users with single transmit and receive antenna cooperate in clusters to form distributed transmit and receive antenna arrays. We characterize how the capacity of the distributed MIMO transmission scales with the number of cooperating users, the area of the clusters and the separation between them, in a line-of-sight propagation environment. We use this result to answer the following question: can distributed MIMO provide significant capacity gain over traditional multi-hop in large ad hoc networks with n source-destination pairs randomly distributed over an area A? Two diametrically opposite answers [24] and [26] have emerged in the current literature. We show that neither of these two results are universal and their validity depends on V the relation between the number of users n and √A/λ, which we identify as the spatial degrees of freedom in the network. λ is the carrier wavelength. When √A/λ ≥ n, there are n degrees of freedom in the network and distributed MIMO with hierarchical cooperation can achieve a capacity scaling linearly in n as in [24], while capacity of multihop scales only as √n. On the other hand, when √A/λ ≤ √n as in [26], there are only √n degrees of freedom in the network and they can be readily achieved by multihop. Our results also reveal a third regime where √n ≤ √A/λ ≤ n. Here, the number of degrees of freedom are smaller than n but larger than what can be achieved by multi-hop. We construct scaling optimal architectures for this intermediate regime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Design of Large Scale Wireless Systems

    Publication Year: 2013 , Page(s): 215 - 225
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (536 KB) |  | HTML iconHTML  

    In this paper, we consider the downlink of large OFDMA-based networks and study their performance bounds as a function of the number of - transmitters B, users K, and resource-blocks N. Here, a resource block is a collection of subcarriers such that all such collections, that are disjoint have associated independently fading channels. In particular, we analyze the expected achievable sum-rate as a function of above variables and derive novel upper and lower bounds for a general spatial geometry of transmitters, a truncated path-gain model, and a variety of fading models. We establish the associated scaling laws for dense and extended networks, and propose design guidelines for the regulators to guarantee various QoS constraints and, at the same time, maximize revenue for the service providers. Thereafter, we develop a distributed resource allocation scheme that achieves the same sum-rate scaling as that of the proposed upper bound for a wide range of K, B, N. Based on it, we compare low-powered peer-to-peer networks to high-powered single-transmitter networks and give an additional design principle. Finally, we also show how our results can be extended to the scenario where each of the B transmitters have M (>;1) co-located antennas. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Base Station Clustering and Beamformer Design for Partial Coordinated Transmission in Heterogeneous Networks

    Publication Year: 2013 , Page(s): 226 - 240
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2094 KB) |  | HTML iconHTML  

    We consider the interference management problem in a multicell MIMO heterogeneous network. Within each cell there is a large number of distributed micro/pico base stations (BSs) that can be potentially coordinated for joint transmission. To reduce coordination overhead, we consider user-centric BS clustering so that each user is served by only a small number of (potentially overlapping) BSs. Thus, given the channel state information, our objective is to jointly design the BS clustering and the linear beamformers for all BSs in the network. In this paper, we formulate this problem from a {sparse optimization} perspective, and propose an efficient algorithm that is based on iteratively solving a sequence of group LASSO problems. A novel feature of the proposed algorithm is that it performs BS clustering and beamformer design jointly rather than separately as is done in the existing approaches for partial coordinated transmission. Moreover, the cluster size can be controlled by adjusting a single penalty parameter in the nonsmooth regularized utility function. The convergence of the proposed algorithm (to a stationary solution) is guaranteed, and its effectiveness is demonstrated via extensive simulation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hermitian Precoding for Distributed MIMO Systems with Individual Channel State Information

    Publication Year: 2013 , Page(s): 241 - 250
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (562 KB) |  | HTML iconHTML  

    We consider a distributed multiple-input multiple-output (MIMO) system in which multiple transmitters cooperatively serve a common receiver. It is usually very costly to acquire full channel state information at the transmitter (CSIT) in such a scenario, especially for large-scale antenna systems. In this paper, we assume individual CSIT (I-CSIT), i.e., each transmitter has perfect CSI of its own link but only slow fading factors of the others. A linear Hermitian precoding technique is proposed to enhance the system performance. The optimality of the proposed precoding technique is analyzed. Numerical results demonstrate that the performance loss incurred by the I-CSIT assumption is negligible as compared to the full-CSIT case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrally Efficient Time-Frequency Training OFDM for Mobile Large-Scale MIMO Systems

    Publication Year: 2013 , Page(s): 251 - 263
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (586 KB) |  | HTML iconHTML  

    Large-scale orthogonal frequency division multiplexing (OFDM) multiple-input multiple-output (MIMO) is a promising candidate to achieve the spectral efficiency up to several tens of bps/Hz for future wireless communications. One key challenge to realize practical large-scale OFDM MIMO systems is high-dimensional channel estimation in mobile multipath channels. In this paper, we propose the time-frequency training OFDM (TFT-OFDM) transmission scheme for large-scale MIMO systems, where each TFT-OFDM symbol without cyclic prefix adopts the time-domain training sequence (TS) and the frequency-domain orthogonal grouped pilots as the time-frequency training information. At the receiver, the corresponding time-frequency joint channel estimation method is proposed to accurately track the channel variation, whereby the received time-domain TS is used for path delays estimation without interference cancellation, while the path gains are acquired by the frequency-domain pilots. The channel property that path delays vary much slower than path gains is further exploited to improve the estimation performance, and the sparse nature of wireless channel is utilized to acquire the path gains by very few pilots. We also derive the theoretical Cramer-Rao lower bound (CRLB) of the proposed channel estimator. Compared with conventional large-scale OFDM MIMO systems, the proposed TFT-OFDM MIMO scheme achieves higher spectral efficiency as well as the coded bit error rate performance close to the ergodic channel capacity in mobile environments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Coordinated Approach to Channel Estimation in Large-Scale Multiple-Antenna Systems

    Publication Year: 2013 , Page(s): 264 - 273
    Cited by:  Papers (65)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (481 KB) |  | HTML iconHTML  

    This paper addresses the problem of channel estimation in multi-cell interference-limited cellular networks. We consider systems employing multiple antennas and are interested in both the finite and large-scale antenna number regimes (so-called "massive MIMO"). Such systems deal with the multi-cell interference by way of per-cell beamforming applied at each base station. Channel estimation in such networks, which is known to be hampered by the pilot contamination effect, constitutes a major bottleneck for overall performance. We present a novel approach which tackles this problem by enabling a low-rate coordination between cells during the channel estimation phase itself. The coordination makes use of the additional second-order statistical information about the user channels, which are shown to offer a powerful way of discriminating across interfering users with even strongly correlated pilot sequences. Importantly, we demonstrate analytically that in the large-number-of-antennas regime, the pilot contamination effect is made to vanish completely under certain conditions on the channel covariance. Gains over the conventional channel estimation framework are confirmed by our simulations for even small antenna array sizes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Element-Based Lattice Reduction Algorithms for Large MIMO Detection

    Publication Year: 2013 , Page(s): 274 - 286
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (874 KB) |  | HTML iconHTML  

    Large multi-input multi-output (MIMO) systems with tens or hundreds of antennas have shown great potential for next generation of wireless communications to support high spectral efficiencies. However, due to the non-deterministic polynomial hard nature of MIMO detection, large MIMO systems impose stringent requirements on the design of reliable and computationally efficient detectors. Recently, lattice reduction (LR) techniques have been applied to improve the performance of low-complexity detectors for MIMO systems without increasing the complexity dramatically. Most existing LR algorithms are designed to improve the orthogonality of channel matrices, which is not directly related to the error performance. In this paper, we propose element-based lattice reduction (ELR) algorithms that reduce the diagonal elements of the noise covariance matrix of linear detectors and thus enhance the asymptotic performance of linear detectors. The general goal is formulated as solving a "shortest longest vector reduction" or a stronger version, "shortest longest basis reduction," both of which require high complexity to find the optimal solution. Our proposed ELR algorithms find sub-optimal solutions to the reductions with low complexity and high performance. The fundamental properties of the ELR algorithms are investigated. Simulations show that the proposed ELR-aided detectors yield better error performance than the existing low-complexity detectors for large MIMO systems while maintaining lower complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Min-Max Power Allocation in Cellular Networks With Coordinated Beamforming

    Publication Year: 2013 , Page(s): 287 - 302
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (723 KB) |  | HTML iconHTML  

    This paper considers base station (BS) cooperation in the form of coordinated beamforming, focusing on min-max fairness in the power usage subject to target SINR constraints at each single-antenna user. We show that the optimal beamforming strategies have an interesting nested zero-forcing structure. In the asymptotic regime where the number of antennas at each BS and that of users in each cell both grow large with their ratio tending to a finite constant, the dimensionality of the optimization problem that needs to be solved is greatly reduced, and only knowledge of statistics is required to solve it. The optimal solution is characterized in general, and an algorithm is proposed that converges to the optimal transmit parameters, for feasible SINR targets. For the two cell case, a simple single parameter characterization is obtained. These asymptotic results provide insights into the average performance, as well as simple but efficient beamforming strategies for the finite system case. In particular, the asymptotically optimal beamformers only require the BSs to have local instantaneous channel state information; the remaining parameters of the beamformers can be calculated using channel statistics, thereby reducing the channel state information estimation and signaling overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PAR-Aware Large-Scale Multi-User MIMO-OFDM Downlink

    Publication Year: 2013 , Page(s): 303 - 313
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (437 KB) |  | HTML iconHTML  

    We investigate an orthogonal frequency-division multiplexing (OFDM)-based downlink transmission scheme for large-scale multi-user (MU) multiple-input multiple-output (MIMO) wireless systems. The use of OFDM causes a high peak-to-average (power) ratio (PAR), which necessitates expensive and power-inefficient radio-frequency (RF) components at the base station. In this paper, we present a novel downlink transmission scheme, which exploits the massive degrees-of-freedom available in large-scale MU-MIMO-OFDM systems to achieve low PAR. Specifically, we propose to jointly perform MU precoding, OFDM modulation, and PAR reduction by solving a convex optimization problem. We develop a corresponding fast iterative truncation algorithm (FITRA) and show numerical results to demonstrate tremendous PAR-reduction capabilities. The significantly reduced linearity requirements eventually enable the use of low-cost RF components for the large-scale MU-MIMO-OFDM downlink. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beamforming via Large and Dense Antenna Arrays Above a Clutter

    Publication Year: 2013 , Page(s): 314 - 325
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2492 KB) |  | HTML iconHTML  

    The paper sheds light on the beamforming (BF) performance of large (potentially unconstrained in size) as well as dense (but physically constrained in size) antenna arrays when equipped with arbitrarily many elements. Two operational modes are investigated: Single-layer BF and multi-layer BF. In the first mode, a realistic BF criterion namely the average BF gain is revisited and employed to understand the far-field and the near-field effects on the BF performance of large-scale antennas above a clutter. The diminishing throughput returns in a single-layer BF mode versus the number of antennas necessitate multi-layering. In the multi-layer BF mode, the RF coverage is divided into a number of directive non-overlapping sector-beams in a deterministic manner within a multi-user multi-input multi-output (MIMO) system. The optimal number of layers that maximizes the user's sum-rate given a constrained antenna array is found as a compromise between the multiplexing gain (associated with the number of sector-beams) and the inter-beam interference, represented by the side lobe level (SLL). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity Limits of Compact Broadband Multi-Antenna Systems

    Publication Year: 2013 , Page(s): 326 - 337
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1133 KB) |  | HTML iconHTML  

    In order to support multiple antennas on compact wireless devices, transceivers are often designed with matching networks that compensate for mutual coupling. Some works have suggested that when optimal matching is applied to such a system, performance at the center frequency can be improved at the expense of an apparent reduction in the system bandwidth. This paper addresses the question of how coupling impacts bandwidth in the context of circular arrays. It will be shown that mutual coupling creates eigen-modes (virtual antennas) with diverse frequency responses, using the standard matching techniques. We shall also demonstrate how common communications techniques such as Diversity-OFDM would need to be optimized in order to compensate for these effects. View full abstract»

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

    Publication Year: 2013 , Page(s): 338
    Save to Project icon | Request Permissions | PDF file iconPDF (790 KB)  
    Freely Available from IEEE
  • Author Information

    Publication Year: 2013 , Page(s): 339
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • Call for papers: IEEE Journal on Selected Areas in Communications - Adaptive Media Streaming

    Publication Year: 2013 , Page(s): 340
    Save to Project icon | Request Permissions | PDF file iconPDF (25 KB)  
    Freely Available from IEEE
  • Call for Papers: IEEE Journal on Selected Areas in Communications - Communication Methodologies for the Next-Generation Storage Systems

    Publication Year: 2013 , Page(s): 341
    Save to Project icon | Request Permissions | PDF file iconPDF (27 KB)  
    Freely Available from IEEE

Aims & Scope

IEEE Journal on Selected Areas in 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
Muriel Médard
MIT