Showing papers on "Channel state information published in 2013"

Joint Spatial Division and Multiplexing—The Large-Scale Array Regime

Abstract: We propose joint spatial division and multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional channel state information at the transmitter (CSIT). JSDM achieves significant savings both in the downlink training and in the CSIT uplink feedback, thus making the use of large antenna arrays at the base station potentially suitable also for frequency division duplexing (FDD) systems, for which uplink/downlink channel reciprocity cannot be exploited. In the proposed scheme, the multiuser MIMO downlink precoder is obtained by concatenating a prebeamforming matrix, which depends only on the channel second-order statistics, with a classical multiuser precoder, based on the instantaneous knowledge of the resulting reduced dimensional “effective” channel matrix. We prove a simple condition under which JSDM incurs no loss of optimality with respect to the full CSIT case. For linear uniformly spaced arrays, we show that such condition is approached in the large number of antennas limit. For this case, we use Szego's asymptotic theory of Toeplitz matrices to show that a DFT-based prebeamforming matrix is near-optimal, requiring only coarse information about the users angles of arrival and angular spread. Finally, we extend these ideas to the case of a 2-D base station antenna array, with 3-D beamforming, including multiple beams in the elevation angle direction. We provide guidelines for the prebeamforming optimization and calculate the system spectral efficiency under proportional fairness and max-min fairness criteria, showing extremely attractive performance. Our numerical results are obtained via asymptotic random matrix theory, avoiding lengthy Monte Carlo simulations and providing accurate results for realistic (finite) number of antennas and users.

From RSSI to CSI: Indoor localization via channel response

Abstract: The spatial features of emitted wireless signals are the basis of location distinction and determination for wireless indoor localization. Available in mainstream wireless signal measurements, the Received Signal Strength Indicator (RSSI) has been adopted in vast indoor localization systems. However, it suffers from dramatic performance degradation in complex situations due to multipath fading and temporal dynamics.Break-through techniques resort to finer-grained wireless channel measurement than RSSI. Different from RSSI, the PHY layer power feature, channel response, is able to discriminate multipath characteristics, and thus holds the potential for the convergence of accurate and pervasive indoor localization. Channel State Information (CSI, reflecting channel response in 802.11 a/g/n) has attracted many research efforts and some pioneer works have demonstrated submeter or even centimeter-level accuracy. In this article, we survey this new trend of channel response in localization. The differences between CSI and RSSI are highlighted with respect to network layering, time resolution, frequency resolution, stability, and accessibility. Furthermore, we investigate a large body of recent works and classify them overall into three categories according to how to use CSI. For each category, we emphasize the basic principles and address future directions of research in this new and largely open area.

Wireless Information Transfer with Opportunistic Energy Harvesting

Abstract: Energy harvesting is a promising solution to prolong the operation of energy-constrained wireless networks. In particular, scavenging energy from ambient radio signals, namely wireless energy harvesting (WEH), has recently drawn significant attention. In this paper, we consider a point-to-point wireless link over the narrowband flat-fading channel subject to time-varying co-channel interference. It is assumed that the receiver has no fixed power supplies and thus needs to replenish energy opportunistically via WEH from the unintended interference and/or the intended signal sent by the transmitter. We further assume a single-antenna receiver that can only decode information or harvest energy at any time due to the practical circuit limitation. Therefore, it is important to investigate when the receiver should switch between the two modes of information decoding (ID) and energy harvesting (EH), based on the instantaneous channel and interference condition. In this paper, we derive the optimal mode switching rule at the receiver to achieve various trade-offs between wireless information transfer and energy harvesting. Specifically, we determine the minimum transmission outage probability for delay-limited information transfer and the maximum ergodic capacity for no-delay-limited information transfer versus the maximum average energy harvested at the receiver, which are characterized by the boundary of so-called "outage-energy" region and "rate-energy" region, respectively. Moreover, for the case when the channel state information (CSI) is known at the transmitter, we investigate the joint optimization of transmit power control, information and energy transfer scheduling, and the receiver's mode switching. The effects of circuit energy consumption at the receiver on the achievable rate-energy trade-offs are also characterized. Our results provide useful guidelines for the efficient design of emerging wireless communication systems powered by opportunistic WEH.

Wireless Information and Power Transfer: A Dynamic Power Splitting Approach

