© The Institution of Engineering and Technology
Lattice-reduction-aided (LRA) preequalisation for the multiple-input/multiple-output broadcast channel has most often been considered for the uncoded case so far. However, recent advantages in the closely related field of integer-forcing equalisation, where the cancellation of the multiuser interference and the channel coding are combined, create doubt to this separated point of view. In this Letter, the philosophy of matching both the channel code and the complex-valued signal constellation to the same finite-field arithmetic is proposed. The consequences on the factorisation task present in LRA preequalisation are discussed and covered by numerical performance evaluations based on non-binary low-density parity-check codes.
References
-
-
1)
-
14. Costantini, L., Matuz, B., Liva, G., et al: ‘Non-binary protograph low-density parity-check codes for space communications’, Int. J. Satell. Commun. Netw., 2012, 30, (2), pp. 43–51 (doi: 10.1002/sat.1004).
-
2)
-
15. Gan, Y.H., Ling, C., Mow, W.H.: ‘Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection’, IEEE Trans. Signal Process., 2009, 57, (7), pp. 2701–2710 (doi: 10.1109/TSP.2009.2016267).
-
3)
-
14. Windpassinger, C., Fischer, R.F.H., Huber, J.B.: ‘Lattice-reduction-aided broadcast precoding’, IEEE Trans. Commun., 2004, 52, (12), pp. 2057–2060 (doi: 10.1109/TCOMM.2004.838732).
-
4)
-
11. Tunali, N.E., Narayanan, K.R., Boutros, J.J., et al: ‘Lattices over Eisenstein integers for compute-and-forward’, IEEE Trans. Inf. Theory, 2015, 61, (10), pp. 5306–5321 (doi: 10.1109/TIT.2015.2451623).
-
5)
-
9. Fischer, R.F.H., Cyran, M., Stern, S.: ‘Factorization approaches in lattice-reduction-aided and integer-forcing equalization’. Int. Zurich Seminar on Communications, Zurich, Switzerland, March 2016.
-
6)
-
3. Zhan, J., Nazer, B., Erez, U., et al: ‘Integer-forcing linear receivers’, IEEE Trans. Inf. Theory, 2014, 60, (12), pp. 7661–7685 (doi: 10.1109/TIT.2014.2361782).
-
7)
-
21. Caire, G., Taricco, G., Biglieri, E.: ‘Bit-interleaved coded modulation’, IEEE Trans. Inf. Theory, 1998, 44, (3), pp. 927–946 (doi: 10.1109/18.669123).
-
8)
-
5. Stern, S., Fischer, R.F.H.: ‘Lattice-reduction-aided preequalization over algebraic signal constellations’. Int. Conf. on Signal Processing and Communication Systems, Cairns, Australia, December 2015.
-
9)
-
10. Huber, K.: ‘Codes over Gaussian Integers’, IEEE Trans. Inf. Theory, 1994, 40, (1), pp. 207–216 (doi: 10.1109/18.272484).
-
10)
-
1. Forney, G.D.Jr., Ungerboeck, G.: ‘Modulation and coding for linear Gaussian channels’, IEEE Trans. Inf. Theory, 1998, 44, (6), pp. 2384–2415 (doi: 10.1109/18.720542).
-
11)
-
8. Fischer, R.F.H.: ‘Complexity-performance trade-off of algorithms for combined lattice reduction and QR decomposition’, Int. J. Electron. Commun. (AEÜ), 2012, 66, (11), pp. 871–879 (doi: 10.1016/j.aeue.2012.03.003).
-
12)
-
7. Fischer, R.F.H.: ‘Precoding and signal shaping for digital transmission’ (Wiley-IEEE Press, New York, USA, 2002).
-
13)
-
4. Conway, J., Sloane, N.: ‘Sphere packings, lattices and groups’ (Springer, New York, USA, 1999, 3rd edn).
-
14)
-
17. European Telecommunications Standards Institute: ‘DVB-S2’. , 2005.
-
15)
-
24. Davey, M.C., MacKay, D.: ‘Low-density parity check codes over GF(q)’, IEEE Commun. Lett., 1998, 2, (6), pp. 165–167 (doi: 10.1109/4234.681360).
-
16)
-
3. Feng, C., Silva, D., Kschischang, F.: ‘An algebraic approach to physical-layer network coding’, IEEE Trans. Inf. Theory, 2013, 59, pp. 7576–7596 (doi: 10.1109/TIT.2013.2274264).
-
17)
-
13. Jin, H., Khandekar, A., McEliece, R.: ‘Irregular repeat accumulate codes’. Int. Symp. on Turbo Codes, Brest, France, September 2000.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2015.4290
Related content
content/journals/10.1049/el.2015.4290
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Joint algebraic coded modulation and lattice-reduction-aided preequalisation