By Topic

Wireless Communications, IEEE Transactions on

Issue 3 • Date May 2005

Filter Results

Displaying Results 1 - 25 of 53
  • Table of contents

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

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (36 KB)  
    Freely Available from IEEE
  • On decoding algorithm and performance of space-time block codes

    Page(s): 825 - 829
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB) |  | HTML iconHTML  

    In this letter, we present a unified mathematical expression for the decoding algorithm of space-time block codes (STBC). Based on the unified expression, we make a comparison of the STBC transmit diversity and the maximal-ratio combining MRC receive diversity, and analyze the symbol error probability for the STBC transmissions. The effects of the channel correlation and the number of transmit and receive antennas on the performance of the STBC are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate allocation for serial concatenated block codes

    Page(s): 830 - 834
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (192 KB) |  | HTML iconHTML  

    While serial concatenated codes were designed to provide good overall performance with reasonable system complexity, they may arise naturally in certain cases, such as the interface between two networks. In this work we consider the problem of constrained rate allocation between nonsystematic block codes in a serial concatenated coding system with either ideal or no interleaving between the codes. Given constraints on system parameters, such as a limit on the overall rate, analytic guidelines for the selection of good inner code rates are found by using an upper bound on the average system block error rate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On adaptive hybrid error control in wireless networks using Reed-Solomon codes

    Page(s): 835 - 840
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (232 KB) |  | HTML iconHTML  

    This letter models and analyzes an adaptive radio link level error control protocol using Reed-Solomon codes for wireless networks. Results show that the proposed dynamic rate adaptive strategy provides a much improved throughput relative to a conventional type-I and type-II hybrid-automatic repeat request (ARQ) protocols. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equal-gain and maximal-ratio combining over nonidentical Weibull fading channels

    Page(s): 841 - 846
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (392 KB) |  | HTML iconHTML  

    We study the performance of L-branch equal-gain combining (EGC) and maximal-ratio combining (MRC) receivers operating over nonidentical Weibull-fading channels. Closed-form expressions are derived for the moments of the signal-to-noise ratio (SNR) at the output of the combiner and significant performance criteria, for both independent and correlative fading, such as average output SNR, amount of fading and spectral efficiency at the low power regime, are studied. We also evaluate the outage and the average symbol error probability (ASEP) for several coherent and noncoherent modulation schemes, using a closed-form expression for the moment-generating function (mgf) of the output SNR for MRC receivers and the Pade´ approximation to the mgf for EGC receivers. The ASEP of dual-branch EGC and MRC receivers is also obtained in correlative fading. The proposed mathematical analysis is complimented by various numerical results, which point out the effects of fading severity and correlation on the overall system performance. Computer simulations are also performed to verify the validity and the accuracy of the proposed theoretical approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An uplink DS-CDMA receiver using a robust post-correlation Kalman structure

    Page(s): 847 - 854
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    Kalman filtering has been proposed in the literature for wireless channel estimation, however, it is not sufficiently robust to uncertainties in the channel auto-correlation model as well as to multiple access interference (MAI). This paper presents a receiver structure for direct-sequence code-division multiple-access (DS-CDMA) systems by using robust Kalman estimation and post-correlation (i.e., symbol rate) processing for channel estimation. The proposed structure is also generalized to incorporate multiple-antenna combining and interference cancellation techniques. The resulting receiver outperforms earlier structures in the presence of channel modeling uncertainties, MAI, and low-received signal-to-noise ratio. The enhancement in performance is achieved at the same order of complexity as a standard Kalman-based receiver. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed and centralized multiuser detection with antenna arrays

    Page(s): 855 - 860
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB) |  | HTML iconHTML  

    In this letter, we have analyzed and compared two different multiuser detection receiver structures that are appropriate for code-division multiple-access systems with multiple antennas. We compare the distributed decorrelator (where signal decorrelation is performed at each receiving antenna) and the centralized decorrelator (where decorrelation is performed once collectively). We show that they provide the same performance in additive Gaussian noise channels. The distributed decorrelator provides better performance in flat fading channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of three-branch selection combining over arbitrarily correlated Rayleigh-fading channels

    Page(s): 861 - 865
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (248 KB) |  | HTML iconHTML  

    The recent literature has thoroughly treated two-branch selection combining (SC) over correlated Rayleigh fading and three-branch SC over exponentially correlated Rayleigh fading. However, a long-standing open problem involves the three-branch SC performance over arbitrarily correlated Rayleigh fading. We solve this problem completely by deriving new infinite series expressions for the cumulative distribution function, the probability density function, and the moment generating function (mgf) of the three-branch SC output signal-to-noise ratio (SNR). The output mgf can be used to derive the average symbol-error rate for any two-dimensional digital modulations. The outage probability and the higher moments of the SC output SNR are also derived. These analytical results are canonical, in that the three-branch SC performance is now completely solved for arbitrary correlation. Some previous results are shown to be special cases of our new results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimum interference mitigating combining scheme for the CDMA downlink with the same complexity as MRC

    Page(s): 866 - 871
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (256 KB) |  | HTML iconHTML  

    This letter presents a new optimum interference mitigating combining (OIMC) scheme for the code-division multiple-access downlink RAKE receiver. The OIMC scheme optimizes the RAKE weights and maximizes the signal-to-interference-plus-noise ratio (SINR) at the RAKE combiner output. Unlike other interference mitigation schemes, the new scheme does not need to estimate the interference or data correlation matrix (and its inverse) of the received signal to render a reliable and low complexity receiver. The OIMC scheme mitigates interference by inversely proportionately weighting the finger output by its associated interference power, while simultaneously mitigating multipath fading. The interference power is found to be directly related to the finger's associated multipath channel gain, rendering the OIMC scheme with the same order of complexity as a maximal ratio combining (MRC) scheme. Under realistic channel conditions, simulation results show that the proposed OIMC scheme always outperforms MRC with a gain of up to more than 1 dB. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compensation of IQ imbalance and phase noise in OFDM systems

    Page(s): 872 - 877
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    Nowadays, a lot of effort is spent on developing inexpensive orthogonal frequency-division multiplexing (OFDM) receivers. Especially, zero intermediate frequency (zero-IF) receivers are very appealing, because they avoid costly IF filters. However, zero-IF front-ends also introduce significant additional front-end distortion, such as IQ imbalance. Moreover, zero-IF does not solve the phase noise problem. Unfortunately, OFDM is very sensitive to the receiver nonidealities IQ imbalance and phase noise. Therefore, we developed a new estimation/compensation scheme to jointly combat the IQ imbalance and phase noise at baseband. In this letter, we describe the algorithms and present the performance results. Our compensation scheme eliminates the IQ imbalance based on one OFDM symbol and performs well in the presence of phase noise. The compensation scheme has a fast convergence and a small residual degradation: even for large IQ imbalance, the overall system performance for an OFDM-wireless local area network (WLAN) case study is within 0.6 dB of the optimal case. As such, our approach greatly relaxes the mismatch specifications and thus enables low-cost zero-IF receivers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative power control for imperfect successive interference cancellation

    Page(s): 878 - 884
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    Successive interference cancellation (SIC) is a technique for increasing the capacity of cellular code-division multiple-access (CDMA) systems. To be successful, SIC systems require a specific distribution of the users' received powers, especially in the inevitable event of imperfect interference cancellation. This apparent complication of standard CDMA power control has been frequently cited as a major drawback of SIC. In this paper, it is shown that surprisingly, these "complications" come with no additional complexity. It is shown that 1-bit UP/DOWN power control-like that used in commercial systems-monotonically converges to the optimal power distribution for SIC with cancellation error. The convergence is proven to within a discrete step-size in both signal-to-noise plus interference ratio and power. Additionally, the algorithm is applicable to multipath and fading channels and can overcome channel estimation error with a standard outer power control loop. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of broadband multicarrier DS-CDMA using space-time spreading-assisted transmit diversity

    Page(s): 885 - 894
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (488 KB) |  | HTML iconHTML  

    In this contribution multicarrier direct-sequence code-division multiple-access (MC DS-CDMA) using space-time spreading (STS)-assisted transmit diversity is investigated in the context of broadband communications over frequency-selective Rayleigh-fading channels. We consider the issue of parameter design for the sake of achieving high-efficiency communications in various dispersive environments. Furthermore, in contrast to conventional MC DS-CDMA schemes employing time (T)-domain spreading only, in this contribution we also investigate broadband MC DS-CDMA schemes employing both T-domain and frequency (F)-domain spreading, i.e., employing TF-domain spreading. The bit-error rate (BER) performance of STS-assisted broadband MC DS-CDMA is investigated for downlink transmissions associated with the correlation based single-user detector and the decorrelating multiuser detector. Our study demonstrated that when appropriately selecting the system parameters, broadband MC DS-CDMA using STS-assisted transmit diversity constitutes a promising downlink transmission scheme. This scheme is capable of supporting ubiquitous communications over diverse communication environments without BER performance degradation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MIMO channel capacity and modeling issues on a measured indoor radio channel at 5.8 GHz

    Page(s): 895 - 903
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (488 KB) |  | HTML iconHTML  

    Multiple transmitters and receivers can be used to provide high link capacity in future wireless systems. Herein, an analysis of indoor environment multiple-input-multiple-output (MIMO) measurements in the industrial, scientific, and medical (ISM) band at 5.8 GHz is performed and the possible increase in capacity, utilizing multiple transmitters and receivers is examined. The investigation shows that in the measured indoor environment, the scattering is sufficiently rich to provide substantial link capacity increases. Furthermore, the effect of intra-element spacing on the channel capacity is studied. Our investigation also shows that the envelope of the channel coefficients for this obstructed-line-of-sight (OLOS) indoor scenario is approximately Rayleigh distributed and the MIMO channel covariance matrix can be well approximated by a Kronecker product of the covariance matrices describing the correlation at the transmitter side and the receiver side, respectively. A statistical narrowband model for the OLOS indoor MIMO channel based on this covariance structure is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis and overflowed traffic characterization in multiservice hierarchical wireless networks

    Page(s): 904 - 918
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (576 KB) |  | HTML iconHTML  

    A cellular hierarchical network with heterogeneous traffic is considered, where calls with shorter (longer) average call-holding time are assigned to the associated lower (upper) layer. The main contribution of this paper is that an efficient and reasonably accurate analytical method is proposed to calculate performance measures of interest, i.e., new call-blocking probability and forced termination probability for conversational services, new call-blocking probability, forced termination probability, and the average number of assigned time slots for streaming services. In particular, a simple two-state MMPP(1,2,...,K), that takes into account not only the dependence among overflowed calls of the same class but also the correlation among overflowed calls of different classes, is used to approximate overflowed traffic to reduce computational complexity and improve accuracy. The methods with the multiclass overflowed traffic being approximated as independent Poisson processes and interrupted Poisson processes are also conducted for comparison. Importantly, it is shown via simulation results that the proposed model generates more accurate results than those obtained with the other two approximation methods. Last but not least, the effect of nonuniform traffic density on performance measures is studied via simulation. It is shown that the nonuniform traffic density may have a significant impact on the performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative joint source-channel decoding of variable-length codes using residual source redundancy

    Page(s): 919 - 929
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (576 KB) |  | HTML iconHTML  

    We present a novel symbol-based soft-input a posteriori probability (APP) decoder for packetized variable-length encoded source indexes transmitted over wireless channels where the residual redundancy after source encoding is exploited for error protection. In combination with a mean-square or maximum APP estimation of the reconstructed source data, the whole decoding process is close to optimal. Furthermore, solutions for the proposed APP decoder with reduced complexity are discussed and compared to the near-optimal solution. When, in addition, channel codes are employed for protecting the variable-length encoded data, an iterative source-channel decoder can be obtained in the same way as for serially concatenated codes, where the proposed APP source decoder then represents one of the two constituent decoders. The simulation results show that this iterative decoding technique leads to substantial error protection for variable-length encoded correlated source signals, especially, when they are transmitted over highly corrupted channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advanced analysis methods for 3G cellular networks

    Page(s): 930 - 942
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1912 KB) |  | HTML iconHTML  

    The operation and maintenance of the third generation (3G) mobile networks will be challenging. These networks will be strongly service driven, and this approach differs significantly from the traditional speech dominated in the second generation (2G) approach. Compared to 2G, in 3G, the mobile cells interact and interfere with each other more, they have hundreds of adjustable parameters, and they monitor and record data related to several hundreds of different variables in each cell. This paper shows that a neural network algorithm called the self-organizing map, together with a conventional clustering method like the k-means, can effectively be used to simplify and focus network analysis. It is shown that these algorithms help in visualizing and grouping similarly behaving cells. Thus, it is easier for a human expert to discern different states of the network. This makes it possible to perform faster and more efficient troubleshooting and optimization of the parameters of the cells. The presented methods are applicable for different radio access network technologies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance enhancement of combining QoS provisioning and location management in wireless cellular networks

    Page(s): 943 - 953
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (544 KB) |  | HTML iconHTML  

    Quality-of-service (QoS) provisioning and location management (LM) in cellular networks are solved separately in previous work. For realistic network environments, we have proposed a framework of combining QoS provisioning and LM by using all available user mobility information. In this paper, we present performance evaluation to show that this framework can yield more efficient solutions for both. We propose a novel path-based LM scheme in this combined framework and evaluate the performance gain of the new scheme over the original path-based LM scheme by simulations. Further, we propose a new connection admission control (CAC) scheme derived from this combined framework for QoS provisioning and present results showing performance enhancements over CAC schemes proposed previously. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced complexity interleaver growth algorithm for turbo codes

    Page(s): 954 - 964
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (440 KB) |  | HTML iconHTML  

    This paper is focused on the problem of significantly reducing the complexity of the recursive interleaver growth algorithm (IGA) with the goal of extending the range of applicability of the algorithm to significantly larger interleavers for a given CPU time and processor. In particular, we present two novel modifications to IGA changing the complexity order of the algorithm from O(Nmax4) to O(Nmax2), present several further minor modifications reducing the CPU time albeit not fundamentally changing the complexity order, and present a mixed mode strategy that combines the results of complexity reduction techniques that do not alter the algorithm outcome itself, with a novel transposition value set cardinality constrained design that does modify the optimization results. The mixed strategy can be used to further extend the range of interleaver sizes by changing the complexity order from O(Nmax2) to O(Nmax) (i.e., linear in the interleaver size). Finally, we present optimized variable length interleavers for the Universal Mobile Telecommunications System (UMTS) and Consultative Committee for Space Data Systems (CCSDS) standards outperforming the best interleavers proposed in the literature. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-complexity MMSE turbo equalization: a possible solution for EDGE

    Page(s): 965 - 974
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (464 KB) |  | HTML iconHTML  

    This paper deals with a low complexity receiver scheme where equalization and channel decoding are jointly optimized in an iterative process. We derive the theoretical transfer function of the infinite length linear minimum mean square error (MMSE) equalizer with a priori information. A practical implementation is exposed which employs the fast Fourier transform (FFT) to compute the equalizer coefficients, resulting in a low-complexity receiver structure. The performance of the proposed scheme is investigated for the enhanced general packet radio service (EGPRS) radio link. Simulation results show that significant power gains may be achieved with only a few (3-4) iterations. These results demonstrate that MMSE turbo equalization is an attractive candidate for single-carrier broadband wireless transmissions in long delay-spread environments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless optical communications via diversity reception and optical preamplification

    Page(s): 975 - 983
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB) |  | HTML iconHTML  

    Atmospheric optical communication systems that use optical preamplifiers and diversity reception are addressed. The particular diversity techniques that are investigated include aperture averaging, linear combining, and adaptive optics. On-off keying and binary pulse position modulation are considered. The effects of atmospheric turbulence, background light, source extinction ratio, amplified spontaneous emission, and receiver thermal noise are studied in the context of a semiclassical photon-counting approach. Numerical results are presented using a conditional Gaussian approximation method. By this method, we can measure the power penalty incurred under various operating conditions as well as the link margin improvement due to optical preamplification and diversity reception. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance enhancement of DS/CDMA system using chaotic complex spreading sequence

    Page(s): 984 - 989
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (384 KB) |  | HTML iconHTML  

    In this paper, a novel direct sequence/spread spectrum (DS/SS) communication system is proposed. This scheme exploits the two-dimensional complex valued chaotic Ikeda map as the spreading sequences. With this double spreading DS/SS system, the effect of multiple access interference can be mitigated by choosing the spreading sequences with appropriate cross-correlation properties. The performance of the system is assessed and demonstrated in a multiuser environment by means of computer simulation with additive white Gaussian noise, Rayleigh fading, and selective fading channel conditions. These studies reveal that the proposed system significantly outperforms the Gold code DS/SS-BPSK system in synchronous channel conditions. In asynchronous case, the improvement is substantial for low signal-to-noise ratios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-antenna capacity in correlated Rayleigh fading with channel covariance information

    Page(s): 990 - 997
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB) |  | HTML iconHTML  

    We analyze a mobile multiple input multiple output wireless link with M transmit and N receive antennas operating in a spatially correlated Rayleigh flat fading environment. Only the correlations between the channel coefficients are assumed to be known at the transmitter and the receiver. The channel coefficients are correlated in space and uncorrelated in time from one coherence interval to another. These coefficients remain constant for a coherence interval of T symbol periods after which they change to another independent realization according to the spatial correlation model. For this system we characterize the structure of the input signal that achieves capacity. The capacity achieving transmit signal is expressed as the product of an isotropically distributed unitary matrix, an independent nonnegative diagonal matrix and a unitary matrix whose columns are the eigenvectors of the transmit fade covariance matrix. For the case where the number of transmit antennas M is larger than the channel coherence interval T, we show that the channel capacity is independent of the smallest M-T eigenvalues of the transmit fade covariance matrix. In contrast to the previously reported results for the spatially white fading model where adding more transmit antennas beyond the coherence interval length (M>T) does not increase capacity, we find that additional transmit antennas always increase capacity as long as their channel fading coefficients are spatially correlated with the other antennas. We show that for fast hopping or fast fading systems (T=1) with only channel covariance information available to the transmitter and receiver, transmit fade correlations are beneficial. Mathematically, we prove this by showing that capacity is a Schur-convex function of the vector of eigenvalues of the transmit fade correlation matrix. We also show that the maximum possible capacity gain due to transmitter fade correlations is 10logM dB. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-complexity space-time OFDM multiuser system

    Page(s): 998 - 1007
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB) |  | HTML iconHTML  

    Exploiting the Fourier basis structure both in the space and the time domains, we develop a low-complexity multiuser space-time coding scheme, multiuser (MU) angle-frequency coding scheme (MU-AFCS), to properly schedule the data streams of each user with respect to its corresponding angle-frequency channel structure for downlink wireless systems. With the proposed approach, a large amount of space resource left over by one user, in clustered multipath wireless channels, can be easily identified and used by the others without serious signal collision in the space domain. In doing so, low channel capacity resulting from poor channel structures in systems, allowing only single-user transmission at a time, can be greatly boosted. The key advantage of this approach is that only limited feedback of channel state information to the transmitter is required while multiuser macro-diversity is sufficiently exploited. In addition, the complexity of the proposed approach is much lower than that of the existing ones serving similar purposes. Through theoretical analyses and computer simulations, we demonstrate that the MU-AFCS can significantly increase the channel capacity as compared to the traditional orthogonal resource division MU multiple-input multiple-output (MIMO) systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint power and bandwidth allocation in downlink transmission

    Page(s): 1008 - 1016
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    We formulate and analyze the problem of optimal downlink scheduling with instantaneous channel and queue size information when both power and bandwidth may be adaptively split among multiple users. We derive optimal solutions of low computational complexity, as well as faster and simpler approximations, to various versions of this problem when the power, rate, and bandwidth allocations to the users can all take continuous values. For this case, we show that the optimal scheme requires transmission to no more than two users during each time slot when users can receive at arbitrary rates, even when the user rate per unit of bandwidth is upper bounded by the best available modulation scheme. Our methods also extend easily to incorporate other intuitive constraints such as upper limits on user rates to improve frame fill efficiency. Simulation results suggest that the simple approximations work nearly as well as the throughput optimal schemes when continuous bandwidth and power partitions are allowed. In practice, the rate and bandwidth assignments to users take discrete values, and we present heuristic methods motivated by the continuous optimum to this discrete case. View full abstract»

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

Aims & Scope

The IEEE Transactions on Wireless Communications publishes high-quality manuscripts on advances in the state-of-the-art of wireless communications.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Jeff Andrews
Cullen Trust for Higher Education Endowed Professor of Engineering