Searcharxiv⌕ Search

arXiv subjects

Mohammad Kazemi

Publications and source records attributed to Mohammad Kazemi.

29 records · Page 2Linked to original sources

Unsourced Random Access Using Multiple Stages of Orthogonal Pilots: MIMO and Single-Antenna Structures

We study the problem of unsourced random access (URA) over Rayleigh block-fading channels with a receiver equipped with multiple antennas. We propose a slotted structure with multiple stages of orthogonal pilots, each of which is randomly picked from a codebook. In the proposed signaling structure, each user encodes its message using a polar code and appends it to the selected pilot sequences to construct its transmitted signal. Accordingly, the transmitted signal is composed of multiple orthogonal pilot parts and a polar-coded part, which is sent through a randomly selected slot. The performance of the proposed scheme is further improved by randomly dividing users into different groups each having a unique interleaver-power pair. We also apply the idea of multiple stages of orthogonal pilots to the case of a single receive antenna. In all the set-ups, we use an iterative approach for decoding the transmitted messages along with a suitable successive interference cancellation technique. The use of orthogonal pilots and the slotted structure lead to improved accuracy and reduced computational complexity in the proposed set-ups, and make the implementation with short blocklengths more viable. Performance of the proposed set-ups is illustrated via extensive simulation results which show that the proposed set-ups with multiple antennas perform better than the existing MIMO URA solutions for both short and large blocklengths, and that the proposed single-antenna set-ups are superior to the existing single-antenna URA schemes.

cs.IT↗

Over-the-Air Federated Edge Learning with Hierarchical Clustering

We examine federated learning (FL) with over-the-air (OTA) aggregation, where mobile users (MUs) aim to reach a consensus on a global model with the help of a parameter server (PS) that aggregates the local gradients. In OTA FL, MUs train their models using local data at every training round and transmit their gradients simultaneously using the same frequency band in an uncoded fashion. Based on the received signal of the superposed gradients, the PS performs a global model update. While the OTA FL has a significantly decreased communication cost, it is susceptible to adverse channel effects and noise. Employing multiple antennas at the receiver side can reduce these effects, yet the path-loss is still a limiting factor for users located far away from the PS. To ameliorate this issue, in this paper, we propose a wireless-based hierarchical FL scheme that uses intermediate servers (ISs) to form clusters at the areas where the MUs are more densely located. Our scheme utilizes OTA cluster aggregations for the communication of the MUs with their corresponding IS, and OTA global aggregations from the ISs to the PS. We present a convergence analysis for the proposed algorithm, and show through numerical evaluations of the derived analytical expressions and experimental results that utilizing ISs results in a faster convergence and a better performance than the OTA FL alone while using less transmit power. We also validate the results on the performance using different number of cluster iterations with different datasets and data distributions. We conclude that the best choice of cluster aggregations depends on the data distribution among the MUs and the clusters.

cs.LG↗

Mining Tourism Experience on Twitter: A case study

With the increase of digital data and social network platforms the impact of social media science in driving company decision related to product/service features and customer care operations is becoming more crucial. In particular, platform such as Twitter where people can share experience about almost everything can drastically impact the reputation and offering of a company as well as of a place or tourism site. Text mining tools are researched and proposed in literature in order to gain value and perform trend topics and sentiment analysis on Twitter. As data are the fuels for these models, the "right" ones, i.e the domain-related ones makes a difference on their accuracy. In this paper, we describe a pipeline of \textit{DataOps / MLOps} operations performed over a tourism related Twitter dataset in order to comprehend tourism motivation and interest. The gained knowledge can be exploit, by the travel/hospitality industry in order to develop data-driven strategic service, and by travelers which can consume relevant information about tourist destination.

cs.SI↗

Over-the-Air Federated Learning with Energy Harvesting Devices

We consider federated edge learning (FEEL) among mobile devices that harvest the required energy from their surroundings, and share their updates with the parameter server (PS) through a shared wireless channel. In particular, we consider energy harvesting FL with over-the-air (OTA) aggregation, where the participating devices perform local computations and wireless transmission only when they have the required energy available, and transmit the local updates simultaneously over the same channel bandwidth. In order to prevent bias among heterogeneous devices, we utilize a weighted averaging with respect to their latest energy arrivals and data cardinalities. We provide a convergence analysis and carry out numerical experiments with different energy arrival profiles, which show that even though the proposed scheme is robust against devices with heterogeneous energy arrivals in error-free scenarios, we observe a 5-10% performance loss in energy harvesting OTA FL.

cs.DC↗

Hierarchical Over-the-Air Federated Edge Learning

Federated learning (FL) over wireless communication channels, specifically, over-the-air (OTA) model aggregation framework is considered. In OTA wireless setups, the adverse channel effects can be alleviated by increasing the number of receive antennas at the parameter server (PS), which performs model aggregation. However, the performance of OTA FL is limited by the presence of mobile users (MUs) located far away from the PS. In this paper, to mitigate this limitation, we propose hierarchical over-the-air federated learning (HOTAFL), which utilizes intermediary servers (IS) to form clusters near MUs. We provide a convergence analysis for the proposed setup, and demonstrate through theoretical and experimental results that local aggregation in each cluster before global aggregation leads to a better performance and faster convergence than OTA FL.

