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

What about the "dissipation of computation" question? A return to bennett

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 2007年第5-6期62卷 690-713页

作者： Matherat, Philippe CNRS Telecom Paris UMR 5141 F-75013 Paris France

In an electronic computing circuit, all the energy delivered by the electric power supply is converted into heat (dissipation). A result from Bennett in 1973 showed that the minimal amount of dissipated energy is not linked with the time-complexity of the computation, but rather with the size of the result, which can be very low. However, real chips are dissipating proportionally to the time-complexity, and this is the major problem challenging the increase of performance and the miniaturization of mobile devices. Wily are we confronted to this contradiction ? We return to the reading of Bennett's paper in order to look for a renewal of fundamental questions it can rise. We suggest a link with the nature of time and with synchronization in distributed systems. This text is a transcript of the talk given at the MIR seminar (Mathematiques pour l'Iformatique et les Reseaux) in ENST, the March 9th 2006.

关键词： computer theory thermal dissipation computing complexity finite automation deterministic automation reversibility

来源：评论

学校读者我要写书评

暂无评论

CHOICE BETWEEN QUADRATIC ESTIMATORS OF POWER SPECTRA

引用

ANNALS OF TELECOMMUNICATIONS 1984年第3-4期39卷 113-128页

作者： CLERGEOT, H Laboratoire des Signaux et Systèmes C.N.R.S.-E.S.E. Plateau du Moulon 91190 Gif-sur-Yvette

Analyse Les méthodes quadratiques d’estimation du spectre de puissance sont comparées, à durée totale d’observation donnée, sur la base de la matrice de la forme quadratique associée. En se limitant au cas de spectres à variations lentes, excluant le cas de raies étroites par rapport à Vinverse de la durée totale d’observation, on montre que la variance minimale à résolution donnée est obtenue si cette matrice est de la forme Toeplitz. Une comparaison détaillée est faite, au point de vue estimation et complexité de calcul, entre les méthodes équivalentes au lissage du périodogramme total et la méthode très populaire du moyennage de plusieurs périodogrammes partiels. La présentation adoptée permet de clarifier le choix des paramètres et d’éviter des erreurs courantes en particulier pour l’analyse sur un intervalle court.

关键词： Signal spectrum Power spectrum Spectral analysis Quadratic estimation Non parametric estimator Comparative study Toeplitz matrix Fast Fourier transformation Spectral window computing complexity

来源：评论

学校读者我要写书评

暂无评论

An intelligent cryptographic key management model for secure communications in distributed industrial intelligent systems

引用

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2022年第12期37卷 10158-10171页

作者： Chaeikar, Saman Shojae Alizadeh, Mojtaba Tadayon, Mohammad Hesam Jolfaei, Alireza Iranians Univ Fac Comp Engn Tehran Iran Lorestan Univ Fac Comp Engn Khorramabad Iran Iran Telecommun Res Ctr ITRC ICT Secur Tehran Iran Macquarie Univ Dept Comp Sydney NSW Australia

For secure communication in a distributed cooperation, generally, the data are encrypted and decrypted using a symmetric key. The process of creating, distributing, storing, deploying, and finally revoking the cryptographic keys is called key management. On the basis of the structure, usability, and complexity of the cyber-physical systems, each one of the current key management practices is suitable for a specific range of applications. However, these schemes have some drawbacks in common, such as complicated key generation and distribution process, using key storage, attacks, and traffic load. This paper proposes a key management model for establishing secure communications in the distributed industrial intelligent systems. The model is attack resistant, has high usability in real-world applications, and transforms the current customary key management workflow to enhance security and reduce weaknesses. Its main features include reduced process, intelligent attack resistance, producing dynamic keys with no additional cost, and eliminating key storage and revocation calls.

关键词： computing complexity cryptographic key management cyber‐ physical systems cybersecurity distributed systems industrial intelligent systems secure communication

来源：评论

学校读者我要写书评

暂无评论

A REDUCED-STATE VITERBI RECEIVER WITH PREFILTERING FOR THE MOBILE RADIO CHANNEL

引用

ANNALS OF TELECOMMUNICATIONS 1992年第5-6期47卷 227-234页

作者： GUREN, HC ROSTE, T SKALVIK, JN 1. ABB Corporate Research N-1361 Billingstad P.O. Box 90 Norvège

