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

Precoding methods for multi-input multi-ouput interference channels with channel covariance Feedback

IET COMMUNICATIONS 2015年第4期9卷 517-525页

作者： Zhou, Wen Shantou Univ Dept Elect Engn Shantou Peoples R China Guangdong Prov Key Lab Digital Signal & Image Pro Guangzhou Guangdong Peoples R China

Usually, instantaneous channel information is required by the transmitter for the precoding in multi-input multi-output interference channels. In the case of fast fading channels, the resultant additional overhead of the system will be high. Against this, this study considers the scenario where the channel is spatially correlated and the transmitter only has the covariance information of the channel so that the system overhead can be reduced. On the basis of maximum signal-to-interference-plus-noise ratio (SINR) criterion, the author proposes two precoding methods, including the iterative precoding and bisection search precoding methods. The first method solves the optimal precoder of a given user provided that others' precoders are known, so that the SINR can be increased gradually. Whereas the second method introduces an auxiliary variable, transforms the original non-convex problem into a convex one, and solves it by convex optimisation softwares. Both the proposed methods are proved to be convergent and their computation complexity and overheads are also analysed. Under various system settings, the proposed two methods are compared with a few existing precoding or joint transceiver methods by numerical method and computer simulation, and the superiority of the proposed methods is also shown in most cases.

关键词： covariance matrices computational complexity convex programming fading channels radio transceivers feedback radiofrequency interference MIMO communication precoding channel coding precoding method channel covariance feedback instantaneous channel information transmitter fading channel spatial correlation system overhead reduction maximum signal-to-interference-plus-noise ratio criterion SINR criterion iterative precoding bisection search precoding method auxiliary variable nonconvex problem transformation convex optimisation software computation complexity joint transceiver method covariance matrix multiinput multioutput interference channel MIMO interference channels

来源：评论

学校读者我要写书评

暂无评论

Online Routing for Autonomous Vehicle Cruise Systems with Fuel Constraints

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2022年第4期104卷 1-16页

作者： Li, Longjiang Liang, Haoyang Wang, Jie Yang, Jianjun Li, Yonggang Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 611731 Peoples R China Chongqing Univ Posts & Telecommun Chongqing 400065 Peoples R China

Autonomous ground/aerial vehicles (UGVs/UAVs) boost many potential applications over past few years, but it usually takes a long time or a large price to fully recharge or refuel a vehicle, so it is extremely important to make efficient routing decisions for autonomous vehicles with limited fuel capacity. This paper elaborates the uninterrupted cruising requirements for autonomous vehicles and the influence of limited fuel capacity on the routing policies. We provide a proof that the basic cruising problem is NP-hard in the general case, though the previous work formulated it as a polynomial problem based on some oversimplified assumptions, which result in a degraded performance under the condition of limited fuel capacity. This is formulated as a mixed-integer non-convex optimization problem, which is difficult to solve in general. Furthermore, we observed that the nature of the limited fuel capacity is a limitation on the solution space of the cruising problem, which motivated us to construct an efficient heuristic solution by applying the fuel constraints iteratively on the shortest path that can be obtained in polynomial time. Since targets are usually requested in an online way in real cruising applications, we design a sliding window-based algorithm, so that a tradeoff can be made between the routing efficiency and the computation complexity by adjusting the window size. Finally, the simulation results show that the proposed scheme reduces the computation complexity by at least 13 times, simultaneously with performance improvements by about 7% in terms of fuel consumption than the alternative algorithms.

关键词： Autonomous vehicles Fuel constraints Cruising problems computation complexity Online algorithms

来源：评论

学校读者我要写书评

暂无评论

Cost-effective triple-mode reconfigurable pipeline FFT/IFFT/2-D DCT processor

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2008年第8期16卷 1058-1071页

作者： Lin, Chin-Teng Yu, Yuan-Chu Van, Lan-Da Natl Chiao Tung Univ Coll Elect Engn & Comp Sci Hsinchu 300 Taiwan Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan Natl Chiao Tung Univ Dept Elect & Control Engn Hsinchu 300 Taiwan

