• arXiv.cs.IT Pub Date : 2020-07-06
Yingkai Ouyang; Narayanan Rengaswamy

Quantum metrology (QM) is expected to be a prominent use-case of quantum technologies. However, noise easily degrades these quantum probe states, and negates the quantum advantage they would have offered in a noiseless setting. Although quantum error correction (QEC) can help tackle noise, fault-tolerant methods are too resource intensive for near-term use. Hence, a strategy for (near-term) robust

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Qingqing Wu; Shuowen Zhang; Beixiong Zheng; Changsheng You; Rui Zhang

Intelligent reflecting surface (IRS) is an enabling technology to engineer the radio signal prorogation in wireless networks. By smartly tuning the signal reflection via a large number of low-cost passive reflecting elements, IRS is capable of dynamically altering wireless channels to enhance the communication performance. It is thus expected that the new IRS-aided hybrid wireless network comprising

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06

We propose two-stage adaptive pooling schemes, 2-STAP and 2-STAMP, for detecting COVID-19 using real-time reverse transcription quantitative polymerase chain reaction (RT-qPCR) test kits. Similar to the Tapestry scheme of Ghosh et al., the proposed schemes leverage soft information from the RT-qPCR process about the total viral load in the pool. This is in contrast to conventional group testing schemes

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Matthias Frey; Igor Bjelakovic; Slawomir Stanczak

Motivated by various applications in distributed Machine Learning (ML) in massive wireless sensor networks, this paper addresses the problem of computing approximate values of functions over the wireless channel and provides examples of applications of our results to distributed training and ML-based prediction. The over-the-air'' computation of a function of data captured at different wireless devices

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Yifan Gu; Qian Wang; He Chen; Yonghui Li; Branka Vucetic

This paper considers a two-hop status update system, in which an information source aims for the timely delivery of status updates to the destination with the aid of a relay. The relay is assumed to be an energy-constraint device and our goal is to devise scheduling policies that adaptively switch between the information decoding and information forwarding to minimize the long-term average Age-of-Information

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Fang Liu; Wei-Guo Zhang

This paper reports a modified axiomatic foundation of the analytic hierarchy process (AHP), where the reciprocal property of paired comparisons is broken. The novel concept of reciprocal symmetry breaking is proposed to characterize the considered situation without reciprocal property. It is found that the uncertainty experienced by the decision maker can be naturally incorporated into the modified

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-05
Alexander A. Davydov; Stefano Marcugini; Fernanda Pambianco

The weight of a coset of a code is the smallest Hamming weight of any vector in the coset. For a linear code of length $n$, we call integral weight spectrum the overall numbers of weight $w$ vectors, $0\le w\le n$, in all the cosets of a fixed weight. For maximum distance separable (MDS) codes, we obtained new convenient formulas of integral weight spectra of cosets of weight 1 and 2. Also, we give

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-05
Maryam Farahnak-Ghazani; Mahtab Mirmohseni; Masoumeh Nasiri-Kenari

The concentration of molecules in the medium can provide us very useful information about the medium. In this paper, we use this information and design a molecular flow velocity meter using a molecule releasing node and a receiver that counts these molecules. We first assume $M$ hypotheses according to $M$ possible medium flow velocity values and an $L$-sample decoder at the receiver and obtain the

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-05
Bruno Bauwens; Marius Zimand

Consider a channel that is capable of corrupting the data that is transmitted through it. In its standard form, the channel coding problem asks for an encoding function mapping messages to codewords that makes communication over the given channel resilient to a given noise level. This means that when a codeword is sent over the channel, the receiver is able to recover it from a noisy version, provided

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-05
Wenchao Xia; Tony Q. S. Quek; Kun Guo; Wanli Wen; Howard H. Yang; Hongbo Zhu

By exploiting the computing power and local data of distributed clients, federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. However, latency caused by hundreds to thousands of communication

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Bruno Mera; Paulo Mateus; Alexandra M. Carvalho

