Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel

In this work, we extend the nonorthogonal amplify-and-forward (NAF) cooperative diversity scheme to the multiple-input multiple-output (MIMO) channel. A family of space-time block codes for a half-duplex MIMO NAF fading cooperative channel with N relays is constructed. The code construction is based on the nonvanishing determinant (NVD) criterion and is shown to achieve the optimal diversity-multiplexing tradeoff (DMT) of the channel. We provide a general explicit algebraic construction, followed by some examples. In particular, in the single-relay case, it is proved that the Golden code and the 4times4 Perfect code are optimal for the single-antenna and two-antenna cases, respectively. Simulation results reveal that a significant gain (up to 10 dB) can be obtained with the proposed codes, especially in the single-antenna case     

Joint Relay and Antenna Selection in MIMO PLNC Inter-vehicular Communication Systems over Cascaded Fading Channels

We investigate the joint relay and antenna selection performance in a multiple input multiple output (MIMO) Vehicle-to-Vehicle (V2V) communication system employing physical layer network coding (PLNC) with amplify-and-forward (AF) scheme at the relay antenna. Analytic results are derived under the cascaded Nakagami-m fading channel model assumption, which covers cascaded Rayleigh and conventional cellular channel models as well. We evaluate the performance of the system in terms of joint outage probability of sources and derive closed-form expressions for lower and upper bounds while an exact expression is found as a single integral form. Besides, the asymptotic diversity order is analyzed and quantified as a function of number of relays and antennas installed on the source and relay vehicles, and channel parameters. Finally, we verify the analytic derivations by computer simulations. Our results show that the outage probability performance decreases with the increasing cascading degrees of the channels but joint relay and antenna selection enhances the performance of the system superbly with the increasing number of relays and antennas. Also it is shown throughout all the simulation results, the lower bound for the joint outage probability seems to consistently be well tight for large SNR. Therefore it can be used for practical design of inter-vehicular communication systems which contain multiple relays and antennas.     

Optical CDMA via temporal codes

The authors provide an analysis of the performance of optical orthogonal codes in an optical code division multiple access (CDMA) network by considering the probability distribution of the interference patterns. It is shown that the actual performance is close to a previous estimate. A less structured temporal code in which the code words are allowed to overlap at two pulse positions is also considered. The bit error probability for this class of codes is obtained for two cases: with and without optical hard-limiting at the receivers. It is shown that this code may increase the number of users in the network considerably without a significant loss in the performance     

Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective

We consider a general multiple-antenna network with multiple sources, multiple destinations, and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or nonclustered). We first study the multiple-antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link are increased, whereas CF continues to perform optimally. We also study the multiple-antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source-destination pair and multiple relays, each node with a single antenna, and show that even under the ideal assumption of full-duplex relays and a clustered network, this virtual multiple-input multiple-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains in effect.     

The GenLOT: generalized linear-phase lapped orthogonal transform

The general factorization of a linear-phase paraunitary filter bank (LPPUFB) is revisited. From this new perspective, a class of lapped orthogonal transforms with extended overlap (generalized linear-phase lapped orthogonal transforms (GenLOTs)) is developed as a subclass of the general class of LPPUFB. In this formulation, the discrete cosine transform (DCT) is the order-1 GenLOT, the lapped orthogonal transform is the order-2 GenLOT, and so on, for any filter length that is an integer multiple of the block size. The GenLOTs are based on the DCT and have fast implementation algorithms. The implementation of GenLOTs is explained, including the method to process finite-length signals. The degrees of freedom in the design of GenLOTs are described, and design examples are presented along with image compression tests     

接收端配备滤波器的分布式波束形成技术

基于频率选择性信道中由一个发射节点、一个目标节点和多个中继节点构成的中继网络,该文提出一种新型的分布式波束形成技术。该技术除了在中继节点上采用滤波而后转发的中继数据中转策略之外,在接收节点也配备一个有限长响应(Finite Impulse Response, FIR)滤波器,共同均衡发射节点与中继节点以及中继节点与接收节点之间的频率选择性信道。该文中,此两种滤波器将得到联合优化以提高接收节点的服务质量,并同时满足中继节点的发射功率限制。仿真结果表明,相较于放大而后转发以及滤波而后转发但无接收滤波器的波束形成器而言,所提波束形成技术极大地提高了频率选择性信道中中继网络的性能。     

A note on Gilbert burst-correcting codes