Abstract: Energy harvesting is a promising solution to prolong the operation time of energy-constrained wireless networks. In particular, scavenging energy from ambient radio signals, namely wireless energy harvesting (WEH), has recently drawn significant attention. In this paper, we consider a point-to-point wireless link over the flat-fading channel, where the receiver has no fixed power supplies and thus needs to replenish energy via WEH from the signals sent by the transmitter. We first consider a SISO (single-input single-output) system where the single-antenna receiver cannot decode information and harvest energy independently from the same signal received. Under this practical constraint, we propose a dynamic power splitting (DPS) scheme, where the received signal is split into two streams with adjustable power levels for information decoding and energy harvesting separately based on the instantaneous channel condition that is assumed to be known at the receiver. We derive the optimal power splitting rule at the receiver to achieve various trade-offs between the maximum ergodic capacity for information transfer and the maximum average harvested energy for power transfer, which are characterized by the boundary of a so-called "rate-energy (R-E)" region. Moreover, for the case when the channel state information is also known at the transmitter, we investigate the joint optimization of transmitter power control and receiver power splitting. The achievable R-E region by the proposed DPS scheme is also compared against that by the existing time switching scheme as well as a performance upper bound by ignoring the practical receiver constraint. Finally, we extend the result for optimal DPS to the SIMO (single-input multiple-output) system where the receiver is equipped with multiple antennas. In particular, we investigate a low-complexity power splitting scheme, namely antenna switching, which achieves the near-optimal rate-energy trade-offs as compared to the optimal DPS.

CSI-Based Indoor Localization

Abstract: Indoor positioning systems have received increasing attention for supporting location-based services in indoor environments. WiFi-based indoor localization has been attractive due to its open access and low cost properties. However, the distance estimation based on received signal strength indicator (RSSI) is easily affected by the temporal and spatial variance due to the multipath effect, which contributes to most of the estimation errors in current systems. In this work, we analyze this effect across the physical layer and account for the undesirable RSSI readings being reported. We explore the frequency diversity of the subcarriers in orthogonal frequency division multiplexing systems and propose a novel approach called FILA, which leverages the channel state information (CSI) to build a propagation model and a fingerprinting system at the receiver. We implement the FILA system on commercial 802.11 NICs, and then evaluate its performance in different typical indoor scenarios. The experimental results show that the accuracy and latency of distance calculation can be significantly enhanced by using CSI. Moreover, FILA can significantly improve the localization accuracy compared with the corresponding RSSI approach.

Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels

Abstract: We propose and analyze transmit antenna selection (TAS) to enhance physical layer security in a wiretap channel with NA antennas at the transmitter, NB antennas at the receiver, and NE antennas at the eavesdropper. We focus on the practical scenario where the transmitter does not have any channel state information (CSI) of the eavesdropper's channel. The transmitter selects a single antenna that maximizes the instantaneous signal-to-noise ratio (SNR) at the receiver. The receiver and the eavesdropper employ either maximal-ratio combining (MRC) or selection combining (SC) to combine the received signals. For the proposed protocols, we derive new closed-form expressions for the probability of non-zero secrecy capacity. We consider Nakagami-m fading with non-identical fading parameters of the main channel, mB, and of the eavesdropper's channel, mE. Next, we derive new closed-form expressions for the exact secrecy outage probability, based on which the e-outage secrecy capacity is characterized. Based on the exact expressions, we derive the asymptotic secrecy outage probability which accurately reveals the secrecy diversity order and the secrecy array gain. We confirm that the proposed protocols achieve identical secrecy diversity orders of NANBmB. An interesting conclusion is reached that this diversity order is independent of NE and mE. Furthermore, we prove that under the proposed protocols, the secrecy outage probability and the e-outage secrecy capacity improve with increasing NA.

Channel Estimation in OFDM Systems