Model complexity plays an essential role in its selection, namely, by choosing a model that fits the data and is also succinct. Two-part codes and the minimum description length have been successful in delivering procedures to single out the best models, avoiding overfitting. In this work, we pursue this approach and complement it by performing further assumptions in the parameter space. Concretely

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-04
Emre Ozfatura; Sennur Ulukus; Deniz Gunduz

Coded computation techniques provide robustness against straggling workers in distributed computing. However, most of the existing schemes require exact provisioning of the straggling behaviour and ignore the computations carried out by straggling workers. Moreover, these schemes are typically designed to recover the desired computation results accurately, while in many machine learning and iterative

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Xinliang Zhang; Mojtaba Vaezi

This paper introduces a unified deep neural network (DNN)-based precoder for two-user multiple-input multiple-output (MIMO) networks with five objectives: data transmission, energy harvesting, simultaneous wireless information and power transfer, physical layer (PHY) security, and multicasting. First, a rotation-based precoding is developed to solve the above problems independently. Rotation-based

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-06
Derek Anderson; Matthew Deardorff; Timothy Havens; Siva Kakula; Timothy Wilkin; Muhammad Islam; Anthony Pinar; Andrew Buck

The fuzzy integral is a powerful parametric nonlin-ear function with utility in a wide range of applications, from information fusion to classification, regression, decision making,interpolation, metrics, morphology, and beyond. While the fuzzy integral is in general a nonlinear operator, herein we show that it can be represented by a set of contextual linear order statistics(LOS). These operators

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-05
Marc Harper; Joshua Safyan

We combine momentum from machine learning with evolutionary dynamics, where momentum can be viewed as a simple mechanism of intergenerational memory. Using information divergences as Lyapunov functions, we show that momentum accelerates the convergence of evolutionary dynamics including the replicator equation and Euclidean gradient descent on populations. When evolutionarily stable states are present

更新日期：2020-07-07
• arXiv.cs.IT Pub Date : 2020-07-03
Jiayu Zhang; Min Li; Shihao Yan; Chunshan Liu; Xihan Chen; Minjian Zhao; Philip Whiting

Covert communication prevents legitimate transmission from being detected by a warden while maintaining certain covert rate at the intended user. Prior works have considered the design of covert communication over conventional low-frequency bands, but few works so far have explored the higher-frequency millimeter-wave (mmWave) spectrum. The directional nature of mmWave communication makes it attractive

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-02
Omer Waqar; Hina Tabassum; Raviraj Adve

In this correspondence, we consider an amplify-and-forward relay network in which relayed information is overheard by an eavesdropper. In order to confound the eavesdropper, a wireless-powered jammer is also considered which harvests energy from a multiple-antenna source. We proposed a new secure beamforming scheme in which beamforming vector is a linear combination of the energy beamforming (EB) and

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-02
Oliver Gebhard; Oliver Johnson; Philipp Loick; Maurice Rolvien

The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test several individuals together. In an idealized setting, a test is positive if and only if at least one infected individual is included and negative otherwise. Significant progress was made in recent years towards understanding

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-03
Hedongliang Liu; Nikita Polyanskii; Ilya Vorobyev; Antonia Wachter-Zeh

In this work, we introduce a natural notion concerning vector finite spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$ is called almost affinely disjoint if any $(k+1)$-dimensional subspace containing a subspace from the family non-trivially intersects with only a few subspaces from the family. The central question discussed in the paper is the polynomial growth (in $q$) of the maximal

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-03
Anis Elgabli; Jihong Park; Chaouki Ben Issaid; Mehdi Bennis

Wireless connectivity is instrumental in enabling scalable federated learning (FL), yet wireless channels bring challenges for model training, in which channel randomness perturbs each worker's model update while multiple workers' updates incur significant interference under limited bandwidth. To address these challenges, in this work we formulate a novel constrained optimization problem, and propose

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-03

If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes represent a subclass of topological quantum codes. In this article, we introduce {thirteen} new classes of quantum codes. These codes are associated with the following:

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-03
Haotian Jiang

