Adaptive multiple stage K-best successive interference cancellation algorithm for MIMO detection

In this study, we propose a novel meta-heuristic optimization algorithm for joint peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. High PAPR not only complicates a distortion of a signal at the nonlinear high-power amplifier of a transmitter the design, but also in significant performance degradation. Tone injection (TI) scheme is a well-known PAPR reduction technique for OFDM systems. The key idea of the proposed method is a distortionless technique that can reduce PAPR significantly without data rate loss and does not require the extra side information. But unfortunately, in optimal TI-based OFDM systems, the PAPR reduction performance mainly requires an exhaustive search over all possible constellations, which is a hard optimization problem and potential problem for practical applications. To address this problem, an efficient scheme based on firefly algorithm is introduced to search over all combinations of possible permutations of the expanded constellation with low complexity and fast convergence. The simulation results reveal that our system can achieve good tradeoff between PAPR reduction performance and low computational complexity.     

基于博弈论功率控制的串行干扰消除算法

无线网络实现串行干扰消除算法可以提高网络吞吐量,在采用串行干扰消除算法的无线网络系统中,如何控制节点间传输功率使系统效用最大化是一个NP-Hard难题。针对此问题提出非合作博弈算法来解决节点间的传输功率控制,提出了串行干扰消除算法功率控制的非合作博弈,证明了纳什均衡,所提算法可以获得较高的无线网络吞吐量,仿真实验证实了分析结果并展示了算法的优越性。     

Asymptotic performance of successive interference cancellation in the context of linear precoded OFDM systems

Recent results on the asymptotic empirical eigenvalue distribution of random matrices have enabled the study of the asymptotic limits of linear precoded orthogonal frequency-division multiplexing systems with minimum mean-square error (MMSE) equalization. In this letter, we extend these results to the MMSE successive interference cancellation detector and quantify the nonlinearity gain for certain type of precoding matrices.     

Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications

The group decision feedback (GDF) detector is studied in this letter. Given the maximum group size, a grouping algorithm is proposed. It is shown that the proposed grouping algorithm maximizes the symmetric energy of the multiuser detection system. Furthermore, based on a set of lower bounds on asymptotic group effective energy (AGEE) of the GDF detector, it is shown that the proposed grouping algorithm, in fact, maximizes the AGEE lower bound for every group of users. The theoretical analysis of the grouping algorithm enables the offline estimation of the computational cost and the performance of a GDF detector. The computational complexity of a GDF detector is exponential in the largest size of the groups. Simulation results are presented to verify the theoretical conclusions. The results from this letter can be applied to the decision feedback detector by setting the maximum group size to one.     

A single antenna interference cancellation algorithm for increased gsm capacity

In mobile communications networks, system capacity is often limited by cochannel interference. Therefore, receiver algorithms for cancellation of cochannel interference have recently attracted much interest. At the mobile terminal, algorithms can usually rely only on one received signal delivered by a single receive antenna. In this letter, a low-complexity single antenna interference cancellation (SAIC) algorithm for real-valued modulation formats referred to as mono interference cancellation (MIC) is introduced which is well suited for practical applications. Field trials in commercial GSM networks using prototype terminals with the proposed MIC algorithm have demonstrated that the novel concept may yield capacity improvements of up to 80%. The underlying principle is also beneficial for adjacent channel interference and receivers with multiple antennas. Furthermore, in coverage-limited scenarios, there is no performance degradation compared with conventional receivers     

A new interpretation of the average matched filter for MSK-typereceivers

The minimum-mean-square-error approximation to a generalized minimum-shift-keying (MSK) signal using an offset quadrature phase-shift keying waveform with an elementary pulse, g(t), is considered. It is shown that the optimum shape of G(t), γ(t), coincides with the average pulse of the generalized MSK signal. Therefore, γ(-t) is the impulse response of the corresponding average matched fiber     

A successive cancellation algorithm for fetal heart-rate estimation using an intrauterine ECG signal

In this paper, we present a two-stage successive cancellation (SC) algorithm that sequentially separates fetal and maternal heartbeats from an intrauterine electrocardiogram (IuECG) signal containing both fetal and maternal QRS complexes. The ECG signal is modeled as a series of fetal, maternal, and noise events. Peak detection is first employed to locate the potential fetal and maternal QRS complexes, referred to as candidate events. Each stage automatically generates a template of a source from the candidate events in the initialization period, and thereafter performs classification of the remaining candidate events based on a template matching technique. The detected events of the stronger signal are subtracted from the composite ECG signal prior to initialization and classification of the weaker signal. Once the fetal and maternal complexes are successfully detected and separated, a counting mechanism is utilized to derive the corresponding heart rates. Computer simulation results on real IuECG data demonstrate the effectiveness of the SC algorithm.     