Abstract: Orthogonal frequency division multiplexing (OFDM) provides an effective and low complexity means of eliminating inter symbol interference for transmission over frequency selective fading channels. This technique has eceived a lot of interest in mobile communication research as the radio channel is usually frequency selective and time variant. In OFDM system, modulation may be coherent or differential. Channel state information (CSI) is required for the OFDM receiver to perform coherent detection or diversity combining, if multiple transmit and receive antennas are deployed. In practice, CSI can be reliably estimated at the receiver by transmitting pilots along with data symbols. Pilot symbol assisted channel estimation is especially attractive for wireless links, where the channel is time-varying. When sing differential modulation there is no need for a channel estimate but its performance is inferior to coherent system. In this paper we investigate and compare various efficient pilot based channel estimation schemes for OFDM systems. In this present study, two major types of pilot arrangement such as block type and comb-type pilot have been focused employing Least Square Error (LSE) and Minimum Mean Square Error (MMSE) channel estimators. Block type pilot sub-carriers is especially suitable for slow-fading radio channels whereas comb type pilots provide better resistance to fast fading channels. Also comb type pilot arrangement is sensitive to frequency selectivity when comparing to block type arrangement. The channel estimation algorithm based on comb type pilots is divided into pilot signal estimation and channel interpolation. The symbol error rate (SER) performances of OFDM system for both block type and comb type pilot subcarriers are presented in this paper.

Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers

Abstract: This paper studies secrecy rate optimization in a wireless network with a single-antenna source, a multi-antenna destination and a multi-antenna eavesdropper. This is an unfavorable scenario for secrecy performance as the system is interference-limited. In the literature, assuming that the receiver operates in half duplex (HD) mode, the aforementioned problem has been addressed via use of cooperating nodes who act as jammers to confound the eavesdropper. This paper investigates an alternative solution, which assumes the availability of a full duplex (FD) receiver. In particular, while receiving data, the receiver transmits jamming noise to degrade the eavesdropper channel. The proposed self-protection scheme eliminates the need for external helpers and provides system robustness. For the case in which global channel state information is available, we aim to design the optimal jamming covariance matrix that maximizes the secrecy rate and mitigates loop interference associated with the FD operation. We consider both fixed and optimal linear receiver design at the destination, and show that the optimal jamming covariance matrix is rank-1, and can be found via an efficient 1-D search. For the case in which only statistical information on the eavesdropper channel is available, the optimal power allocation is studied in terms of ergodic and outage secrecy rates. Simulation results verify the analysis and demonstrate substantial performance gain over conventional HD operation at the destination.

Spatially Selective Artificial-Noise Aided Transmit Optimization for MISO Multi-Eves Secrecy Rate Maximization

Abstract: Consider an MISO channel overheard by multiple eavesdroppers. Our goal is to design an artificial noise (AN)-aided transmit strategy, such that the achievable secrecy rate is maximized subject to the sum power constraint. AN-aided secure transmission has recently been found to be a promising approach for blocking eavesdropping attempts. In many existing studies, the confidential information transmit covariance and the AN covariance are not simultaneously optimized. In particular, for design convenience, it is common to prefix the AN covariance as a specific kind of spatially isotropic covariance. This paper considers joint optimization of the transmit and AN covariances for secrecy rate maximization (SRM), with a design flexibility that the AN can take any spatial pattern. Hence, the proposed design has potential in jamming the eavesdroppers more effectively, based upon the channel state information (CSI). We derive an optimization approach to the SRM problem through both analysis and convex conic optimization machinery. We show that the SRM problem can be recast as a single-variable optimization problem, and that resultant problem can be efficiently handled by solving a sequence of semidefinite programs. Our framework deals with a general setup of multiple multi-antenna eavesdroppers, and can cater for additional constraints arising from specific application scenarios, such as interference temperature constraints in interference networks. We also generalize the framework to an imperfect CSI case where a worst-case robust SRM formulation is considered. A suboptimal but safe solution to the outage-constrained robust SRM design is also investigated. Simulation results show that the proposed AN-aided SRM design yields significant secrecy rate gains over an optimal no-AN design and the isotropic AN design, especially when there are more eavesdroppers.

A Learning Theoretic Approach to Energy Harvesting Communication System Optimization

Abstract: A point-to-point wireless communication system in which the transmitter is equipped with an energy harvesting device and a rechargeable battery, is studied. Both the energy and the data arrivals at the transmitter are modeled as Markov processes. Delay-limited communication is considered assuming that the underlying channel is block fading with memory, and the instantaneous channel state information is available at both the transmitter and the receiver. The expected total transmitted data during the transmitter's activation time is maximized under three different sets of assumptions regarding the information available at the transmitter about the underlying stochastic processes. A learning theoretic approach is introduced, which does not assume any a priori information on the Markov processes governing the communication system. In addition, online and offline optimization problems are studied for the same setting. Full statistical knowledge and causal information on the realizations of the underlying stochastic processes are assumed in the online optimization problem, while the offline optimization problem assumes non-causal knowledge of the realizations in advance. Comparing the optimal solutions in all three frameworks, the performance loss due to the lack of the transmitter's information regarding the behaviors of the underlying Markov processes is quantified.

