532 search results - page 5 / 107 » New Results on the Complexity of the Middle Bit of Multiplic... |
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
— Bit interleaved coded multiple beamforming (BICMB) was previously designed to achieve full spatial multiplexing of min(N, M) and full spatial diversity of NM for N transmit and...
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
14 years 2 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
JCM
2008
13 years 7 months ago
2008
Optical Code Division Multiple Access (OCDMA) is considered as the strongest candidates for the future high speed optical networks due to the large bandwidth offered by the system,...
MMSP
2008
IEEE
14 years 2 months ago
2008
IEEE
—In many applications and environments for mobile communication there is a need for reference free perceptual quality measurements. In this paper a method for prediction of a num...
ISW
2010
Springer
13 years 5 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...