Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Optimized constellations for two-way wireless relaying with physical network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Denoising strategy for convolutionally-coded bidirectional relaying
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding
IEEE Transactions on Information Theory
Performance Bounds for Bidirectional Coded Cooperation Protocols
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The unavoidable parametrization of the wireless link represents a major problem of the network-coded modulation synthesis in a 2-way relay channel. Composite (hierarchical) codeword received at the relay is generally parametrized by the channel gain, forcing any processing on the relay to be dependent on channel parameters. In this paper, we introduce the codebook design criteria, which ensure that all permissible hierarchical codewords have decision regions invariant to the channel parameters (as seen by the relay). We utilize the criterion for parameter-invariant constellation space boundary to obtain the codebooks with channel parameter-invariant decision regions at the relay. Since the requirements on such codebooks are relatively strict, the construction of higher-order codebooks will require a slightly simplified design criteria. We will show that the construction algorithm based on these relaxed criteria provides a feasible way to the design of codebooks with arbitrary cardinality. The promising performance benefits of the example codebooks (compared to a classical linear modulation alphabets) will be exemplified on the minimum distance analysis.