Exploiting Pilot Mixtures in Coded Random Access
Abstract: The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices. In this letter, a technique is proposed to obtain full benefit from these "pilot mixtures" in presence of a base station with a massive number of antennas. The proposed technique consists of combining pilot mixtures with an intra-slot successive interference cancellation (SIC) algorithm, referred to as inner SIC, to increase the number of decoded messages per slot. In framed systems, the synergic effect of inner SIC and of an outer SIC algorithm across slots, typical of coded random access protocols, allows achieving a very high reliability with a low number of packet replicas per active user.
- G. Gui, M. Liu, F. Tang, N. Kato, and F. Adachi, “6G: Opening new horizons for integration of comfort, security, and intelligence,” IEEE Wireless Commun., vol. 27, no. 5, pp. 126–132, Oct. 2020.
- C. Kalalas and J. Alonso-Zarate, “Massive connectivity in 5G and beyond: Technical enablers for the energy and automotive verticals,” in Proc. 2020 2nd 6G Wireless Summit, Levi, Finland, Mar. 2020.
- J. Gao, W. Zhuang, M. Li, X. Shen, and X. Li, “MAC for machine-type communications in industrial IoT—Part I: Protocol design and analysis,” IEEE Internet of Things J., vol. 8, no. 12, pp. 9945–9957, Jun. 2021.
- S. R. Pokhrel, J. Ding, J. Park, O.-S. Park, and J. Choi, “Towards enabling critical mMTC: A review of URLLC within mMTC,” IEEE Access, vol. 8, pp. 131 796–131 813, Jul. 2020.
- G. Liva, “Graph-based analysis and optimization of contention resolution diversity slotted ALOHA,” IEEE Trans. Commun., vol. 59, no. 2, pp. 477–487, Feb. 2011.
- E. Paolini, Č. Stefanović, G. Liva, and P. Popovski, “Coded random access: Applying codes on graphs to design random access protocols,” IEEE Commun. Mag., vol. 53, no. 6, pp. 144–150, Jun. 2015.
- A. Munari, “Modern random access: An age of information perspective on irregular repetition slotted ALOHA,” IEEE Trans. Commun., vol. 69, no. 6, pp. 3572–3585, Jun. 2021.
- J. H. Sørensen, E. De Carvalho, Č. Stefanovic, and P. Popovski, “Coded pilot random access for massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 17, no. 12, pp. 8035–8046, Dec. 2018.
- L. Valentini, M. Chiani, and E. Paolini, “Massive grant-free access with massive MIMO and spatially coupled replicas,” IEEE Trans. Commun., vol. 70, no. 11, pp. 7337–7350, Nov. 2022.
- K. Senel, H. V. Cheng, E. Björnson, and E. G. Larsson, “What role can NOMA play in massive MIMO?” IEEE J. Sel. Topics Signal Process., vol. 13, no. 3, pp. 597–611, Jun. 2019.
- L. Liu, E. G. Larsson, W. Yu, P. Popovski, C. Stefanovic, and E. De Carvalho, “Sparse signal processing for grant-free massive connectivity: A future paradigm for random access protocols in the Internet of Things,” IEEE Signal Process. Mag., vol. 35, no. 5, pp. 88–99, Sep. 2018.
- A. T. Abebe and C. G. Kang, “MIMO-based reliable grant-free massive access with QoS differentiation for 5G and beyond,” IEEE J. Sel. Areas Commun., vol. 39, no. 3, pp. 773–787, Mar. 2021.
- X. Dai, T. Yan, Q. Li, H. Li, and X. Wang, “Pattern division random access (PDRA) for M2M communications with massive MIMO systems,” IEEE Trans. Veh. Technol., vol. 70, no. 12, Dec. 2021.
- G. Choudhury and S. Rappaport, “Diversity ALOHA-a random access scheme for satellite communications,” IEEE Trans. Commun., vol. 31, no. 3, pp. 450–457, Mar. 1983.
- E. Paolini, G. Liva, and M. Chiani, “Coded slotted ALOHA: A graph-based method for uncoordinated multiple access,” IEEE Trans. Inf. Theory, vol. 61, no. 12, pp. 6815–6832, Dec. 2015.
- L. Valentini, M. Chiani, and E. Paolini, “A joint PHY and MAC layer design for coded random access with massive MIMO,” in Proc. 2022 IEEE Global Commun. Conf., Rio di Janeiro, Brazil, Dec. 2022.
- K.-H. Ngo, A. G. i Amat, and G. Durisi, “Irregular repetition slotted ALOHA over the binary adder channel,” in Proc. 2023 IEEE Int. Conf. Commun., Rome, Italy, May 2023.
- L. Valentini, M. Chiani, and E. Paolini, “Interference cancellation algorithms for grant-free multiple access with massive MIMO,” IEEE Trans. Commun., 2023, to appear.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.