نتایج جستجو برای: blast block size

تعداد نتایج: 723443  

2012
Seung-Jun Yu Hyoung-Kyu Song

Space-time block coding (STBC) and Spatial multiplexing (SM) or BLAST (Bell Labs Layered Space-Time) are promise approaches that exploit the MIMO channel to provide higher data rates and diversity gains with no sacrifice in bandwidth. In this work, we present a hybrid MIMO scheme that combines transmit diversity and spatial multiplexing. The proposed scheme can achieve arbitrary number of multi...

Journal: :Mining 2022

The Trauzl test is widely used to measure the explosive power of a substance by determining volume increase produced detonation tested charge in cavity lead block with defined quality and size. In this study, high-speed 3D digital image correlation (3D-DIC) system were evaluate effect stemming on blast hole. blasting experiments conducted emulsion explosives. materials adopted study sand, aggre...

Journal: :CoRR 2010
Nirmalendu Bikas Sinha S. Chakraborty P. K. Sutradhar R. Bera M. Mitra

Multiple Input Multiple Output (MIMO) systems have recently emerged as a key technology in wireless communication systems for increasing both data rates and system performance. There are many schemes that can be applied to MIMO systems such as space time block codes, space time trellis codes, and the Vertical Bell Labs Space-Time Architecture (V-BLAST). This paper proposes a novel signal detect...

2006
J. P. Morgan Valentin Parvu

Intense combinatorial study of balanced incomplete block designs since the time of Fisher and Yates has led to a great many designs with the same numbers of treatments, blocks, and block size. While the basic analysis does not differentiate among different BIBDs with the same parameters, they do differ in their capacity to withstand loss of experimental material. Competing BIBDs are compared he...

Journal: :Australasian J. Combinatorics 1999
Charles J. Colbourn Alan C. H. Ling

Constructions of balanced sampling plans excluding contiguous units, a class of designs introduced by Hedayat, Rao and Stufken, are given which provide a complete solution to this problem when k = 4.

Journal: :Australasian J. Combinatorics 1996
Margaret Ann Francel Dinesh G. Sarvate

Abstract T emory designs with replication numbers all or all but one of the values in the range 1\(V-1J/(K-l} to 1\(V-l)/(K-2) are studied. It is known that for K=3 and replication numbers all values in the range 1\{V-l) /(K-l J to 1\(V-l }/(K-2J, designs exist if and only if 1\=2. Here we show the uniqueness of such designs. When K=3 and all values in the range 1\(V-l J/(K-l) to 1\(V-l )/(K-2)...

Journal: :Discrete Mathematics 2006
R. A. Bailey Peter J. Cameron Peter Dobcsányi John P. Morgan Leonard H. Soicher

In 2001, the United Kingdom Engineering and Physical Sciences Research Council awarded three of the authors of this paper a grant for “A Web-based resource for design theory”. As the project developed, we have had to face a number of problems, ranging from fundamental questions such as “What is a design?”, through research topics such as “How should the concept of partial balance be extended to...

Journal: :Des. Codes Cryptography 2005
Behruz Tayfeh-Rezaie

In this paper, we use the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence of...

Journal: :CoRR 2014
V. S. Usatyuk

This article present a application of Block Korkin---Zolotarev lattice reduction method for Lattice Reduction---Aided decoding under MIMO---channel. We give a upper bound estimate on the lattice reduced by block Korkin---Zolotarev method (BKZ) for different value of the block size and detecting by SIC.

Journal: :Electr. J. Comb. 2011
R. Julian R. Abel Diana Combe Adrian M. Nelson William D. Palmer

There are well known necessary conditions for the existence of a generalized Bhaskar Rao design over a group G, with block size k = 3. We prove that they are sufficient for nilpotent groups G of even order, and in particular for 2-groups. In addition, we prove that they are sufficient for semi-dihedral groups.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید