Related papers: Structured Dispersion Matrices from Space-Time Blo…
The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject…
The common spatial pattern (CSP) approach is known as one of the most popular spatial filtering techniques for EEG classification in motor imagery (MI) based brain-computer interfaces (BCIs). However, it still suffers some drawbacks such as…
A multi-access multiple-input multiple-output (MIMO) relay differential chaos shift keying cooperative diversity (DCSK-CD) system is proposed in this paper as a comprehensive cooperation scheme, in which the relay and destination both…
In large-scale distributed computing clusters, such as Amazon EC2, there are several types of "system noise" that can result in major degradation of performance: bottlenecks due to limited communication bandwidth, latency due to straggler…
Multidimensional scaling (MDS) is a popular dimensionality reduction techniques that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates…
We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used)…
This paper presents a novel scheme dubbed Collision Diversity (CoD) SCRAM, which is provisioned to meet the challenging requirements of the future 6G, portrayed in massive connectivity, reliability, and ultra-low latency. The conventional…
We consider a distributed learning problem in which the computation is carried out on a system consisting of a master node and multiple worker nodes. In such systems, the existence of slow-running machines called stragglers will cause a…
To address growing cybersecurity challenges in modern power dispatch systems, this paper proposes a multi-layer modeling and optimization framework for SCADA systems enhanced with quantum key distribution (QKD). While most existing…
In this paper, a novel modulation scheme called set partition modulation (SPM) is proposed. In this scheme, set partitioning and ordered subsets in the set partitions are used to form codewords. We define different SPM variants and depict a…
Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we…
A joint sparse-regression-code (SPARC) and low-density-parity-check (LDPC) coding scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) is proposed in this paper. Different from the state-of-the-art…
In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of $M$ users sending different information to a common base station through independent block fading channels. The aim is…
In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…
Space-Time block codes (STBC) from Orthogonal Designs (OD) and Co-ordinate Interleaved Orthogonal Designs (CIOD) have been attracting wider attention due to their amenability for fast (single-symbol) ML decoding, and full-rate with…
This paper presents two new space time block codes (STBCs) with quasi orthogonal structure for an open loop multi-input single-output (MISO) systems. These two codes have been designed to transmit from three or four antennas at the…
Sparse coding aims to model data vectors as sparse linear combinations of basis elements, but a majority of related studies are restricted to continuous data without spatial or temporal structure. A new model-based sparse coding (MSC)…
Very recently, we proposed the row-monomial distributed orthogonal space-time block codes (DOSTBCs) and showed that the row-monomial DOSTBCs achieved approximately twice higher bandwidth efficiency than the repetitionbased cooperative…
The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of $g$-group encodable and $g$-group decodable linear STBCs is…
In this paper, we consider the asymptotic and finite-length performance of block Markov superposition transmission~(BMST) of short codes, which can be viewed as a new class of spatially coupled~(SC) codes with the generator matrices of…