This paper presents a possible receiver structure for high bit rate transmission on the mobile radio channel. The receiver is based on a reduced-state Viterbi algorithm combined with decision feedback, known as Decision Feedback Sequence Estimation. A TDMA concept using a training sequence for channel estimation and continuous phase modulation is assumed. For channel estimation a least squares method is studied, and an adaptive prefilter is used to improve the receiver performance on minimum phase channels. Estimates on the computational complexity of the receiver and simulation results showing the performance on a typical urban (TU) channel are presented. The results show that the prefilter improves,the performance of the receiver significantly when a small number of states is used in the Viterbi algorithm. However, the computational complexity for 2 Mbit/s continuous transmission is very high.

关键词： MOBILE RADIOCOMMUNICATION LAND MOBILE SERVICE HIGH RATE VITERBI DECODING ADAPTATIVE FILTERING computing complexity SIMULATION OPTIMAL RECEIVER

来源：评论

学校读者我要写书评

暂无评论

Low complexity syndrome algorithm for the decoding of convolutional codes

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 2005年第7-8期60卷 1080-1102页

作者： Antoine, J Husson, L Wautier, A Paul, N Dany, JC Brouet, J Ecole Super Elect SUPLEC Dept Telecommun F-91192 Gif Sur Yvette France Alcatel Res & Innovat F-91461 Marcoussis France

The decoding of convolutional codes in the maximum likelihood sense is carried out in a traditional way with the Viterbi algorithm (m). We proposed a soft and hard input decoder where the VA, associated with an relevant metric, is applied to identify the error vector rather than the information message. In this paper we show that, with this type of decoding, the exhaustive computation of a majority of ACS (Add Compare Select) is unnecessary. Moreover we show that optimal performance is achieved in the case of a hard input decoder and that performance closed to the optimum is achieved in the case of a soft input decoder while offering of a reduction of the complexity which is all the more important than the Ec/No ratio is (e. g. for ratio Ec/No greater than 3 dB, more than 80% of the ACS can be avoided). We also propose an algorithm allowing rejecting a frame without having to carry out any iteration of the VA.

关键词： error correcting code convolutional code decoding computing complexity Viterbi decoding simulation

来源：评论

学校读者我要写书评

暂无评论

A fast realization of new Mersenne number transformation and its applications

引用

INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS 2019年第5期47卷 738-752页

作者： Hua, Jingyu Liu, Fei Xu, Zhijiang Li, Feng Wang, Dongming Zhejiang Univ Technol Sch Informat Engn Hangzhou 310014 Zhejiang Peoples R China Zhejiang Univ technol Dept Commun Engn Hangzhou Zhejiang Peoples R China Southeast Univ Natl Commun Res Lab Nanjing Jiangsu Peoples R China

The new Mersenne number transform (NMNT) can be realized by the fast Fourier transform (FFT) with power-of-two length, which results in great flexibility in real-world fixed-point computations, such as the convolution-based signal processing in the embedded device. Yet the FFT realization exists the truncation errors and in order to further reduce the computations, this paper puts forward a novel realization structure for the NMNT, where the Walsh-Hadamard transform (WHT) is employed to accelerate the NMNT computation. Moreover, we also propose the refined computing structure using the matrix decomposition and multiple constant multiplication (MCM), and then all multiplications can be replaced by the shift-addition operations without precision loss. Besides, the use of lookup table (LUT) to reduce the complexity is also discussed in our study. A typical convolution application is tested by computer simulations, while the result demonstrates that the proposed scheme produces precise computing results with reduced complexity.

关键词： computing complexity fast realization Walsh-Hadamard new mersenne number transform Walsh Hadamard transform

来源：评论

学校读者我要写书评

暂无评论

Fast prediction mode selection and CU partition for HEVC intra coding

引用

IET IMAGE PROCESSING 2020年第9期14卷 1892-1900页

作者： Fu, Bin Zhang, Qiangqing Hu, Jianling Soochow Univ Sch Elect & Informat Engn Suzhou 215006 Jiangsu Peoples R China

