Decision-directed Blind Equalization Research Articles

OF-FSE: An Efficient Adaptive Equalization for QAM-Based UAV Modulation Systems

Quadrature amplitude modulation (QAM) is one of the essential components of unmanned 1 aerial vehicle (UAV) communications. However, the output signal accuracy of QAM deteriorates dramatically and even collapses in the case of UAVs in a harsh channel environment. This is due to the fractionally spaced equalization based on the multi-modulus blind equalization algorithm being implemented prior to carrier synchronization in QAM-based UAV modulation systems. The carrier frequency offset from the harsh channel signal thus contributes to the significantly degraded performance of MMA by suffering the fractionally spaced equalization. Therefore, in this paper, a novel offset feedback fractionally spaced equalization architecture for UAVs to eliminate the carrier frequency offset is first proposed. In this architecture, the carrier frequency offset allows estimated and incorporation into the input signal of fractionally spaced equalization to compensate for the offset. Moreover, a new multi-modulus decision-directed algorithm is presented for the novel architecture to improve the received signal accuracy of UAVs further. It enables adaptive optimization of the convergence process in accordance with the dynamic UAV communication environment employing the multi-modulus blind equalization algorithm and decision-directed blind equalization algorithm (MDD). Simulation results demonstrate the effectiveness of the OF-FSE framework in enabling the QAM-based UAV modulation systems operation in harsh channel scenarios. Moreover, the performance of the presented new MDD algorithm compared with baseline approaches is also confirmed.

Chaotic convergence of the decision-directed blind equalization algorithm

Classically, adaptive equalization algorithms are analyzed in terms of two possible steady state behaviors: convergence to a fixed point and divergence to infinity. This twofold scenario suits well the modus operandi of linear supervised algorithms, but can be rather restrictive when unsupervised methods are considered, as their intrinsic use of higher-order statistics gives rise to nonlinear update expressions. In this work, we show, using different analytical tools belonging to dynamic system theory, that one of the most emblematic and studied unsupervised approaches – the decision-directed algorithm – is potentially capable of presenting behaviors, like convergence to limit-cycles and chaos, that transcend the aforementioned dichotomy. These results also indicate theoretical possibilities concerning step-size selection and initialization.

계산 복잡도가 줄어든 새로운 Bussgang 자력 등화 알고리듬

눈 모형이 열린 경우 간결하고 좋은 수렴 특성을 갖는 결정-지향 자력 등화 알고리듬이 자주 사용된다. 그러나 눈 모형이 닫힌 채널에서 결정-지향 알고리듬의 수렴은 보장되지 않는다. 이러한 문제를 해결하기 위하여 무기억 비선형 함수로 hyperbolic tangent 함수를 사용하는 수정된 Bussgang 알고리듬의 적용이 Filho 등에 의하여 제안되었다. 그러나 이 알고리듬의 적용은 hyperbolic tangent 함수 그리고 이의 미분에 대한 계산 및 채널의 변화에 따른 룩업 테이블을 위한 많은 메모리를 필요로 한다. 따라서 본 논문에서는 Filho 등이 제안한 알고리듬의 계산량 또는 하드웨어 복잡도를 줄이기 위하여 결정-지향 알고리듬을 위한 개선된 기법을 제안한다. 무기억 비선형 함수를 signum 함수로 설정하고, 이의 미분인 디락 델타 함수(Dirac delta function)를 협소한 사각 펄스로 근사화하여 결정-지향 알고리듬에 적용하면 Filho가 제안한 알고리듬의 수렴 및 정상 상태 성능은 유지하면서 계산 복잡도를 크게 줄일 수 있다. The decision-directed blind equalization algorithm is often used due to its simplicity and good convergence property when the eye pattern is open. However, in a channel where the eye pattern is closed, the decision-directed algorithm is not guaranteed to converge. Hence, a modified Bussgang-type algorithm using a hyperbolic tangent function for zero-memory nonlinear(ZNL) function has been proposed and applied to avoid this problem by Filho et al. But application of this algorithm includes the calculation of hyperbolic tangent function and its derivative or a look-up table which may need a large amount of memory due to channel variations. To reduce the computational and/or hardware complexity of Filho's algorithm, in this paper, an improved method for the decision-directed algorithm is proposed. In the proposed scheme, the ZNL function and its derivative are respectively set to be the original signum function and a narrow rectangular pulse which is an approximation of Dirac delta function. It is shown that the proposed scheme, when it is combined with decision-directed algorithm, reduces the computational complexity drastically while it retains the convergence and steady-state performance of the Filho's algorithm.

Recursive least-squares backpropagation algorithm for stop-and-go decision-directed blind equalization

Stop-and-go decision-directed (S-and-G-DD) equalization is the most primitive blind equalization (BE) method for the cancelling of intersymbol-interference in data communication systems. Recently, this scheme has been applied to complex-valued multilayer feedforward neural network, giving robust results with a lower mean-square error at the expense of slow convergence. To overcome this problem, in this work, a fast converging recursive least squares (RLS)-based complex-valued backpropagation learning algorithm is derived for S-and-G-DD blind equalization. Simulation results show the effectiveness of the proposed algorithm in terms of initial convergence.