The codes discussed here, due to E. N. Gilbert, are capable of detecting and correcting certain bursts, i.e., errors which occur in clusters. In particular, it is shown that Gilbert's burst-correcting cedes have capabilities beyond those previously recognized. D. A. Huffman's graph-code formulation is used, which greatly facilitates the appreciation of the results. A cyclic code formulation is also given, and certain Gilbert codes are seen to be Fire codes.     

Switching frequency imposition and ripple reduction in DTC drivesby using a multilevel converter

A new strategy for direct torque control with imposed switching frequency (DiCoIF) is proposed. This strategy was specially designed to operate with a multicell (flying capacitors) inverter with any number of levels, which means it can also be used for standard two-level inverters. This approach combines the well known advantages of the multicell. inverter with those of a direct torque controlled (DTC) based strategy. It is shown that the multicell topology presents enough degrees of freedom to control both torque and flux with very low ripple and high dynamics on one hand, and to impose the switching frequency and the capacitors voltage balance on the other hand. Experimental and simulation results, obtained with a standard two-level inverter and with a four-level multicell inverter, are presented and discussed. Finally, a comparative analysis either with the classical DTC and field oriented techniques is carried out     

Use of extra degrees of freedom in multilevel drives

Multilevel converters with series connection of semiconductors allow power electronics to reach medium voltages (1-10 kV) with relatively standard components. The increase of the number of semiconductors provides extra degrees of freedom, which can be used to improve different characteristics. This paper is focused on variable-speed drives and it is shown that with the proposed multilevel direct torque control strategy (DiCoIF) the tradeoff between the performances of the drive (harmonic distortions, torque dynamics, voltage step gradients, etc.) and the switching frequency of the semiconductors is improved. Then, a slightly modified strategy reducing common-mode voltage and bearing currents is presented.     

Optimization of TLM schemes based on the general symmetricalcondensed node

A general symmetrical condensed node (GSCN) for the transmission-line modeling (TLM) method is derived from first principles, based on the establishment of a mapping between field quantities and voltage pulses, averaging at the node centers quantities at the boundaries and differencing of Maxwell's equations. The degrees of freedom offered by this formulation permit the development of adaptable nodes, where the mix of stubs and links can be chosen in a manner to optimize the dispersion characteristics. Results are shown confirming that the adaptable nodes can reduce substantially the dispersion and remove polarization-dependent errors     

基于不同调度算法的多用户分集MIMO中继信道容量分析

采用平均容量性能来定量分析多用户分集多输入多输出(MIMO)中继信道,中继节点使用放大转发(Amplify-and-forward,AF)协议将接收到的源节点的发送信号重发给目的节点.研究了多用户MIMO中继信道的不同调度算法,即容量公平、最大特征根、最小特征根调度策略和空间独立性调度算法,结果表明空间独立性调度算法有...     

Multi-user diversity analysis in MISO amplify-and-forward relaying network

This article analyzed multi-user diversity performance for multiple input single output (MISO) amplify-and-forward (AF) relaying network with selection combiner, and the closed-form outage probabilities for variable gain relaying and fixed gain relaying network are derived. Based on these results, diversity order is presented for variable gain relaying network. Simulation results validate the derived theoretical results, and the diversity order of variable gain relaying network with Nr available relays is K(Nt+Nr) in K users' scenario, where Nt is the number of source transmitter antennas.     

A token circulation scheme for code assignment and cooperative transmission scheduling in CDMA-based UAV ad hoc networks

Code division multiple access (CDMA) ad hoc networks have been considered a promising multiple-channel networking architecture for connecting tactical platforms in battle fields. In this paper we consider a network of a swarm of unmanned aerial vehicles (UAVs) that are used in a tactical surveillance mission. The UAVs are assumed to have multiuser detection capability and form a CDMA-based ad hoc network. A token circulation scheme is proposed to conduct functions required at the medium access control layer including detection of hidden/lost neighbors, code assignment and schedule-based cooperative transmission scheduling. In the proposed scheme, a token continuously circulates around the network based on the “receive-forward” module. Through circulation of the token, each UAV can detect its hidden and/or lost neighbors in near real-time, assign codes enabling the spatial reuse of code channels without incurring code collision, and schedule data transmissions in a cooperative and distributed manner. In addition, the proposed scheme is able to take advantage of multiuser detection functionality and allows for simultaneous transmissions from multiple transmitters to a same receiver. The performance of the proposed token circulation scheme is evaluated, both analytically and through simulations. It is shown that the latency of the token is at most linearly proportional to the network size, and the average delay of a data packet increases with either the packet generation rate or the network size. The results also show that the proposed token circulation scheme is suitable for large-scale CDMA-based UAV ad hoc networks with even heavy network traffic load.     

非正交选择译码转发协同

