scispace - formally typeset
G

G.J. Foschini

Researcher at Bell Labs

Publications -  36
Citations -  1987

G.J. Foschini is an academic researcher from Bell Labs. The author has contributed to research in topics: Spectral efficiency & Channel allocation schemes. The author has an hindex of 24, co-authored 36 publications receiving 1946 citations.

Papers
More filters
Proceedings ArticleDOI

Optimum Zero-forcing Beamforming with Per-antenna Power Constraints

TL;DR: The results indicate that optimizing the antenna outputs based on the per-antenna constraints may improve the rate considerably when the number of transmit antennas is larger thenumber of receive antennas.
Proceedings ArticleDOI

Distributed algorithms for dynamic channel allocation in microcellular systems

TL;DR: The capacity of a microcellular system using dynamic channel allocation was studied and it was found that these systems can self-organize, with little loss in capacity, by using channel-allocation algorithms that are simple, practical, and local.
Proceedings ArticleDOI

Keyholes, correlations and capacities of multi-element transmit and receive antennas

TL;DR: It is shown that degenerate channel phenomena, called "keyholes" may arise under realistic assumptions which have zero correlation between the entries of the channel matrix H and yet only a single degree of freedom.
Proceedings ArticleDOI

Capacity growth of multi-element arrays in indoor and outdoor wireless channels

TL;DR: The capacity growth of multiple-element antenna arrays (MEAs) in a realistic propagation environment using WiSE, an experimental ray tracing tool, is demonstrated and effective degrees of freedom (EDOFs) are defined as parallel spatial modes of transmission for an MEA.
Journal ArticleDOI

Optimum Allocation of Servers to Two Types of Competing Customers

TL;DR: For two types of users it is shown that among a large class of policies, the optimum is the easily implemented policy of restricting the maximum number of processors that one of the two types can occupy at any time.