We discuss possible definitions of structural balance conditions in a network with preference orderings as node attributes. The main result is that for the case with three alternatives (A, B, C) we reduce the (3!)(3) = 216 possible configurations of triangles to 10 equivalence classes, and use these as measures of balance of a triangle towards possible extensions of structural balance theory. Moreover, we derive a general formula for the number of equivalent classes for preferences on n alternatives. Finally, we analyze a real-world data set and compare its empirical distribution of triangle equivalence classes to a null hypothesis in which preferences are randomly assigned to the nodes.

We study opinion dynamics in a social network with stubborn agents who influence their neighbors but who themselves always stick to their initial opinion. We consider first the well-known DeGroot model. While it is known in the literature that this model can lead to consensus even in the presence of a stubborn agent, we show that the same result holds under weaker assumptions than has been previously reported. We then consider a recent extension of the DeGroot model in which the opinion of each agent is a random Bernoulli distributed variable, and by leveraging on the first result we establish that this model also leads to consensus, in the sense of convergence in probability, in the presence of a stubborn agent. Moreover, all agents opinions converge to that of the stubborn agent.

We illustrate the potential of Massive MIMO for communication with unmanned aerial vehicles (UAVs). We consider a scenario, where multiple single-antenna UAVs simultaneously communicate with a ground station (GS) equipped with a large number of antennas. Specifically, we discuss the achievable uplink (UAV to GS) capacity performance in the case of line-of-sight conditions. We develop a realistic geometric model, which incorporates an arbitrary orientation, of the GS and UAV antenna elements to characterize the polarization mismatch loss, which occurs due to the movement and orientation of the UAVs. A closed-form expression for a lower bound on the ergodic rate for a maximum-ratio combining receiver with estimated channel state information is derived. The optimal antenna spacing that maximizes the ergodic rate achieved by an UAV is also determined for uniform linear and rectangular arrays. It is shown that when the UAVs are spherically uniformly distributed around the GS, the ergodic rate per UAV is maximized for an antenna spacing equal to an integer multiple of one-half wavelength.

We study the uplink ergodic rate performance of the zero-forcing (ZF) receiver in a Massive multiple-input and multiple-output (MIMO) enabled drone communication system. Considering a 3D geometric model for line-of-sight (LoS) propagation, approximate but accurate analyses of lower and upper bounds on the uplink ergodic rate with estimated channel state information (CSI) are provided.

We develop refinements of the Levenshtein bound in q-ary Hamming spaces by taking into account the discrete nature of the distances versus the continuous behavior of certain parameters used by Levenshtein. We investigate the first relevant cases and present new bounds. In particular, we derive generalizations and q-ary analogs of the MacEliece bound. Furthermore, we provide evidence that our approach is as good as the complete linear programming and discuss how faster are our calculations. Finally, we present a table with parameters of codes which, if exist, would attain our bounds.

We analyze the outage capacity performance of the Massive MIMO uplink in a random line-of-sight (LoS) scenario. Considering a maximum-ratio combining receiver and assuming perfect channel state information at the base station (BS), we derive closed-form expressions for a lower bound on the outage capacity. It is shown that the outage capacity of Massive MIMO in the random LoS scenario logarithmically increases with the number of BS antennas due to the fact that the fluctuations in the total interference power become negligible (i.e., an interference hardening effect).

Massive multiple-input, multiple-output (MIMO) is currently the most compelling wireless physical layer technology and a key component of fifth-generation (5G) systems. The understanding of its core principles has emerged during the last five years, and material is becoming available that is rigorously refined to focus on timeless fundamentals [1], facilitating the instruction of the topic to both master- and doctoral-level students [2]. Meaningful laboratory work that exposes the operational principles of massive MIMO is more difficult to accomplish. At Linköping University, Sweden, this was achieved through a project course, based on the conceive-design-implement-operate (CDIO) concept [3], and through the creation of a specially designed experimental setup using acoustic signals.