Degrees of Freedom of Time Correlated MISO Broadcast Channel With Delayed CSIT

Abstract: We consider the time correlated multiple-input single-output (MISO) broadcast channel where the transmitter has imperfect knowledge of the current channel state, in addition to delayed channel state information. By representing the quality of the current channel state information as P-α for the signal-to-noise ratio P and some constant α ≥ 0, we characterize the optimal degrees of freedom region for this more general two-user MISO broadcast correlated channel. The essential ingredients of the proposed scheme lie in the quantization and multicast of the overheard interferences, while broadcasting new private messages. Our proposed scheme smoothly bridges between the scheme recently proposed by Maddah-Ali and Tse with no current state information and a simple zero-forcing beamforming with perfect current state information.

Communicating channel state information (csi) of multiple transmission points

Abstract: Embodiments contemplate methods and systems for determining and communicating channel state information (CSI) for one or more transmission points (or CSI reference signal resources). Embodiments further contemplate determining transmission states may include applying at least one CSI process for channel state information (CSI) reporting. Embodiments also contemplate aperiodic and/or periodic reporting of one or more report types (e.g., rank indicator (RI)) of CSI, perhaps based on one or more reporting modes that may be configured for each of the one or more CSI process.

Buffer-Aided Relaying with Adaptive Link Selection

Abstract: In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both delay-constrained and delay-unconstrained transmission. For the delay-unconstrained case, we characterize the optimal link selection policy, derive the corresponding throughput, and develop an optimal power allocation scheme. For the delay-constrained case, we propose to starve the buffer of the relay by choosing the decision threshold of the link selection policy smaller than the optimal one and derive a corresponding upper bound on the average delay. Furthermore, we propose a modified link selection protocol which avoids buffer overflow by limiting the queue size. Our analytical and numerical results show that buffer-aided relaying with adaptive link selection achieves significant throughput gains compared to conventional relaying protocols with and without buffers where the relay employs a fixed schedule for reception and transmission.

Pilot: Passive Device-Free Indoor Localization Using Channel State Information

Abstract: Many emerging applications such as intruder detection and border protection drive the fast increasing development of device-free passive (DfP) localization techniques. In this paper, we present Pilot, a Channel State Information (CSI)-based DfP indoor localization system in WLAN. Pilot design is motivated by the observations that PHY layer CSI is capable of capturing the environment variance due to frequency diversity of wideband channel, such that the position where the entity located can be uniquely identified by monitoring the CSI feature pattern shift. Therefore, a ``passive'' radio map is constructed as prerequisite which include fingerprints for entity located in some crucial reference positions, as well as clear environment. Unlike device-based approaches that directly percepts the current state of entities, the first challenge for DfP localization is to detect their appearance in the area of interest. To this end, we design an essential anomaly detection block as the localization trigger relying on the CSI feature shift when entity emerges. Afterwards, a probabilistic algorithm is proposed to match the abnormal CSI to the fingerprint database to estimate the positions of potential existing entities. Finally, a data fusion block is developed to address the multiple entities localization challenge. We have implemented Pilot system with commercial IEEE 802.11n NICs and evaluated the performance in two typical indoor scenarios. It is shown that our Pilot system can greatly outperform the corresponding best RSS-based scheme in terms of anomaly detection and localization accuracy.

Strong Secrecy From Channel Resolvability

Abstract: We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each message a subcode that operates just below the capacity of the eavesdropper's channel, we consider channel-resolvability-based constructions, which associate to each message a subcode that operates just above the resolvability of the eavesdropper's channel. Building upon the work of Csiszar and Hayashi, we provide further evidence that channel resolvability is a powerful and versatile coding mechanism for secrecy by developing results that hold for strong secrecy metrics and arbitrary channels. Specifically, we show that at least for symmetric wiretap channels, random capacity-based constructions fail to achieve the strong secrecy capacity, while channel-resolvability-based constructions achieve it. We then leverage channel resolvability to establish the secrecy-capacity region of arbitrary broadcast channels with confidential messages and a cost constraint for strong secrecy metrics. Finally, we specialize our results to study the secrecy capacity of wireless channels with perfect channel state information (CSI), mixed channels, and compound channels with receiver CSI, as well as the secret-key capacity of source models for secret-key agreement. By tying secrecy to channel resolvability, we obtain achievable rates for strong secrecy metrics with simple proofs.

