80 search results - page 13 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
92
Voted
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
112
click to vote
SCOPES
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
TSP
2008
14 years 11 months ago
2008
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
93
Voted
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
107
click to vote
SIGMETRICS
2008
ACM
14 years 11 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...