Publication | Closed Access
Optimum beamforming using transmit antenna arrays
324
Citations
3
References
2003
Year
Unknown Venue
Mimo SystemEngineeringTransmit BeamformingTransmit Antenna ArraysSpace-time Transmit FilteringMultiuser MimoAntennaComputer EngineeringCooperative DiversitySystems EngineeringSmart AntennaIterative AlgorithmDistributed Antenna ArchitectureBeamformingAntenna ArraysSignal Processing
Transmit beamforming increases capacity in antenna‑array systems, especially when receive beamforming is unavailable, such as in base‑to‑mobile downlink cellular links. The study formulates transmit beamforming as minimizing base‑station power while meeting mobile quality‑of‑service requirements. The authors formulate the problem as a power‑minimization optimization, devise iterative algorithms for single‑cell and multi‑pair systems, and extend the solution to accommodate receive beamforming and space‑time filtering. They prove a global minimum exists for a single‑cell system, provide convergent iterative algorithms, and show the solution extends to receive beamforming, space‑time filtering, and multi‑pair ad hoc networks with monotonically decreasing costs.
Transmit beamforming is a powerful means of increasing capacity in systems in which the transmitter is equipped with an antenna array, especially in systems in which receive beamforming is not available, as is typical in the base-to-mobile downlink in a cellular communication system. In this paper, the problem of transmit beamforming is formulated as one of minimizing the power radiated by the base station, subject to satisfying quality of service requirements at the mobiles. For a single cell system, a global minimum is shown to exist, and an iterative algorithm that converges to it is provided. The solution extends to accommodate receive beamforming at the mobiles. It also extends to provide a mechanism for space-time transmit filtering, which exploits the differences between the temporal as well as the spatial channels between the base station and different mobiles. Finally, a system with multiple source-destination pairs (e.g., in an ad hoc network) is considered. An iterative algorithm that outputs a convergent sequence of feasible points with monotonically decreasing costs is provided for this case.
| Year | Citations | |
|---|---|---|
Page 1
Page 1