检索结果-内蒙古大学图书馆

Energy-efficient design techniques for LUT based adaptive digital pre-distorters

MICROELECTRONICS JOURNAL 2023年 141卷

作者： Baran, Dursun Sci & Technol Res Council Turkey TUBITAK Gebze Kocaeli Turkiye Informat & Informat Secur Res Ctr BILGEM TUBITAK TR-41470 Gebze Kocaeli Turkiye

Energy-efficient design techniques for an adaptive Look-Up Table (LUT) based Digital Predistortion (DPD) system are presented. The proposed methods are simplification of the adaptation function, reduction of the memory hardware complexity and bypassing of the equalizer circuit. The equalizer circuit block is critical while the adaptation loop is enabled but need for this block while the loop is disabled is explored to reduce power dissipation. Three adaptation functions that require less complex hardware are presented. The system is modeled with Matlab-Simulink, then implemented using an FPGA and 130 nm ST-Silicon On Insulator (SOI) process. More than 33% of power saving is obtained by applying the proposed techniques and further power reductions are also possible by configuring the system.

关键词： Digital predistortion (DPD) Power amplifier (PA) Energy-efficient design techniques Power dissipation memory depth memory complexity

来源：评论

学校读者我要写书评

暂无评论

One-pass streaming algorithm for monotone lattice submodular maximization subject to a cardinality constraint

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2023年第17期35卷

作者： Zhang, Zhenning Guo, Longkun Wang, Linyang Zou, Juan Beijing Univ Technol Dept Operat Res & Informat Engn Beijing Peoples R China Fuzhou Univ Coll Math & Comp Sci Fuzhou Peoples R China Qilu Univ Technol Sch Comp Sci Room 420 Jinan 250353 Peoples R China Qufu Normal Univ Sch Math & Sci Qufu Shandong Peoples R China

In the article, we devise streaming algorithms for maximization of a monotone submodular function subject to a cardinality constraint on the integer lattice. Based on the observation that lattice submodularity is not equivalent to diminishing return submodularity on the integer lattice but rather a weaker condition, we propose a one-pass streaming algorithm with a modified binary search as subroutine of each step. Finally, we show that the algorithm is with approximation ratio 1/2-epsilon, memory complexity O(epsilon-1klogk), and per-element query complexity O(epsilon-2log2k).

关键词： cardinality integer lattice lattice submodular memory complexity streaming algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient and lightweight group rekeying protocol for communicating things

引用

COMPUTERS & ELECTRICAL ENGINEERING 2021年 91卷 107021-107021页

作者： Lakhlef, Hicham Bouabdallah, Abdelmadjid Sorbonne Univ Univ Technol Compiegne CNRS CS 60319 F-60203 Compiegne France

Recent advances in emerging technologies have given birth to a new type of networks called Internet of Things (IoT). The emergence of IoT has led practitioners to envision networking a large number of sensors for event monitoring, data collection and filtering. Due to the use of wireless technologies, a secure communication is strongly needed to protect valuable information. Secure group communication is one of the most significant requirements for IoT applications. This employs a group rekeying mechanism for a secure and efficient delivery of data. In this paper, we present a new efficient and scalable rekeying protocol for wireless communicating things. This protocol uses O(log(2) (3)root n) memory complexity, improving significantly the literature works, where n is the network size. Simulation results show that our protocol has better performances than existing works in several criteria.

关键词： Communicating things Message-passing Rekeying Energy-efficiency Security Group communication memory complexity

来源：评论

学校读者我要写书评

暂无评论

Succinct enumeration of distant vertex pairs

引用

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS 2019年第6期11卷

作者： Rudi, Ali Gholami Babol Noshirvani Univ Technol Dept Elect & Comp Engn Babol Sar Iran

The fastest known algorithms for finding the exact value of the diameter of general graphs are no faster than the algorithms that compute all-pairs shortest paths. An extension of the problem of computing graph diameter is enumerating pairs of vertices in a graph, ordered decreasingly by their distance. In this paper, we investigate this problem with the presence of memory constraints. We also show how our result can help the computation of graph Hyperbolicity, by lowering the memory complexity of computing the ordered list of far-apart vertex pairs.

关键词： Graph diameter succinct data structures memory complexity all pairs shortest path graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Quickstop: A Markov optimal stopping approach for quickest misinformation detection

Quickstop: A Markov optimal stopping approach for quickest m...

引用

Proceedings of the ACM on Measurement and Analysis of Computing Systems

