Results 231 to 240 of about 26,581 (261)
Some of the next articles are maybe not open access.

Design of lapped orthogonal transforms

IEEE Transactions on Image Processing, 1996
We investigate the design of lapped orthogonal transforms for data compression of images. We present some properties and new results of paraunitary filter banks. We concentrate on the case where the filter length L=2K, where K is the number of channels.
openaire   +2 more sources

Orthogonal and nearly orthogonal designs for computer experiments

Biometrika, 2009
We introduce a method for constructing a rich class of designs that are suitable for use in computer experiments. The designs include Latin hypercube designs and two-level fractional factorial designs as special cases and fill the vast vacuum between these two familiar classes of designs.
Derek Bingham   +2 more
openaire   +2 more sources

Amicable Orthogonal Designs-Existence

Canadian Journal of Mathematics, 1976
Definition. An orthogonal design in order n and of type (u1, … , us) on the commuting variables x1, . . .
openaire   +1 more source

On orthogonal designs and space-time codes

Proceedings IEEE International Symposium on Information Theory,, 2003
Two aspects of orthogonal designs are explored in this paper. The first relates to the existence of restricted-alphabet orthogonal designs. While orthogonal designs yield efficient space-time codes, real orthogonal designs exist only for sizes n=2, 4, 8.
Hsiao-feng Lu   +2 more
openaire   +1 more source

The asymptotic existence of orthogonal designs. [PDF]

open access: possibleAustralas. J Comb., 2014
Given any l-tuple (s1, s2,..., sl) of positive integers, there is an integer N = N (s1, s2,..., sl) such that an orthogonal design of order 2n (s1+s2+...+sl) and type (2ns1, 2ns2,..., 2nsl) exists, for each n ≥ N. This complements a result of Eades et al. which in turn implies that if the positive integers s1, s2,..., s_l are all highly divisible by 2,
Ghaderpour E., Kharaghani H.
openaire   +1 more source

Super-Orthogonal Co-Ordinate Interleaved Orthogonal Designs

2008 IEEE International Conference on Communications, 2008
A super-orthogonal co-ordinate interleaved orthogonal design (CIOD) space-time block code is introduced for three and four transmit antennas. Using unitary matrix transformations the constituent CIOD is expanded, with a performance improvement in terms of Eb/N0 and an increased code rate in MIMO channels, and only a moderate increase in decoding ...
openaire   +1 more source

On the amicability of orthogonal designs

Journal of Combinatorial Designs, 2009
AbstractAlthough it is known that the maximum number of variables in two amicable orthogonal designs of order 2np, where p is an odd integer, never exceeds 2n+2, not much is known about the existence of amicable orthogonal designs lacking zero entries that have 2n+2 variables in total.
Holzmann, W. H., Kharaghani, H.
openaire   +2 more sources

Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

IEEE Transactions on Information Theory, 2007
Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver.
Yindi Jing, Hamid Jafarkhani
openaire   +1 more source

Orthogonal designs of Kharaghani type. I.

Ars Comb., 2003
Summary: We use an array constructed by \textit{H. Kharaghani} [J. Comb. Des. 8, 166-173 (2000; Zbl 0985.05015)] to obtain infinite families of 8-variable Kharaghani type orthogonal designs, \(OD(8t;k_1,k_1,k_1,k_1,k_2,k_2,k_2,k_2)\), where \(k_1\) and \(k_2\) must be sums of two squares.
Koukouvinos, C., Seberry, Jennifer
openaire   +2 more sources

Orthogonal designs in powers of two

1977
Repeat designs are introduced and it is shown how they may be used to give very powerful constructions for orthogonal designs in powers of two. These results are used to show all full four variable and all three variable designs exist in 2t , t ≤ 9. We believe these constructions demonstrate the existence of all possible four variable designs with no
Robinson, Peter J, Seberry, Jennifer
openaire   +1 more source

Home - About - Disclaimer - Privacy