Sciweavers

5832 search results - page 1060 / 1167
» Software complexity and maintainability
Sort
View
TCOM
2010
63views more  TCOM 2010»
14 years 11 months ago
Efficiently decoded full-rate space-time block codes
Space-time block codes with orthogonal structures typically provide full-diversity reception and simple receiver processing. However, rate-1 orthogonal codes for complex constellat...
Don J. Torrieri, Matthew C. Valenti
134
Voted
TCOM
2010
65views more  TCOM 2010»
14 years 11 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief
TCOM
2010
83views more  TCOM 2010»
14 years 11 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
159
Voted
VLSISP
2010
191views more  VLSISP 2010»
14 years 11 months ago
Sign Language Phoneme Transcription with Rule-based Hand Trajectory Segmentation
A common approach to extract phonemes of sign language is to use an unsupervised clustering algorithm to group the sign segments. However, simple clustering algorithms based on dis...
W. W. Kong, Surendra Ranganath
SIAMNUM
2011
117views more  SIAMNUM 2011»
14 years 11 months ago
Construction and Convergence Study of Schemes Preserving the Elliptic Local Maximum Principle
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
Jérôme Droniou, Christophe Le Potier
« Prev « First page 1060 / 1167 Last » Next »