cs.LG↗

Energy Efficiency Optimization for Device-to-Device Communication Underlaying Cellular Networks in Millimeter-Wave

This paper studies energy efficiency maximization in device-to-device (D2D) communications underlaying cellular networks in millimeter-wave (mm-wave) band. A stochastic geometry framework has been used to extract the results. First, cellular and D2D users are modeled by independent homogeneous Poisson point process; then, exact expressions for successful transmission probability of D2D and cellular users have been derived. Furthermore, the average sum rate and energy efficiency for a typical D2D scenario have been presented. An optimization problem subject to transmission power and quality of service constraints for both cellular and D2D users has been defined and energy efficiency of D2D communication is maximized. Simulation results reveal that by working in millimeter-wave, significant energy efficiency improvement can be attained, e.g., 20\% energy efficiency improvement compared to Rayleigh distribution in the practical scenarios by considering circuit power. Finally, to verify our analytical expressions, the simulation studies are carried out and the excellent agreements have been achieved.

eess.SP↗

Estimation of Inverse Weibull Distribution Under Type-I Hybrid Censoring

The hybrid censoring is a mixture of Type I and Type II censoring schemes. This paper presents the statistical inferences of the Inverse Weibull distribution when the data are Type-I hybrid censored. First we consider the maximum likelihood estimators of the unknown parameters. It is observed that the maximum likelihood estimators can not be obtained in closed form. We further obtain the Bayes estimators and the corresponding highest posterior density credible intervals of the unknown parameters under the assumption of independent gamma priors using the importance sampling procedure. We also compute the approximate Bayes estimators using Lindley's approximation technique. We have performed a simulation study and a real data analysis in order to compare the proposed Bayes estimators with the maximum likelihood estimators.

stat.OT↗

Robust Transceiver Design for Reciprocal M*N Interference Channel Based on Statistical Linearization Approximation

This paper focuses on robust transceiver design for throughput enhancement on the interference channel (IC), under imperfect channel state information (CSI). In this paper, two algorithms are proposed to improve the throughput of the multi-input multi-output (MIMO) IC. Each transmitter and receiver has respectively M and N antennas and IC operates in a time division duplex mode. In the first proposed algorithm, each transceiver adjusts its filter to maximize the expected value of signal-to-interference-plus-noise ratio (SINR). On the other hand, the second algorithm tries to minimize the variances of the SINRs to hedge against the variability due to CSI error. Taylor expansion is exploited to approximate the effect of CSI imperfection on mean and variance. The proposed robust algorithms utilize the reciprocity of wireless networks to optimize the estimated statistical properties in two different working modes. Monte Carlo simulations are employed to investigate sum rate performance of the proposed algorithms and the advantage of incorporating variation minimization into the transceiver design.

cs.IT↗

The Capacity of Degraded Cognitive Interference Channel with Unidirectional Destination Cooperation

Previous works established the capacity region for some special cases of discrete memoryless degraded cognitive interference channel (CIC) with unidirectional destination cooperation (UDC). In this letter, we characterize the capacity region of the general discrete memoryless degraded CIC-UDC. The obtained results imply that the capacity region is achieved by the Gel'fand-Pinsker coding at the cognitive transmitter, superposition coding at the primary transmitter and decode-and-forward at the relay. Furthermore, using this general result and a novel converse analysis, we establish the capacity of the Gaussian degraded CIC-UDC, which had been open until this work.

cs.IT↗

Estimation of P(X > Y ) for Weibull distribution based on hybrid censored samples

A Hybrid censoring scheme is mixture of Type-I and Type-II censoring schemes. Based on hybrid censored samples, this paper deals with the in- ference on R = P(X > Y ), when X and Y are two independent Weibull distributions with different scale parameters, but having the same shape pa- rameter. The maximum likelihood estimator (MLE), and the approximate MLE (AMLE) of R are obtained. The asymptotic distribution of the maxi- mum likelihood estimator of R is obtained. Based on the asymptotic distribu- tion, the confidence interval of R can be derived. Two bootstrap confidence intervals are also proposed. We consider the Bayesian estimate of R, and propose the corresponding credible interval for R. Monte Carlo simulations are performed to compare the different proposed methods. Analysis of a real data set has also been presented for illustrative purposes.

stat.OT↗

On the Cooperative Communication over Cognitive Interference Channel

In this paper, we investigate the problem of communication over cognitive interference channel (CIC) with partially cooperating (PC) destinations (CIC-PC). This channel consists of two source nodes communicating two independent messages to their corresponding destination nodes. One of the sources, referred to as the cognitive source, has a noncausal knowledge of the message of the other source, referred to as the primary source. Each destination is assumed to decode only its intended message. In addition, the destination corresponding to the cognitive source assists the other destination by transmitting cooperative information through a relay link. We derive a new upper bound on the capacity region of discrete memoryless CI-CPC. Moreover, we characterize the capacity region for two new classes of this channel: (1) degraded CIC-PC, and (2) a class of semideterministic CIC-PC.

cs.IT↗