|
Algorithm 1 Solve globally optimal ZOSC with channel gains from finite alphabet
|
| 0. Initialize the marginal distributions and define . |
| 1. Construct the -ary expansion matrix , where each row of is a tuple (the 1st row is (0,0,0) and the proceedings follow an increasing order with respect to the -ary expansion). |
| 2. Construct , where , if by the j-th row of , and is not used in calculating the marginal probability , where is the i-row of , , . Define . |
| 3. Reorder and as and , respectively, such that are in an increasing manner. |
| repeat |
| 4. Update : set columns of as a zero vectors, where the indices of those columns correspond to the rows of having the smallest rates. |
| 5. Solve , , , , by CVX. |
| 6. Set L = L + 1. |
|
until is feasible, |
| 7. ZOSC = , where |
|
.
|