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: A Gaussian orthogonal relay model is investigated, and it is shown that when the relay-to-destination signal- to-noise ratio (SNR) is less than a certain threshold, the capacity at the optimizing /spl theta/ is also the maximum capacity of the channel over all possible resource allocation parameters.
Abstract: A Gaussian orthogonal relay model is investigated, where the source transmits to the relay and destination in channel 1, and the relay transmits to the destination in channel 2, with channels 1 and 2 being orthogonalized in the time-frequency plane in order to satisfy practical constraints. The total available channel resource (time and bandwidth) is split into the two orthogonal channels, and the resource allocation to the two channels is considered to be a design parameter that needs to be optimized. The main focus of the analysis is on the case where the source-to-relay link is better than the source-to-destination link, which is the usual scenario encountered in practice. A lower bound on the capacity (achievable rate) is derived, and optimized over the parameter /spl theta/, which represents the fraction of the resource assigned to channel 1. It is shown that the lower bound achieves the max-flow min-cut upper bound at the optimizing /spl theta/, the common value thus being the capacity of the channel at the optimizing /spl theta/. Furthermore, it is shown that when the relay-to-destination signal-to-noise ratio (SNR) is less than a certain threshold, the capacity at the optimizing /spl theta/ is also the maximum capacity of the channel over all possible resource allocation parameters /spl theta/. Finally, the achievable rates for optimal and equal resource allocations are compared, and it is shown that optimizing the resource allocation yields significant performance gains.

270 citations

Journal ArticleDOI
TL;DR: A unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding, and Canonical distributions provide a new, general framework for handling continuous variables.
Abstract: Iterative algorithms are an attractive approach to approximating optimal, but high-complexity, joint channel estimation and decoding receivers for communication systems. We present a unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding. For many common channels, it is easy to find simple graphical models that lead directly to implementable algorithms. Canonical distributions provide a new, general framework for handling continuous variables. Example receiver designs for Rayleigh fading channels with block or Markov memory, and multipath fading channels with fixed unknown coefficients illustrate the effectiveness of our approach.

270 citations

Journal ArticleDOI
TL;DR: This paper focuses on the energy efficiency of a cognitive radio network, in which a secondary user senses the channels licensed to some primary users sequentially before it decides to transmit, and develops an algorithm to find the optimal sensing-access strategies for the original problem.
Abstract: Energy-efficient design has become increasingly important to battery-powered wireless devices. In this paper, we focus on the energy efficiency of a cognitive radio network, in which a secondary user senses the channels licensed to some primary users sequentially before it decides to transmit. Energy is consumed in both the channel sensing and transmission processes. The energy-efficient design calls for a careful design in the sensing-access strategies and the sensing order, with the sensing strategy specifying when to stop sensing and start transmission, the access strategy specifying the power level to be used upon transmission, and the sensing order specifying the sequence of channel sensing. Hence, the objective of this paper is to identify the sensing-access strategies and the sensing order that achieve the maximum energy efficiency. We first investigate the design when the channel sensing order is given and formulate the above design problem as a stochastic sequential decision-making problem. To solve it, we study another parametric formulation of the original problem, which rewards transmission throughput and penalizes energy consumption. Dynamic programming can be applied to identify the optimal strategy for the parametric problem. Then, by exploring the relationship between the two formulations and making use of the monotonicity property of the parametric formulation, we develop an algorithm to find the optimal sensing-access strategies for the original problem. Furthermore, we study the joint design of the channel sensing order and the sensing-access strategies. Lastly, the performance of the proposed designs is evaluated through numerical results.

270 citations

Patent
07 Nov 1997
TL;DR: In this article, a packet-based data channel extends between the microprocessor and the interfaces of the devices to provide communication between the processor and the devices, by varying the size of the packets in accordance with actual data transmission requirements improved computer performance.
Abstract: A physically non-distributed microprocessor-based computer includes a microprocessor, and a random access memory device, a mass storage device, and an input-output port device, all operable from the microprocessor and including an interface for receiving and transmitting data in packet form. A novel packet-based data channel extends between the microprocessor and the interfaces of the devices to provide communication between the microprocessor and the devices. By varying the size of the packets in accordance with actual data transmission requirements improved computer performance is achieved.

269 citations

Proceedings ArticleDOI
06 Nov 2002
TL;DR: An approach of optimizing AP placement and channel assignment in WLAN by formulating an optimal integer linear programming (ILP) problem to minimize the maximum of channel utilization, which qualitatively represents congestion at the hot spot in Wlan service areas is proposed.
Abstract: The design of a wireless local area network (WLAN) has an important issue of determining the optimal placement of access points (AP) and assignment of channels to them. WLAN services in the outdoor as well as indoor environments should be designed in order to achieve the maximum coverage and throughput. To provide the maximum coverage for WLAN service areas, AP should be installed such that the sum of signal measured at each traffic demand point is maximized. However, as users connected to an AP share wireless channel bandwidth with others in the same AP, AP placement should be carefully decided to maximize the throughput by considering load balancing among AP and channel interference for the user traffic demand. In this paper, therefore, we propose an approach of optimizing AP placement and channel assignment in WLAN by formulating an optimal integer linear programming (ILP) problem. The optimization objective is to minimize the maximum of channel utilization, which qualitatively represents congestion at the hot spot in WLAN service areas. It is seen from the simulation results that the proposed method finds the optimal AP placement and channels which minimize the maximum of channel utilization.

269 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