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

Robust Localization over Obstructed Interferences for Inbuilding Wireless Applications

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2009年第1期55卷 105-111页

作者： Kong, Youngbae Kwon, Younggoo Park, Gwitae Korea Univ Dept Elect Engn Seoul 136701 South Korea Konkuk Univ Dept Elect Engn Seoul South Korea

Location-awareness can be applied to the various consumer applications. A received signal strength (RSS) based localization system is relatively inexpensive and simple to be implemented without additional hardware supports. However, the radio signals are strongly affected by the obstructed interferences. This is a difficult problem for the RSS based localization systems to be implemented in real world. To solve this problem, we propose a practical and robust localization algorithm in the obstructed environments. The proposed algorithm uses the maximum Likelihood Estimation (MLE) based on the position probability grid. In addition, the proposed algorithm detects and compensates the large measurement error using the min-max algorithm. We evaluated the performance of the proposed algorithm in the obstructed environments. Performance results show that the proposed algorithm outperforms other algorithms on the obstructed environments.(1)

关键词： Location-awareness Received signal strength Obstructed interference maximum likelihood estimation min-max algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Check Node Processing Architectures for Non-binary LDPC Decoding Using Power Representation

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2014年第2期76卷 211-222页

作者： Cai, Fang Zhang, Xinmiao Case Western Reserve Univ Cleveland OH 44106 USA Case Western Reserve Univ Dept Elect Engn & Comp Sci Cleveland OH 44106 USA

When the code length is moderate, non-binary low-density parity-check (NB-LDPC) codes can achieve better error correcting performance than their binary counterparts at the expense of higher decoding complexity. The check node processing is a major bottleneck of NB-LDPC decoding. This paper proposes novel schemes for both the min-max and the simplified min-sum check node processing by making use of the cyclical-shift property of the power representation of finite field elements. Compared to previous designs based on the min-max algorithm with forward-backward scheme, the proposed check node units (CNUs) do not need the complex switching network. Moreover, the multiplications of the parity check matrix entries are efficiently incorporated. For a min-max NB-LDPC decoder over G F(32), the proposed scheme reduces the CNU area by at least 32 %, and leads to higher clock frequency. Compared to the prior simplified min-sum based design, the proposed CNU is more regular, and can achieve good throughput-area tradeoff.

关键词： Non-binary LDPC decoding Power representation VLSI Check node unit architecture min-max algorithm Simplified min-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

Range identification for nonlinear parameterizable paracatadioptric systems

引用

AUTOMATICA 2010年第7期46卷 1129-1140页

作者： Nath, Nitendra Tatlicioglu, Enver Dawson, Darren M. Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA Izmir Inst Technol Dept Elect & Elect Engn TR-35430 Izmir Turkey

In this paper, a new range identification technique for a calibrated paracatadioptric system mounted on a moving platform is developed to recover the range information and the three-dimensional (3D) Euclidean coordinates of a static object feature. The position of the moving platform is assumed to be measurable. To identify the unknown range, first, a function of the projected pixel coordinates is related to the unknown 3D Euclidean coordinates of an object feature. This function is nonlinearly parameterized (i.e., the unknown parameters appear nonlinearly in the parameterized model). An adaptive estimator based on a min-max algorithm is then designed to estimate the unknown 3D Euclidean coordinates of an object feature relative to a fixed reference frame which facilitates the identification of range. A Lyapunov-type stability analysis is used to show that the developed estimator provides an estimation of the unknown parameters within a desired precision. Numerical simulation results are presented to illustrate the effectiveness of the proposed range estimation technique. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Nonlinear parameterization Range identification Paracatadioptric systems Lyapunov methods Vision-based estimation min-max algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Fully Parallel Decoder Architecture for Nonbinary LDPC Codes

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2014年第12期22卷 2649-2660页

作者： Lin, Jun Yan, Zhiyuan Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

