For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Abstract— In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and...
The power consumption due to the HW/SW communication on system-level buses represents one of the major contributions to the overall power budget. A model to estimate the switching...
William Fornaciari, Donatella Sciuto, Cristina Sil...
— A general noncoherent chaos-shift-keying (CSK) communication system with adjustable weights is proposed in this paper. The performance of the system under additive white Gaussi...
s displays harmed interrupters' task performance, while abstract displays did not. We conclude that y with an abstract representation of a collaborator's workload is opti...