TH预编码的超奈奎斯特系统残余干扰消除算法

超奈奎斯特(Faster-Than-Nyquist, FTN)技术能够有效提高传输系统的频谱效率,然而代价是引入了严重的码间串扰(Inter-Symbol Interference, ISI)。在基于Ungerboeck模型的FTN系统中的发送端使用TH预编码(Tomlinson-Harashima Precoding, THP)并不能完全有效消除FTN系统所引入的ISI,会存在残余ISI。对此,针对FTN系统中的残余干扰提出了两种接收端检测算法,分别是基于后向串行干扰消除(Backward Serial Interference Cancellation, BSIC)的无迭代检测算法和基于连续干扰消除(Successive Interference Cancellation, SIC)的Turbo迭代均衡改进算法,并通过蒙特卡洛方法寻找最优的扩展取模间隔。计算机数值仿真结果表明,在选定的扩展取模间隔下,两种接收端检测算法在FTN系统的加速因子为0.8和0.9时均能有效消除FTN技术所引入的ISI,其误码率趋近于奈奎斯特正交传输性能。     

A simple algorithm for sidelobe cancellation in a partiallyadaptive linear array

It is argues that the far-field lobes of the edge elements of a uniformly excited linear array are nearly equal to the sidelobes of the array itself, and hence the edge elements are ideal for cancellation of specific sidelobes of the pattern. This supports the concept of partial adaptivity using only the edge elements. This technique is suitable for real-time implementation because only the edge elements require direct control; the inner elements are controlled by programmable read-only memories. Other advantages reported are: the nulls produced specifically by control of the edge elements are deep and wide, and the main-beam gain is not much affected by the sidelobe cancellation     

Performance of group ordered successive interference cancellation for multiuser detection in GSTBC SFH/MC DS‐CDMA system

In this paper, we present a novel group space‐time block coding slow frequency‐hopping multicarrier direct‐sequence code division multiple access (GSTBC SFH/MC DS‐CDMA) system over frequency selective fading channels. The proposed scheme greatly improves the bandwidth‐efficient through assigning the users employing the same frequency‐hopping (FH) pattern. Moreover, the users employing the same FH pattern are assigned into different virtual groups, in which the users are assigned to the different spreading codes, while the users are assigned to the same spreading code in the same virtual group. Then, a novel group detection scheme that we denote by group ordered successive interference cancellation (GOSIC) is presented to suppress the interference between the different virtual groups. Our proposed scheme consists of ordering group at the receiver side in order to maximize the overall system performance, and carrying BLAST‐STBC (LSTBC) detection for the users in the same virtual group. We define and derive the optimal group order based on the post group signal to interference plus noise ratio (PGSINR). We also propose another suboptimal group order in order to overcome the complexity issues. Finally, we compare the performance of our proposed GOSIC with conventional group successive interference cancellation (GSIC), conventional STBC multiuser detection (MUD), and LSTBC‐MUD, and show that significant improvement is introduced. Finally, it is shown that the proposed scheme is robust to the imperfect channel estimation. Copyright © 2006 John Wiley & Sons, Ltd.     

A NEW ALGORITHM FOR ADAPTIVE LATTICE FILTERAND ITS APPLICATION IN THE SPEECH LINEARPREDICTIVE SYNTHESIS

In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients.     

Joint power control and user scheduling for backbone-assisted industrial wireless networks with successive interference cancellation

In a backbone-assisted industrial wireless network (BAIWN), the technology of successive interference cancellation (SIC) based non-orthogonal multiple access (NOMA) provides potential solutions for improving the delay performance. Previous work emphasizes minimizing the transmission delay by user scheduling without considering power control. However, power control is beneficial for SIC-based NOMA to exploit the power domain and manage co-channel interference to simultaneously serve multiple user nodes with the high spectral and time resource utilization characteristics. In this paper, we consider joint power control and user scheduling to study the scheduling time minimization problem (STMP) with given traffic demands in BAIWNs. Specifically, STMP is formulated as an integer programming problem, which is NP-hard. To tackle the NP-hard problem, we propose a conflict graph-based greedy algorithm, to obtain a sub-optimal solution with low complexity. As a good feature, the decisions of power control and user scheduling can be made by the proposed algorithm only according to the channel state information and traffic demands. The experimental results show that compared with the other methods, the proposed method effectively improves the delay performance regardless of the channel states or the network scales.

     

A weighted least squares algorithm for quasi-equiripple FIR and IIRdigital filter design

