The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel

The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is optimal for the nondegraded case. Furthermore, the capacity region is characterized under a wide range of input constraints, accounting, as special cases, for the total power and the per-antenna power constraints     

Capacity Region of a Class of Gaussian Cognitive Degraded Broadcast Channel

This paper studies the cognitive broadcast channel in which the primary user com- municates to the primary receiver, while the secondary user has noncausal knowledge of the primary radio＇s codeword and expects to communicate to two secondary receivers. Comparing with the existing cognitive radio channel which considers only one secondary receiver, cognitive broadcast channel studies the case that there are multiple secondary receivers. To this end, we investigate the fundamental limits of the performance of the Gaussian cognitive broadcast channel from the information theoretic perspective. Specifically, we derive the capacity region of the Gaussian cognitive degraded broadcast channel with weak interference.     

Channel Capacity of Multiple-Input Multiple-Output Systems for Optimal Antenna Spacing by Particle Swarm Optimizer

The geometrical shape of antenna arrays for maximizing the average channel capacity of the system in a multiple-input multiple-output link is investigated. The optimum element spacing of the transmitting antenna is also included. The frequency responses of transceiver antenna with different element spacing are computed by ray-tracing techniques, and the channel frequency response is further used to calculate corresponding channel capacity. The transmitter is set in the center of the indoor environment and the receivers are with uniform intervals distribution in the whole wooden table. Linear shaped array, L shaped array, T shaped array and rectangular shaped array with non-uniform inter-element spacing are investigated for both line-of-sight and non-LOS scenarios. The optimal element spacing of antenna for maximizing the channel capacity is searched by particle swarm optimizer. Numerical results have shown that our proposed method is effective for increasing average channel capacity. It is also found that L shaped array has the highest channel capacity and the improvement ratio for rectangular shaped array is the largest.     

Hardware Emulation of Wideband Correlated Multiple-Input Multiple-Output Fading Channels

A low-complexity hardware emulator is proposed for wideband, correlated, multiple-input multiple-output (MIMO) fading channels. The proposed emulator generates multiple discrete-time channel impulse responses (CIR) at the symbol rate and incorporates three types of correlation functions of the subchannels via Kronecker product: the spatial correlation between transmit or receive elements, temporal correlation due to Doppler shifts, and inter-tap correlation due to multipaths. The Kronecker product is implemented by a novel mixed parallel-serial (mixed P-S) matrix multiplication method to reduce memory storage and to meet the real-time requirement in high data-rate, large MIMO size, or long CIR systems. We present two practical MIMO channel examples implemented on an Altera Stratix III EP3SL150F FPGA DSP development kit: a 2-by-2 MIMO WiMAX channel with a symbol rate of 1.25 million symbols/second and a 2-by-6 MIMO underwater acoustic channel with 100-tap CIR. Both examples meet real-time requirement using only 12–14% of hardware resources of the FPGA.     

Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages

Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multiple-antenna transmitter wishes to send independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multiple-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.      

On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets

An inner bound on the deterministic-code capacity region of the two-user discrete memoryless arbitrarily varying general broadcast channel (AVGBC) was characterized by Jahn, assuming that the common message capacity is nonzero; however, he did not indicate how one could decide whether the latter capacity is positive. Csiszaacuter and Narayan's result for the single-user arbitrarily varying channel (AVC) establishes the missing part in Jahn's characterization. Nevertheless, being based on Ahlswede's elimination technique, Jahn's characterization is not applicable for symmetrizable channels under state constraint. Here, the various notions of symmetrizability for the two-user broadcast AVC are defined. Sufficient non-symmetrizability condition that renders the common message capacity of the AVGBC positive is identified using an approach different from Jahn's. The decoding rules we use establish an achievable region under state and input constraints for the family of degraded message sets codes over the AVGBC     

Feedback Capacity of the Compound Channel