Given a separation oracle $\mathsf{SO}$ for a convex function $f$ that has an integral minimizer inside a box with radius $R$, we show how to efficiently find a minimizer of $f$ using at most $O(n (n + \log(R)))$ calls to $\mathsf{SO}$. When the set of minimizers of $f$ has integral extreme points, our algorithm outputs an integral minimizer of $f$. This improves upon the previously best oracle complexity

更新日期：2020-07-06
• arXiv.cs.IT Pub Date : 2020-07-02
Matthew Bliss; Nicolò Michelusi

This paper investigates the adaptive trajectory and communication scheduling design for an unmanned aerial vehicle (UAV) relaying random data traffic generated by ground nodes to a base station. The goal is to minimize the expected average communication delay to serve requests, subject to an average UAV mobility power constraint. It is shown that the problem can be cast as a semi-Markov decision process

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Carlos Galindo; Fernando Hernando; Diego Ruano

Entanglement-assisted quantum error correcting codes (EAQECCs) from Reed-Solomon codes and BCH codes are considered in this work. It is provided a complete and explicit formula for the parameters of an EAQECC coming from any Reed-Solomon code, for the Hermitian metric, and from any BCH code with extension degree 2 and consecutive cyclotomic cosets, for both the Euclidean and the Hermitian metric. The

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Jide Yuan; Elisabeth De Carvalho; Petar Popovski

A novel frequency modulating reflecting intelligent surface (FM-RIS)-aided system has been proposed in this paper. In contrast with conventional RIS, elements over FM-RIS continuously manipulate phases of incident signals, and act as frequency modulators with a given frequency. Therefore, the signal received at FM-RIS is spread and transmit over a new frequency band uniquely associated to the surface

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Wei Chen; Zunwei Fu; Loukas Grafakos; Yue Wu

We provide a double encryption algorithm that uses the lack of invertibility of the fractional Fourier transform (FRFT) on $L^{1}$. One encryption key is a function, which maps a "good" $L^{2}(\mathbb{R})$ signal to a "bad" $L^{1}(\mathbb{R})$ signal. The FRFT parameter which describes the rotation associated with this operator on the time-frequency plane provides the other encryption key. With the

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Qingheng Song; Yong Zeng; Jie Xu; Shi Jin

Unmanned aerial vehicle (UAV) communications have attracted significant attention from both academia and industry. To facilitate the large-scale usage of UAVs for various applications in practice, we provide a comprehensive survey on the prototype and experiment for UAV communications. To this end, we first provide an overview on the general architecture of the prototype and experiment for UAV communications

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Yali Chen; Bo Ai; Hongliang Zhang; Yong Niu; Lingyang Song; Zhu Han; H. Vincent Poor

With the evolution of the 5G, 6G and beyond, device-to-device (D2D) communication has been developed as an energy-, and spectrum-efficient solution. In cellular network, D2D links need to share the same spectrum resources with the cellular link. A reconfigurable intelligent surface (RIS) can reconfigure the phase shifts of elements and create favorable beam steering, which can mitigate aggravated interference

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Meilin GaoSherman; Bo AiSherman; Yong NiuSherman; Wen WuSherman; Peng YangSherman; Feng LyuSherman; XueminSherman; Shen

Future railway is expected to accommodate both train operation services and passenger broadband services. The millimeter wave (mmWave) communication is a promising technology in providing multi-gigabit data rates to onboard users. However, mmWave communications suffer from severe propagation attenuation and vulnerability to blockage, which can be very challenging in high-speed railway (HSR) scenarios

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Kai Wan; Hua Sun; Mingyue Ji; Daniela Tuninetti; Giuseppe Caire

Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users' local caches. The seminal work on coded caching by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain, in addition to the known local caching gain in uncoded systems, when users aim to retrieve a single file from the library. This paper formulates a novel

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Junbeom Kim; Hoon Lee; Seung-Eun Hong; Seok-Hwan Park