Compared with the predecessor H.264/advanced video coding, high-efficiency video coding (HEVC) is a new video coding standard with nearly double coding efficiency under the same coding quality. However, the computing complexity of HEVC increases sharply. To solve this problem, a fast algorithm for intra prediction mode selection based on mode grouping is proposed by reducing the number of modes entering rough mode decision. Moreover, the dual support vector machine is proposed to efficiently select the coding unit (CU) size, which is based on texture features of CU and sub-CUs including content complexity and direction complexity. By using the new CU size selection algorithm, the encoder can confirm the split for complex CU and terminate the split for simple CU in advance, so as to reduce the computing complexity of CU size selection. The experimental results show that by employing the two fast algorithms in intra coding, it can save 42.80% encoding time, with 0.98% increment in bit rate and 0.018 dB loss of peak-signal-to-noise ratio of luminance, compared with the reference software x265-1.7.

关键词： computational complexity support vector machines video coding rate distortion theory complex CU CU size selection algorithm direction complexity coding unit size dual support vector machine rough mode decision mode grouping intra prediction mode selection computing complexity coding quality double coding efficiency video coding standard high-efficiency video coding HEVC intra coding CU partition fast prediction mode selection

来源：评论

学校读者我要写书评

暂无评论

The minimum number of discriminant equations for a symmetric game

引用

IET CONTROL THEORY AND APPLICATIONS 2022年第17期16卷 1782-1791页

作者： Wang, Lei Liu, Xinyun Li, Ting Zhu, Jiandong Nanjing Normal Univ Sch Math Sci Nanjing 210023 Peoples R China Weifang Univ Sch Math & Informat Sci Weifang Peoples R China

The discriminant equations with the minimum number for a symmetric game are derived. By using a new version of the semi-tensor product method based on adjacent transpositions, the analysis of symmetric games is greatly simplified. Some new necessary and sufficient conditions for symmetric games are proposed, a basis of the symmetric game space is easily calculated, and the computing complexity is achieved. Finally, two examples are displayed to show the effectiveness of the proposed method.

关键词： semitensor product method number theory tensors discriminant equations adjacent transpositions computational complexity computing complexity minimum number game theory symmetric game

来源：评论

学校读者我要写书评

暂无评论

Intelligent resource sharing to enable quality of service for network clients: the trade-off between accuracy and complexity

引用

computing 2022年第5期104卷 1219-1231页

作者： da Costa, Luis Antonio L. F. Kunst, Rafael de Freitas, Edison Pignaton Univ Fed Rio Grande do Sul Porto Alegre RS Brazil Univ Rio Sinos Valley UNISINOS Sao Leopoldo Brazil

Wireless network traffic estimation is of paramount importance for commercial network operators. Accurate traffic forecasting impacts resource allocation that ultimately influences the quality of service perceived by network clients. This kind of forecasting is particularly challenging in real-time scenarios since this operation demands the implementation of advanced artificial intelligence algorithms, which may be prohibitively complex in some scenarios. This article analyzes the trade-off between traffic forecasting accuracy and the complexity of artificial intelligence algorithms applied to this end. Such analysis brings a consistent contribution since the results allow network operators to select the most suitable model for their needs, leading to a well-organized resource sharing initiative that can reduce the amount of investment demanded by these operators to provide a high quality of service to their clients.

关键词： Artificial intelligence computing complexity Network traffic forecasting Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A NEW ECHO-CANCELLING SYSTEM WITH INTERPOLATION

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1984年第11-1期39卷 499-513页

作者： BAUCHOT, F MACCHI, O Laboratoire des Signaux et Systèmes CNRS-ESE Plateau du Moulon F-91190 Gif-sur-Yvette

Analyse Cette étude présente un dispositif original d’annulation d’écho adaptative à suréchantillonnage dans lequel un interpolateur de structure simple remplace la moitié des annuleurs d’écho utilisés dans un dispositif classique. Si l’on s’autorise une dissymétrie entre les équipements aux deux extrémités de transmission (fréquences porteuses différentes), la mise en cascade d’un annuleur d’écho et d’un filtre interpolateur présente des performances bien meilleures que celles d’un dispositif classique. Ceci est dû au fait que l’interpolateur réduit le bruit de l’algorithme du gradient gouvernant l’évolution des annuleurs d’écho. L’utilisation d’un tel interpolateur permet de réduire la complexité de calcul dans des proportions très intéressantes (supérieures à 40%). Des simulations sur ordinateur ont permis de confirmer les developpements theoriques et d’apprécier la bonne robustesse du dispositif décrit.

关键词： Echo canceller Interpolator Adaptive method Digital transmission Analytic signal Linear filter Estimation error Optimization computing complexity Theoretical study Digital simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：