Computer Science – Information Theory
Scientific paper
2008-03-05
Computer Science
Information Theory
30 onecolumn-pages, 2 figures, replaced with revised version, submitted (Dec07) to Signal Processing
Scientific paper
In this article we consider the approximate description of doubly--dispersive channels by its symbol. We focus on channel operators with compactly supported spreading, which are widely used to represent fast fading multipath communication channels. The concept of approximate eigenstructure is introduced, which measures the accuracy E_p of the approximation of the channel operation as a pure multiplication in a given L_p-norm. Two variants of such an approximate Weyl symbol calculus are studied, which have important applications in several models for time--varying mobile channels. Typically, such channels have random spreading functions (inverse Weyl transform) defined on a common support U of finite non--zero size such that approximate eigenstructure has to be measured with respect to certain norms of the spreading process. We derive several explicit relations to the size |U| of the support. We show that the characterization of the ratio of E_p to some L_q-norm of the spreading function is related to weighted norms of ambiguity and Wigner functions. We present the connection to localization operators and give new bounds on the ability of localization of ambiguity functions and Wigner functions in U. Our analysis generalizes and improves recent results for the case p=2 and q=1.
No associations
LandOfFree
On the Approximate Eigenstructure of Time-Varying Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Approximate Eigenstructure of Time-Varying Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Approximate Eigenstructure of Time-Varying Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-160830