Massive multiple-input multiple-output (MIMO) is an emerging technology for mobile communications, where a large number of antennas are employed at the base station to simultaneously serve multiple single-antenna terminals with very high capacity. In this paper, we study the potentials and challenges of utilizing massive MIMO for unmanned aerial vehicles (UAVs) communication. We consider a scenario where multiple single-antenna UAVs simultaneously communicate with a ground station (GS) equipped with a large number of antennas. Speci[1]cally, we discuss the achievable uplink (UAV to GS) capacity performance in the case of line-of-sight (LoS) conditions. We also study the type of antenna polarization that should be used in order to maintain a reliable communication link between the GS and the UAVs. The results obtained using a realistic geometric model show that massive MIMO is a potential enabler for high-capacity UAV network

We investigate the achievable ergodic rate of Massive multi-input-multi-output (MIMO) system in environments with high mobility and line-of-sight (LoS). A 3-dimensional geometric model with uniform rectangular array at the basestation (BS) is used for the investigation. We derive a closed formexpression for a lower bound on the uplink ergodic rate takinginto account imperfections of the channel state information,number of BS antennas, antenna spacing, and spatial distributionof user terminals. The results show that, in LoS Massive MIMO, when the terminals are spherically uniformly distributed around the BS, the ergodic rate is maximized for antenna spacing equal to integer multiples of one-half wavelength.

We propose a nonlinear signal space diversity (SSD) precoding techniquethat produces transmit signals that have constant envelope(CE) in discrete time, resulting in low peak-to-average power ratio(PAPR) waveforms after pulse-shape filtering. We propose twomethods for construction of CE signal set. While the proposed CESSDscheme is inferior to the conventional SSD designs in termsof coding gain performance, it performs better in terms of overallpower efficiency because of the reduced back-off requirement of thepower amplifier (PA).

In this paper, the capacity maximization and the spectrum utilization efficiency improvement are investigated for the Pico cells in broadband heterogeneous networks. In frequency-reuse model, the users attached to Macro base station are usually viewed as primary users, and those attached to Pico base station should be regarded as cognitive radio (CR) users. As both the primary users and the CR users communicate in parallel frequency bands, the performance of the system is limited by the mutual inter-carrier interference (ICI). In order to control ICI and maximize the achievable transmission rate of the CR users, an effective power allocation scheme is proposed to maximize the transmission rate of the CR users under a given interference threshold prescribed by the primary users. By transforming this suboptimal solution into an innovative matrix expression, the algorithm is easier to perform in practice. The simulation results demonstrate that the proposed algorithm provides a large performance gain in Pico cell capacity over the non-cooperative and equal power allocation schemes.

In this paper, we investigate joint subcarrier and power allocation scheme for distributed multi-carrier cooperative networks with imperfect channel state information. Using practical channel estimation algorithms, the statistic model of the channel estimation error is first derived. Then based on the channel error model, the resource allocation scheme aims at maximizing the sum rate of the overall network. Specifically, both subcarrier allocation and power allocation are taken into account. In the subcarrier allocation, a realistic problem of the power leakage between neighboring subcarriers is also addressed. Furthermore, based on Lagrange dual-decomposition algorithm, a practical power allocation algorithm is proposed. Finally, the simulation results demonstrate the performance advantages of the proposed robust design.

In this paper, we present an improved detector for ACK/NACK message detection in the LTE uplink control channel with imperfect channel state information at the receiver. The detector is based on the generalized likelihood-ratio test (GLRT) paradigm. We derive detection metrics for the cases when the noise variances at the receiver are known and unknown. Noise here may comprise both thermal noise and interference. Simulation results show remarkable performance gains of the GLRT-based detector with unknown noise variances compared to the training-based maximum-likelihood detector with unknown noise variances when the noise variances in two slots are different. Furthermore, the performance of the GLRT-based detector with unknown noise variances is nearly the same as that of the training-based maximum-likelihood detector with known noise variances.