This letter studies deep learning (DL) approaches to optimize beamforming vectors in downlink multi-user multi-antenna systems that can be universally applied to arbitrarily given transmit power limitation at a base station. We exploit the sum power budget as side information so that deep neural networks (DNNs) can effectively learn the impact of the power constraint in the beamforming optimization

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Waleed Raza; Xuefei Ma; Amir Ali; Zubair Ali Shah; Ghazanfar Mehdi

In this article we research about underwater acoustics transceivers. As Underwater acoustic transceivers consume more power than Radio frequency transceivers. The techniques which are being utilized in radio frequency cannot be implemented directly in underwater acoustic system it needs to be re investigated to design new methods. To achieve reliable acoustic data transmission new techniques should

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Markus Grassl

Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that pre-shared entanglement between sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement. Subsequently, the same authors derived a version of the so-called quantum Singleton bound that relates the parameters of the entanglement-assisted quantum-error

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-02
Tian Li; Ahmad Beirami; Maziar Sanjabi; Virginia Smith

Empirical risk minimization (ERM) is typically designed to perform well on the average loss, which can result in estimators that are sensitive to outliers, generalize poorly, or treat subgroups unfairly. While many methods aim to address these problems individually, in this work, we explore them through a unified framework---tilted empirical risk minimization (TERM). In particular, we show that it

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-06-29

Cellular vehicle-to-everything (V2X) communication is expected to herald the age of autonomous vehicles in the coming years. With the integration of blockchain in such networks, information of all granularity levels, from complete blocks to individual transactions, would be accessible to vehicles at any time. Specifically, the blockchain technology is expected to improve the security, immutability

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-01
Dominik Janzing; Patrick Blöbaum; Lenon Minorics

We introduce 'Causal Information Contribution (CIC)' and 'Causal Variance Contribution (CVC)' to quantify the influence of each variable in a causal directed acyclic graph on some target variable. CIC is based on the underlying Functional Causal Model (FCM), in which we define 'structure preserving interventions' as those that act on the unobserved noise variables only. This way, we obtain a measure

更新日期：2020-07-03
• arXiv.cs.IT Pub Date : 2020-07-01
Nuh Aydin; Thomas Guidotti; Peihan Liu

One of the most important and challenging problems in coding theory is to determine the optimal values of the parameters of a linear code and to explicitly construct codes with optimal parameters, or as close to the optimal values as possible. The class of quasi-twisted (QT) codes has been very promising in this regard. Over the past few decades various search algorithms to construct QT codes with

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Jesy Pachat; Nujoom Sageer Karat; Deepthi P. P.; B. Sundar Rajan

Vehicle to Vehicle (V2V) communication phase is an integral part of collaborative message dissemination in vehicular ad-hoc networks (VANETs). In this work, we apply index coding techniques to reduce the number of transmissions required for data exchange. The index coding problem has a sender, which tries to meet the demands of several receivers in a minimum number of transmissions. All these receivers

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Qiuyun Zou; Haochuan Zhang; Hongwen Yang

In this paper, we extend the bilinear generalized approximate message passing (BiG-AMP) approach, originally proposed for high-dimensional generalized bilinear regression, to the multi-layer case for the handling of cascaded matrix-factorization problems arising in relay communications among others. Assuming statistically independent matrix entries with known priors, we derive a new algorithm called

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Kai Wan; Hua Sun; Mingyue Ji; Giuseppe Caire

This paper formulates a distributed computation problem, where a master asks $N$ distributed workers to compute a linearly separable function. The task function can be expressed as $K_c$ linear combinations to $K$ messages, where each message is a function of one dataset. Our objective is to find the optimal tradeoff between the computation cost (number of datasets assigned to each worker) and the

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Anil Kurt; Gokhan Muzaffer Guvensen

In this paper, adaptive hybrid beamforming methods are proposed for millimeter-wave range massive multiple-input-multiple-output (MIMO) systems considering single carrier wideband transmission in uplink data mode. A statistical analog beamformer is adaptively constructed in slow-time, while the channel is time-varying and erroneously estimated. A recursive filtering approach is proposed, which aims

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Washim Uddin Mondal; Goutam Das

