Results 1  10
of
4,403
Spacetime block codes from orthogonal designs
 IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract

Cited by 1524 (42 self)
 Add to MetaCart
Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas
Network Coding for Large Scale Content Distribution
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract

Cited by 493 (7 self)
 Add to MetaCart
We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
A New Method of Encoding Block Codes with Polynomials
"... Abstract — We present an efficient new method of obtaining a generator matrix G from certain types of parity check matrices H with a defective cyclic block structure. This novel approach describes parity check and generator matrices in terms of polynomials. Moreover, by using this polynomial algebra ..."
Abstract
 Add to MetaCart
Abstract — We present an efficient new method of obtaining a generator matrix G from certain types of parity check matrices H with a defective cyclic block structure. This novel approach describes parity check and generator matrices in terms of polynomials. Moreover, by using this polynomial
Radix 4/8 Dual Encoder Block for Multiplier Architecture using GDI
 Technique,” ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 1, Issue 9
, 2012
"... AbstractA hybrid radix4/8 multiplier is proposed for portable multimedia applications that demand high speed and low energy operation. Depending on the input pattern, the multiplier operates in the radix8 mode in 56% of the input cases for low power, but reverts to the radix4 mode in 44% of th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
% of the slower input cases for high speed. For this Radix 4/8 Dual encoder block is designed. Compared to a conventional CMOS radix4/8 encoder, the proposed radix4/8 encoder consumes 43.6% less power, and 46.51% less area and 3.3% less delay time. Index Terms dual encoder, multiplier, gatediffusion input
Spacetime block coding for wireless communications: performance results
 IEEE J. Select. Areas. Commun
, 1999
"... Abstract—We document the performance of space–time block codes [13], [14], which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code, and the encoded data is split into n streams which are simultaneousl ..."
Abstract

Cited by 369 (13 self)
 Add to MetaCart
Abstract—We document the performance of space–time block codes [13], [14], which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code, and the encoded data is split into n streams which
The iSLIP Scheduling Algorithm for InputQueued Switches
, 1999
"... An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, these systems use input queues to hold packets waiting to traverse the switching fabric. It is well known th ..."
Abstract

Cited by 425 (8 self)
 Add to MetaCart
that if simple first in first out (FIFO) input queues are used to hold packets then, even under benign conditions, headofline (HOL) blocking limits the achievable bandwidth to approximately 58.6 % of the maximum. HOL blocking can be overcome by the use of virtual output queueing, which is described
Recursive Distributed Representations
 Artificial Intelligence
, 1990
"... A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compo ..."
Abstract

Cited by 414 (9 self)
 Add to MetaCart
for such compositional structures, as well as efficient accessing mechanisms for them. Patterns which stand for the internal nodes of fixedvalence trees are devised through the recursive use of backpropagation on threelayer autoassociative encoder networks. The resulting representations are novel
Mirror Manifolds and Topological Field Theory
 in Essays on Mirror Manifolds (ed. S.T. Yau), International Press, Hong Kong
, 1992
"... In N = 4 super YangMills theory on a fourmanifold M, one can specify a discrete magnetic flux valued in H2 (M,ZN). This flux is encoded in the AdS/CFT correspondence in terms of a fivedimensional topological field theory with ChernSimons action. A similar topological field theory in seven dimens ..."
Abstract

Cited by 380 (12 self)
 Add to MetaCart
In N = 4 super YangMills theory on a fourmanifold M, one can specify a discrete magnetic flux valued in H2 (M,ZN). This flux is encoded in the AdS/CFT correspondence in terms of a fivedimensional topological field theory with ChernSimons action. A similar topological field theory in seven
Efficient erasure correcting codes
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2001
"... We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discretetime random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both si ..."
Abstract

Cited by 360 (26 self)
 Add to MetaCart
sides of the graph which is necessary and sufficient for the decoding process to finish successfully with high probability. By carefully designing these graphs we can construct for any given rate and any given real number a family of linear codes of rate which can be encoded in time proportional to ��@I
Results 1  10
of
4,403