Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userChannel simulation via interactive communications
111
0
0.0
(
0
)
Added by
Mohammad Hossein Yassaee
Publication date
2012
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d. copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and Anantharam to study the general problem of channel simulation via interactive communication stated above. However only inner and outer bounds for the special case of no shared randomness were obtained in their work. In this paper we settle this problem by providing an exact computable characterization of the multi-round problem. To show this we employ the technique of output statistics of random binning that has been recently developed by the authors.
rate research
Read More
We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an ordinary receiver and a robust receiver. The channel to the ordinary receiver is a given (known) discrete memoryless channel (DMC), whereas the channel to the robust receiver is an arbitrarily varying channel (AVC). Both receivers are required to decode the common message, whereas only the ordinary receiver is required to decode the private message.
The feasibility of physical-layer-based security approaches for wireless communications in the presence of one or more eavesdroppers is hampered by channel conditions. In this paper, cooperation is investigated as an approach to overcome this problem and improve the performance of secure communications. In particular, a decode-and-forward (DF) based cooperative protocol is considered, and the objective is to design the system for secrecy capacity maximization or transmit power minimization. System design for the DF-based cooperative protocol is first studied by assuming the availability of global channel state information (CSI). For the case of one eavesdropper, an iterative scheme is proposed to obtain the optimal solution for the problem of transmit power minimization. For the case of multiple eavesdroppers, the problem of secrecy capacity maximization or transmit power minimization is in general intractable. Suboptimal system design is proposed by adding an additional constraint, i.e., the complete nulling of signals at all eavesdroppers, which yields simple closed-form solutions for the aforementioned two problems. Then, the impact of imperfect CSI of eavesdroppers on system design is studied, in which the ergodic secrecy capacity is of interest.
In diffusion-based communication, as for molecular systems, the achievable data rate is low due to the stochastic nature of diffusion which exhibits a severe inter-symbol-interference (ISI). Multiple-Input Multiple-Output (MIMO) multiplexing improves the data rate at the expense of an inter-link interference (ILI). This paper investigates training-based channel estimation schemes for diffusive MIMO (D-MIMO) systems and corresponding equalization methods. Maximum likelihood and least-squares estimators of mean channel are derived, and the training sequence is designed to minimize the mean square error (MSE). Numerical validations in terms of MSE are compared with Cramer-Rao bound derived herein. Equalization is based on decision feedback equalizer (DFE) structure as this is effective in mitigating diffusive ISI/ILI. Zero-forcing, minimum MSE and least-squares criteria have been paired to DFE, and their performances are evaluated in terms of bit error probability. Since D-MIMO systems are severely affected by the ILI because of short transmitters inter-distance, D-MIMO time interleaving is exploited as countermeasure to mitigate the ILI with remarkable performance improvements. The feasibility of a block-type communication including training and data equalization is explored for D-MIMO, and system-level performances are numerically derived.
Reconfigurable intelligent surfaces (RISs) have been recently considered as a promising candidate for energy-efficient solutions in future wireless networks. Their dynamic and low-power configuration enables coverage extension, massive connectivity, and low-latency communications. Due to a large number of unknown variables referring to the RIS unit elements and the transmitted signals, channel estimation and signal recovery in RIS-based systems are the ones of the most critical technical challenges. To address this problem, we focus on the RIS-assisted wireless communication system and present two joint channel estimation and signal recovery schemes based on message passing algorithms in this paper. Specifically, the proposed bidirectional scheme applies the Taylor series expansion and Gaussian approximation to simplify the sum-product procedure in the formulated problem. In addition, the inner iteration that adopts two variants of approximate message passing algorithms is incorporated to ensure robustness and convergence. Two ambiguities removal methods are also discussed in this paper. Our simulation results show that the proposed schemes show the superiority over the state-of-art benchmark method. We also provide insights on the impact of different RIS parameter settings on the proposed schemes.
In this paper, the minimum mean square error (MMSE) channel estimation for intelligent reflecting surface (IRS) assisted wireless communication systems is investigated. In the considered setting, each row vector of the equivalent channel matrix from the base station (BS) to the users is shown to be Bessel $K$ distributed, and all these row vectors are independent of each other. By introducing a Gaussian scale mixture model, we obtain a closed-form expression for the MMSE estimate of the equivalent channel, and determine analytical upper and lower bounds on the mean square error. Using the central limit theorem, we conduct an asymptotic analysis of the MMSE estimate, and show that the upper bound on the mean square error of the MMSE estimate is equal to the asymptotic mean square error of the MMSE estimation when the number of reflecting elements at the IRS tends to infinity. Numerical simulations show that the gap between the upper and lower bounds are very small, and they almost overlap with each other at medium signal-to-noise ratio (SNR) levels and moderate number of elements at the IRS.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