In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant deterministic feedback. We consider the use of fixed length block codes over the compound channel. Our achievability result includes a proof of the existence of a universal decoder for the family of FSCs with feedback. As a consequence of our capacity result, we show that feedback does not increase the capacity of the compound Gilbert-Elliot channel. Additionally, we show that for a stationary and uniformly ergodic Markovian channel, if the compound channel capacity is zero without feedback then it is zero with feedback. Finally, we use our result on the FSC to show that the feedback capacity of the memoryless compound channel is given by inf_thetas max_QX I(X; Y |thetas).     

机载MIMO雷达空时自适应处理技术研究进展

MIMO雷达作为一种新体制雷达,具有诸多优点和广泛的应用领域,引起了国内外军事界和学术界的极大关注。空时自适应处理(STAP)主要目的为抑制地杂波,进行地面动目标显示(GMTI)。如今,这项技术又被进一步推广到MIMO雷达系统中,MIMO雷达STAP迅速成为国际雷达界的一个研究热点。该文详细阐述了MIMO- STAP的引入及重要意义,对杂波建模、杂波自由度(DOF)分析、降维(秩)处理、有源干扰与杂波的同时抑制、非均匀杂波环境处理等方面主要研究情况进行综述,并对未来MIMO-STAP技术的发展方向进行了展望。      

Mutual Information of Multiple-Input Multiple-Output (MIMO) Transmission Schemes

We analyze the mutual information of some common multiple-input multiple-output (MIMO) transmission schemes. Whereas most capacity evaluations are done under the assumption of Gaussian transmit symbols, we take into account restrictions on the transmit symbol alphabet and analyze real world signal constellations. Moreover, we include suboptimum detectors which might be applied in practical systems in the capacity evaluation. Furthermore, we consider not only spatially uncorrelated full rank channels but also channel degradations such as spatial correlation and keyhole effects. The results show that in many practical relevant cases, simple space-time block codes are a robust solution which achieves similar, sometimes even better capacities than spatial multiplexing even though they do not exploit all available MIMO dimensions.     

基于多快拍图像联合的MIMO雷达三维成像方法

为了提高多输入多输出(MIMO)雷达三维成像沿运动方向的方位分辨率,该文从多快拍图像联合利用的角度入手,提出一种新的多输入多输出-逆合成孔径雷达(MIMO-ISAR)三维成像方法。其基本思路是通过对一段时间观测下二维平面阵列获取的多个单快拍三维图像进行相干处理,沿着散射点线性拟合的方向提取峰值并重构出新的三维图像。仿真实验结果表明,与单快拍三维成像方法相比,该方法可以显著提高成像结果沿运动方向的方位分辨率;与现有基于重排和插值的经典MIMO-ISAR方法相比,该方法对慢速和快速运动目标均适用,得到的成像结果聚焦良好并能够有效抑制沿运动方向的旁瓣。      

On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel

We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the linear-assignment capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum-rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound.     

Low-Complexity Iterative Algorithm for Finding the MIMO-OFDM Broadcast Channel Sum Capacity

A novel low-complexity and provably convergent algorithm is proposed to find the sum capacity for vector Gaussian broadcast channels. Unlike the recently proposed sum-power constraint iterative waterfilling (SPC-IWF) algorithms, it has lower complexity and requires no additional precautions to ensure the convergence. We have proved analytically the convergence with probability one, and the computer simulations show that the proposed algorithm converges faster than the earlier variants of SPC-IWF algorithms. We formulate the problem in the context of a multiple-input multiple-output orthogonal frequency-division multiplexing system and discuss the simplifications provided by the block-diagonal channel structure     

Capacity Comparison of CDMA and TDMA in Vector Broadcast Channel

1　Introduction　MultipleInputMultipleOutput (MIMO)havereceivedagreatdealofattentionasamethodtoachievelargecapacityandhighreliabilityoverwire lesslink .Accordingtovectorbroadcastchannel,thebasestationanduserinthissystembothhavemulti pleantennas.Costa[1 ] hadpointedoutthatifthein terferencesignalwasindependentoftransmitsignalanditwasknownatthetransmitterthenthechan nelcapacitywiththeinterferenceisthesameasiftheinterferencewasnotexist.　Thoughthepreconditionofcosta sresultisscalarchannel.The…     

