Frequency-hop multiple-access systems with limited per-hop multi-user detection

Block, Frederick J.; Moore, Michael R.; Qiu, David; Royster, Thomas C.

doi:10.1109/aero.2013.6497130

Cited by 5 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each user employs different pilots. In SFH systems, the interference contains channel noise and MAI caused by collision, which is controllable if either orthogonal hopping patterns or max-n orthogonal set mentioned in [9] are employed. But the hopping patterns are not independent in these systems, so coordination is also required.…”

Section: A Signal Modelmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: A Signal Modelmentioning

confidence: 99%

“…However, these MUDs can not be used for coherent modulations, as their lacking of phase estimation. 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].…”

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

show abstract

“…Several MUD approaches have been considered for FH systems (e.g., [4], [5], [6], [7]). Limited per-hop MUD for FH [8] is of particular interest here. This is designed to handle a small number of colliding users on a each hop and was shown to provide a significant improvement in performance even when the receiver is capable of processing only two colliding users jointly.…”

Section: Introductionmentioning

confidence: 99%

Non-coherent multi-user detection of DPSK signals after differential demodulation

Qiu

Block

2013

2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Differential phase-shift keying (DPSK) is commonly associated with a loss in performance when compared to coherent demodulation of PSK signals. Because DPSK avoids the problem of phase tracking, the performance loss may be deemed acceptable. When two or more users transmit simultaneously, such as in a frequency-hopping (FH) system with non-orthogonal hopping patterns, single-user differential demodulation cannot guarantee selecting the most probable hard decision for each symbol.In this paper, we consider the performance when collisions occur. For our technique, we first derive the resulting signal constellation from performing differential demodulation. Conditioned on that, and assuming knowledge of phase difference between the users, the optimal multi-user detection (MUD) algorithm is derived and analyzed to bound the performance of non-coherent demodulation. Based on the analysis, a suboptimal 2-user MUD algorithm that requires no phase information is proposed and shown to attain significant performance improvement over single-user detection (SUD).

show abstract

“…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%

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

Frequency-hop multiple-access systems with limited per-hop multi-user detection

Cited by 5 publications

References 7 publications

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

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

Non-coherent multi-user detection of DPSK signals after differential demodulation

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

Contact Info

Product

Resources

About