This investigation proposes a novel radix-4(2) algorithm with the low computational complexity of a radix-16 algorithm but the lower hardware requirement of a radix-4 algorithm. The proposed pipeline radix-4(2) single delay feedback path (R4(2)SDF) architecture adopts a multiplierless radix-4 butterfly structure, based on the specific linear mapping of common factor algorithm (CFA), to support both 256-point fast Fourier transform/inverse fast Fourier transform (FFT/IFFT) and 8 x 8 2-D discrete cosine transform (DCT) modes following with the high efficient feedback shift registers architecture. The segment shift register (SSR) and overturn shift register (OSR) structure are adopted to minimize the register cost for the input re-ordering and post computation operations in the 8 x 8 2-D DCT mode, respectively. Moreover, the retrenched constant multiplier and eight-folded complex multiplier structures are adopted to decrease the multiplier cost and the coefficient ROM size with the complex conjugate symmetry rule and subexpression elimination technology. To further decrease the chip cost, a finite wordlength analysis is provided to indicate that the proposed architecture only requires a 13-bit internal wordlength to achieve 40-dB signal-to-noise ratio (SNR) performance in 256-point FFT/IFFT modes and high digital video (DV) compression quality in 8 x 8 2-D DCT mode. The comprehensive comparison results indicate that the proposed cost effective reconfigurable design has the smallest hardware requirement and largest hardware utilization among the tested architectures for the FFT/IFFT computation, and thus has the highest cost efficiency. The derivation and chip implementation results show that the proposed pipeline 256-point FFT/IFFT/2-D DCT triple-mode chip consumes 22.37 mW at 100 MHz at 1.2-V supply voltage in TSMC 0.13-mu m CMOS process, which is very appropriate for the RSoCs IP of next-generation handheld devices.

关键词： computation complexity cost effective hardware utilization next-generation wireless communications pipeline architecture R4(2)SDF triple modes

来源：评论

学校读者我要写书评

暂无评论

Chinese remainder Theorem based centralised group key management for secure multicast communication

引用

IET INFORMATION SECURITY 2014年第3期8卷 179-187页

作者： Vijayakumar, Pandi Bose, Sudan Kannan, Arputharaj Univ Coll Engn Tindivanam Dept Comp Sci & Engn Tindivanam 604001 Tamil Nadu India Anna Univ Chennai Dept Comp Sci & Engn Madras 600025 Tamil Nadu India Anna Univ Chennai Dept Informat Sci & Technol Madras 600025 Tamil Nadu India

Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O(1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.

关键词： communication complexity multicast communication multimedia communication telecommunication security Chinese remainder theorem centralised group key management secure multimedia multicast communication computation complexity

来源：评论

学校读者我要写书评

暂无评论

On the Construction and Analysis of Verifiable Multi-secret Sharing Based on Non-homogeneous Linear Recursion

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2018年第3期34卷 749-763页

作者： Zhang, Ben-Hui Tang, Yuan-Sheng Huaibei Normal Univ Sch Math Sci Huaibei 235000 Peoples R China Yangzhou Univ Sch Math Sci Yangzhou 225002 Jiangsu Peoples R China

We shall propose two verifiable multi-secret sharing schemes based on novel non homogeneous linear recursions. In the initial phase, the secret shadow of each participant is selected by himself. In the construction phase, the dealer puts the information of shared secrets in the initialization vector of non-homogeneous linear recursions of degree t - 1. In the verification phase, verification algorithms based on elliptic curve are designed to resist a variety of cheating actions or attacks. In the recovery phase, each participant just needs to provide secret share instead of secret shadow. The proposed schemes have the following features: verifiability, the reuse of secret shadows and shared secrets is possible, only public channels are needed. Compared with previous schemes, they have better performance, fewer public values, lower computation complexity, shorter key length and less running time.

关键词： secret sharing non-homogeneous linear recursion public value computation complexity running time

来源：评论

学校读者我要写书评

暂无评论

Parallel information-based complexity of numerical integration on holder class H-M(s,alpha)(Omega)

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1996年第3-4期62卷 297-308页

作者： Jiang, TZ [a] Pattern Recognition Laboratory Institute of Automation Chinese Academy of Sciences Beijing P.R. China

This paper deals with the parallel information-based complexity of numerical integration on Holder class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously: the number ... 详细信息

关键词： parallel model information computation complexity numerical integration Holder class

来源：评论

学校读者我要写书评

暂无评论

Partial interference alignment for downlink multi-cell multi-input-multi-output networks

引用

IET COMMUNICATIONS 2015年第6期9卷 836-843页

作者： Zhang, Yang Zhou, Zheng Li, Bin Gu, Chaozhi Shu, Ruo China Univ Petr UPC Coll Comp & Commun Engn Qingdao 266580 Peoples R China Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100876 Peoples R China

Interference alignment (IA) is a novel technique to achieve the optimal degree of freedom of wireless communication systems through efficient interference management. In a large size multi-cell network, IA over a full connected model requires the impractical number of transmit/receive antennas. Moreover, extensive channel state information is delivered over the backhaul between different base-stations. For realistic scenarios with limited quantity of transceiver antennas, such a full IA scheme may even become infeasible. In this study, by exploiting the heterogeneous path losses, the authors propose a novel partial IA scheme to enhance the throughput of multi-cell networks, which requires relatively small amounts of antennas and hence can be practically implemented. They first formulate the partial IA problem in terms of a mixed integer bi-level non-linear optimal program. Then, they decompose the problem into two sub-problems to reduce the computation complexity and, furthermore, introduce two algorithms for interference links selection. It is shown that, in a 19 hexagonal wrap-around-cell layout, their proposed algorithm outperforms a standard multi-user multi-input-multi-output technique with far less transmit antennas. The present scheme is therefore of great promise to practical applications.

关键词： radiofrequency interference cellular radio mobility management (mobile radio) MIMO communication radio transceivers transmitting antennas receiving antennas wireless channels integer programming nonlinear programming computational complexity antenna arrays partial interference alignment management downlink multicell multiinput-multioutput network wireless communication system transmit-receive antenna channel state information base-station transceiver antenna IA scheme heterogeneous path loss mixed integer bilevel nonlinear optimal programming computation complexity hexagonal wrap-around-cell layout

来源：评论

学校读者我要写书评

暂无评论

A Revised TOPSIS Method Based on Interval Fuzzy Soft Set Models with Incomplete Weight Information

引用

FUNDAMENTA INFORMATICAE 2017年第3期152卷 297-321页

作者： Yang, Yong Peng, Xindong Northwest Normal Univ Coll Comp Sci & Engn Lanzhou 730070 Gansu Peoples R China Shaoguan Univ Sch Informat Sci & Engn Shaoguan 512005 Guangdong Peoples R China

Soft set theory was originally proposed by Molodtsov in 1999 as a general mathematical tool for dealing with uncertainty. However, it has been pointed out that classical soft set model is not appropriate to deal with imprecise and fuzzy problems. In order to handle these types of problems, some fuzzy extensions of soft set theory are presented, yielding fuzzy soft set theory. As a further research, in this work, we first propose concepts of interval fuzzy sets and interval fuzzy soft sets, define some operations on them and study some of their relevant properties, especially, the dual laws are discussed with respect to difference operation in interval fuzzy soft set theory. We then introduce a revised Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) method and choice value method for interval fuzzy soft set which the weight information is completely unknown. Meanwhile, an analysis of computation complexity is employed, also the discriminative power of two methods are shown. Finally, two illustrative examples are employed to show that they can be successfully applied to problems that contain uncertainties.