In this paper, we study ACK/NACK messages detection in the LTE physical uplink control channel (PUCCH) with multiple receive antennas. The LTE PUCCH is typically characterized by high interference variability due to severe inter-user interferences and slot-level frequency hopping. We present detection methods applicable for the cases when the noise variances at the receiver are known and unknown. Noise here may comprise both thermal noise and interference. The proposed detection technique is based on the generalized likelihood-ratio test (GLRT) paradigm. Simulation results show that GLRT-based detector offers a significant gain over the training-based maximum-likelihood detector when the noise variances in two slots are different and unknown. For the case when the noise variances at the receiver are known, the GLRT-based detector has nearly the same performance as the training-based maximum-likelihood detector.

In this paper a family of constacyclic ternary quasi-perfect linear block codes is presented. This family extends the result presented in a previous work by the first two authors, where the existence of codes with the presented parameters was stated as an open question. The codes have a minimum distance 5 and covering radius 3.

In this correspondence we compute a closed-form expression for theasymptotic (large-sample) accuracy of the recently proposedsquared-range least-squares (SR-LS) method for source localization. We compare its accuracy to that of the classicalleast-squares (LS) method and show that LS and SR-LS performdifferently in general. We identify geometries where theperformances of the methods are identical but also geometries when thedifference in performance is unbounded.

In this paper we discuss some spectrum sensing techniques for detection of DVB-T signals. Their performance is compared in terms of probability of detection and ROC curves. Some simulation results are presented for various scenarios.

In this paper, we consider spectrum sensing of DVB-T signals in differentfading environments. We compare state-of-the-art detectorsincluding detectors based on pilot subcarriers, as well as detectors for general OFDM signals that exploit the correlation structure incurred by the cyclicprefix. Energy detection is also included for comparison. We shownumerically that the choice of detector depends on the scenario, the detectorrequirements, and on the available prior knowledge. We also show that it ispossible to obtain good detection performance by exploiting the correlation,even in a frequency selective channel.

The use of relays is a promising way to extend coverage and increase rates in Long Term Evolution Advanced (LTE Advanced) networks. Performing a transmission in several hops (BS-relay & relay-user) requires more radio resources than a single hop transmission. This paper analyses how the available radio resource should be allocated between relays and users in order to maximize throughput and/or fairness. Time and frequency multiplexed backhaul is investigated under some basic assumptions on the division of the radio resource. It is shown that the system will typically be backhaul limited and that the two ways of multiplexing will perform equally when fairness is taken into account. The analysis results in throughput/fairness suboptimal solutions, dependant on the number of relays per cell, spectral efficiencies and fraction of users served by relays. The analysis is verified by simulations, performed using a MATLAB based network simulator.

In this paper a family of constacyclic ternary quasi-perfect linearblock codes is presented. This family extends the result presented ina previous work by the first two authors, where the existence of codeswith the presented parameters was stated as an open question. The codes have a minimum distance 5 and covering radius 3.

Cognitive radio is a new concept of reusing a licensed spectrum in an unlicensed manner. The motivation for cognitive radio is various measurements of spectrum utilization, that generally show unused resources in frequency, time and space. These "spectrum holes" could be exploited by cognitive radios. Some studies suggest that the spectrum is extremely underutilized, and that these spectrum holes could provide ten times the capacity of all existing wireless devices together. The spectrum could be reused either during time periods where the primary system is not active, or in geographical positions where the primary system is not operating. In this paper, we deal primarily with the concept of geographical reuse, in a frequency-planned primary network. We perform an analysis of the potential for communication in a geographical spectrum hole, and in particular the achievable sum-rate for a secondary network, to some order of magnitude. Simulation results show that a substantial sum-rate could be achieved if the secondary users communicate over small distances. For a small number of secondary links, the sum-rate increases linearly with the number of links. However, the spectrum hole gets saturated quite fast, due to interference caused by the secondary users. A spectrum hole may look large, but it disappears as soon as someone starts using it.

In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.

We consider the interference channel with multiple antennas at the transmitter. We prove that at high signal-to-noise ratio (SNR), the zero-forcing transmit scheme is optimal in the sum-rate sense. Furthermore we prove that at low SNR, maximum-ratio transmission is optimal in the sum-rate sense. We also provide a discussion of the connection to classical results on spectral efficiency in the wideband regime. Finally, we propose a non-convex optimization approach based on monotonic optimization to solve the sum rate maximization problem.

