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

22nd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Sertthin, Chinnapat Ohtsuki, Tomoaki Takyu, Osamu Fujii, Takeo Umeda, Yohtaro Keio Univ Fac Sci & Technol Dept Informat & Comp Sci Tokyo 108 Japan Shinshu Univ Div Sci & Technol Dept Elect Engn Matsumoto Nagano Japan Univ Electrocommun AWCC Chofu Tokyo Japan Tokyo Univ Sci Dept Elect Engn Fac Sci & Technol Tokyo Japan

ISBN: (纸本)9781457713484

Nearest transmitter information is a mandatory requirement for utilizing Switching Estimated Receiver Position (SwERP) scheme, of which was proposed to enhance accuracy of Visible Light ID (VLID) positioning system. The conventional approach is achieved by controlling Sensitivity (RxS) limit. Conversely, general distance estimation by optical received power can also be used. Both of the mentioned methods have disadvantage on implementation complexity and inaccuracy due to noise fluctuation, respectively. In this paper, we propose a nearest transmitter classification (NTC) method by utilizing Optical Orthogonal Code (OOC) with On-Off Keying (OOK) modulation at transmitters (T(x)s), and perform oversampling at a receiver (R-x) to overcome the limitation of bandwidth resolution (B). The results confirm that the proposed method can classify the nearest T-x accurately, with some tradeoff with computation complexity from the increment of oversampling factor (O-c).

关键词： Adaptive optics NTC method Noise OOC OOK modulation Optical noise Optical pulses Optical receivers Optical transmitters SwERP scheme VLC based positioning system VLID positioning system amplitude shift keying computation complexity nearest transmitter classification method nearest transmitter information noise fluctuation on-off keying modulation optical modulation optical orthogonal code optical received power optical receivers optical transmitters switching estimated receiver position scheme visible light ID positioning system

来源：评论

学校读者我要写书评

暂无评论

THE STUDY OF AN M-ARY MC-CDMA SYSTEM BASED ON CYCLIC SPREADING CODES & PRE-EQUALIZATION

引用

Journal of Electronics(China) 2005年第3期22卷 273-280页

作者： ChuZhenyong YingXiaofan YiKechu TianHongxin NationalKeyLab.ofISN XidianUniversityXi＇an710071China／／TheTelecommunicationEngineeringInstituteAirForceEngineeringUniversityXi＇an710077China NationalKeyLab.ofISN XidianUniversityXi＇an710071China

A novel fast despreading scheme for M-ary Multi-Carrier Code-Division Multiple Access (MC-CDMA) system is proposed based on cyclic spreading codes and pre-equalizer. In the transmitter, the M spreading codes of each user are generated by circularly shifting the prototype spreading code. A feedback pre-equalizer is employed to process the M-ary MC- CDMA signal before transmitted. The received signal is multiplied by the Inverse Discrete Fourier Transform (IDFT) result of the mirror image code of the prototype spreading code, and then demodulated by Orthogonal Frequency-Division Multiplexing (OFDM) demodulator. Compared with the conventional M-ary MC-CDMA receiver, the proposed scheme increases bandwidth efficiency, meanwhile, it achieves M-ary despread spectrum and multi-carrier demodulation, which reduces computation complexity remarkably.

关键词： Multi-Carrier Code-Division Multiple Access (MC-CDMA) M-ary spread spec- trum Cyclic spreading codes Pre-equalization computation complexity

来源：评论

学校读者我要写书评

暂无评论

Rai-Choo! Evolving Blind Signatures to the Next Level 42nd

Rai-Choo! Evolving Blind Signatures to the Next Level

引用

42nd Annual International Conference on Theory and Applications of Cryptographic Techniques (Eurocrypt)

作者： Hanzlik, Lucjan Loss, Julian Wagner, Benedikt CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany Saarland Univ Saarbrucken Germany

ISBN: (纸本)9783031305887;9783031305894

