Novel Interference Cancellation Technique Based on Matrix Computation for FTN Communication System

Baek, Myung-Sun; Hur, Namho; Lim, Hyoungsoo

doi:10.1109/milcom.2014.144

Cited by 20 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Innertermofeqns. (5), (7) +M + The interference cancellation and detection process above is repeated until the last symbol is detected. Let us denote the detected symbols after the above process is repeated…”

Section: Qrd-m Algorithm For Ftn Signallingmentioning

confidence: 99%

“…Introduction: Many researchers on 5G and advanced digital broadcasting have mainly investigated highly spectrum-efficient transmission technologies [1,2]. Recently, to meet the demand of high spectral efficiency, faster-than-Nyquist (FTN) signalling has received considerable attention [3][4][5][6][7]. The FTN signalling uses higher symbol rate than Nyquist rate and causes inter-symbol interference (ISI).…”

mentioning

confidence: 99%

“…The FTN signalling uses higher symbol rate than Nyquist rate and causes inter-symbol interference (ISI). Therefore, ISI cancellation scheme is required for the FTN signal reception [5,6]. For FTN signal detection, most researchers employ Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm [6,7].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Interference cancellation and signal detection technique based on QRD‐M algorithm for FTN signalling

et al. 2017

View full text Add to dashboard Cite

This Letter presents interference cancellation and signal detection technique for faster-than-Nyquist (FTN) signalling. The proposed scheme uses QR decomposition (QRD)-M algorithm to execute interference cancellation and signal detection. Based on the Toeplitz structure of the inter-symbol interference coefficient matrix, the QRD-M algorithm is adopted to detect the transmitted symbols from an FTN signal. The computational complexity comparisons and numerical results demonstrate that the proposed technique can achieve the complexity <10% of Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm while maintaining BER performance similar to that of BCJR algorithm.

show abstract

Section: Qrd-m Algorithm For Ftn Signallingmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Interference cancellation and signal detection technique based on QRD‐M algorithm for FTN signalling

et al. 2017

View full text Add to dashboard Cite

show abstract

“…FDE (frequency-domain equalization), DFE (decision feedback equalization) 및 SIC (successive interference cancellation) 등 다양한 기법이 제안되었다 [4][5][6][7][8][9][10][11][12][13] .…”

unclassified

ISI Estimation Using Iterative MAP for Faster-Than-Nyquist Transmission

Kang¹,

Kim²,

Park³

et al. 2017

The Journal of Korean Institute of Communications and Informati

View full text Add to dashboard Cite

In this paper, we propose an inter-symbol interference (ISI) estimation scheme based on the maximum a posteriori (MAP) algorithm for faster-than-Nyquist (FTN) systems. Unfortunately, the ISI estimator based on the MAP algorithm requires relatively high computational complexity. To reduce the complexity of the MAP based ISI estimator, we propose a hybrid ISI estimation scheme based on the MAP and successive interference cancellation (SIC) algorithms. The proposed scheme not only offers good ISI estimation performances but also requires reasonably low complexity.

show abstract

“…McGuire and Sima [13] introduced a method of implementing discrete block FTN signalling using matrix multiplication which would reduce the receiver complexity in case of AWGN channels. ISI cancellation strategy based on matrix computation is proposed in [14], simulation results show that the decision feedback equalisation (DFE) detection can give better detection performance than VA, however, since the matrix size is the same as the frame size, the memory size for matrix computation become too large, so the partial DFE (PDFE) is proposed later. Although the PDFE can reduce the complexity of ISI cancellation, due to only partial ISI is considered, the performance degradation is inevitable, and the complexity of the PDFE based on QR decomposition is still high.…”

mentioning

confidence: 99%

Interference cancellation technique for faster‐than‐Nyquist signalling

2016

View full text Add to dashboard Cite

The faster-than-Nyquist (FTN) signalling is a bandwidth-efficient technology which has drawn attention in the bandwidth-starved world. However, inter-symbol interference is introduced by transmitting signals at a higher signalling rate than allowed by the Nyquist criterion. Decision feedback equalisation (DFE) cancellation is an efficient signal detection scheme for FTN-based communication system. However, since the DFE interference cancellation is executed by overall matrix computation, the required memory size is very large. In order to reduce the complexity of the interference cancellation process, a novel simple interference cancellation is proposed. Simulation results show that the scheme can perform better than DFE, and its complexity is very low because of the absence of QR decomposition.Introduction: Faster-than-Nyquist (FTN) signalling is a method that could potentially achieve higher capacity by introducing controlled inter-symbol interference (ISI). It was first studied by Mazo as early as 1975 [1] he showed that one can transmit the signal pulses faster than the Nyquist frequency without decreasing the Euclidian distance between any two signals, thus it can pack more data in the same bandwidth at the same energy without loss in performance compared with traditional methods. The main reason of Mazo's result did not attract much attention at that time is that the huge receiver complexity of FTN signalling.Recently, it has attracted interest in this bandwidth-starved world. In 2003, Liveris and Georghiades [2] investigated the structure of error events for binary FTN signalling when using root raised cosine (RRC) pulses, and showed that the same phenomenon occurred with RRC pulses. In 2006, Rusek and Anderson [3] investigated the lower and upper bounds of the information rates using RRC pulses for FTN schemes. In 2008, non-binary FTN was investigated in detail [4] describing a method to compute the minimum distance. Rusek and Anderson also investigated the constrained capacities for FTN [5] and compared their capacity computations with signal using orthogonal modulation. In [6], Rusek and Anderson introduced the 2D Mazo limit by packing signals in time and stacking signals in frequency together. Kim and Bajcsy in [7] analysed the information rates and their upper bounds for cyclostationary FTN signalling using additive white Gaussian noise (AWGN) and continuous time ISI channels. The pulse design is presented in [8], and showed that arbitrary modulation pulses were used which not only reduce the detection complexity but also achieve the channel capacity.However, due to the inevitable ISI is introduced with the FTN signalling, and much faster symbol rate is used, the number of interference is highly increased, thus the computational complexity of removal of ISI is the main challenge for FTN signalling. So far, a number of demodulating methods have been proposed for the FTN signalling receiver. For example, maximum likelihood sequence estimation (MLSE) technique [9] and Viterbi algorithm (VA) [10], as the ...

show abstract

Novel Interference Cancellation Technique Based on Matrix Computation for FTN Communication System

Cited by 20 publications

References 12 publications

Interference cancellation and signal detection technique based on QRD‐M algorithm for FTN signalling

Interference cancellation and signal detection technique based on QRD‐M algorithm for FTN signalling

ISI Estimation Using Iterative MAP for Faster-Than-Nyquist Transmission

Interference cancellation technique for faster‐than‐Nyquist signalling

Contact Info

Product

Resources

About