This letter characterizes the exact distribution function of a typical Voronoi area in a $K$-tier Poisson network. The users obey a generalized association (GA) rule, which is a superset of nearest base station association and maximum received power based association (with arbitrary fading) rules that are commonly adopted in the literature. Combining the Robbins' theorem and the probability generating

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Wanchun Liu; Girish Nair; Yonghui Li; Dragan Nesic; Branka Vucetic; H. Vincent Poor

Wireless networked control systems (WNCSs) provide a key enabling technique for Industry Internet of Things (IIoT). However, in the literature of WNCSs, most of the research focuses on the control perspective, and has considered oversimplified models of wireless communications which do not capture the key parameters of a practical wireless communication system, such as latency, data rate and reliability

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Hua Wang; Yachong Yang; Weijie J. Su

In high-dimensional linear regression, would increasing effect sizes always improve model selection, while maintaining all the other conditions unchanged (especially fixing the sparsity of regression coefficients)? In this paper, we answer this question in the \textit{negative} in the regime of linear sparsity for the Lasso method, by introducing a new notion we term effect size heterogeneity. Roughly

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Harald Bayerlein; Mirco Theile; Marco Caccamo; David Gesbert

Autonomous deployment of unmanned aerial vehicles (UAVs) supporting next-generation communication networks requires efficient trajectory planning methods. We propose a new end-to-end reinforcement learning (RL) approach to UAV-enabled data collection from Internet of Things (IoT) devices in an urban environment. An autonomous drone is tasked with gathering data from distributed sensor nodes subject

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-06-26
Frédéric BarbarescoIMB; Yann CabanesIMB

