Sciweavers

79 search results - page 4 / 16
» Linear programming bounds for unitary space time codes
Sort
View
CP
2005
Springer
15 years 3 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CORR
2008
Springer
105views Education» more  CORR 2008»
14 years 9 months ago
On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
Xiaoyong Guo, Xiang-Gen Xia
GLOBECOM
2008
IEEE
15 years 4 months ago
Distributed Double-Differential Orthogonal Space-Time Coding for Cooperative Networks
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...
Manav R. Bhatnagar, Are Hjørungnes
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CASES
2005
ACM
14 years 11 months ago
Optimizing stream programs using linear state space analysis
Digital Signal Processing (DSP) is becoming increasingly widespread in portable devices. Due to harsh constraints on power, latency, and throughput in embedded environments, devel...
Sitij Agrawal, William Thies, Saman P. Amarasinghe