作者： Honghao, W.E.I. Kang, Xiaohan Wang, Weina Ying, Lei Arizona State University TempeAZ85287 United States University of Illinois at Urbana-Champaign Urbana Illinois61820 United States Carnegie Mellon University PittsburghPA15213 United States

This paper combines data-driven and model-driven methods for real-time misinformation detection. Our algorithm, named QuickStop, is an optimal stopping algorithm based on a probabilistic information spreading model obtained from labeled data. The algorithm consists of an offline machine learning algorithm for learning the probabilistic information spreading model and an online optimal stopping algorithm to detect misinformation. The online detection algorithm has both low computational and memory complexities. Our numerical evaluations with a real-world dataset show that QuickStop outperforms existing misinformation detection algorithms in terms of both accuracy and detection time (number of observations needed for detection). Our evaluations with synthetic data further show that QuickStop is robust to (offline) learning errors. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Learning algorithms Machine learning Signal detection Social networking (online) Detection algorithm Fake news memory complexity Model driven method On line detection Optimal stopping Probabilistic information Quickest detection

来源：评论

学校读者我要写书评

暂无评论

Time and space optimality of rotor-router graph exploration

引用

INFORMATION PROCESSING LETTERS 2017年第Nov.期127卷 17-20页

作者： Menc, Artur Pajak, Dominik Uznanski, Przemyslaw Wroclaw Univ Technol Fac Fundamental Problems Technol Wroclaw Poland Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

We consider the problem of exploration of an anonymous, port-labeled, undirected graph with n nodes, m edges and diameter D, by a single mobile agent. Initially the agent does not know the graph topology nor any of the global parameters. Moreover, the agent does not know the incoming port when entering a vertex. Each vertex is endowed with memory that can be read and modified by the agent upon its visit to that node. However the agent has no operational memory i.e., it cannot carry any state while traversing an edge. In such a model at least log(2) d bits are needed at each vertex of degree d for the agent to be able to traverse each graph edge. This number of bits is always sufficient to explore any graph in time O(mD) using algorithm ROTOR-ROUTER Yanovski et al. (2003) [1]. We show that even if the available node memory is unlimited then time Omega(mD) is required in some graphs, regardless of the algorithm. This shows that ROTOR-ROUTER is asymptotically optimal in the worst-case. Secondly we show that for the case of paths, ROTOR-ROUTER attains exactly optimal time. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Distributed computing Graph exploration memory complexity

来源：评论

学校读者我要写书评

暂无评论

Improved impossible differential attack on reduced version of Camellia with FL/FL^-1 functions

引用

IET INFORMATION SECURITY 2016年第6期10卷 425-432页

作者： Liu, Ya Yang, Anren Liu, Zhiqiang Li, Wei Wang, Qingju Song, Liang Gu, Dawu Univ Shanghai Sci & Technol Dept Comp Sci & Engn Shanghai 200093 Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Donghua Univ Sch Comp Sci & Technol Shanghai 201620 Peoples R China Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100093 Peoples R China Shanghai Key Lab Integrate Adm Technol Informat S Shanghai 200240 Peoples R China Katholieke Univ Leuven ESAT COSIC B-3001 Leuven Belgium Katholieke Univ Leuven iMinds B-3001 Leuven Belgium

As an ISO/IEC international standard, Camellia has been used in various cryptographic applications. In this study, the authors present the best currently known attacks on Camellia-192/256 with key-dependent layers FL/FL-1 (without the whitening layers) by taking advantage of the intrinsic weakness of keyed functions, the redundancy of key schedule and the early abort technique. Specifically, the authors mount the first impossible differential attack on 13-round Camellia-192 with 2(124.79) chosen plaintexts, 2(186.09) 13-round encryptions and 2(129.79) bytes, while the analysis for the biggest number of rounds in previous results on Camellia-192 worked on 12 rounds. Furthermore, the authors successfully attack on 14-round Camellia-256 with 2(122.14) chosen plaintexts, 2(228.33) 14-round encryptions and 2(134.14) bytes. Compared with the previously best known attack on 14-round Camellia-256, the time and memory complexities are reduced by 2(9.87) times and 2(46.06) times, and the data complexity is comparable.

关键词： ISO standards IEC standards cryptography impossible differential attack Camellia standard ISO international standard IEC international standard cryptographic applications Camellia-192 Camellia-256 time complexity memory complexity data complexity

来源：评论

学校读者我要写书评

暂无评论

A memory complexity Model for Circular Sentences

A Memory Complexity Model for Circular Sentences

引用

