The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The compressive sensing-based random access may get impacted largely by other cell interference (OCI), which may shatter the sparsity of the received signal model unless the signature space assignment among interfering cells is carefully handled. In this paper, we investigate the performance of multi-sequence spreading-based random access (MSRA) scheme under multi-cell environment. In particular,...
In this paper, we introduce a comprehensive grant-free random access scheme for machine-type communication which is characterized by massive connectivity and low latency. The scheme presented in here is comprehensive in a sense that, synchronization, channel estimation, and users identification & data detection (multi-user detection) are performed all in a single shot. The scheme employs compressive...
Synchronization, channel estimation, and multi- user detection (MUD) can be performed in a single shot for a comprehensive grant-free access [1]. The scheme employs compressive sensing by exploiting two sparse phenomena: sparsity in users' activity and sparsity in channel delay spread. The performance of compressive sensing based schemes should be thoroughly studied in a multi-cell environment as...
In multiple measurement vectors (MMV) problems, the sparsity structure, i.e., the support of the measurement vectors, remains constant for multiple instants. For machine type communication (MTC) context, this sparsity structure may remain constant over all symbols in a frame, which can be termed as frame-wise sparsity. Instead of employing symbol-by-symbol detection based on algorithms such as orthogonal...
In this paper, we present a scheme to overlay machine-to-machine (M2M) traffic over human-to-human (H2H) communication under an orthogonal frequency division multiple access (OFDMA) framework. An intermittent short burst of M2M traffic is considered with a massive number of devices attempting to access the network. The proposed scheme solves the random access channel (RACH) congestion problem by allowing...
In this paper, we present a new structure for compressive sensing(CS)-based random access (RA) scheme for machine-type communications (MTC). In the proposed scheme, we consider a one-shot transmission in which users transmit their packets right away by spreading them with multiple spreading sequences (MS) over a frame without waiting for scheduling grant from the base station. The scheme is designed...
This paper presents a compressive sensing (CS)-based one-shot random access (RA) scheme for massive and delay-intolerant machine-type communication (MTC). Furthermore, an iterative order recursive least square (IORLS)-based orthogonal matching pursuit (OMP) decoding algorithm is employed for high accuracy and low decoding complexity. By employing IORLS, it has been shown that near oracle detection,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.