In this paper, we propose a new structured Grassmannian constellation for noncoherent communications over single-input multiple-output (SIMO) Rayleigh block-fading channels. The constellation, which call Grass-Lattice, is based on measure preserving mapping from the unit hypercube to of lines. structure allows on-the-fly symbol generation, low-complexity decoding, and simple bit-to-symbol Gray-...

Abstract We consider supercritical site percolation on the $d$ -dimensional hypercube $Q^d$ . show that typically all components in percolated hypercube, besides giant, are of size $O(d)$ This resolves a conjecture Bollobás, Kohayakawa, and Łuczak from 1994.

A partial cube is a graph that can be isometrically embedded into a hypercube. In other words, a partial cube is a subgraph of a hypercube that preserves distances the distance between any two vertices in the subgraph is the same as the distance between those vertices in the hypercube. Partial cubes were first introduced by Graham and Pollak (Graham & Pollak, 1971) as a model for communication ...

Abstract This paper presents a robust ABAQUS ® plug-in called Virtual Data Generator ( VDGen ) for generating virtual data identifying the uncertain material properties in unidirectional lamina through artificial neural networks (ANNs). The supports 3D finite element models of unit cells with square and hexagonal fibre arrays, uses Latin-Hypercube sampling methods robustly imposes periodic boun...

Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A method is proposed for performing exact hypercube convolution in sub-quadratic time. The method outperforms FFTPACK, called via numpy, and FFTW, called via pyfftw...