By Topic

Information Theory, IEEE Transactions on

Issue 12 • Date Dec. 2005

Filter Results

Displaying Results 1 - 25 of 46
  • Table of contents

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

    Publication Year: 2005 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (37 KB)  
    Freely Available from IEEE
  • Networked Slepian-Wolf: theory, algorithms, and scaling laws

    Publication Year: 2005 , Page(s): 4057 - 4073
    Cited by:  Papers (92)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (528 KB) |  | HTML iconHTML  

    Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weight is considered, for both the data-gathering scenario, which is relevant in sensor networks, and general traffic matrices, relevant for general networks. The minimization is achieved by jointly optimizing a) the transmission structure, which is shown to consist in general of a superposition of trees, and b) the rate allocation across the source nodes, which is done by Slepian-Wolf coding. The overall minimization can be achieved in two concatenated steps. First, the optimal transmission structure is found, which in general amounts to finding a Steiner tree, and second, the optimal rate allocation is obtained by solving an optimization problem with cost weights determined by the given optimal transmission structure, and with linear constraints given by the Slepian-Wolf rate region. For the case of data gathering, the optimal transmission structure is fully characterized and a closed-form solution for the optimal rate allocation is provided. For the general case of an arbitrary traffic matrix, the problem of finding the optimal transmission structure is NP-complete. For large networks, in some simplified scenarios, the total costs associated with Slepian-Wolf coding and explicit communication (conditional encoding based on explicitly communicated side information) are compared. Finally, the design of decentralized algorithms for the optimal rate allocation is analyzed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information capacity and power control for slotted Aloha random-access systems

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

    Information-theoretic capacity notions for a slotted Aloha random-access system are considered in this paper, as well as joint power and retransmission controls for this protocol. The effect of the bursty nature of the arrival and transmission process on the information-carrying capability and spectral efficiency of the system is studied. The nature of the random-access protocol used to resolve decoding failures determines the system stability and dynamics, and in consequence its capacity. System control is carried out by dynamic control of retransmission probability and by power control. It is shown that substantial performance improvements can be achieved under this control scheme in terms of throughput and spectral efficiency for a range of channel parameters. The tradeoffs involving coding rate, system throughput, and spectral efficiency are analyzed from an information-theoretic point of view. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transmission capacity of wireless ad hoc networks with outage constraints

    Publication Year: 2005 , Page(s): 4091 - 4102
    Cited by:  Papers (220)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (355 KB) |  | HTML iconHTML  

    In this paper, upper and lower bounds on the transmission capacity of spread-spectrum (SS) wireless ad hoc networks are derived. We define transmission capacity as the product of the maximum density of successful transmissions multiplied by their data rate, given an outage constraint. Assuming that the nodes are randomly distributed in space according to a Poisson point process, we derive upper and lower bounds for frequency hopping (FH-CDMA) and direct sequence (DS-CDMA) SS networks, which incorporate traditional modulation types (no spreading) as a special case. These bounds cleanly summarize how ad hoc network capacity is affected by the outage probability, spreading factor, transmission power, target signal-to-noise ratio (SNR), and other system parameters. Using these bounds, it can be shown that FH-CDMA obtains a higher transmission capacity than DS-CDMA on the order of M1-2α/, where M is the spreading factor and α>2 is the path loss exponent. A tangential contribution is an (apparently) novel technique for obtaining tight bounds on tail probabilities of additive functionals of homogeneous Poisson point processes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource allocation under uncertainty using the maximum entropy principle

    Publication Year: 2005 , Page(s): 4103 - 4117
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB) |  | HTML iconHTML  

    In this paper, we formulate and solve a problem of resource allocation over a given time horizon with uncertain demands and uncertain capacities of the available resources. In particular, we consider a number of data sources with uncertain bit rates, sharing a set of parallel channels with time-varying and possibly uncertain transmission capacities. We present a method for allocating the channels so as to maximize the expected system throughput. The framework encompasses quality-of-service (QoS) requirements, e.g., minimum-rate constraints, as well as priorities represented by a user-specific cost per transmitted bit. We assume only limited statistical knowledge of the source rates and channel capacities. Optimal solutions are found by using the maximum entropy principle and elementary probability theory. The suggested framework explains how to make use of multiuser diversity in various settings, a field of recently growing interest in communication theory. It admits scheduling over multiple base stations and includes transmission buffers to obtain a method for optimal resource allocation in rather general multiuser communication systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative sensor networks with misinformed nodes

    Publication Year: 2005 , Page(s): 4118 - 4133
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (524 KB) |  | HTML iconHTML  

    The communication capacity of Cooperative SEnsor Networks with Mobile Access (C-SENMA) is considered when some sensors may be misinformed with erroneous messages. It is assumed that a global message is first distributed to all the nodes, each node receiving the message correctly with probability 1-β. The nodes cooperate in delivering the global message to the mobile access point. Three system configurations are discussed based on whether a polling channel and/or an energy constraint are present. The first type is C-SENMA with Polling with No Energy constraints (PNE), where the mobile access point has the ability to poll individual sensors. Without energy constraints, each sensor can transmit for an unlimited number of times. The second type is C-SENMA with No Polling with No Energy constraints (NPNE), where adaptive polling is not allowed and sensors have to transmit according to a predetermined schedule. The third type is C-SENMA with No Polling with an Energy constraint (NPE), where each node has a limit on the number of transmissions. The capacities of the three system configurations are analyzed. It is shown that, the capacity for C-SENMA PNE is the same as that when there are no misinformed sensors. For C-SENMA NPNE, with the absence of the polling channel, there is a loss on the achievable rate, proportional to β, the probability that a sensor is misinformed. Results are extended to multiple simultaneous transmissions with the presence of channel fading. The optimal number of simultaneous transmissions is investigated under three different fading situations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-SNR power offset in multiantenna communication

    Publication Year: 2005 , Page(s): 4134 - 4151
    Cited by:  Papers (108)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (648 KB) |  | HTML iconHTML  

    The analysis of the multiple-antenna capacity in the high-SNR regime has hitherto focused on the high-SNR slope (or maximum multiplexing gain), which quantifies the multiplicative increase as a function of the number of antennas. This traditional characterization is unable to assess the impact of prominent channel features since, for a majority of channels, the slope equals the minimum of the number of transmit and receive antennas. Furthermore, a characterization based solely on the slope captures only the scaling but it has no notion of the power required for a certain capacity. This paper advocates a more refined characterization whereby, as a function of SNR|dB, the high-SNR capacity is expanded as an affine function where the impact of channel features such as antenna correlation, unfaded components, etc., resides in the zero-order term or power offset. The power offset, for which we find insightful closed-form expressions, is shown to play a chief role for SNR levels of practical interest. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

    Publication Year: 2005 , Page(s): 4152 - 4172
    Cited by:  Papers (567)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (853 KB) |  | HTML iconHTML  

    We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-link) channels. The proposed protocols are evaluated using Zheng-Tse diversity-multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound on the achievable diversity-multiplexing tradeoff with a single relay. We then construct a new AF protocol that achieves this upper bound. The proposed algorithm is then extended to the general case with (N-1) relays where it is shown to outperform the space-time coded protocol of Laneman and Wornell without requiring decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains 0lesrles1/N. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three scenarios is that they do not rely on orthogonal subspaces, allowing for a more efficient use of resources. In fact, using our results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-rate concatenated space-time block code M-TCM designs

    Publication Year: 2005 , Page(s): 4173 - 4183
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (328 KB) |  | HTML iconHTML  

    In this paper, a new technique to design improved high-rate space-time (ST) codes is proposed based on the concept of concatenated ST block code (STBC) and outer trellis-coded modulation (M-TCM) encoder constructions. Unlike the conventional rate-lossy STBC-MTCM schemes, the proposed designs produce higher rate ST codes by expanding the codebook of the inner orthogonal STBC. The classic set partitioning concept is adopted to realize the STBC-MTCM designs with large coding gains. The proposed expanded STBC-MTCM designs for the two-, three-, and four-transmitter cases are illustrated. Simulation results show the proposed STBC-MTCM designs significantly outperform the traditional ST-TCM schemes. Furthermore, decoding complexity of the proposed scheme is low because signal orthogonality is exploited to ease data decoding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebraic family of complex lattices for fading channels with application to space-time codes

    Publication Year: 2005 , Page(s): 4184 - 4202
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (624 KB)  

    A new approach is presented for the design of full modulation diversity (FMD) complex lattices for the Rayleigh-fading channel. The FMD lattice design problem essentially consists of maximizing a parameter called the normalized minimum product distance dp2 of the finite signal set carved out of the lattice. We approach the problem of maximizing dp2 by minimizing the average energy of the signal constellation obtained from a new family of FMD lattices. The unnormalized minimum product distance for every lattice in the proposed family is lower-bounded by a nonzero constant. Minimizing the average energy of the signal set translates to minimizing the Frobenius norm of the generator matrices within the proposed family. The two strategies proposed for the Frobenius norm reduction are based on the concepts of successive minima (SM) and basis reduction of an equivalent real lattice. The lattice constructions in this paper provide significantly larger normalized minimum product distances compared to the existing lattices in certain dimensions. The proposed construction is general and works for any dimension as long as a list of number fields of the same degree is available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding by linear programming

    Publication Year: 2005 , Page(s): 4203 - 4215
    Cited by:  Papers (1282)  |  Patents (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (384 KB) |  | HTML iconHTML  

    This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f∈Rn from corrupted measurements y=Af+e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to recover f exactly from the data y? We prove that under suitable conditions on the coding matrix A, the input f is the unique solution to the ℓ1-minimization problem (||x||ℓ1:=Σi|xi|) min(g∈Rn) ||y - Ag||ℓ1 provided that the support of the vector of errors is not too large, ||e||ℓ0:=|{i:ei ≠ 0}|≤ρ·m for some ρ>0. In short, f can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program). In addition, numerical experiments suggest that this recovery procedure works unreasonably well; f is recovered exactly even in situations where a significant fraction of the output is corrupted. This work is related to the problem of finding sparse solutions to vastly underdetermined systems of linear equations. There are also significant connections with the problem of recovering signals from highly incomplete measurements. In fact, the results introduced in this paper improve on our earlier work. Finally, underlying the success of ℓ1 is a crucial property we call the uniform uncertainty principle that we shall describe in detail. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Density evolution for asymmetric memoryless channels

    Publication Year: 2005 , Page(s): 4216 - 4236
    Cited by:  Papers (30)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB) |  | HTML iconHTML  

    Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes and graph codes with message passing decoding algorithms. With channel symmetry as one of its fundamental assumptions, density evolution has been widely and successfully applied to different channels, including binary erasure channels (BECs), binary symmetric channels (BSCs), binary additive white Gaussian noise (BiAWGN) channels, etc. This paper generalizes density evolution for asymmetric memoryless channels, which in turn broadens the applications to general memoryless channels, e.g., z-channels, composite white Gaussian noise channels, etc. The central theorem underpinning this generalization is the convergence to perfect projection for any fixed-size supporting tree. A new iterative formula of the same complexity is then presented and the necessary theorems for the performance concentration theorems are developed. Several properties of the new density evolution method are explored, including stability results for general asymmetric memoryless channels. Simulations, code optimizations, and possible new applications suggested by this new density evolution method are also provided. This result is also used to prove the typicality of linear LDPC codes among the coset code ensemble when the minimum check node degree is sufficiently large. It is shown that the convergence to perfect projection is essential to the belief propagation (BP) algorithm even when only symmetric channels are considered. Hence, the proof of the convergence to perfect projection serves also as a completion of the theory of classical density evolution for symmetric memoryless channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance distribution of binary codes and the error probability of decoding

    Publication Year: 2005 , Page(s): 4237 - 4246
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (408 KB) |  | HTML iconHTML  

    We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binary-symmetric channel (BSC). An improved upper bound is given for the maximum attainable exponent of this probability (the reliability function of the channel). In particular, we prove that the "random coding exponent" is the true value of the channel reliability for codes rate R in some interval immediately below the critical rate of the channel. An analogous result is obtained for the Gaussian channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal linear codes from matrix groups

    Publication Year: 2005 , Page(s): 4247 - 4251
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (168 KB) |  | HTML iconHTML  

    New linear codes (sometimes optimal) over the finite field with q elements are constructed. In order to do this, an equivalence between the existence of a linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations is used. To reduce the size of the system of equations, the search for solutions is restricted to solutions with special symmetry given by matrix groups. This allows to find more than 400 new codes for the case q=2,3,4,5,7,9. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negacyclic codes of length 2s over galois rings

    Publication Year: 2005 , Page(s): 4252 - 4262
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (372 KB) |  | HTML iconHTML  

    Codes over the ring of integers modulo 4 have been studied by many researchers. Negacyclic codes such that the length n of the code is odd have been characterized over the alphabet Zopf4, and furthermore, have been generalized to the case of the alphabet being a finite commutative chain ring. In this paper, we investigate negacyclic codes of length 2s over Galois rings. The structure of negacyclic codes of length 2s over the Galois rings GR(2a,m), as well as that of their duals, are completely obtained. The Hamming distances of negacyclic codes over GR(2a,m) in general, and over Zopf2 a in particular are studied. Among other more general results, the Hamming distances of all negacyclic codes over Zopf2 a of length 4,8, and 16 are given. The weight distributions of such negacyclic codes are also discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information rates achievable with algebraic codes on quantum discrete memoryless channels

    Publication Year: 2005 , Page(s): 4263 - 4277
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (478 KB) |  | HTML iconHTML  

    The highest information rate at which quantum error-correction schemes work reliably on a channel is called the quantum capacity. Here this is proven to be lower-bounded by the limit of coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. The quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension. The codes that are proven to have the desired performance are symplectic stabilizer codes. On the depolarizing channel, the bound proven here is actually the highest possible rate at which symplectic stabilizer codes work reliably View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A synthesis of a 1/f process via Sobolev spaces and fractional integration

    Publication Year: 2005 , Page(s): 4278 - 4285
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1152 KB) |  | HTML iconHTML  

    We provide an almost-sure convergent expansion of a process with power law of fractional order by means of some known theorems from harmonic analysis and rather simple probability theory results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On bent and semi-bent quadratic Boolean functions

    Publication Year: 2005 , Page(s): 4286 - 4298
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB) |  | HTML iconHTML  

    The maximum-length sequences, also called m-sequences, have received a lot of attention since the late 1960s. In terms of linear-feedback shift register (LFSR) synthesis they are usually generated by certain power polynomials over a finite field and in addition are characterized by a low cross correlation and high nonlinearity. We say that such a sequence is generated by a semi-bent function. Some new families of such function, represented by f(x)=Σi=1(n-1)2/ciTr(x(2i)+1), n odd and ci∈F2, have recently (2002) been introduced by Khoo et al. We first generalize their results to even n. We further investigate the conditions on the choice of ci for explicit definitions of new infinite families having three and four trace terms. Also, a class of nonpermutation polynomials whose composition with a quadratic function yields again a quadratic semi-bent function is specified. The treatment of semi-bent functions is then presented in a much wider framework. We show how bent and semi-bent functions are interlinked, that is, the concatenation of two suitably chosen semi-bent functions will yield a bent function and vice versa. Finally, this approach is generalized so that the construction of both bent and semi-bent functions of any degree in certain range for any n≥7 is presented, n being the number of input variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Masking-based domain extenders for UOWHFs: bounds and constructions

    Publication Year: 2005 , Page(s): 4299 - 4311
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (464 KB) |  | HTML iconHTML  

    We study the class of masking-based domain extenders for universal one-way hash functions (UOWHFs). Our first contribution is to show that any correct masking-based domain extender for UOWHF which invokes the compression UOWHF s times must use at least lceillog2srceil masks. As a consequence, we obtain the key expansion optimality of several known algorithms among the class of all masking-based domain extending algorithms. Our second contribution is to present a new parallel domain extender for UOWHF. The new algorithm achieves asymptotically optimal speedup over the sequential algorithm and the key expansion is almost everywhere optimal, i.e., it is optimal for almost all possible number of invocations of the compression UOWHF View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shorter bit sequence is enough to break stream cipher LILI-128

    Publication Year: 2005 , Page(s): 4312 - 4319
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (240 KB) |  | HTML iconHTML  

    LILI-128 is the stream cipher proposed as a candidate cipher for the New European Schemes for Signatures, Integrity, and Encryption (NESSIE) Project. Some methods of breaking it more efficiently than an exhaustive search for its secret key have been found already. The authors propose a new method, which uses shorter bit sequence to break LILI-128 successfully. An attack that can be made with less data can be a more practical threat. With only 27 bits of keystream, this method can break LILI-128 successfully. The efficiency of our attack depends on the memory size. For example, with 299.1 computations, our attack breaks LILI-128, if 228.6-bit memory is available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonintersecting subspaces based on finite alphabets

    Publication Year: 2005 , Page(s): 4320 - 4325
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    Two subspaces of a vector space are here called "nonintersecting" if they meet only in the zero vector. Motivated by the design of noncoherent multiple-antenna communications systems, we consider the following question. How many pairwise nonintersecting Mt-dimensional subspaces of an m-dimensional vector space V over a field F can be found, if the generator matrices for the subspaces may contain only symbols from a given finite alphabet A⊆F? The most important case is when F is the field of complex numbers C; then Mt is the number of antennas. If A=F=GF(q) it is shown that the number of nonintersecting subspaces is at most (qm-1)/(qMt-1), and that this bound can be attained if and only if m is divisible by Mt. Furthermore, these subspaces remain nonintersecting when "lifted" to the complex field. It follows that the finite field case is essentially completely solved. In the case when F=C only the case Mt=2 is considered. It is shown that if A is a PSK-configuration, consisting of the 2r complex roots of unity, the number of nonintersecting planes is at least 2r(m-2) and at most 2r(m-1)-1 (the lower bound may in fact be the best that can be achieved). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The asymptotic capacity of multiple-antenna Rayleigh-fading channels

    Publication Year: 2005 , Page(s): 4325 - 4333
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (456 KB) |  | HTML iconHTML  

    We consider the asymptotic behavior of the capacity of multiple-antenna Rayleigh-fading channels in the limit as the transmit and receive arrays become large. We show that the capacity converges in distribution to a Gaussian random variable, and give closed-form formulas for its mean and variance. These results enable us to derive the first asymptotic formula for outage rates, as well as a sharper estimate of the error in previously reported asymptotic formulas for ergodic capacity. Although these formulas are asymptotic, we show by simulation that they are often quite accurate, even for relatively small arrays. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monotonicity results for coherent MIMO Rician channels

    Publication Year: 2005 , Page(s): 4334 - 4339
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (239 KB) |  | HTML iconHTML  

    The dependence of the Gaussian input information rate on the line-of-sight (LOS) matrix in multiple-input multiple-output (MIMO) coherent Rician fading channels is explored. It is proved that the outage probability and the mutual information induced by a multivariate circularly symmetric Gaussian input with any covariance matrix are monotonic in the LOS matrix D, or more precisely, monotonic in DD in the sense of the Loewner partial order. Conversely, it is also demonstrated that this ordering on the LOS matrices is a necessary condition for the uniform monotonicity over all input covariance matrices. This result is subsequently applied to prove the monotonicity of the isotropic Gaussian input information rate and channel capacity in the singular values of the LOS matrix. Extensions to multiple-access channels (MAC) are also provided. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closed-form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas

    Publication Year: 2005 , Page(s): 4340 - 4347
    Cited by:  Papers (35)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (295 KB) |  | HTML iconHTML  

    In this correspondence, we present systematic and closed-form constructions of complex orthogonal space-time block codes from complex orthogonal designs of rates (k+1)/2k for 2k-1 or 2k transmit antennas for any positive integer k. 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 Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Frank R. Kschischang

Department of Electrical and Computer Engineering