Making smart use of excess antennas: Massive MIMO, small cells, and TDD

Abstract: In this paper, we present a vision beyond the conventional Long Term Evolution Fourth Generation (LTE-4G) evolution path and suggest that time division duplexing (TDD) could be a key enabler for a new heterogeneous network architecture with the potential to provide ubiquitous coverage and unprecedented spectral area efficiencies. This architecture is based on a cochannel deployment of macro base stations (BSs) with very large antenna arrays and a secondary tier of small cells (SCs) with a few antennas each. Both tiers employ a TDD protocol in a synchronized fashion. The resulting channel reciprocity enables not only the estimation of large-dimensional channels at the BSs, but also an implicit coordination between both tiers without the need to exchange user data or channel state information (CSI) over the backhaul. In particular, during the uplink (UL), the BSs and SCs can locally estimate the dominant interference sub-space. This knowledge can be leveraged for downlink (DL) precoding to reduce intra- and inter-tier interference. In other words, the BSs and SCs “sacrifice” some of their degrees of freedom for interference rejection. Our simulation results demonstrate that the proposed architecture and precoding scheme can achieve a very attractive rate region compared to several baseline scenarios. For example, with 100 antennas at each BS and four antennas at each SC, we observe an aggregate area throughput of 7.63 Gb/s/km2 (DL) and 8.93 Gb/s/km2 (UL) on a 20 MHz band shared by about 100 mobile devices.

Hybrid Cooperative Beamforming and Jamming for Physical-Layer Security of Two-Way Relay Networks

Abstract: In this paper, we propose a hybrid cooperative beamforming and jamming scheme to enhance the physical-layer security of a single-antenna-equipped two-way relay network in the presence of an eavesdropper. The basic idea is that in both cooperative transmission phases, some intermediate nodes help to relay signals to the legitimate destination adopting distributed beamforming, while the remaining nodes jam the eavesdropper, simultaneously, which takes the data transmissions in both phases under protection. Two different schemes are proposed, with and without the instantaneous channel state information of the eavesdropper, respectively, and both are subjected to the more practical individual power constraint of each cooperative node. Under the general channel model, it is shown that both problems can be transformed into a semi-definite programming (SDP) problem with an additional rank-1 constraint. A current state of the art technique for handling such a problem is the semi-definite relaxation (SDR) and randomization techniques. In this paper, however, we propose a penalty function method incorporating the rank-1 constraint into the objective function. Although the so-obtained problem is not convex, we develop an efficient iterative algorithm to solve it. Each iteration is a convex SDP problem, thus it can be efficiently solved using the interior point method. When the channels are reciprocal such as in TDD mode, we show that the problems become second-order convex cone programming ones. Numerical evaluation results are provided and analyzed to show the properties and efficiency of the proposed hybrid security scheme, and also demonstrate that our optimization algorithms outperform the SDR technique.

Scalable Synchronization and Reciprocity Calibration for Distributed Multiuser MIMO

Abstract: Large-scale distributed Multiuser MIMO (MU-MIMO) is a promising wireless network architecture that combines the advantages of "massive MIMO" and "small cells." It consists of several Access Points (APs) connected to a central server via a wired backhaul network and acting as a large distributed antenna system. We focus on the downlink, which is both more demanding in terms of traffic and more challenging in terms of implementation than the uplink. In order to enable multiuser joint precoding of the downlink signals, channel state information at the transmitter side is required. We consider Time Division Duplex (TDD), where the {\em downlink} channels can be learned from the user uplink pilot signals, thanks to channel reciprocity. Furthermore, coherent multiuser joint precoding is possible only if the APs maintain a sufficiently accurate relative timing and phase synchronization. AP synchronization and TDD reciprocity calibration are two key problems to be solved in order to enable distributed MU-MIMO downlink. In this paper, we propose novel over-the-air synchronization and calibration protocols that scale well with the network size. The proposed schemes can be applied to networks formed by a large number of APs, each of which is driven by an inexpensive 802.11-grade clock and has a standard RF front-end, not explicitly designed to be reciprocal. Our protocols can incorporate, as a building block, any suitable timing and frequency estimator. Here we revisit the problem of joint ML timing and frequency estimation and use the corresponding Cramer-Rao bound to evaluate the performance of the synchronization protocol. Overall, the proposed synchronization and calibration schemes are shown to achieve sufficient accuracy for satisfactory distributed MU-MIMO performance.

