scispace - formally typeset
Search or ask a question
Topic

Communication channel

About: Communication channel is a research topic. Over the lifetime, 137411 publications have been published within this topic receiving 1715077 citations. The topic is also known as: communication channel & communications channel.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a novel LIS architecture based on sparse channel sensors is proposed, where all the LIS elements are passive except for a few elements that are connected to the baseband.
Abstract: Employing large intelligent surfaces (LISs) is a promising solution for improving the coverage and rate of future wireless systems. These surfaces comprise massive numbers of nearly-passive elements that interact with the incident signals, for example by reflecting them, in a smart way that improves the wireless system performance. Prior work focused on the design of the LIS reflection matrices assuming full channel knowledge. Estimating these channels at the LIS, however, is a key challenging problem. With the massive number of LIS elements, channel estimation or reflection beam training will be associated with (i) huge training overhead if all the LIS elements are passive (not connected to a baseband) or with (ii) prohibitive hardware complexity and power consumption if all the elements are connected to the baseband through a fully-digital or hybrid analog/digital architecture. This paper proposes efficient solutions for these problems by leveraging tools from compressive sensing and deep learning. First, a novel LIS architecture based on sparse channel sensors is proposed. In this architecture, all the LIS elements are passive except for a few elements that are active (connected to the baseband). We then develop two solutions that design the LIS reflection matrices with negligible training overhead. In the first approach, we leverage compressive sensing tools to construct the channels at all the LIS elements from the channels seen only at the active elements. In the second approach, we develop a deep-learning based solution where the LIS learns how to interact with the incident signal given the channels at the active elements, which represent the state of the environment and transmitter/receiver locations. We show that the achievable rates of the proposed solutions approach the upper bound, which assumes perfect channel knowledge, with negligible training overhead and with only a few active elements, making them promising for future LIS systems.

405 citations

Proceedings ArticleDOI
25 Mar 2012
TL;DR: An eigenvalue-decomposition-based approach to channel estimation, that estimates the channel blindly from the received data, that exploits the asymptotic orthogonality of the channel vectors in very large MIMO systems.
Abstract: This paper considers multicell multiuser MIMO systems with very large antenna arrays at the base station. We propose an eigenvalue-decomposition-based approach to channel estimation, that estimates the channel blindly from the received data. The approach exploits the asymptotic orthogonality of the channel vectors in very large MIMO systems. We show that the channel to each user can be estimated from the covariance matrix of the received signals, up to a remaining scalar multiplicative ambiguity. A short training sequence is required to resolve this ambiguity. Furthermore, to improve the performance of our approach, we combine it with the iterative least-square with projection (ILSP) algorithm. Numerical results verify the effectiveness of our channel estimation approach.

405 citations

Journal ArticleDOI
TL;DR: This paper considers the design of the analog and digital beamforming coefficients, for the case of narrowband signals, and proposes the optimal analog beamformer to minimize the mean squared error between the desired user and its receiver estimate.
Abstract: In multiple-input multiple-output (MIMO) systems, the use of many radio frequency (RF) and analog-to-digital converter (ADC) chains at the receiver is costly. Analog beamformers operating in the RF domain can reduce the number of antenna signals to a feasible number of baseband channels. Subsequently, digital beamforming is used to capture the desired user signal. In this paper, we consider the design of the analog and digital beamforming coefficients, for the case of narrowband signals. We aim to cancel interfering signals in the analog domain, thus minimizing the required ADC resolution. For a given resolution, we will propose the optimal analog beamformer to minimize the mean squared error between the desired user and its receiver estimate. Practical analog beamformers employ only a quantized number of phase shifts. For this case, we propose a design technique to successively approximate the desired overall beamformer by a linear combination of implementable analog beamformers. Finally, an online channel estimation technique is introduced to estimate the required statistics of the wireless channel on which the optimal beamformers are based.

404 citations

Journal ArticleDOI
TL;DR: The myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities, which characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels.
Abstract: We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert- Elliot channel model). A user chooses one channel to sense and access in each slot and collects a reward determined by the state of the chosen channel. The problem is to design a sensing policy for channel selection to maximize the average reward, which can be formulated as a multi-arm restless bandit process. In this paper, we study the structure, optimality, and performance of the myopic sensing policy. We show that the myopic sensing policy has a simple robust structure that reduces channel selection to a round-robin procedure and obviates the need for knowing the channel transition probabilities. The optimality of this simple policy is established for the two-channel case and conjectured for the general case based on numerical results. The performance of the myopic sensing policy is analyzed, which, based on the optimality of myopic sensing, characterizes the maximum throughput of a multi-channel opportunistic communication system and its scaling behavior with respect to the number of channels. These results apply to cognitive radio networks, opportunistic transmission in fading environments, downlink scheduling in centralized networks, and resource-constrained jamming and anti-jamming.

404 citations

Journal ArticleDOI
16 Aug 1998
TL;DR: The capacity and mutual information of a broadband fading channel consisting of a finite number of time-varying paths is investigated and it is shown that if white-like signals are used instead (as is common in spread-spectrum systems), the mutual information is inversely proportional to the number of resolvable paths L/spl tilde/ with energy spread out.
Abstract: We investigate the capacity and mutual information of a broadband fading channel consisting of a finite number of time-varying paths. We show that the capacity of the channel in the wideband limit is the same as that of a wideband Gaussian channel with the same average received power. However, the input signals needed to achieve the capacity must be "peaky" in time or frequency. In particular, we show that if white-like signals are used instead (as is common in spread-spectrum systems), the mutual information is inversely proportional to the number of resolvable paths L/spl tilde/ with energy spread out, and in fact approaches 0 as the number of paths gets large. This is true even when the paths are assumed to be tracked perfectly at the receiver. A critical parameter L/spl tilde//sub crit/ is defined in terms of system parameters to delineate the threshold on L over which such overspreading phenomenon occurs.

402 citations


Network Information
Related Topics (5)
Wireless
133.4K papers, 1.9M citations
88% related
Network packet
159.7K papers, 2.2M citations
86% related
Wireless network
122.5K papers, 2.1M citations
84% related
Node (networking)
158.3K papers, 1.7M citations
83% related
Wireless sensor network
142K papers, 2.4M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202270
20214,425
20206,535
20197,160
20187,052
20176,315