The aim is to describe new geometric approaches to define the statistics of spatio-temporal and polarimetric measurements of the states of an electromagnetic wave, using the works of Maurice Fr{\'e}chet, Jean-Louis Koszul and Jean-Marie Souriau, with in particular the notion of 'average' state of this digital measurement as a Fr{\'e}chet barycentre in a metric space and a model derived from statistical

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Yujie Qin; Mustafa A. Kishk; Mohamed-Slim Alouini

Unmanned aerial vehicles (UAVs) can be used as flying base stations (BSs) to offload Macro-BSs in hotspots. However, due to the limited battery on-board, UAVs can typically stay in operation for less than 1.5 hours. Afterward, the UAV has to fly back to a dedicated charging station that recharges/replaces the UAV's battery. In this paper, we study the performance of a UAV-enabled cellular network while

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-07-01
Alessandro Brighente; Jafar Mohammadi; Paolo Baracca

The strict latency and reliability requirements of ultra-reliable low-latency communications (URLLC) use cases are among the main drivers in fifth generation (5G) network design. Link adaptation (LA) is considered to be one of the bottlenecks to realize URLLC. In this paper, we focus on predicting the signal to interference plus noise ratio at the user to enhance the LA. Motivated by the fact that

更新日期：2020-07-02
• arXiv.cs.IT Pub Date : 2020-06-30
Iwan Duursma; Hsin-Po Wang

An $(n, k, d, \alpha)$-MSR (minimum storage regeneration) code is a set of $n$ nodes used to store a file. For a file of total size $k\alpha$, each node stores $\alpha$ symbols, any $k$ nodes recover the file, and any $d$ nodes can repair any other node via each sending out $\alpha/(d-k+1)$ symbols. In this work, we explore various ways to re-express the infamous product-matrix construction using skew-symmetric

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-28
Jiahui Chen; Xiaowen You; Youlong Wu; Haoyu Yin

We consider cache-aided broadcast networks with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. A new definition of transmission delay is introduced to characterize the latency cost during the delivery phase for arbitrary cache-aided networks. We investigate the deterministic caching and decentralized random caching

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Heunchul Lee; Maksym Girnyk; Jaeseong Jeong

In this paper, we propose a deep reinforcement learning (RL)-based precoding framework that can be used to learn an optimal precoding policy for complex multiple-input multiple-output (MIMO) precoding problems. We model the precoding problem for a single-user MIMO system as an RL problem in which a learning agent sequentially selects the precoders to serve the environment of MIMO system based on contextual

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Shuo Shao; Jesús Gómez-Vilardebó; Kai Zhang; Chao Tian

Caching is a technique to reduce the communication load in peak hours by prefetching contents during off-peak hours. An information-theoretic framework for coded caching was introduced by Maddah-Ali and Niesen in a recent work, where it was shown that significant improvement can be obtained compared to uncoded caching. Considerable efforts have been devoted to identify the precise information-theoretic

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Vaibhav Kumar; Barry Cardiff; Shankar Prakriya; Mark F. Flanagan

Non-orthogonal multiple access (NOMA) is a potential candidate to further enhance the spectrum utilization efficiency in beyond fifth-generation (B5G) standards. However, there has been little attention on the quantification of the delay-limited performance of downlink NOMA systems. In this paper, we analyze the performance of a two-user downlink NOMA system over generalized {\alpha}-{\mu} fading in

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Salman Khalid; Waqas bin Abbas; Farhan Khalid; Michele Zorzi

A hybrid architecture for millimeter wave (mmW) massive MIMO systems is considered practically implementable due to low power consumption and high energy efficiency. However, due to the limited number of RF chains, user selection becomes necessary for such architecture. Traditional user selection algorithms suffer from high computational complexity and, therefore, may not be scalable in 5G and beyond

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-27
Rishabh Iyer; Jeff Bilmes

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit polynomial-time algorithms for minimization, both of which are fundamental characteristics of convex functions. Submodular functions also show signs similar to concavity

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Hengtao He; Rui Wang; Shi Jin; Chao-Kai Wen; Geoffrey Ye Li

Terahertz (THz)-band communications have been one of the promising technologies for future wireless networks that integrate a wide range of data-demanding applications. To compensate for the large channel attenuation in THz band and avoid high hardware cost, a lens-based beamspace massive multiple-input multiple-output (MIMO) system is considered. However, the beam squint effect appeared in wideband

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Yuan Quan; Longfei Shi; Jialei Liu; Jiazhi Ma

Radar detection and communication can be operated simultaneously in joint radar-communication (JRC) system. In this paper, we propose a bistatic JRC system which is applicable in multi-path environments. Basing on a novel joint waveform, a joint detection process is designed for both target detection and channel estimation. Meanwhile, a low-cost channel equalization method that utilizes the channel

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-30
Hassan SaberSEQUEL; Pierre MénardSEQUEL; Odalric-Ambrym MaillardSEQUEL

We consider a multi-armed bandit problem specified by a set of Gaussian or Bernoulli distributions endowed with a unimodal structure. Although this problem has been addressed in the literature (Combes and Proutiere, 2014), the state-of-the-art algorithms for such structure make appear a forced-exploration mechanism. We introduce IMED-UB, the first forced-exploration free strategy that exploits the

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-29
Arya Mazumdar; Soumyabrata Pal

Mixture of linear regressions is a popular learning theoretic model that is used widely to represent heterogeneous data. In the simplest form, this model assumes that the labels are generated from either of two different linear models and mixed together. Recent works of Yin et al. and Krishnamurthy et al., 2019, focus on an experimental design setting of model recovery for this problem. It is assumed

更新日期：2020-07-01
• arXiv.cs.IT Pub Date : 2020-06-29
Victor Beresnevich; Sanju Velani

In this chapter we introduce the theory of Diophantine approximation via a series of basic examples from information theory relevant to wireless communications. In particular, we discuss Dirichlet's theorem, badly approximable points, Dirichlet improvable and singular points, the metric (probabilistic) theory of Diophantine approximation including the Khintchine-Groshev theorem and the theory of Diophantine

更新日期：2020-07-01
Contents have been reproduced by permission of the publishers.

down
wechat
bug