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

12th IEEE International Conference on Green Innovation for Africon Renaissance (AFRICON)

作者： Ali, Towfik Jemal Kern, Daniel Kuehn, Volker Jimma Univ Jimma Inst Technol Jimma Ethiopia Univ Rostock Inst Commun Engn D-18055 Rostock Germany

ISBN: (纸本)9781479974986

Wireless broadcast advantage (WBA) and wireless cooperative advantage (WCA) are exploited in this paper for finding a cooperative route in a wireless mesh network with minimum energy consumption considering practical coding and modulation schemes. In doing so we have assumed a multihop wireless mesh network consisting of nodes capable of adjusting their transmit power. An optimization problem to allocate minimum sum power for a given route subject to a desired end-to-end throughput and outage probability constraints is formulated. WBA and WCA are taken into account separately and together during the resource allocation. Afterwards, optimal and suboptimal route selection is done using a classical Dijkstra's algorithm. Turbo codes with iterative decoding algorithms are implemented with various QAM modulation schemes.

关键词： array signal processing cooperative communication iterative decoding optimisation quadrature amplitude modulation resource allocation telecommunication network routing wireless mesh networks QAM modulation schemes WBA WCA classical Dijkstra algorithm coding schemes cooperative route distributed beamforming end-to-end throughput iterative decoding algorithms minimum sum power allocation multihop wireless mesh network network routing optimal route selection optimization problem outage probability constraints suboptimal route selection wireless broadcast advantage wireless cooperative advantage Array signal processing Encoding Modulation Resource management Signal to noise ratio Wireless communication Wireless mesh networks Wireless mesh networks array signal processing management of resources water conservation areas wideband amplifiers Resource utilization Network routing Quadrature amplitude modulation signal to noise ratios Iterative decoding cooperative communication telecommunication network routing CARRIER SYSTEM decoding algorithm end-to-end

来源：评论

学校读者我要写书评

暂无评论

Joint Probability-algebraic decoding for Tail-biting Codes Used in LTE System

Joint Probability-algebraic Decoding for Tail-biting Codes U...

引用

International Conference on Computer Science and Network Technology

作者： Jianping LI Wan LI School of Information Engineering Communication University of China CUC Beijing China

ISBN: (纸本)9781467381741

Tail-biting codes are the main control channel coding form for the LTE system. The WAVA algorithm is one of the widely used as the decoding algorithm of tail-biting codes. To fully make use of the information on the algebra structure of the tail-biting codes, we combined the WAVA algorithm with the algebraic decoding, and proposed a new joint probabilityalgebraic decoding algorithm. Simulation results show that, compared with the single probability decoding, the new algorithm has better performance on the error correction.

关键词： tail-biting codes LTE joint probability-algebraic decoding Local thermodynamic equilibrium tail biting Long Term Evolution error correction decoding algorithm control channel Codes Algebra decoding

来源：评论

学校读者我要写书评

暂无评论

A simplifed joint demapping and decoding for LDPC coded BICM systems

A simplifed joint demapping and decoding for LDPC coded BICM...

引用

11th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2015)

作者： Ping Huang Yueheng Li Meiyan Ju Department of Computer Information Hohai University Nanjing China

ISBN: (纸本)9781510821279

To make full use of the characteristics of LDPC decoding, Stephan ten Brink had proposed a joint iterative demapping and decoding algorithm for LDPC coded BICM systems. Based on Brink proposed algorithm, we propose a modified joint iterative scheme to further reduce the computation complex. Different from the algorithm presented by Brink, in the process of iterative demapping and decoding, the proposed method simplifies the update calculation of the LDPC parity check nodes by adopting the UMP-BP. More importantly, to compensate for the performance degradation brought by UMP-BP, LLRs optimization based on certain optimality criterion is employed for the proposed method. Numerical analysis shows that the complexity of the proposed method is less than traditional joint iterative algorithm. Simulation results also show that by LLRs optimization the proposed method achieves noticeable performance improvement compared with the BICM-ID and the joint iterative algorithm.

关键词： BICM Joint Iterative Demapping and decoding LDPC LLRs Optimization low density parity check codes decoding Joints Joints performance boost degradation of performance decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

XJ-BP: Express Journey Belief Propagation decoding for Polar Codes

XJ-BP: Express Journey Belief Propagation Decoding for Polar...

