142 search results - page 13 / 29 » On orthogonal ray graphs |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Modulation forensics is to detect the modulation type in wireless communications without any prior information. It nds both military and civilian applications such as surveillance...
JGT
2007
13 years 7 months ago
2007
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...
JSAC
2007
13 years 7 months ago
2007
— In this paper, a distributive non-cooperative game is proposed to perform sub-channel assignment, adaptive modulation, and power control for multi-cell multi-user Orthogonal Fr...
DM
2000
13 years 7 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...