Results 11  20
of
128,523
Bounds on ordered codes and orthogonal arrays
 Moscow Math. Journal
, 2009
"... ABSTRACT. We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the NiederreiterRosenbloomTsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given by ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
ABSTRACT. We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the NiederreiterRosenbloomTsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given
Orthogonal arrays obtained by repeatingcolumn difference matrices
, 2006
"... www.elsevier.com/locate/disc In this paper, by using the repeatingcolumn difference matrices and orthogonal decompositions of projection matrices, we propose a new general approach to construct asymmetrical orthogonal arrays. As an application of the method, some new orthogonal arrays with run size ..."
Abstract
 Add to MetaCart
www.elsevier.com/locate/disc In this paper, by using the repeatingcolumn difference matrices and orthogonal decompositions of projection matrices, we propose a new general approach to construct asymmetrical orthogonal arrays. As an application of the method, some new orthogonal arrays with run
On a Grouping Method for Constructing Mixed Orthogonal Arrays
, 2012
"... Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry. can be partitioned into 1,PG mn s 1,PG mn s 1 1mn ns s –1nflats such that each –1nflat is associated with a point in. An orthogonal array 1, nPG m s ..."
Abstract
 Add to MetaCart
Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry. can be partitioned into 1,PG mn s 1,PG mn s 1 1mn ns s –1nflats such that each –1nflat is associated with a point in. An orthogonal array 1, nPG m
Orthogonal arrays from Hermitian varieties
 INNOVATIONS IN INCIDENCE GEOMETRY
"... A simple orthogonal array OA(q^(2n−1),q^(2n−2),q,2) is constructed by using
the action of a large subgroup of PGL(n+1,q^2) on a set of non–degenerate Hermitian varieties in PG(n,q^2).
..."
Abstract
 Add to MetaCart
A simple orthogonal array OA(q^(2n−1),q^(2n−2),q,2) is constructed by using
the action of a large subgroup of PGL(n+1,q^2) on a set of non–degenerate Hermitian varieties in PG(n,q^2).
Blind Signal Separation: Statistical Principles
, 2003
"... Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption of mut ..."
Abstract

Cited by 522 (4 self)
 Add to MetaCart
Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption
Shiftable Multiscale Transforms
, 1992
"... Orthogonal wavelet transforms have recently become a popular representation for multiscale signal and image analysis. One of the major drawbacks of these representations is their lack of translation invariance: the content of wavelet subbands is unstable under translations of the input signal. Wavel ..."
Abstract

Cited by 557 (36 self)
 Add to MetaCart
Orthogonal wavelet transforms have recently become a popular representation for multiscale signal and image analysis. One of the major drawbacks of these representations is their lack of translation invariance: the content of wavelet subbands is unstable under translations of the input signal
Blind Beamforming for Non Gaussian Signals
 IEE ProceedingsF
, 1993
"... This paper considers an application of blind identification to beamforming. The key point is to use estimates of directional vectors rather than resorting to their hypothesized value. By using estimates of the directional vectors obtained via blind identification i.e. without knowing the arrray mani ..."
Abstract

Cited by 704 (31 self)
 Add to MetaCart
manifold, beamforming is made robust with respect to array deformations, distortion of the wave front, pointing errors, etc ... so that neither array calibration nor physical modeling are necessary. Rather surprisingly, `blind beamformers' may outperform `informed beamformers' in a plausible
Improving DirectMapped Cache Performance by the Addition of a Small FullyAssociative Cache and Prefetch Buffers
, 1990
"... ..."
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 579 (3 self)
 Add to MetaCart
hierarchical reduction scheme whereby entire control constructs are reduced to an object similar to an operation in a basic block. With this scheme, all innermost loops, including those containing conditional statements, can be software pipelined. It also diminishes the startup cost of loops with small
A simple transmit diversity technique for wireless communications
 IEEE Journal on Selected Areas in Communications
, 1998
"... Abstract — This paper presents a simple twobranch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximalratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the sch ..."
Abstract

Cited by 2084 (0 self)
 Add to MetaCart
that the scheme may easily be generalized to two transmit antennas and M receive antennas to provide a diversity order of 2M. The new scheme does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC. Index Terms—Antenna array
Results 11  20
of
128,523