引用

IEEE Global Communications Conference

作者： Jingwei Xu Tiben Che Gwan Choi Department of Electrical and Computer Engineering Texas A&M University

ISBN: (纸本)9781479959532

This paper presents a novel belief propagation (BP) based decoding algorithm for polar codes. The proposed algorithm facilitates belief propagation by utilizing the specific constituent codes that exist in the factor graph, which results in an express journey (XJ) for belief information to propagate in each decoding iteration. In addition, this XJ-BP decoder employs a novel round-trip message passing scheduling method for the increased efficiency. The proposed method simplifies min-sum (MS) BP decoder by 40.6%. Along with the round-trip scheduling, the XJ-BP algorithm reduces the computational complexity of MS BP decoding by 90.4%;this enables an energy-efficient hardware implementation of BP decoding in practice.

关键词： Polar code Belief propagation Factor Graph decoding decoding algorithm complexity classes decoders

来源：评论

学校读者我要写书评

暂无评论

Unique decoding of General AG Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第4期60卷 2038-2053页

作者： Lee, Kwankyu Bras-Amoros, Maria O'Sullivan, Michael E. Chosun Univ Dept Math & Educ Kwangju 501759 South Korea Univ Rovira & Virgili Dept Comp Engn & Math E-43007 Tarragona Spain San Diego State Univ Dept Math & Stat San Diego CA 92182 USA

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it retains the same advantages of fast speed, regular structure, and direct message recovery. Upon this generalization, we add a technique from the Guruswami-Sudan list decoding that boosts the decoding speed significantly. Compared with other known decoding algorithms for general AG codes, it has a similar decoding performance and allows streamlined practical implementation by its simple and regular structure.

关键词： Multipoint AG code decoding algorithm interpolation Grobner base

来源：评论

学校读者我要写书评

暂无评论

A reliable asynchronous protocol for VLC communications based on the rolling shutter effect

A reliable asynchronous protocol for VLC communications base...

引用

IEEE Global Communications Conference

作者： Julia Ferrandiz-Lahuerta Daniel Camps-Mur Josep Paradells-Aspas i2CAT Foundation UPC-Barcelona Tech

ISBN: (纸本)9781479959532

In this paper we introduce a novel reliable asyn-chronous protocol that allows to establish a VLC link between a LED luminary and an off-the-shelf smartphone. Our protocol and decoding algorithms benefit from the access to advanced camera settings available in the latest generations of mobile devices to outperform previous VLC designs in the state of the art. In particular, in the paper we provide an experimental evaluation using a commercial Nexus 5 device where it is shown how our designed prototype can achieve transmission speeds of up to 700 bps and operating distances of up to 3 meters. The previous performance figures have the potential to spark a wide set of novel applications.

关键词： variable length codes state of the art asynchronous protocol rolling shutter Mobile devices protocols decoding algorithm transmission speed Communication Research

来源：评论

学校读者我要写书评

暂无评论

Accelerating and deceleratingmin-sum-based gear-shift LDPC decoders

Accelerating and deceleratingmin-sum-based gear-shift LDPC d...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： J. Andrade G. Falcao V. Silva Instituto de Telecomunicações University of Coimbra Portugal

ISBN: (纸本)9781467369985

Low-Density Parity-Check (LDPC) decoders typically implement a single decoding algorithm or update rule, which narrows down the design space of the decoder and maintains its overall simplicity. However, gear-shift techniques combine multiple decoding algorithms, update rules and quantization of the log-likelihood ratios (LLRs), allowing wider design space explorations as more parameters can be fine-tuned to a particular need. Gear-shift LDPC decoders have been shown to improve both the decoding throughput and the energy efficiency per bit decoded, while achieving similar capacity compared to traditional approaches that only use one algorithm. In this paper, we incorporate gear-shift techniques based on the Min-Sum algorithm (MSA) and Self-Corrected Min-Sum algorithm(SCMSA) using variable quantization steps. The proposed design allows bit error rate (BER) performances close to the more powerful SCMSA running only a selected number of iterations using the most powerful update rule.

关键词： Gear-Shift LDPC Codes Min-Sum Self-Correction low density parity check codes decoders acceleration Space Exploration Quantization decoding algorithm Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems

引用

SWARM AND EVOLUTIONARY COMPUTATION 2014年第0期14卷 66-75页