On Secrecy Rate of the Generalized Artificial-Noise Assisted Secure Beamforming for Wiretap Channels

Abstract: In this paper we consider the secure transmission with multiple-input, single-output, single-antenna eavesdropper (MISOSE) in fast fading channels where the transmitter knows perfect legitimate channel state information but only the statistics of the eavesdropper's channel. For the MISOSE channels, the artificial noise assisted beamforming proposed by Goel and Negi is a promising technique, where the artificial noise is imposed on the null space of the legitimate channel to disrupt the eavesdropper's reception. Here we propose a generalized artificial noise scheme which allows the injection of the artificial noise to the legitimate channel. Although the generalized artificial noise may cause the leakage of artificial noise at the legitimate receiver, the secrecy rate can still be improved since the covariance matrix of it is more flexible than the heuristic one selected by Goel and Negi. To fully characterize the proposed scheme, we investigate the optimization of its secrecy rate. We first derive the conditions under which the beamformers of the message bearing signal and the generalized artificial noise being the same is optimal. Based on this choice, the complicated secrecy rate optimization problem over the covariance matrices of the message-bearing signal and the generalized artificial noise can be reduced to a much simpler power allocation problem. We also develop an efficient algorithm to solve this non-convex power allocation problem. Numerical results show that our generalized artificial noise scheme outperforms Goel and Negi's heuristic selection, especially in the near eavesdropper settings. In particular, with the aid of the proposed scheme, the regime with non-zero secrecy rate is enlarged, which can significantly improve the connectivity of the network.

Joint Cooperative Beamforming and Jamming to Secure AF Relay Systems With Individual Power Constraint and No Eavesdropper's CSI

Abstract: Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.

Wireless communication using multi-dimensional antenna configuration

Abstract: Communications may be performed in a communications system using multi-dimensional antenna configurations. A WTRU may receive communications from a base station via one or more channels. The communications may be performed using multiple component codebooks. The WTRU may send channel state information (CSI) feedback for each component codebook to the base station for consideration when performing communications with the WTRU. The WTRU may determine the CSI feedback for each component codebook based on channel measurements. The component codebooks may include a horizontal component codebook and/or a vertical component codebook. The WTRU may send the CSI feedback for each component codebook to the base station independently or in the form of a composite codebook. The WTRU may determine a composite codebook a function of the component codebooks.

Method and device for reporting channel state information in wireless communication system

Abstract: A method of reporting channel state information (CSI) on a terminal in which a plurality of CSI processes are configured in a wireless communication system according to an embodiment of the present invention includes: measuring a channel based on a CSI reference signal (RS) resource related to one of the CSI processes; measuring interference based on a CSI-interference measurement (IM) resource related to the CSI process; determining CSI based on the measured channel and the measured interference; and reporting the CSI through an uplink channel, wherein a codebook for reporting the CSI, which is used for determining the CSI, is one of two or more codebooks that correspond independently to each of the CSI processes.

Method and apparatus for reporting channel state information in wireless communication system

Abstract: One embodiment of the present invention is a method for reporting channel state information by means of a terminal in a wireless communication system, the method comprising: a step of measuring a channel using at least one channel state information-reference signal (CSI-RS) indicated by at least one feedback type index from among a plurality of feedback type indices; and a step of generating channel state information based on the channel measurement and reporting the channel state information. Each of the plurality of feedback type indices indicates one or more CSI-RS configurations to be used in channel estimation and an effective channel relating to said one or more CSI-RS configurations.

Virtual MIMO in Multi-Cell Distributed Antenna Systems: Coordinated Transmissions with Large-Scale CSIT

