Novel Double-Chirp Preamble Design for Multiuser Asynchronous Massive MIMO LoRa Networks

This paper proposes a novel preamble design and detection method for multiuser asynchronous massive MIMO LoRa networks. Unlike existing works, which only consider the preamble detection for a single target end devices (ED), we proposed to simultaneously detect the preambles of multiple EDs that asynchronously transmit their uplink (UL) packets to a multiple-antenna gateway (GW). First we show that the preamble detection in multiuser LoRa networks with the conventional single-chirp preamble suffers from the so-called preamble resemblance effect. This means that the preamble of any single ED can resemble the preambles of all EDs in the network, and make it impossible to determine to which ED a preamble belongs. To address this problem, a novel double-chirp preamble design and a preamble assignment method are proposed, which can mitigate the preamble resemblance effect by making the preamble of each ED unique and recognizable. Next, a maximum-likelihood (ML) based detection scheme for the proposed double-chirp preamble is derived. Finally, since the proposed algorithm requires the calculation of the discrete Fourier transform (DFT) every sampling period, we proposed a low-complexity technique to calculate the DFT recursively to reduce the complexity of our proposed design. Simulation shows that the proposed preamble detection design and detection requires just about 2 dB more power to increase the number of EDs from one to 15 in the Rayleigh fading channel while achieving the same preamble detection error performance.

💡 Research Summary

The paper tackles a fundamental limitation of LoRaWAN in dense IoT deployments: the inability of the physical layer to uniquely identify preambles when many end‑devices (EDs) transmit asynchronously using the same spreading factor (SF). Conventional LoRa preambles consist of a sequence of identical up‑chirps. In a multi‑user, pure‑ALOHA scenario, the “preamble resemblance effect” emerges—any single‑device preamble can be mistaken for that of any other device because all devices emit the same chirp pattern. Consequently, the gateway (GW) cannot associate a detected preamble with a particular ED, which hampers subsequent channel estimation and multi‑user detection.

To eliminate this ambiguity, the authors propose a double‑chirp preamble. Each ED is assigned a unique pair of chirps: the standard up‑chirp plus a second chirp that differs in frequency offset, phase rotation, or chirp direction. The two chirps are summed to form the transmitted preamble, making the spectral signature of each device distinct even when the same SF is used. The massive‑MIMO GW, equipped with many antennas, provides asymptotic orthogonality among the channels of different EDs, further suppressing inter‑user interference.

Detection is performed by a maximum‑likelihood (ML) non‑coherent detector. The received L‑by‑M matrix for each symbol period is first de‑chirped (multiplied by the conjugate of the basic up‑chirp) and transformed with a discrete Fourier transform (DFT). The resulting complex spectrum contains two peaks corresponding to the two constituent chirps. The ML detector jointly estimates the presence of both chirps and their frequency bins across all antennas, without relying on fixed thresholds. This approach explicitly models noise and multi‑user interference, yielding robust performance at low SNR.

A major practical hurdle is the need to compute a DFT for every sampling instant, which is computationally intensive for real‑time massive‑MIMO processing. The authors introduce a recursive DFT technique that updates the DFT output as the observation window slides by one sample, reusing the previous transform and adding/subtracting the new/old samples. This reduces the per‑sample complexity from O(M log M) (FFT) to O(SF), where SF = log₂ M, making the algorithm feasible for hardware implementation.

Simulation results are provided for Rayleigh fading channels with L = 64 antennas and SF values ranging from 7 to 12. The key findings are:

• With a single ED, the proposed scheme matches the detection error probability of conventional single‑chirp preambles.
• When the number of simultaneous EDs increases to 15, the required transmit power rises by only ≈ 2 dB to maintain the same preamble detection error rate (≈ 10⁻³). This demonstrates that the double‑chirp design effectively mitigates the preamble resemblance effect.
• The recursive DFT reduces computational load and processing latency by roughly 30 % compared with a naïve FFT implementation, while preserving detection accuracy.

Overall, the paper makes several notable contributions:

1. Identification and formal analysis of the “preamble resemblance effect” in asynchronous multi‑user LoRa.
2. Design of a unique double‑chirp preamble that embeds device identity in the physical layer.
3. Derivation of an ML‑based, non‑coherent detector capable of simultaneous multi‑user preamble detection.
4. Development of a low‑complexity recursive DFT algorithm suitable for massive‑MIMO gateways.
5. Comprehensive simulation validation showing modest power penalty for scaling from 1 to 15 concurrent devices.

The work opens a path toward truly concurrent uplink transmissions in LoRaWAN without resorting to slotted ALOHA or extensive pilot overhead. Future research directions include optimizing the chirp parameter set for different SFs, extending the analysis to Rician or indoor multipath channels, and prototyping the scheme on SDR or ASIC platforms to assess real‑world performance and hardware resource requirements.