Blind signatures are a fundamental tool for privacy-preserving applications. Known constructions of concurrently secure blind signature schemes either are prohibitively inefficient or rely on nonstandard assumptions, even in the random oracle model. A recent line of work (ASIACRYPT '21, CRYPTO '22) initiated the study of concretely efficient schemes based on well-understood assumptions in the random oracle model. However, these schemes still have several major drawbacks: 1) The signer is required to keep state;2) The computation grows linearly with the number of signing interactions, making the schemes impractical;3) The schemes require at least five moves of interaction. In this paper, we introduce a blind signature scheme that eliminates all of the above drawbacks at the same time. Namely, we show a round-optimal, concretely efficient, concurrently secure, and stateless blind signature scheme in which communication and computation are independent of the number of signing interactions. Our construction also naturally generalizes to the partially blind signature setting. Our scheme is based on the CDH assumption in the asymmetric pairing setting and can be instantiated using a standard BLS curve. We obtain signature and communication sizes of 9 KB and 36 KB, respectively. To further improve the efficiency of our scheme, we show how to obtain a scheme with better amortized communication efficiency. Our approach batches the issuing of signatures for multiple messages.

关键词： Blind Signatures Standard Assumptions Random Oracle Model Cut-and-Choose computation complexity Round complexity

来源：评论

学校读者我要写书评

暂无评论

A New Approach for Affine-invariant Image Matching

A New Approach for Affine-invariant Image Matching

引用

International Conference on Mechatronics and Semiconductor Materials (ICMSCM 2013)

作者： Chen, Wenlong Xiao, Baihua Wang, Chunheng Chinese Acad Sci Inst Automat State Key Lab Management & Control Complex Syst Beijing Peoples R China

ISBN: (纸本)9783037859391

Affine-invariant matching is one of the challenging fields for image matching. Although several algorithms (ASIFT, Fair-SURF) have been proposed and achieved expressive performance, all these method need to simulate perspective changes and exhaust all possible match which is of high computation complexity (O(N-2)). In this paper, we proposed a new method to introduce global descriptor to filter out much unnecessary coarse matches for the matching procedure. Specially, the computation complexity of matching procedure in our method reduces significantly to O(N). But, the experiment result shows that the proposed method can achieve comparable performance to ASIFT at much lower cost.

关键词： Global descriptor Affine-invariant Simulating computation complexity

来源：评论

学校读者我要写书评

暂无评论

An optimization on GLRT-based detection for LTE PUCCH

An optimization on GLRT-based detection for LTE PUCCH

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Xie, Lijun Peng, Tao Wang, Wenbo Beijing Univ Posts & Telecommun Wireless Signal Proc & Network Beijing Peoples R China

ISBN: (纸本)9781509002436

This paper gives a basic optimization on the detection of Uplink Control Information (UCI) transmitted in Long Term Evolution (LTE) Physical Uplink Control Channel (PUCCH). UCI includes HARQ-ACK and Channel Quality Indicator (CQI) bits. In this paper we study the detection technique based on the generalized likelihood-ratio test (GLRT) paradigm. On the case that the noise variances in two slots are different, the detection performance of GLRT-based algorithm is improved remarkably. However the GLRT-based detection needs to traverse the all data candidates with a cost of higher computation complexity. And then an optimization on GLRT detection is proposed, which improve the detection performance of about 2.8dB for both ACK/NACK and CQI and reduce the computation complexity by straight-forward combination.

关键词： PUCCH GLRT technique signal detection computation complexity

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Extended Predictive Functional Control for Boiler-Turbine Unit of Power Plant 24

Design and Implementation of Extended Predictive Functional ...

引用

24th Mediterranean Conference on Control and Automation (MED)

作者： Farahani, Maryam Amirabadi Haeri, Mohammad Islamic Azad Univ Dept Elect Engn Sci & Res Branch Tehran Iran Sharif Univ Technol Dept Elect Engn Adv Control Syst Lab Tehran Iran

ISBN: (纸本)9781467383455

In this paper, a new model predictive controller is introduced to control a power unit process with three inputs and three outputs. This method is proposed to reduce the complexity of the required computation. In fact, the presented controller ensures achieving an acceptable performance in the presence of noise and disturbances and reduces the volume of calculations to control a complex and nonlinear boiler-turbine process. The simulation results indicate that the implementation of the proposed controller requires less computing time while the performance degradation is not more than five percent.

关键词： Boiler-turbine model predictive controller computation complexity uncertainty disturbance performance

来源：评论

学校读者我要写书评

暂无评论

Delay-Optimal User Scheduling and Inter-Cell Interference Management in Cellular Network via Distributive Stochastic Learning

Delay-Optimal User Scheduling and Inter-Cell Interference Ma...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Huang, Huang Lau, Vincent K. N. Hong Kong Univ Sci & Technol Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781424456383

