Abstract
In this paper, a new method of dirty paper code design is investigated, namely the biorthogonal matrix. The error probability is analysed for the code design. Since the code has the maximum dmin', the robustness of this code is optimal. However, due to the limited availability of the codewords, the performance is restricted. Superior coding and binning methods are derived from the in-depth analysis of the simulation results. Simulation results identify this restriction and solutions are discussed. Comparisons are made with non-orthogonal codes showing the robustness advantage of biorthogonal codes.
| Original language | English |
|---|---|
| Pages (from-to) | 96-105 |
| Number of pages | 0 |
| Journal | Journal of Digital Information Management |
| Volume | 7 |
| Issue number | 2 |
| Publication status | Published - 1 Apr 2009 |