室内MIMO ACO-OFDM可见光通信系统接收机设计

设计了一种在室内可见光MIMO通信系统(MIMO-VLC)中使用具有两个不同视场角(FOV)的光电二极管(PD)的角度分集光接收机(2FOV-ADR),其兼具两个不同视场角的接收机(2-FOV)和传统角度分集接收机(ADR)的优点,实现了更优的接收性能。对将LED灯用作数据发射器的典型室内可见光通信场景进行仿真,结果表明,2FOV-ADR均衡器输出端的最小信噪比(minSNR)要高于2-FOV接收机和传统ADR,实现了室内97%的位置的minSNR在45 dB以上,相比于前两种接收机,这一比例分别提高了96%和32%。最后,对使用非对称限幅光正交频分复用(ACO-OFDM)作为调制方案的系统,计算总误码率(BER),给出了迫零和最小均方误差均衡器的结果。结果表明,对于所考虑的室内位置,2FOV-ADR都具有最低的误码率。     

SEMI-BLIND CHANNEL ESTIMATION OF MULTIPLE-INPUT／MULTIPLE-OUTPUT SYSTEMSBASED ON MARKOV CHAIN MONTE CARLO METHODS

This paper addresses the issues of channel estimation in a Multlple-Input/Multiple-Output (MIMO) system. Markov Chain Monte Carlo (MCMC) method is employed to jointly estimate the Channel State Information (CSI) and the transmitted signals. The deduced algorithms can work well under circumstances of low Signal-to-Noise Ratio (SNR). Simulation results are presented to demonstrate their effectiveness.     

TOPICS IN OPTICAL COMMUNICATIONS - Fundamentals and Challenges of Optical Multiple-Input Multiple-Output Multimode Fiber Links

In this article we discuss the application of MIMO processing to multimode fiber links. MIMO processing is shown to increase the information capacity of communication links linearly as the minimum number of transmitters/receivers increases. The fundamentals of optical MIMO fiber links are presented, and the promises and challenges of such systems are elaborated     

一种基于多维交替方向乘子法的多输入多输出逆合成孔径雷达成像方法

基于傅里叶变换的传统逆合成孔径雷达(ISAR)成像方法存在数据存储量大、数据采集时间长的问题.压缩感知(CS)理论利用图像的稀疏性,可以利用有限的数据恢复图像,这极大降低了数据采集成本.但对于多维数据,传统压缩感知方法要将多维数据转化成一维向量,这造成了很大存储和计算负担.因此,该文提出一种基于多维度-交替方向乘子法(...     

On the Discrete Memoryless Partially Cooperative Relay Broadcast Channel and the Broadcast Channel With Cooperating Decoders

We derive two inner bounds on the rate region of the partially cooperative relay broadcast channel. The first inner bound is based on the Cover and El Gamal generalized strategy for the original relay channel, while the second inner bound is based on the strategy proposed recently by Chong, Motani, and Garg, for the relay channel, which combines backward decoding and simultaneous decoding. Both rate regions subsume the inner bound reported by Liang and Kramer which is based just on the decode-and-forward strategy for the common message. A broadcast channel with cooperating decoders is a broadcast channel wherein the receivers, once observing their outputs, may exchange messages via a pair of channels with specified capacities. An achievable rate region for this model is derived based on the first coding strategy for the partially cooperative relay broadcast channel. This region subsumes the Dabora and Servetto rate region. A converse result is proved for this model based on the converse result of Nair and El Gamal for the broadcast channel and Willems's converse proof for the multiple-access channel with cooperating encoders.     

The Two-User Compound Interference Channel

We introduce the two-user finite state compound interference channel. The main contributions involve both novel inner and outer bounds. For the Gaussian case, we characterize its capacity region to within one bit. The inner bound is multilevel superposition coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typical error events of the achievable scheme.     

Channel Coding: The Road to Channel Capacity

Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance versus complexity for practical applications, particularly on the additive white Gaussian noise channel. We discuss algebraic block codes, and why they did not prove to be the way to get to the Shannon limit. We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes. Finally, we sketch some of the practical applications of these codes.