为了提高两跳中继网络的传输速率和协同分集增益,该文提出一种非正交的选择译码转发策略传输数据。单节点协同时,协同节点仅在正确译码时采用和发送节点非正交的时序转发;在多节点协同时,采用一种节点选择算法选择译码正确且信道条件最佳的节点用于非正交转发。这种协同策略可获得和非正交放大转发相同的分集复用折衷性能,但其实现更简单,且在低信噪比时中断性能更好。     

A new family of Grassmann space-time codes for non-coherent MIMO systems

A family of space-time codes suited for noncoherent multi-input multi-output (MIMO) systems is presented. These codes use all the complex degrees of freedom of the system, i.e. M/spl times/(1-(M/T)) symbols per channel use. They are constructed as codes on the Grassmann manifold G/sub T,M/(/spl Copf/) where T is the temporal codelength and M is the number of transmit antennas.     

Degrees of Freedom Region of the MIMO X Channel

We provide achievability as well as converse results for the degrees of freedom region of a multiple-input multiple-output (MIMO) X channel, i.e., a system with two transmitters, two receivers, each equipped with multiple antennas, where independent messages need to be conveyed over fixed channels from each transmitter to each receiver. The inner and outer bounds on the degrees of freedom region are tight whenever integer degrees of freedom are optimal for each message. With M = 1 antennas at each node, we find that the total (sum rate) degrees of freedom are bounded above and below as 1 les eta*x les 4/3. If M > 1 and channel matrices are nondegenerate then the precise degrees of freedom eta*x = (4/3)M. Thus, the MIMO X channel has noninteger degrees of freedom when M is not a multiple of 3. Simple zero forcing without dirty paper encoding or successive decoding, suffices to achieve the (4/3)M degrees of freedom. If the channels vary with time/frequency then the channel with single antennas (M = 1) at all nodes has exactly 4/3 degrees of freedom. The key idea for the achievability of the degrees of freedom is interference alignment-i.e., signal spaces are aligned at receivers where they constitute interference while they are separable at receivers where they are desired. We also explore the increase in degrees of freedom when some of the messages are made available to a transmitter or receiver in the manner of cognitive radio.     

Joint sensing time and power allocation in cooperatively cognitive networks

The jointly optimal allocation of sensing time and power for a two-user amplify-and-forward overlay cognitive network is developed by maximizing the averaged aggregate throughput of the secondary network. In particular, observing that the sensing duration lies within a strict interval, the jointly optimal strategy of sensing time and power allocation is proved to be tractable by sequential optimization.     

A new family of space/wavelength/time spread three-dimensionaloptical code for OCDMA networks

A new family of space/wavelength/time spread three-dimensional (3-D) optical codes for optical code-division multiple-access (OCDMA) networks has been proposed. Two types of 3-D codes have been constructed: 3-D codes with single pulse per plane and 3-D codes with multiple pulses per plane. Both codes are based on the prime sequence algorithm and have shown improved performance compared to the previously proposed two-dimensional (2-D) prime code. Effective implementation of the 3-D code has also been proposed. In order to eliminate the requirement of fiber ribbons and multiple star couplers in space/wavelength/time spread 3-D code based optical networks, a wavelength²/time scheme has been suggested, in which the periodic property of an arrayed waveguide grating (AWG) is used. It has been shown that the system performance can be maximized for given resources with a proper choice of the wavelength²/time scheme. Due to the improved performance of the 3-D code and the effective architecture of the wavelength²/time scheme, the feasibility of the OCDMA network is much enhanced     

Performance Analysis of Amplify and Forward Cooperative Relaying Protocol in Wireless Communication System

Cooperative relaying has been well appreciated to be a key concept of future wireless systems capable of yielding high network reliability and significant error rate reduction. However, in such paradigm of communication, the total limited power may be wasted without providing minimum performance requirements such as network lifetime if it is not well allocated between the cooperating nodes in an efficient way. In this work, we mainly address the problem of network lifetime limitation in wireless relay communication system by developing optimal power allocation techniques. In the communication scenario, a source sends information to a destination with the help of multiple relay nodes operating in amplify-and-forward relaying protocol. As a parameter of measurement, we particularly address the symbol error rate (SER) performance for MPSK signal using the concept of moment generating function. Due to the complexity of the closed-form SER expression, we then find a tight corresponding lower bound to show useful insights in terms of analysis. Next, we develop a cooperation strategy where only a best relay that maximizes the end-to-end signal-to-noise ratio assists the transmission to further improve the performance of the previous system. In addition, numerical results are presented to validate the theoretical analysis.