Nonbinary low-density parity-check (NB-LDPC) codes outperform their binary counterparts in some cases, but their high decoding complexity is a significant hurdle to their applications. In this paper, we propose a decoding algorithm with reduced computational complexities and smaller memory requirements for NB-LDPC codes. First, a simplified algorithm is proposed to reduce the computational complexity of variable node processing. To reduce the memory requirements, existing NB-LDPC decoders often truncate the message vectors to a limited number n(m) of values. However, the memory requirements of these decoders remain high when the field size is large. In this paper, an improved trellis-based check node processing algorithm is proposed to significantly reduce the memory requirement. The number of elements in a variable-to-check message is reduced to n(v) (n(v) < n(m)). The sorted log likelihood ratio (LLR) vector of a check-to-variable (c-to-v) message is approximated using a piecewise linear function. For each a priori message, most of the LLRs are approximated with a linear function. Two low complexity LLR generation units (LGUs) are proposed to compute LLR vectors for c-to-v messages. A fully parallel NB-LDPC decoder over GF(256) is implemented with 28-nm CMOS technology. The decoder over GF(256) achieves a through-put of 546 Mb/s and an energy efficiency of 0.178 nJ/b/iter.

关键词： Fully parallel decoder architecture log likelihood ratio (LLR) approximation min-max algorithm nonbinary low-density parity-check (NB-LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

Reduced-Rank STAP for Slow-Moving Target Detection by Antenna-Pulse Selection Reduced-Rank STAP for Slow-Moving Target Detection by Antenna-Pulse Selection

引用

IEEE SIGNAL PROCESSING LETTERS 2015年第8期22卷 1156-1160页

作者： Wang, Xiangrong Aboutanios, Elias Amin, Moeness G. Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Villanova Univ Coll Engn Ctr Adv Commun Villanova PA 19085 USA

Space-time adaptive processing (STAP) is an effective strategy for clutter suppression in airborne radar systems. Limited training data, high computational load and the heterogeneity of training data constitute the main challenges in STAP. In this letter, we propose a new detection strategy based on selecting an optimum subset of antenna-pulse pairs associated with maximum separation between the target and the clutter trajectory. The proposed strategy reduces redundancy while addressing the above three inter-linked challenges for detecting slow-moving targets especially in heterogeneous cases. An iterative min-max algorithm is proposed to solve the antenna-pulse selection problem, which is NP-hard combinatorial optimization. Extensive simulation results confirm the effectiveness of the proposed strategy.

关键词： Clutter trajectory combinatorial optimization heterogeneous clutter min-max algorithm STAP

来源：评论

学校读者我要写书评

暂无评论

Geogames: Designing location-based games from classic board games

引用

IEEE INTELLIGENT SYSTEMS 2006年第5期21卷 40-46页

作者： Schlieder, Christoph Kiefer, Peter Matyas, Sebastian Univ Bamberg D-96045 Bamberg Germany

The traditional image of interactive entertainment - games that reduce players\'\' physical involvement to moving a joy stick - is obsolete. Games researchers and designers are already integrating complex movement into games. Location-based games involve body movements beyond figural space - that is, beyond the space of computer screens and small 3D objects. They focus on locomotion in vista space, typically a single room or sports field, or in environmental space, such as a neighborhood or city. Several location-based games have been designed for environmental space using localization technologies such as GPS. Some are adaptations of popular computer games, and others are rather straightforward chase games. A third type of game - what we call challenging location-based games - combines the intellectual and strategic appeal of classic board games with the real-time locomotion and physical involvement of location-based games. Furthermore, a straightforward approach to the spatial mapping of classic board games doesn\'\'t work. Instead, we developed the Geogames framework, which uses search techniques to identify a single temporal parameter for balancing sportive versus strategic elements

关键词： Global Positioning System computer games entertainment interactive systems mobile computing GPS Geogames classic board games interactive entertainment location-based games game design min-max algorithm state-space anal Computer Games interactive systems Entertainment Location based media Location based services board games automatic game Mobile Computing Video Games

来源：评论

学校读者我要写书评

暂无评论

Optimization of Pulse-agile Sequence for Suppressing Range Folded Clutter Based on Diverse NLFM Waveforms

Optimization of Pulse-agile Sequence for Suppressing Range F...

引用

IEEE Radar Conference (RadarConf)

作者： Sun, Ying-hao Fan, Hua-yu Zhuang, Ruo-dan Ren, Li-xiang Mao, Er-ke Long, Teng Beijing Inst Technol Radar Res Lab Sch Informat & Elect Beijing Peoples R China Minist Educ Key Lab Elect & Informat Technol Satellite Nav Beijing Inst Technol Beijing Peoples R China

ISBN: (纸本)9781728189420

Waveform diversity, which can be used to resolve range ambiguity and suppress range folded clutter in pulse-Doppler radar system, has attracted an increasing amount of attention in recent years. Especially for high pulse repetition frequency (PRF), the range folded clutter severely impacts the detection of small targets with long range and low speed. Using diverse waveforms, pulses of the transmitted sequence of radar are agile. It is possible to construct corresponding matched filters (MFs) to suppress the range folded clutter. However, the performance greatly depends on the cross-correlation among pulses of the transmitted sequence. In this paper, diverse nonlinear frequency modulation (NLFM) waveforms, the spectra of which are based on different window functions, are designed to construct a signal library, and positive and negative frequency modulation rate are both considered. Then, a min-max algorithm is proposed for sequentially selecting NLFM waveforms from the signal library to generate an optimal transmitted sequence. Pulse-to-pulse random initial phases are also added to each pulse of the sequence to further improve the irrelevance among pulses. Moreover, to eliminate the range sidelobe modulation (RSM) effect in Doppler processing, a cyclic algorithm for designing joint mismatched filters (JMMFs) with finite impulse response (FIR) is provided. Simulations show that the optimized pulse-agile sequence based on NLFM waveforms yields satisfactory performance on the ambiguity function, and range folded clutter can be effectively suppressed.

关键词： waveform diversity nonlinear frequency modulation (NLFM) min-max algorithm range sidelobe modulation (RSM) joint mismatched filter (JMMF)

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Membership Functions Based on Point-to-Polygon Distance Evaluation

Fuzzy Membership Functions Based on Point-to-Polygon Distanc...

引用

IEEE International Conference on Fuzzy Systems (FUZZ)

作者： Liparulo, Luca Proietti, Andrea Panella, Massimo Univ Roma La Sapienza Dept Informat Engn Elect & Telecommun DIET Via Eudossiana 18 I-00184 Rome Italy

ISBN: (纸本)9781479900206

In this paper, a new approach is presented for the evaluation of membership functions in fuzzy clustering algorithms. Starting from the geometrical representation of clusters by polygons, the fuzzy membership is evaluated through a suited point-to-polygon distance estimation. Three different methods are proposed, either by using the geometrical properties of clusters in the data space or by using Gaussian or cone-shaped kernel functions. They differ from the basic trade-off between computational complexity and approximation accuracy. By the proposed approach, fuzzy clusters of any geometrical complexity can be used, since there is no longer required to impose constraints on the shape of clusters resulting from the choice of computationally affordable membership functions. The methods illustrated in the paper are validated in terms of speed and accuracy by using several numerical simulations.

关键词： Fuzzy membership function point-to-polygon distance fuzzy clustering min-max algorithm

来源：评论

学校读者我要写书评

暂无评论

Mshindi - an Awale winner

Mshindi - an Awale winner

引用

9th International Conference on Intelligent Games and Simulation

作者： de Boer, Vincent Rothkrantz, Leon Delft Univ Technol Man Machine Interact Grp NL-2628 CD Delft Netherlands

ISBN: (纸本)9789077381458

Mshindi is a program developed for the Tjip Challenge, an open contest to write an Awale program in Java or C# that beats the other participants within time and space constraints. The programs were given two minutes for the whole match and received an extra second For each move. Also the source code and any databases couldn't be larger than 1MB, making it impossible to pre-compute all the game states or even use a very large opening book or endgame database. The design of the program based on the main-max algorithm with alpha-beta pruning will be discussed. The final scores of the competition will be presented.

关键词： Awale min-max algorithm Tjip challenge

来源：评论

学校读者我要写书评

暂无评论

Biased Constrain Hybrid Kalman Filter for Wireless Indoor Localization 18

Biased Constrain Hybrid Kalman Filter for Wireless Indoor Lo...

引用

18th IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)

作者： Zhao, Yubin Li, Xiaofan Fan, Xiaopeng Xu, Cheng-Zhong Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Shenzhen Yaoyuan Technol Co Ltd Shenzhen Peoples R China Shenzhen Inst Radio Testing & Tech Shenzhen 518000 Peoples R China

ISBN: (纸本)9781538627235

Many exist localization algorithms are unbiased estimators. However, the estimation performance presents biased feature in the real location systems. On the other hand, many biased location estimators show advantages that unbiased estimators can not achieve, e.g., robust to the noise, more accurate estimation and low complexity. In this paper, we propose a biased localization estimator and a hybrid Kalman filtering algorithm. The proposed algorithm is robust to the complicated environment with high accuracy. Both theoretical analysis and experimental evaluation indicate that the proposed algorithm outperform the unbiased optimal estimation methods.

关键词： wireless sensor network Cramer-Rao lower bound biased estimation min-max algorithm unscented Kalman filter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：