Abstract: The virtual multiple input multiple output (MIMO) technique can dramatically improve the performance of a multi-cell distributed antenna system (DAS), thanks to its great potentials for inter-cell interference mitigation. One of the most challenging issues for virtual MIMO is the acquisition of channel state information at the transmitter (CSIT), which usually leads to an overwhelming amount of system overhead. In this work, we focus on the case that only the slowly-varying large-scale channel state is required at the transmitter, and explore the performance gain that can be achieved by coordinated transmissions for virtual MIMO with large-scale CSIT. Aiming at maximizing the achievable ergodic sum rate, the input covariances for all the mobile terminals (MTs) are jointly optimized, which turns out to be a complicated non-convex problem with a non-closed-form objective function. Further analysis reveals that the coordinated transmission problem can be recast as a Max-Min problem with a closed-form objective function and linear constraints. Then, by appealing to the successive approximation method and the saddle-point theory of concave-convex functions, we propose an iterative algorithm for coordinated transmissions with large-scale CSIT and establish its convergence. Simulation results corroborate that the proposed scheme converges quickly, and it yields significant performance gains compared to the existing schemes. Moreover, it is observed that the proposed scheme can achieve a nearly globally-optimal point under the diagonal input covariance constraint. Since the acquisition of large-scale CSIT is far less demanding than that of full CSIT, we believe that the proposed coordinated transmissions with large-scale CSIT in DASs shed some light on virtual MIMO in the making.

Noncoherent Trellis Coded Quantization: A Practical Limited Feedback Technique for Massive MIMO Systems

Abstract: Accurate channel state information (CSI) is essential for attaining beamforming gains in single-user (SU) multiple-input multiple-output (MIMO) and multiplexing gains in multi-user (MU) MIMO wireless communication systems. State-of-the-art limited feedback schemes, which rely on pre-defined codebooks for channel quantization, are only appropriate for a small number of transmit antennas and low feedback overhead. In order to scale informed transmitter schemes to emerging massive MIMO systems with a large number of transmit antennas at the base station, one common approach is to employ time division duplexing (TDD) and to exploit the implicit feedback obtained from channel reciprocity. However, most existing cellular deployments are based on frequency division duplexing (FDD), hence it is of great interest to explore backwards compatible massive MIMO upgrades of such systems. For a fixed feedback rate per antenna, the number of codewords for quantizing the channel grows exponentially with the number of antennas, hence generating feedback based on look-up from a standard vector quantized codebook does not scale. In this paper, we propose noncoherent trellis-coded quantization (NTCQ), whose encoding complexity scales linearly with the number of antennas. The approach exploits the duality between source encoding in a Grassmannian manifold (for finding a vector in the codebook which maximizes beamforming gain) and noncoherent sequence detection (for maximum likelihood decoding subject to uncertainty in the channel gain). Furthermore, since noncoherent detection can be realized near-optimally using a bank of coherent detectors, we obtain a low-complexity implementation of NTCQ encoding using an off-the-shelf Viterbi algorithm applied to standard trellis coded quantization. We also develop advanced NTCQ schemes which utilize various channel properties such as temporal/spatial correlations. Monte Carlo simulation results show the proposed NTCQ and its extensions can achieve near-optimal performance with moderate complexity and feedback overhead.

Method for providing feedback of channel state information in wireless communication system and apparatus for same

Abstract: Disclosed is a wireless communication system. A method for transmitting channel state information (CSI) in a wireless communication system includes receiving information about reference CSI configuration and following CSI configuration configured to have the same rank indicator (RI) as RI of the reference CSI configuration, determining a wideband precoding matrix index (PMI) according to the following CSI configuration to be the same as a wideband PMI according to the reference CSI configuration when reports of the wideband PMI and the RI according to the reference CSI configuration and reports of the wideband PMI and the RI according to the following CSI configuration collide in one subframe, and transmitting the RI and the wideband PMI according to any one selected from the reference CSI configuration and the following CSI configuration.

State Estimation Over Sensor Networks With Correlated Wireless Fading Channels

Abstract: Stochastic stability for centralized time-varying Kalman filtering over a wireless sensor network with correlated fading channels is studied. On their route to the gateway, sensor packets, possibly aggregated with measurements from several nodes, may be dropped because of fading links. To study this situation, we introduce a network state process, which describes a finite set of configurations of the radio environment. The network state characterizes the channel gain distributions of the links, which are allowed to be correlated between each other. Temporal correlations of channel gains are modeled by allowing the network state process to form a (semi-)Markov chain. We establish sufficient conditions that ensure the Kalman filter to be exponentially bounded. In the one-sensor case, this new stability condition is shown to include previous results obtained in the literature as special cases. The results also hold when using power and bit-rate control policies, where the transmission power and bit-rate of each node are nonlinear mapping of the network state and channel gains.

