A Random Beamforming technique in MIMO Broadcast Channels - - PowerPoint PPT Presentation

a random beamforming technique in mimo broadcast channels
SMART_READER_LITE
LIVE PREVIEW

A Random Beamforming technique in MIMO Broadcast Channels - - PowerPoint PPT Presentation

A Random Beamforming technique in MIMO Broadcast Channels Younghwan Bae Univ. of Minnesota OUTLINE 1. Motivation 2. Part I. Sum Capacity of MIMO BC 3. Part II. Simulation Results 4. Conclusion Motivation Both the base station


slide-1
SLIDE 1

A Random Beamforming technique in MIMO Broadcast Channels

Younghwan Bae

  • Univ. of Minnesota
slide-2
SLIDE 2

OUTLINE

  • 1. Motivation
  • 2. Part I. Sum Capacity of MIMO BC
  • 3. Part II. Simulation Results
  • 4. Conclusion
slide-3
SLIDE 3

Motivation

Both the base station and the receiver has one antenna. Degraded broadcast channel

Selecting the best user and sending data only to that user is

  • ptimal!

‘Optimal’ means ‘maximizing the sum rate’

slide-4
SLIDE 4

What if BS has more than one antenna

Non-degraded Broadcast channel

Selecting only one best user is not optimal

slide-5
SLIDE 5

More general case

Multiple antennas at the base station Multiple antennas at each receiver General MIMO Gaussian broadcast channel It is not always reasonable to assume that perfect channel knowledge can be made available to the Tx.

slide-6
SLIDE 6

PART I

Sum Capacity

slide-7
SLIDE 7

Transmitter beamforming

  • Sub-optimal technique that supports simultaneous

transmission to multiple users on a broadcast channel

  • Consider the interference from other users as

noise

2 , M 2

P SINR , 1, ,M 1 P

m i m i m k i k k m

m

= = + ∑ H v H v K

{ } { }

M ( ) , , 1 ,

R = E log(1 SINR ) ME log(1 SINR ) 1 M log(1+E SINR ) M log(1+ ) 1. M 1

a i m i m i i m =

⎧ ⎫ + = + ≤ ⎨ ⎬ ⎩ ⎭ ≈ < −

slide-8
SLIDE 8

Suppose each receiver feeds back its maximum SINR

  • Then, the transmitter assigns beams to the users

with the highest corresponding SINR

  • The sum rate capacity
  • The lower and upper bounds depend on the

distribution of SINR

{ }

M , , 1 N 1 N 1

R E log(1 max SINR ) M E log(1 max SINR )

i m i m i i m ≤ ≤ ≤ ≤ =

⎧ ⎫ ≈ + = + ⎨ ⎬ ⎩ ⎭

N-1 N-1 1

M log(1 )N ( ) ( ) M log(1 )N ( ) ( ) x f x F x dx R x f x F x dx

∞ ∞

+ ≤ ≤ +

∫ ∫

slide-9
SLIDE 9

Part II

Simulation Results

slide-10
SLIDE 10

Simulation Setup

  • Ricean fading channel H
  • N (Num. of Users) = 2
  • Receive antenna at each receiver = 1
  • P1 = 5, P2 = 5
  • Varying M (Num. of Tx antennas)
  • AWGN
  • Orthonormal Tx beamforming
slide-11
SLIDE 11

Result

slide-12
SLIDE 12

Simulation Setup

  • Ricean fading channel H
  • N (Num. of Users) = 2
  • M (Num. of Tx antennas) = 2
  • Receive antenna at each receiver = 1
  • Varying Power P, P1=P2=P/2
  • AWGN
  • Orthonormal Tx beamforming
slide-13
SLIDE 13

Result

slide-14
SLIDE 14

Simulation Setup

  • Ricean fading channel H
  • N (Num. of Users) = 2
  • Receive antenna at each receiver = 1
  • P1 = 5, P2 = 5
  • Varying M (Num. of Tx antennas)
  • AWGN
  • Normalized Tx beamforming maximizing

SINR

slide-15
SLIDE 15

Result

slide-16
SLIDE 16

Simulation Setup

  • Ricean fading channel H
  • N (Num. of Users) = 2
  • M (Num. of Tx antennas) = 2
  • Receive antenna at each receiver = 1
  • Varying Power P, P1=P2=P/2
  • AWGN
  • Normalized Tx beamforming maximizing

SINR

slide-17
SLIDE 17

Result

slide-18
SLIDE 18

Conclusions

  • As Ricean factor K goes from zero ( models a Rayleigh fading

channel) to infinity (models a deterministic fading channel), the capacity increases at first, and then it is saturated.

  • As M gets large, the capacity increases, however, when M is

large enough, the system becomes interference-dominated.

  • Sending M random beamforms to different users is optimal in

that it uses M beamforms efficiently than the method where all the M beamforms are concentrated to one user with the best

  • verall channel