In this correspondence, we study the achievable rate region of the multiple-input single-output (MISO) interference channel, under the assumption that all receivers treat the interference as additive Gaussian noise. Our main result is an explicit parametrization of the Pareto boundary for an arbitrary number of users and antennas. The parametrization describes the boundary in terms of a low-dimensional manifold. For the two-user case we show that a single real-valued parameter per user is sufficient to achieve all points on the Pareto boundary and that any point on the Pareto boundary corresponds to beamforming vectors that are linear combinations of the zero-forcing (ZF) and maximum-ratio transmission (MRT) beamformers. We further specialize the results to the MISO broadcast channel (BC). A numerical example illustrates the result.

While multiple-access communication dates back to systems invented in the 1870's to transmit simultaneous data through a single wire, the foundation of the discipline now known as 'multiuser information theory' was laid in 1961, when Claude E. Shannon published his paper on two-way channels. Since then, multiuser information theory has been an extremely active research area, and has seen a large number of fundamental contributions, covering, besides the two-way channel studied in, multiple access, interference, broadcast, and wiretap channels. However, several key canonical problems have defied many efforts. This book brings together leading experts working in the fields of information theory, coding theory, multiple user communications, discrete mathematics, etc., who survey recent and general results on multiple-access channels (rate regions, rate splitting, etc.), and give an overview of the problems of current CDMA solutions (fading channels, multi-user detection, multiple-antenna systems, iterative joint decoding, OFDMA, etc.). This publication consist of three parts. The first part includes chapters devoted to the information-theoretical aspects of multiple-access communication. In the second part, multiple-access techniques are discussed and the third part of this volume covers coding techniques

While multiple-access communication dates back to systems invented in the 1870's to transmit simultaneous data through a single wire, the foundation of the discipline now known as 'multiuser information theory' was laid in 1961, when Claude E. Shannon published his paper on two-way channels. Since then, multiuser information theory has been an extremely active research area, and has seen a large number of fundamental contributions, covering, besides the two-way channel studied in, multiple access, interference, broadcast, and wiretap channels. However, several key canonical problems have defied many efforts. This book brings together leading experts working in the fields of information theory, coding theory, multiple user communications, discrete mathematics, etc., who survey recent and general results on multiple-access channels (rate regions, rate splitting, etc.), and give an overview of the problems of current CDMA solutions (fading channels, multi-user detection, multiple-antenna systems, iterative joint decoding, OFDMA, etc.). This publication consist of three parts. The first part includes chapters devoted to the information-theoretical aspects of multiple-access communication. In the second part, multiple-access techniques are discussed and the third part of this volume covers coding techniques

In this paper we investigate reduced complexitydecoders for LDPC codes over M-PSK modulation. Capacitycalculations show only minor losses if only phase informationis considered in the decoder. We device a decoder based onphase angle summation, which unfortunately does not work forcodes over Galois fields (but shows promising results for codesover integer rings). For codes over Galois Fields we constructtable-based decoders which gives performance close to BeliefPropagation decoders at substantially reduced complexity.

We describe three new methods for obtaining superimposed codes in Euclidean spaces. With help of them we construct codes with parameters improving upon known constructions. We also prove that the spherical simplex code is not optimal as superimposed code at least for dimensions greater than 9. © 2003 Elsevier Science B.V. All rights reserved.

We give a sufficient condition for a spherical code to be a (n, d, m, T)-spherical superimposed code. We apply this condition to obtain new spherical superimposed codes with help of known spherical codes and codes in the real projective spaces PRn-1. © 2001.

We prove that on the Euclidean sphere S-3 there exist a unique up to isometry 120-point spherical 11-design and a maximal (4, 120, cos(pi /5)) -code. Both these are nothing but copies of a famous regular polytope in four dimensions-the 600-cell.

A sequence of q-ary cyclic codes is analyzed. For each finite field GF (q), q=4, there is a code with parameters [n, k, d, q] = [q(q-1)+1, q(q-1)-6, 6,q]. All these codes are n-, k-, and d-optimal, with only one exception. The dual codes are considered. Their true minimum distances are calculated in the range 4=q=32.