作者： Azad, Md. Abul Kalam Rocha, Ana Maria A. C. Fernandes, Edite M. G. P. Univ Minho Algoritmi R&D Ctr Sch Engn P-4710057 Braga Portugal Univ Minho Sch Engn Dept Prod & Syst P-4710057 Braga Portugal

The 0-1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish swarm algorithm has been developed in continuous global optimization. The algorithm uses a population of points in space to represent the position of fish in the school. In this paper, a binary version of the artificial fish swarm algorithm is proposed for solving the 0-1 MKP. In the proposed method, a point is represented by a binary string of 0/1 bits. Each bit of a trial point is generated by copying the corresponding bit from the current point or from some other specified point, with equal probability. Occasionally, some randomly chosen bits of a selected point are changed from 0 to 1, or 1 to 0, with an user defined probability. The infeasible solutions are made feasible by a decoding algorithm. A simple heuristic add item is implemented to each feasible point aiming to improve the quality of that solution. A periodic reinitialization of the population greatly improves the quality of the solutions obtained by the algorithm. The proposed method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method gives a competitive performance when solving this kind of problems. (C 2013 Elsevier B.V. All rights reserved.

关键词： 0-1 knapsack problem Multidimensional knapsack Artificial fish swarm decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Exploit Network Coding Over GF(2(q)) for Multi-user Cooperative Wireless Networks

引用

INTERNATIONAL JOURNAL OF WIRELESS INFORMATION NETWORKS 2014年第1期21卷 1-14页

作者： Guo, Bin Liu, Yu Zhou, Chi Illinois Inst Technol Dept Elect & Comp Engn Chicago IL 60616 USA

In this paper, we present a decode-and-forward network coded (DFNC) scheme over GF(2(q)) for the multi-user cooperative communication systems. In particular, we consider a cooperative network with m users transmitting independent packets to the same destination. These users form a cooperation set to help each other by using linear network coding. We propose a coding coefficients construction method which can efficiently reduce the transmission overhead from m(q + log(2)m) to m bits compared with conventional random network coding. Furthermore, we propose a novel decoding algorithm-credit-based updating algorithm in order to improve the solvability of decoding set of equations at the destination. The proposed decoding algorithm is combined with channel decoding and is applied on symbol-level. It can fully make use of the error recovery property of network coding while conventional decoding algorithms (e.g., Gaussian elimination) overlook it. We theoretically analyze the diversity performance in terms of information outage probability, and the results show that diversity order of m + 1 can be achieved for a m-user cooperation system. Moreover, we conduct extensive simulations to show that DFNC outperforms other transmission schemes in terms of symbol error rate and achieves higher diversity order. We also demonstrate that the proposed decoding algorithm provides significant performance gain over conventional decoding algorithm.

关键词： Network coding Multi-user cooperative communication Diversity gain decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Representation of solutions in genetic VLSI placement algorithms 12

Representation of solutions in genetic VLSI placement algori...

引用

Proceedings of IEEE East West Design and Test Symposium ( EWDTS 2014)

作者： Zaporozhets, D. U. Zaruba, D. V. Kureichik, V. V. Southern Fed Univ Coll Automat & Comp Sci Rostov Na Donu Russia

ISBN: (纸本)9781479976300

The VLSI placement problem is presented in this article. A mechanism of representation of solutions for further genetic algorithm implementation is described. The proposed encoding algorithm is based on a placement tree and reverse Polish notation. The decoding algorithm is implemented in two stages: twinning of elements in macroblocks and calculation of real coordinates of elements. Experimental results show time-response characteristics of the proposed coding and decoding mechanisms. The time complexity of the encoding algorithm is represented by O(n) whereas the time complexity of the decoding algorithm is represented by O(n log n), where n is the number of elements.

关键词： VLSI computational complexity genetic algorithms integrated circuit design trees (mathematics) VLSI placement problem decoding algorithm encoding algorithm genetic algorithm implementation placement tree reverse Polish notation time complexity time-response characteristics algorithm design and analysis Biological cells decoding Educational institutions Encoding Genetic algorithms Very large scale integration Very large scale integration complexity classes Genetic algorithm (GA) decoding algorithm algorithm design and analysis cytology integrated circuit design Educational institutions decoding RESPONSE CHARACTERISTICS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：