Bound estimation for coded faster-than-Nyquist system

Qingshuang Zhang; Aijun Liu; Xiaohu Liang

Bound estimation for coded faster-than-Nyquist system

View Fulltext

Author(s): Qingshuang Zhang ¹ ; Aijun Liu ¹ ; Xiaohu Liang ¹
- Affiliations: 1: College of Communication Engineering, PLA University of Science and Technology, 1 Haifuxiang Road, Nanjing 210007, People's Republic of China
Source: Volume 53, Issue 2, 19 January 2017, p. 85 – 87
DOI: 10.1049/el.2016.3500 , Print ISSN 0013-5194, Online ISSN 1350-911X

Received 22/09/2016, Published 02/12/2016

Frame error rate bound is a useful tool to predict the performance behaviour of coded faster than Nyquist system (FTN). In this Letter, the Euclidean distance distribution (EDD) of FTN signalling is assumed continuous and obeys the Gaussian distribution for its long memory length. By using the autocorrelation properties of the error sequences, the EDD of FTN is estimated and the simplified bound is further derived which indicates that the performance of coded FTN system is bounded by the performance of employed coding scheme. Simulation results show that the bound is well matched with the simulated performance in high SNR regime.

References

1. 1)
  - 7. Biglieri, E., Divsalar, D., Mclane, P.J., Simon, M.K.: ‘Introduction to trellis-coded modulation with applications’ (MacMillan, New York, 1991).
2. 2)
  - 5. Yu, J., Park, J., Rusek, F., Kudryashov, B., Bocharova, I.: ‘High order modulation in faster-than-Nyquist signaling communication systems’. Proc. VTC2014-Fall, 2014, pp. 1–5.
3. 3)
  - 1. Anderson, J.B., Rusek, F., Owall, V.: ‘Faster than Nyquist signaling’, Pro. IEEE, 2013, 101, pp. 1817–1830 (doi: 10.1109/JPROC.2012.2233451).
4. 4)
  - 12. Fayyaz, U.U., Barry, J.R.: ‘Low-complexity soft-output decoding of polar codes’, IEEE JSAC, 2014, 32, pp. 958–966.
5. 5)
  - 10. Assimi, A.N., Poulliat, C., Fijalkow, I.: ‘Distance distribution of turboequalized systems over static frequency-selective channels’. Proc. Int. Conf. on Acoustics, 2008, pp. 2949–2952.
6. 6)
  - 6. Duman, T.M., Kurtas, E.M.: ‘Performance bounds for high high rate linear codes over partial-response channels’, IEEE Trans. Inf. Theory, 2001, 47, pp. 1201–1205 (doi: 10.1109/18.915684).
7. 7)
  - 8. Tan, W., Todd, R.M., Cruz, J.R.: ‘Bounds for low-density parity-check codes over partial response channels’, IEEE Trans. Magn., 2002, 38, pp. 2310–2312 (doi: 10.1109/20.990111).
8. 8)
  - 3. Rusek, F., Anderson, J.B.: ‘Serial and parallel concatenations based on faster than Nyquist signaling’. Proc. ISIT, 2006, pp. 1993–1997.
9. 9)
  - 9. Todd, R.M., Cruz, J.R.: ‘Computing maximum-likelihood bounds for Reed-Solomon codes over partial response channels’. Proc. ICC, 2007, pp. 6205–6209.
10. 10)
  - 3. Prlja, A., Anderson, J.B.: ‘Reduced-complexity receivers for strongly narrowband intersymbol interference introduced by faster-than-Nyquist signaling’, IEEE Trans. Commun., 2012, 60, (9), pp. 2591–2610 (doi: 10.1109/TCOMM.2012.070912.110296).
11. 11)
  - 11. Anderson, J.B., Prlja, A., Rusek, F.: ‘New reduced state space BCJR algorithms for the ISI channel’. Proc. ISIT, 2009, vol. 101, pp. 889–893.
12. 12)
  - 4. Tajan, R., Benammar, B., Poulliat, C., Boucheret, M.: ‘On coding for faster-than-Nyquist signaling’. Proc. BlackSeaCom, 2015, pp. 92–96.

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

Bound estimation for coded faster-than-Nyquist system

References

Related content