2011 2ND International Conference on Innovative Computing and Communication and 2011 Asia-Pacific Conference on Information Technology and Ocean Engineering(CICC-ITOE 2011)

作者： XU Hai yan LinYi University

The memory system has become a key factor to get high performance, especially for those numerical programs. Along with the increasing gap between processors and memories, the traditional calculation complexity analysis is now not sufficient to judge an algorithm or program. The memory complexity also plays an important role. In this paper, a model based on the memory hierarchy technology was proposed to analyze the memory complexity for circular sentences, which are normally the most time-consuming part for numerical programs, and therefore to judge and predict its performance.

关键词： memory complexity Circular sentence memory hierarchy Model

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a Portable PABX System Through Developing New Bandwidth Optimization Technique 2

Performance Evaluation of a Portable PABX System Through Dev...

引用

2nd International Conference on Electrical Engineering and Information and Communication Technology (ICEEICT)

作者： Rahman, Md Torikur Mahi, Md Julkar Nayeen Biswas, Milon Kaiser, M. Shamim Al Mamun, Shamim Jahangirnagar Univ Inst Informat Technol Dhaka Bangladesh

ISBN: (纸本)9781467366762

Now is the age of information technology. World is advancing day by day. At present in this progressing world communication from one place to another has become so easy, less costly, and faster. This modern life is almost impossible with the help of these communication technologies. People need to talk, need to share data, need to express their emotion from long distance. So they need to use technologies to communicate with one another. But nowadays people prefer video calling more than voice calling. They often used video calling most instead of voice calling. Some software like Skype, Yahoo, Gtalk, Msn is used for voice and video call. But these software uses high capacity of bandwidth and a big amount of internet speed. Thinking of this, a flexible portable video calling PABX PC to PC and PC through different smart phone system established that operates with local LAN bandwidth consist of three limited equipments-1) Server 2) Soft phone 3) Web cam through the network nodes. This system can be implemented on telecommunication sectors like call center, mobile phone customer care center etc. It can also be implemented on security issues like CCTV cameras. The system is implemented through new BW optimization technique which is more efficient in terms of time delay, number of packets and memory complexity. After evaluating the simulation, it is assured that this system is better than other existing systems which are available in market.

关键词： PABX Portability BW Management BW Optimization SIP IAX2 Traffic Engineering Leaky Bucket Token Bucket memory complexity

来源：评论

学校读者我要写书评

暂无评论

Efficient haplotype block recognition of very long and dense genetic sequences

引用

BMC BIOINFORMATICS 2014年第1期15卷 1-18页

作者： Taliun, Daniel Gamper, Johann Pattaro, Cristian European Acad Bolzano Bozen EURAC Biomed Ctr Bozen Bolzano Italy Free Univ Bozen Bolzano Bozen Bolzano Italy

Background: The new sequencing technologies enable to scan very long and dense genetic sequences, obtaining datasets of genetic markers that are an order of magnitude larger than previously available. Such genetic sequences are characterized by common alleles interspersed with multiple rarer alleles. This situation has renewed the interest for the identification of haplotypes carrying the rare risk alleles. However, large scale explorations of the linkage-disequilibrium (LD) pattern to identify haplotype blocks are not easy to perform, because traditional algorithms have at least Theta (n(2)) time and memory complexity. Results: We derived three incremental optimizations of the widely used haplotype block recognition algorithm proposed by Gabriel et al. in 2002. Our most efficient solution, called MIG(,)(++) has only Theta (n) memory complexity and, on a genome-wide scale, it omits >80% of the calculations, which makes it an order of magnitude faster than the original algorithm. Differently from the existing software, the MIG(++) analyzes the LD between SNPs at any distance, avoiding restrictions on the maximal block length. The haplotype block partition of the entire HapMap II CEPH dataset was obtained in 457 hours. By replacing the standard likelihood-based D' variance estimator with an approximated estimator, the runtime was further improved. While producing a coarser partition, the approximate method allowed to obtain the full-genome haplotype block partition of the entire 1000 Genomes Project CEPH dataset in 44 hours, with no restrictions on allele frequency or long-range correlations. These experiments showed that LD-based haplotype blocks can span more than one million base-pairs in both HapMap II and 1000 Genomes datasets. An application to the North American Rheumatoid Arthritis Consortium (NARAC) dataset shows how the MIG(++) can support genome-wide haplotype association studies. Conclusions: The MIG(++) enables to perform LD-based haplotype block recognit

关键词： Linkage Disequilibrium Haplotype Block Strong Linkage Disequilibrium memory complexity Block Partition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：