关键词： Interval fuzzy sets interval fuzzy soft sets TOPSIS computation complexity discriminative power

来源：评论

学校读者我要写书评

暂无评论

Low complexity multifocus image fusion in discrete cosine transform domain

引用

OPTICA APPLICATA 2013年第4期43卷 693-706页

作者： Phamila, Asnath Victy Amutha, R. SSN Coll Engn Dept Elect & Commun Engn Madras 603110 Tamil Nadu India

This paper presents a low complex, highly energy efficient sensor image fusion scheme explicitly designed for wireless visual sensor systems equipped with resource constrained, battery powered image sensors and employed in surveillance, hazardous environment like battlefields etc. Here an energy efficient simple method for fusion of multifocus images based on higher valued AC coefficients calculated in discrete cosine transform domain is presented. The proposed method overcomes the computation and energy limitation of low power devices and is investigated in terms of image quality and computation energy. Simulations are performed using Atmel ATmega128 processor of Mica 2 mote, to measure the resultant energy savings and the simulation results demonstrate that the proposed algorithm is extremely fast and consumes only around 1% of energy consumed by conventional discrete cosine transform based fusion schemes. Also the simplicity of our proposed method makes it more appropriate for real-time applications.

关键词： sensor image fusion discrete cosine transform (DCT) energy consumption computation complexity fusion metrics

来源：评论

学校读者我要写书评

暂无评论

Image analysis by fast improved radial harmonic-Fourier moments algorithm

引用

INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY 2020年第4期30卷 1033-1045页

作者： He, Bing Cui, Jiangtao Peng, Yanguo Yang, Tengfei Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China Weinan Normal Univ Sch Phys & Elect Engn Weinan Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Network Data Anal & Intelligent P Xian Peoples R China

Radial harmonic-Fourier moments (RHFMs) are popular for image reconstruction and invariant pattern recognition due to their properties of translation, scaling and rotation invariant. RHFMs possess lower computation complexity as compared to Zernike moments and Bessel-Fourier moments. However, they always suffer from discontinuity, numerical instability near the center of image, and reconstruction error, especially have a rise for higher order of moments. In this paper, an improvement of radial harmonic-Fourier moments (IRHFMs) is proposed for effectively avoiding the above-mentioned *** this paper, a 2D fast Fourier transform algorithm also is applied to the image matrix to obtain the IRHFMs. Simulation experimental results demonstrate the proposed IRHFMs perform better than traditional RHFMs and other classic orthogonal moments including the latest image moments, for example, polar harmonic Fourier moments in terms of the image reconstruction capability and rotation invariant recognition accuracy in noise-free and noisy conditions.

关键词： computation complexity image reconstruction numerical instability radial harmonic-Fourier moments

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：