3 results
Filters
Settings
Now showing1 - 3 of 3
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Optimizing the Performance of the Interaction-based Caching in CCN(2022-12); LCE (Leave Copy Everywhere), as the default caching strategy of CCN (Content-Centric Networking), caches demanded contents in all en route routers. To optimally reduce the resulting redundancy, the dynamic features of contents, clients, and network elements must be entangled with those of the network's topology. Inspired by Quantum Field Theory and Newtonian Mechanics, we developed a model to comprehensively describe the clients' interactions with contents, which generate a “gravitational force” on the latter moving them toward their requesters. The “gravity” is then transformed into a topological metric to confine the replication of contents spatially to an optimum subset of caches. This Interaction-based Caching (IC) uses the couplings of contents and clients to regulate the kinematics of contents in the network deterministically. To maximize the IC's performance, the interaction terms must be adapted to the capacity and betweenness centrality degree of caches and the contents' popularity. The proposed algorithms are extensively analyzed and evaluated in various simulation scenarios showing that the IC significantly outperforms comparable caching strategies in terms of hit ratio.Publicationtype: Conference Paper38 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , A Variable Node Design with Check Node Aware Quantization Leveraging 2-Bit LDPC Decoding(2022-12); For improving coarsely quantized decoding of LDPC codes, we propose a check node aware design of the variable node update. In contrast to previous works, we optimize the variable node to explicitly maximize the mutual information preserved in the check-to-variable instead of the variable-to-check node messages. The extended optimization leads to a significantly different solution for the compression operation at the variable node. Simulation results for regular LDPC codes confirm that the check node aware design, especially for very coarse quantization with 2- or 3-bit messages, achieves performance gains of up to 0.2 dB - without additional hardware costs. We also show that the 2-bit message resolution enables a very efficient implementation of the check node update, which requires only 2/9 of the 3-bit check node's transistor count and reduces the signal propagation delay by a factor of 4.Publicationtype: Conference Paper52 17 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Uniform vs. Non-Uniform Coarse Quantization in Mutual Information Maximizing LDPC Decoding(2022-12); Recently, low-resolution LDPC decoders have been introduced that perform mutual information maximizing signal processing. However, the optimal quantization in variable and check nodes requires expensive non-uniform operations. Instead, we propose to use uniform quantization with a simple hardware structure, which reduces the complexity of individual node operations approximately by half and shortens the decoding delay significantly. Our analysis shows that the loss of preserved mutual information resulting from restriction to uniform quantization is very small. Furthermore, the error rate simulations with regular LDPC codes confirm that the uniform quantization causes only minor performance degradation within 0.01 dB compared to the non-uniform alternative. Due to the complexity reduction, especially the proposed 3-bit decoder is a promising candidate to replace 4-bit conventional decoders.Publicationtype: Conference Paper46