Relay selection protocols for relay-assisted free-space optical systems

Abstract: We investigate transmission protocols for relay-assisted free-space optical (FSO) systems, when multiple parallel relays are employed and there is no direct link between the source and the destination. As alternatives to all-active FSO relaying, where all the available relays transmit concurrently, we propose schemes that select only a single relay to participate in the communication between the source and the destination in each transmission slot. The selection is based on the channel state information obtained either from all or from the last used FSO links. Thus, the need for synchronization of the relays' transmissions is avoided, while the slowly varying nature of the atmospheric channel is exploited. For the considered relay selection and all-active relaying schemes, novel closed-form expressions for the outage performance are derived, assuming the versatile Gamma-Gamma channel model. In addition, based on the derived analytical results, the problem of optimizing the optical power resources of the FSO links is addressed. Optimal and more computationally attractive suboptimal solutions are proposed that lead to a power efficient system design. Numerical results for equal and non-equal length FSO links illustrate the merits of the proposed relay selection protocols compared to the all-active scheme and demonstrate the significant power savings offered by the proposed power allocation schemes.

Uplink Performance Analysis of Multicell MU-SIMO Systems With ZF Receivers

Abstract: We consider the uplink of a multicell multiuser single-input multiple-output system (MU-SIMO), where the channel experiences both small- and large-scale fading. The data detection is done by using the linear zero-forcing technique, assuming the base station (BS) has perfect channel state information of all users in its cell. We derive new exact analytical expressions for the uplink rate, the symbol error rate (SER), and the outage probability per user, as well as a lower bound on the achievable rate. This bound is very tight and becomes exact in the large-number-of-antenna limit. We further study the asymptotic system performance in the regimes of high signal-to-noise ratio (SNR), large number of antennas, and large number of users per cell. We show that, at high SNRs, the system is interference limited, and hence, we cannot improve the system performance by increasing the transmit power of each user. Instead, by increasing the number of BS antennas, the effects of interference and noise can be reduced, thereby improving system performance. We demonstrate that, with very large antenna arrays at the BS, the transmit power of each user can be made inversely proportional to the number of BS antennas while maintaining a desired quality of service. Numerical results are presented to verify our analysis.

Buffer-Aided Relaying With Adaptive Link Selection—Fixed and Mixed Rate Transmission

Abstract: We consider a simple network consisting of a source, a half-duplex decode-and-forward relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided relaying schemes with different requirements regarding the availability of channel state information at the transmitter (CSIT). In the first scheme, neither the source nor the relay has full CSIT, and consequently, both nodes are forced to transmit with fixed rates. In contrast, in the second scheme, the source does not have full CSIT and transmits with fixed rate but the relay has full CSIT and adapts its transmission rate accordingly. In the absence of delay constraints, for both fixed rate and mixed rate transmission, we derive the throughput-optimal buffer-aided relaying protocols which select either the source or the relay for transmission based on the instantaneous signal-to-noise ratios (SNRs) of the source-relay and relay-destination links. In addition, for the delay constrained case, we develop buffer-aided relaying protocols that achieve a predefined average delay. Compared to conventional relaying protocols, which select the transmitting node according to a predefined schedule independent of the instantaneous link SNRs, the proposed buffer-aided protocols with adaptive link selection achieve large performance gains. In particular, for fixed rate transmission, we show that the proposed protocol achieves a diversity gain of two as long as an average delay of more than three time slots can be afforded. Furthermore, for mixed rate transmission with an average delay of E{T} time slots, a multiplexing gain of r=1-1/ (2E{T}) is achieved. As a by-product of the considered link-adaptive protocols, we also develop a novel conventional relaying protocol for mixed rate transmission, which yields the same multiplexing gain as the protocol with adaptive link selection. Hence, for mixed rate transmission, for sufficiently large average delays, buffer-aided half-duplex relaying with and without adaptive link selection does not suffer from a multiplexing gain loss compared to full-duplex relaying.