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 new blind identification algorithm based solely on the system outputs is proposed and necessary and sufficient identifiability conditions in terms of the multichannel systems and the deterministic input signal are presented.
Abstract: Conventional blind channel identification algorithms are based on channel outputs and knowledge of the probabilistic model of channel input. In some practical applications, however, the input statistical model may not be known, or there may not be sufficient data to obtain accurate enough estimates of certain statistics. In this paper, we consider the system input to be an unknown deterministic signal and study the problem of blind identification of multichannel FIR systems without requiring the knowledge of the input statistical model. A new blind identification algorithm based solely on the system outputs is proposed. Necessary and sufficient identifiability conditions in terms of the multichannel systems and the deterministic input signal are also presented.

830 citations

Proceedings ArticleDOI
28 Aug 2005
TL;DR: This paper provides necessary conditions to verify the feasibility of rate vectors in next generation fixed wireless broadband networks, and uses them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm.
Abstract: Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are characterized by the use of multiple orthogonal channels and nodes with the ability to simultaneously communicate with many neighbors using multiple radios (interfaces) over orthogonal channels. Networks based on the IEEE 802.11a/b/g and 802.16 standards are examples of these systems. However, due to the limited number of available orthogonal channels, interference is still a factor in such networks. In this paper, we propose a network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We provide necessary conditions to verify the feasibility of rate vectors in these networks, and use them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm. We then develop two link channel assignment schemes, one static and the other dynamic, in order to derive lower bounds on the achievable throughput. We demonstrate through simulations that the dynamic link channel assignment scheme performs close to optimal on the average, while the static link channel assignment algorithm also performs very well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

825 citations

Journal ArticleDOI
TL;DR: Two novel equalizers are developed for ZP-OFDM to tradeoff performance with implementation complexity andSimulations tailored to the realistic context of the standard for wireless local area network HIPERLAN/2 illustrate the pertinent tradeoffs.
Abstract: Zero padding (ZP) of multicarrier transmissions has been proposed as an appealing alternative to the traditional cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) to ensure symbol recovery regardless of the channel zero locations. In this paper, both systems are studied to delineate their relative merits in wireless systems where channel knowledge is not available at the transmitter. Two novel equalizers are developed for ZP-OFDM to tradeoff performance with implementation complexity. Both CP-OFDM and ZP-OFDM are then compared in terms of transmitter nonlinearities and required power backoff. Next, both systems are tested in terms of channel estimation and tracking capabilities. Simulations tailored to the realistic context of the standard for wireless local area network HIPERLAN/2 illustrate the pertinent tradeoffs.

822 citations

Journal ArticleDOI
TL;DR: From the single-user point of view considered in this paper, there exists an optimal repetition diversity order (or spreading factor) that minimizes the information outage probability for given rate, power, and fading statistics.
Abstract: We study optimal constant-rate coding schemes for a block-fading channel with strict transmission delay constraint, under the assumption that both the transmitter and the receiver have perfect channel-state information. We show that the information outage probability is minimized by concatenating a standard "Gaussian" code with an optimal power controller, which allocates the transmitted power dynamically to the transmitted symbols. We solve the minimum outage probability problem under different constraints on the transmitted power and we derive the corresponding power-allocation strategies. In addition, we propose an algorithm that approaches the optimal power allocation when the fading statistics are not known. Numerical examples for different fading channels are provided, and some applications discussed. In particular, we show that minimum outage probability and delay-limited capacity are closely related quantities, and we find a closed-form expression for the delay-limited capacity of the Rayleigh block-fading channel with transmission over two independent blocks. We also discuss repetition diversity and its relation with direct-sequence or multicarrier spread-spectrum transmission. The optimal power-allocation strategy in this case corresponds to selection diversity at the transmitter. From the single-user point of view considered in this paper, there exists an optimal repetition diversity order (or spreading factor) that minimizes the information outage probability for given rate, power, and fading statistics.

822 citations

Journal ArticleDOI
TL;DR: Performance limits for two closely related communication scenarios involving a wireless system with multiple-element transmitter antenna arrays are derived and it is shown that, when properly chosen, even a small amount of side information can be quite valuable.
Abstract: We derive performance limits for two closely related communication scenarios involving a wireless system with multiple-element transmitter antenna arrays: a point-to-point system with partial side information at the transmitter, and a broadcast system with multiple receivers. In both cases, ideal beamforming is impossible, leading to an inherently lower achievable performance as the quality of the side information degrades or as the number of receivers increases. Expected signal-to-noise ratio (SNR) and mutual information are both considered as performance measures. In the point-to-point case, we determine when the transmission strategy should use some form of beamforming and when it should not. We also show that, when properly chosen, even a small amount of side information can be quite valuable. For the broadcast scenario with an SNR criterion, we find the efficient frontier of operating points and show that even when the number of receivers is larger than the number of antenna array elements, significant performance improvements can be obtained by tailoring the transmission strategy to the realized channel.

819 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