Phase and power estimation for per-hop multi-user detection in frequency-hopping systems

Qiu, David; Royster, Thomas C.; Block, Frederick J.

doi:10.1109/allerton.2013.6736640

Cited by 3 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed algorithm is also robust to the environment with relative velocity between 13 MSE performance and CRLB of the parameter θ of the virtual user in the ad hoc system with hopping asynchronous and symbol asynchronous communication nodes. Power of each interfering user is set to be 3 dB stronger than that of the desired user.…”

Section: Discussionmentioning

confidence: 99%

“…7. In this scenario, PH-MUD in [13] reverts to PH-SUD, which estimates the energy of the interference hop by hop. It is shown that the packet error rate (PER) of the ED is worse than that of the PH-MUD.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…In recent years, there has been effective work on improving the performance of frequency hopping systems [12][13][14], it was assumed that the receiver has full knowledge of hopping patterns of all users. This assumption requires additional coordination among users and is usually appropriated for a base station (BS)-mobile station (MS) scenario.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Joint interference estimation and cancellation for coherent frequency hopping multiple-access systems

Ren

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we propose an iterative detection algorithm that reconstructs and cancels the multiple-access interference jointly without the knowledge of hopping patterns of the interfering users for SFH/BPSK systems in an ad hoc scenario. Since users are asynchronous in this scenario, signal in one hop of the desired users is affected by partial signals in unaligned hops, called the interference fragments, of the interfering users. We address the interference model by defining a virtual user, which has the same hopping pattern as that of the desired user and contains the feature of the interfering fragments. Then, we derive the joint interference reconstruction and multiple-user detection (MUD) algorithm using the factor graph framework. Simulation results show that the performance of the proposed algorithm can be improved by up to 2 dB than that of the traditional single user detection (SUD) in AWGN at the packet error rate of 10 −2 for a total of 8 users over 20 hopping frequencies, and an outstanding performance may also be achieved in the channel with Doppler.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Simulation Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint interference estimation and cancellation for coherent frequency hopping multiple-access systems

Ren

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Equation (12) is proved to be ML estimation in [10] when no collision occurs. While under correlating, orthogonal pilots in synchronous hopping system can work well as there is only one user's signal, and non-orthogonal ones will bring interference, as a result of their unsatisfied cross-correlation.…”

Section: Multi-user Detectionmentioning

confidence: 96%

“…Capacity analysis of Per-Hop MUD (PH-MUD), with standard PSK modulation, was presented in [9] by Frederick J. Block, and then a feasible 2-user PH-MUD algorithm was proposed in [10]. In 2-user PH-MUD, joint set of possible modulated symbols are calculated, and hard decision is made to detect symbols of both users.…”

Section: Introductionmentioning

confidence: 99%

Per-Chip Multi-User Detection for SFH/BPSK Systems

Ren

2015

2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall)

View full text Add to dashboard Cite

In frequency-hopping systems, the multiple-access interference (MAI) occurs when more than one user appear on the same frequency at the same time. In this paper, we address the multi-user detection (MUD) problem for slow frequencyhopping (SFH) system with binary phase shift keying (BPSK). We first built a MAI model taking the hopping patterns and the phase offset into account, whereby the MAI is considered as independent yet unnecessarily identically distributed random variable. Under the proposed model, we further simplify the MAI by exploiting the Lyapunov central limit theorem and propose an iterative per-chip multiuser detection (PC-MUD) algorithm. By simulations, it's verified that the performance of proposed algorithm is near to the performance of single user bound in additive white Gaussian noise environment.

show abstract