In this paper, we propose a distributive queue-aware intra-cell user scheduling and inter-cell interference (ICI) management control design for a delay-optimal cellular downlink system with M base stations(BSs). Each BS has K downlink queues for K users respectively with heterogeneous arrivals and delay requirements. The ICI management control is adaptive to joint queue state information (QSI) over a slow time scale, while the user scheduling control is adaptive to both the joint QSI and the joint channel state information (CSI) over a faster time scale. We show that the problem can be modeled as an infinite horizon average cost Partially Observed Markov Decision Problem (POMDP), which is NP-hard in general. By exploiting special problem structure, we shall derive an equivalent Bellman equation to solve the POMDP problem. To address the distributive requirement and the issue of dimensionality and computation complexity, we derive a distributive online stochastic learning algorithm, which only requires local QSI and local CSI at each of the M BSs. We show that the proposed learning algorithm converges almost-surely and has significant gain compared with various baselines. The proposed solution only has linear complexity order O(MK).

关键词： Markov processes NP-hard base stations cellular network cellular radio computation complexity computational complexity delay-optimal cellular downlink system distributive online stochastic learning algorithm equivalent Bellman equation infinite horizon av

来源：评论

学校读者我要写书评

暂无评论

Efficient Encoder Structures for Non-Binary Cycle Codes

Efficient Encoder Structures for Non-Binary Cycle Codes

引用

6th International Conference on Wireless Communications, Networking and Mobile Computing (WICOM)

作者： Chen, Weigang Tianjin Univ Sch Elect & Informat Engn Tianjin 300072 Peoples R China

ISBN: (纸本)9781424437092

Low-density parity-check codes with variable node degree two over high order Galois fields, also called non-binary cycle codes, exhibit good error correction performance. In this paper, several efficient encoder structures are proposed for non-binary cycle codes with only one optimized group of non-zero entries in GF(q) (q > 2). The computation complexity and storage requirement are compared for these methods. Considering the underlying sparse graph of cycle code, the encoding complexity is quite low with the proposed modifications. In this way, a proper tradeoff between complexity and performance is achieved for non-binary cycle codes.

关键词： communication complexity computation complexity cyclic codes encoder structure encoding error correction performance low density parity check codes non binary cycle code parity check codes sparse graph

来源：评论

学校读者我要写书评

暂无评论

Asymptotically Optimal Interconnection Networks from Two-State Cells

引用

IEEE Transactions on Computers 1979年第7期C-28卷 500-505页

作者： Chung, Kin-Man Department of Computer Science University of Illinois Urbana IL 61801 United States IBM Thomas J. Watson Research Center Yorktown Heights NY 10598 United States

Some special classes of interconnection networks for n terminals are considered, namely, partitioning networks and full switches. Constructions for them are presented. For the former, the resulting total count of (two-state) cells is n lo g2n + n - log2n - 1, and the maximum delay is 6 log2n - 4. For the latter, the cell count is (n/2) log2n - (n/2) and the maximum delay is 2 log2n - 1. By establishing appropriate lower bounds, we show that these networks are asymptotically optimal as far as cell count is concerned. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Bell numbers computation complexity full switch index Terms-Analysis of algorithms partitioning networks permutation cells permutation networks three-state cells two-state cells

来源：评论

学校读者我要写书评

暂无评论

Study on multiscale least squares and application in parameter identification

Study on multiscale least squares and application in paramet...

引用

5th International Conference on Machine Learning and Cybernetics

作者： Wen, Cheng-Lin Wang, Guang-Jiang Wang, Song-Wei Zheng, Zhu-Lin Henan Inst Sci & Technol Xinxiang 453003 Peoples R China Henan Univ Sch Comp & Informat Engn Kaifeng 475001 Peoples R China

ISBN: (纸本)1424400600

In various theoretical research and engineering, the long memory processes are widely found and studied in many applications. Maximum likelihood Estimation is usually used to capture the relevant parameters, but it can't be utilized broadly because of the huge burden of computability. In this paper, we firstly use discrete wavelet transform to analyze stochastic processes of time series scale-by-scale, then study the variance and statistical properties of the series over a range of different scales. Subsequently, apply Least Squares Estimation to parameter estimation according to the property that log variance is approximately simple linear equation of log scale, finally a new method named multiscale Least Squares Estimation is put forward. The new algorithm can effectively decrease computation complexity and obtain satisfying estimation precision. This advantage is validated by the data analysis and computer simulation.

关键词： long memory process multiscale analysis multiscale least squares estimation computation complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：