It has been demonstrated by several authors that if a suitable frequency response weighting function is used in the design of a finite impulse response (FIR) filter, the weighted least squares solution is equiripple. The crux of the problem lies in the determination of the necessary least squares frequency response weighting function. A novel iterative algorithm for deriving the least squares frequency response weighting function which will produce a quasi-equiripple design is presented. The algorithm converges very rapidly. It typically produces a design which is only about 1 dB away from the minimax optimum solution in two iterations and converges to within 0.1 dB in six iterations. Convergence speed is independent of the order of the filter. It can be used to design filters with arbitrarily prescribed phase and amplitude response     

Multi‐group linear turbo equalization with intercell interference cancellation for MC‐CDMA cellular systems

In this paper, we investigate multi‐group linear turbo equalization using single antenna interference cancellation (SAIC) techniques to mitigate the intercell interference for multi‐carrier code division multiple access (MC‐CDMA) cellular systems. It is important for the mobile station to mitigate the intercell interference as the performance of the users close to cell edge is mainly degraded by the intercell interference. The complexity of the proposed iterative detector and receiver is low as the one‐tap minimum mean square error (MMSE) equalizer is employed for mitigating the intracell interference, while a simple group interference canceller is used for suppressing the intercell interference. Simulation results show that the proposed iterative detector and receiver can mitigate the intercell interference effectively through iterations for both uncoded and coded signals. Copyright © 2009 John Wiley & Sons, Ltd.     

SSOR preconditioned CG method for the linear interference cancellation of asynchronous CDMA systems

An ideal computation of the decorrelating or the linear minimum mean-squared-error (LMMSE) detector requires computational complexity of order K ³ when there K is the number of users. To alleviate the computational complexity, iterative decorrelating and LMMSE detectors are proposed for solving a set of linear equations corresponding to linear interference cancellation structures. Iterative conjugate gradient (CG) method has been used for the linear interference cancellation detectors. Its main advantages are to reduce the order of computation complexity and their suitability to highly parallel implementations. In this paper, the symmetric successive overrelaxation (SSOR) preconditioning scheme is applied to the CG method. The performance of the detectors is investigated and it is found that the SSOR preconditioned CG method can provide significantly faster convergence than CG method.     

Analysis of the adaptive matched filter algorithm for cases withmismatched clutter statistics

In the majority of adaptive radar detection algorithms, the covariance matrix for the clutter plus noise is estimated using samples taken from range cells surrounding the test cell. In a nonhomogeneous environment, this can lead to a mismatch between the mean of the estimated covariance matrix and the true covariance matrix for the test cell. Closed-form expressions are provided, which give the performance for such cases when the popular adaptive matched filter algorithm is used. The expressions are exact in some cases and provide useful approximations in others. To simplify the analysis, the samples from the surrounding range cells are assumed to be independent and identically distributed (i.i.d.), and these samples are assumed to be independent from the sample taken from the test cell. The performance depends on a small number of important parameters. These parameters describe which types of mismatches are important and which are not. Numerical examples are provided to illustrate how performance varies with each of the important parameters. Monte Carlo simulations are included that closely match the predictions of our equations. An airborne radar example is provided that demonstrates that covariance matrix mismatch can have a significant effect on performance in some practical cases     

Performance analysis of linear joint equalization and multiple access interference cancellation for multitone CDMA

In [18] the combination of multitone modulation with direct sequence spectrum spreading has been introduced. The performance of a correlation receiver with diversity has been evaluated for a multipath channel in the presence of a multiple access interference (MAI) using the Gaussian assumption. In the present paper we analyze the problem of joint equalization and cancellation of the multipath and multiple access interferences for these multitone CDMA (Code Division Multiple Access) systems. A linear structure is first investigated for a mean square error (MSE) criterion. In order to understand the potential of the system we study the steady-state behavior of the joint equalizer-canceler. The investigation is carried out for a joint device following a bank of matched filters and assuming perfect carrier phase and timing recovery. An exact expression for the bit error probability of BPSK symbols before and after cancellation, is obtained in the form of an integral The performance of the joint device is investigated for different types of channels. The resistance to the near-far effect is also demonstrated. Then adaptive structures are derived from a least square approach. Their performance is demonstrated by means of computer simulations.This author would like to thank the Belgian NSF for its financial support.This author would like to thank the Belgian IRSIA for its financial support.     

一种病态线性系统求解的新算法

本文提出了一种病态线性系统求解的新算法,该算法将原线性系统求解的问题转化为极小值点的最优化问题,借助不对分寻优法进行迭代求解,并结合引入的伪误差来解决当方程组阶数非常大时出现的误差积累问题。文末算例实验表明,本文算法对于良态线性系统、病态线性系统均有较好的求解效果。该算法为病态线性系统利用计算机迭代求解提供了直接的参考方法。