Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

µ selection in water-filling capacity algorithm

Status
Not open for further replies.
D

dwade

Newbie level 4
Joined
Feb 14, 2008
Messages
7
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Location
UK
Activity points
1,325
Hi guys,

I am currently doing a capacity analysis for MIMO-SM in a rayleigh channel. I stuck with one problem: how do we determine the value of µ (water filling level) in water-filling algorithm?
Many thanks for your kind knowledge sharing
Cheers
 

µ is found iteratively. This thing is explained in Tomas Cover, "Elements of information theory" . It is explained in "Intoduction to Space-Time wireless Commincation" bu Paulraj and Nabar.
this is the page expalining that.

from Tomas Cover you may find more details.
I attached one of the lecture notes of Dr.PAulraj which contains this part. You may find also little discription about waterfilling, or waterpouring as Paulraj and Nabar, call in "Communication Systems" 4th ed ,by Simon Haykin
 

    D

    dwade

    Points: 2
    Helpful Answer Positive Rating
hey, thanks. That helps a lot, now I can compare between unknown vs known CSI
 

Could you please upload your code, if you have no issues.
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top