排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
Binary adaptive coded pilot symbol assisted modulation over Rayleigh fading channels without feedback 总被引:1,自引:0,他引:1
Pilot symbol assisted modulation (PSAM) is a standard approach for transceiver design for time-varying channels, with channel estimates obtained from pilot symbols being employed for coherent demodulation of the data symbols. In this paper, we show that PSAM schemes can be improved by adapting the coded modulation strategy at the sender to the quality of the channel measurement at the receiver, without requiring any channel feedback from the receiver. We consider performance in terms of achievable rate for binary signaling schemes. The transmitter employs interleaved codes, with data symbols coded according to their distance from the nearest pilot symbols. Symbols far away from pilot symbols encounter poorer channel measurements at the receiver and are therefore coded with lower rate codes, while symbols close to pilot symbols benefit from recent channel measurements and are coded with higher rate codes. The performance benefits from this approach are quantified in the context of binary signaling over time-varying Rayleigh fading channels described by a Gauss-Markov model. The spacing of the pilot symbols is optimized to maximize the mutual information between input and output in this setting. Causal and noncausal channel estimators of varying complexity and delay are considered. It is shown that, by appropriate optimization for the spacing between consecutive pilot symbols, the adaptive coding techniques proposed can improve achievable rate, without any feedback from the receiver to the sender. Moreover, channel estimation based on the two closest pilot symbols is generally close to optimal. 相似文献
2.
We analyze the error probability of peaky signaling on bandlimited multipath fading channels, the signaling strategy that achieves the capacity of such channels in the limit of infinite bandwidth under an average power constraint. We first derive an upper bound for general fading, then specialize to the case of Rayleigh fading, where we obtain upper and lower bounds that are exponentially tight and, therefore, yield the reliability function. These bounds constitute a strong coding theorem for the channel, as they not only delimit the range of achievable rates, but also give us a relationship among the error probability, data rate, bandwidth, peakiness, and fading parameters, such as the coherence time. They can be used to compare peaky signaling systems to other large bandwidth systems over fading channels, such as ultra-wideband radio and wideband code-division multiple access. We find that the error probability decreases slowly with the bandwidth W; under Rayleigh fading, the error probability varies roughly as W/sup -/spl alpha//, where /spl alpha/>0. With parameters typical of indoor wireless situations, we study the behavior of the upper and lower bounds on the error probability and the reliability function numerically. 相似文献
3.
Abou-Faycal I.C. Trott M.D. Shamai S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2001,47(4):1290-1301
We consider transmission over a discrete-time Rayleigh fading channel, in which successive symbols face independent fading, and where neither the transmitter nor the receiver has channel state information. Subject to an average power constraint, we study the capacity-achieving distribution of this channel and prove it to be discrete with a finite number of mass points, one of them located at the origin. We numerically compute the capacity and the corresponding optimal distribution as a function of the signal-to-noise ratio (SNR). The behavior of the channel at low SNR is studied and finally a comparison is drawn with the ideal additive white Gaussian noise channel 相似文献
1