2006•Unpublished venueRequires access

Channel Probing under a Power Budget

Jasvinder Singh, Christopher James Rose

Open publisher page 4 citations

Abstract

Consider a multi-channel system between a transmitter and receiver where each channel undergoes independent block fading. At the beginning of each fading block, a certain number of slots are used for sending probing signals (training period) allowing the receiver to learn some information about the fading gains. The receiver uses this information to figure out the best channel for transmission (which maximizes the expected SNR at the receiver) and conveys this choice to the transmitter through a delay free noiseless feedback link. One can then ask the following question: given a fixed power budget and number of slots for probing, how should these resources be divided among the channels so as to maximize the expected SNR at receiver? In this paper, we formulate this general problem and analyze it for some simple cases. For a single probing slot and channels with Gaussian fading gains and additive Gaussian noise, we show that the probing strategy varies from probing a single channel to probing all the channels depending on the probe power budget. Since the exact analytical characterization of the optimal probe power distribution is difficult to obtain, we only present partial analytical results and numerical simulations to illustrate the behavior of the optimal probe power distribution. For the multiple slots case, we show that if probing is done in parallel, then there is no additional benefit to be gained over the single slot case. The problem of sequential probing is very similar to the multi-armed bandit problem and is very difficult to analyze. Here we consider a heuristic scheme and numerically compare its performance to the single slot probing case.

About this research paper

What this paper is about

Consider a multi-channel system between a transmitter and receiver where each channel undergoes independent block fading. At the beginning of each fading block, a certain number of slots are used for sending probing signals (training period) allowing the receiver to learn some information about the fading gains. The receiver uses this information to figure out the best channel for transmission (which maximizes the expected SNR at the receiver) and conveys this choice to the transmitter through a delay free noiseless feedback link. One can then ask the following question: given a fixed power budget and number of slots for probing, how should these resources be divided among the channels so as to maximize the expected SNR at receiver? In this paper, we formulate this general problem and analyze it for some simple cases. For a single probing slot and channels with Gaussian fading gains and additive Gaussian noise, we show that the probing strategy varies from probing a single channel to probing all the channels depending on the probe power budget. Since the exact analytical characterization of the optimal probe power distribution is difficult to obtain, we only present partial analytical results and numerical simulations to illustrate the behavior of the optimal probe power distribution. For the multiple slots case, we show that if probing is done in parallel, then there is no additional benefit to be gained over the single slot case. The problem of sequential probing is very similar to the multi-armed bandit problem and is very difficult to analyze. Here we consider a heuristic scheme and numerically compare its performance to the single slot probing case.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Consider a multi-channel system between a transmitter and receiver where each channel undergoes independent block fading. At the beginning of each fading block, a certain number of slots are used for sending probing signals (training period) allowing the receiver to learn some information about the fading gains. The receiver uses this information to figure out the best channel for transmission (which maximizes the expected SNR at the receiver) and conveys this choice to the transmitter through a delay free noiseless feedback link. One can then ask the following question: given a fixed power budget and number of slots for probing, how should these resources be divided among the channels so as to maximize the expected SNR at receiver? In this paper, we formulate this general problem and analyze it for some simple cases. For a single probing slot and channels with Gaussian fading gains and additive Gaussian noise, we show that the probing strategy varies from probing a single channel to probing all the channels depending on the probe power budget. Since the exact analytical characterization of the optimal probe power distribution is difficult to obtain, we only present partial analytical results and numerical simulations to illustrate the behavior of the optimal probe power distribution. For the multiple slots case, we show that if probing is done in parallel, then there is no additional benefit to be gained over the single slot case. The problem of sequential probing is very similar to the multi-armed bandit problem and is very difficult to analyze. Here we consider a heuristic scheme and numerically compare its performance to the single slot probing case.

Key concepts: Fading, Transmitter, Channel (broadcasting), Computer science, Transmission (telecommunications), Power budget, Channel state information, Block (permutation group theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Channel Probing under a Power Budget — Research Paper | ScholarLens