Equispaced pilot arrangement is the most popular scheme for pilot‐aided transmission in orthogonal frequency division multiplexing systems. In this study, the authors argue that a non‐equispaced pilot pattern may outperform its equispaced counterpart, if ...

This study addresses the pilot scheduling problem in multiuser multi‐cell massive multiple‐input–multiple‐output (MIMO) systems, aiming at mitigating the inter‐cell interference (pilot contamination), which constitutes a bottleneck of the system ...

This paper proposes a new unsupervised image segmentation method by using Bhattacharyya distance‐based irregular pyramid, termed as ‘BDIP’ algorithm. The proposed BDIP algorithm obtains a suboptimal labelling solution under the condition that the number ...

List‐sphere detection (LSD) is a sub‐optimal multiple‐input multiple‐output (MIMO) detection scheme which searches candidate symbol vectors that lie within a sphere of a given radius. This study presents an efficient LSD based method for a joint iterative ...

In this study, the authors propose a low complexity user scheduling for multi‐antenna broadcast systems with a large number of users with diverse delay‐quality of service (QoS) assurances. Owing to the exclusive user scheduling constraints, the ...

In this study, an adaptive user selection of opportunistic multicast scheduling system (OMS‐AUS) scheme is proposed to improve the system throughput performance of opportunistic multicast scheduling system. Different from the previous literatures, the ...

In downlink multiuser multiple‐input multiple‐output (MU‐MIMO) systems, block diagonalisation (BD) is a well‐known precoding technique that eliminates inter‐user interference. The number of simultaneously supportable users with BD is limited by the number ...

This study exploits coordinated proportional fair (PF) user scheduling for in‐building distributed antenna systems (DAS) to address the co‐channel interference problem. The PF algorithm for multiple remote units in the DAS has been analysed and two sub‐...

Maximum likelihood (ML) algorithms, for the joint estimation of synchronisation impairments and channel in multiple input multiple output–orthogonal frequency division multiplexing (MIMO–OFDM) system, are investigated in this work. A system model that ...

To provide increasing multimedia broadcast/multicast services (MBMSs), the third generation partnership project modified long‐term evolution release nine documents to further support evolved MBMSs (e‐MBMS). This study designed a data‐broadcasting method ...

In this study, the authors propose a new multi‐pattern matching algorithm, called BLAST (B‐LAyered bad‐character Shift Tables with a single‐byte search unit), which considers space‐time tradeoff in the context of shift values during the search. Here, the ...

Maximum likelihood (ML) carrier‐frequency offset estimation for orthogonal frequency‐division multiple access uplink is a complex multi‐parameter estimation problem. The ML approach is a global optima search problem, which is prohibitive for practical ...

In this study, the authors propose a fine granularity resource allocation algorithm for enhancing overall quality of users’ received video in the orthogonal frequency division multiple access system. Subcarrier's contribution for video transmission is ...

Timing synchronisation and frequency estimation are two major estimation problems for frequency‐hopping spread spectrum systems. We present a blind scheme for estimating frequency and transition time in an iterative fashion: the iterative disassemble and ...

We study the possibilities and limitations of pseudodeterministic algorithms, algorithms, a notion put forward by Gat and Goldwasser (2011). These are probabilistic algorithms that solve search problems such that on each input, with high probability, ...

Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge ...

We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization results). In particular, the main incarnation of this equivalence refers to ...

We present a reduction from the Pigeon-Hole Principle to the classical Sperner Lemma. The reduction is used

1. to show that the Sperner Lemma does not have a short constant-depth Frege proof, and

2. to prove lower bounds on the Query Complexity of the ...

q{\hbox{-}}\rm gram matching is used for approximate substring matching problems in a wide range of application areas, including intrusion detection. In this paper, we present a tree-based model to perform fast linear time q{\hbox{-}}{\rm gram} ...

The answer-set programming (ASP) paradigm is a way of using logic to solve search problems. Given a search problem, to solve it one designs a logic theory so that models of this theory represent problem solutions. To compute a solution to the problem, ...