A study on turbo decoding iterative algorithms
|
|
- Lawrence Shepherd
- 5 years ago
- Views:
Transcription
1 Buletinul Ştiinţific al Univerităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 49(63, Facicola 2, 2004 A tudy on turbo decoding iterative algorithm Horia Baltă, Maria Kovaci 2 Abtract - In the paper, a tudy of ome turbo decoding iterative algorithm: MAP, MaxLogMAP, LogMAP, i preented. For the correction of the approximation ued in the MAxLogMAP algorithm two method are propoed obtaining two LogMAP algorithm variant. All algorithm variant have been imulated to make poible a comparion from the bit error rate (BER point of view, in order to provide an optimization for each algorithm. The imulation were made for AWGN channel. Two component code with generator matrix: G =[, 5/7] and two interleaver type: peudo-random [] and S- interleaver (S=29 are ued. The interleaving length i N=784. The number of emitted block in one imulation depend of ignal to noie ration,, to obtain a good preciion of reulted curve. Keyword: Turbo code, MAP algorithm, trelli. I. INTRODUCTION The Maximum A-Poteriori (MAP algorithm, propoed by Bahl, Cocke, Jelinek and Raviv (974, i frequently ued after the turbo code dicovery realized by Berrou and al. []. Eentially, MAP algorithm, [2], calculate the Log Likelihood Ratio, LLR, under the form: ( ( ( α ( ( u ŝ, = k- ŝ γ k ŝ, βk + L u = k k y ln ( ŝ ( ŝ, ( ( α ( u ŝ, = k- γ k βk k where:α k- (ŝ = P(S k- = ŝ y j<k i the probability that the encoder trelli wa in ŝ tate at intant k- and the received channel equence, before thi moment, i y j<k, ( = (, ˆ ( ˆ αk γk αk (2 all ˆ β k ( = P(y j>k S k = i the probability that, having been given the trelli tate at intant k, the received channel equence, after thi moment, to be y j>k, ( ˆ (, ˆ ( β γ β k = k k (3 all ˆ γ k (ŝ, = P({y k S k = } S k- = ŝ i the probability that the encoder trelli took the tranition from tate ŝ to tate and the received channel equence for thi tranition i y k. γ k ( ŝ, = C e( u k L( u k / 2 n exp Eb 2 a yki xki 2σ 2 i= (4 In relation (4, u k i the value of information bit for the trelli branch, L(u k i the extrinic information for the k-th bit, E b i the energy of the information bit, σ 2 i the noie power, y ki and x ki repreent correponding value of all the bit attached to the branch which make the liaion of tate ŝ and, from reception (y ki, repectively, emiion (x ki. Fig. preent the computation way of forward-α and backward-β coefficient, for a part of trelli of convolutional code with contraint length K=3. S k- S k-2 S k- S k S k+ y j<k y k y j>k α k- (ŝ γ k- (ŝ, β k ( Fig. The code trelli with G = [, 5/7]. The continuou line correpond of the input bit value. Due to the exponential and logarithm operator in relation ( and (4, the MAP algorithm i difficult to be implemented. Like an alternative, the MaxLogMAP algorithm i eaier to be implemented, due to the approximation:,2 Facultatea de Electronică şi Telecomunicaţii, Departamentul Comunicaţii Bd. V. Pârvan Nr. 2, Timişoara, balta@etc.utt.ro; kmaria@etc.utt.ro
2 e x i max( (5 ln i So, the computing relation, in the MaxLogMAP algorithm cae, are the following: Ak Γ k ( ˆ ln( α ( max( ( ŝ + Γ ( ŝ, Bk i = k Ak k (6 ŝ x i ( ˆ ln( β ( ( ( + Γ ( ŝ, = k Bk k (7 ( ŝ, = ˆ ln( γ ( k L(u k y max ( u ŝ, = = Ĉ + u k L u k 2 Lc n y ki 2 i= ( + xki (A k- (ŝ + Γ k (ŝ, + B k ( k = + max (A k- (ŝ + Γ k (ŝ, + B k ( ( u ŝ, k = (8 (9 The implementation implification price of the MaxLogMAP algorithm i the reduction of the performance (of the BER with 0,2 db veru the MAP algorithm. LogMAP Algorithm, propoed by Roberton and al. [3], correct the approximation ued by MaxLogMAP algorithm and i a little bit more complicated than it. ln( e x + e x 2 x =max(x,x 2 +ln(+ e x 2 = max(x,x 2 + ƒ c ( x -x 2 II. THE TRELLIS CLOSING (0 In function of the trelli cloing the alpha and beta coefficient are initialized. The initial trelli cloing mean the coder initialization with a predefined tate. Thi tate i alo known by the decoder. So, the initialization of the alpha and beta coefficient can be done. With the exception of circular coding, thi initial tate i zero. The final trelli cloing i more difficult to be realized. It i done (excepting the circular code with the price of inertion of the M (the code memory redundant bit in the information equence. Thi fact realize the reduction of the tranmiion rate from /2 to the following value: R cc = (N M / 2 N. ( The trelli cloing give the advantage of the initial tate knowledge (and/or of the final tate, fact which lead to the firm knowledge of the alpha coefficient (at the beginning of trelli and beta coefficient (at the end of the trelli. In the cae of the uncloed trelli thee coefficient can only be predicted probabilitically. A turbo code implie at leat two coder, C and C2. At each coder correpond a trelli. Different trelli cloing technique can be ued for thee coder. In thi paper we invetigate few trelli cloing method for a turbo code (parallel. The table preent thee method. Table Variant Start Final Coding rate C, C2 C, C2 0 0, 0 0,? (N-M/3N 0, 0?,? /3 C Sx, Sy Sx, Sy /3 0. In thi cae, the firt coder cloe the trelli on both extremitie, it inert M redundant bit after the N-M information bit. The econd coder can not do the ame final cloing due to the interleaving of the input equence. So, the econd trelli i not cloed. The firt decoder initialize the alpha coefficient, which correpond at the front end of the trelli to the zero tate, with the probability, and the other alpha coefficient with the probability zero. The firt decoder treat the beta coefficient in the ame way at the end of the trelli. The econd decoder act in the ame way, like the firt, for the alpha coefficient. The beta coefficient of the econd decoder, can be initialized by the one of the following method: 0. The beta coefficient are met equal with the value of the alpha coefficient obtained at the lat iteration. Thi i called the oft initialization; 0h. Thi method initialize the beta coefficient, that correpond to the tate with the highet alpha coefficient, at probability and the other beta coefficient at the probability zero. Thi i called the hard initialization; 0e. Thi method make the beta coefficient to have the ame probability. Thi i called the equal probability initialization;. None of the trellie i final cloed. The advantage, in thi cae, i a higher coding rate. But thi coding rate increae can not be oberved if N>>M. Both decoder mut initialize the beta coefficient in one of the three way enounced above. In thi paper we implement only the oft initialization. The cae of both trelli final cloing i poible only with ome modification of the interleaving between the two coder. C. There i the poibility, uing a pre coding technique, to find, for any data equence x, an initial tate S o of the coder identically with it final tate. So the coding become circular. The decoder doe not know the tate S 0, but know that it can ue the final tate like initial tate. So, it mut to do at leat a forward recurrence. We are implemented and imulated the following variant of circular turbo code: C the decoder realize a forward recurrence and compute a final tate, S 0. The alpha and beta coefficient are initialized with S 0, the backward recurrence i made and the forward recurrence i
3 remade. It memorize the new tate S 0 for the tarting of the next iteration. C2 the decoder realize the both recurrence in the oft variant and retain, for the next iteration, with the role of S 0, the beta coefficient value from the end of the backward recurrence. C3 the decoder realize the both recurrence in the oft variant plu one for the alpha coefficient, only. The initial tate for that econd recurrence i done by the final value of beta coefficient of the lat iteration. The final coefficient of the econd forward recurrence give the tate to be tored for the next iteration. C4 the decoder realize the forward recurrence and build a S 0 tate in a hard deciion (it earche the alpha coefficient maximum. It retain thi tate for the next iteration and alo make the backward recurrence and remake the forward recurrence. III. THE LOGMAP ALGORITHM. IMPLEMENTATION. The variant of LogMAP algorithm differ by the correction term approximation way, decribed in equation (0: f c (x = ln(+e -x, x 0 (2 The function that approximate f c (x mut be eay to implement and they mut reproduce the mot exactly poible the form of thi function. Two approximation were propoed in thi paper, indicated in Fig. 2 and Fig.3. f c (x g c (x Fig.2. The rectangular approximation way. f c (x h c (x x f c (x. The value of the function g c (x are in the et {0.6, 0.3, 0.4, 0.065, 0.03, 0.04, 0.005, 0.002, 0}. The linear variant correpond to an approximation of f c (x of the form: x, x x h ( x = o x (3 c o 0, x > x o and by numerical approximation wa obtained the value x o = 2,347 for which h c (x realize the better approximation of f c (x. IV. EXPERIMENTAL RESULTS In the figure 4 are preented the curve BER( obtained with the three MAP algorithm variant 0 plu the MAP algorithm. Depite the fact that for ignal to noie ratio inferior to db the performance are identical, up to thi value the reult how that the variant 0e i better. It i followed, in order, by the variant: 0, and 0h. Thee reult how that at low ignal to noie ratio the error are produced excluively by the bad election of the path in the trelli and up db the error due to the trelli non cloing have a higher weight. In figure 5 are repreented the BER( curve obtained with the four variant of the circular MAP algorithm already defined in comparion with the bet MAP algorithm: 0e. The firt three circular MAP variant have imilar performance, inferior to the performance of the variant 0e. Tacking into account all the reult already preented it reult that the hard variant i not a good olution. The imulation reult realized with /3 rate RSC turbo code (parallel with G=[,5/7], which utilize in the variant 00 the LogMAP algorithm are compared in Fig.6 with the reult obtained with the bet MAP variant: 0e. From figure reult that all the two LogMAP variant are better than the MAP at leat for value of the ignal to noie ratio inferior to db. Up thi value the curve are not very accurate but obviouly the performance are imilar. The curve reduced preciion i due to the reduced volume of imulation. - Depite the fact that practical implementation of the LogMAP algorithm are fater than thoe of the MAP algorithm the imulation program work lower in the cae of the LogMAP algorithm. Between the two LogMAP algorithm variant the reult how that the linear one i better. Thee concluion mut be verified alo for other component code. x Fig.3. The linear approximation way. The rectangular variant propoed by Roberton and all. [3] i a zero order extrapolation of the function
4 BER MAP0 MAP0h MAP0e o MAP Fig. 4 The BER curve obtained with: MAP0, MAP0h, MAP0e, MAP algorithm. BER MAPC MAPC2 MAPC3 o MAPC4 + MAP0e Fig. 5 BER performance of C, C2, C3, C4 algorithm veru MAP0e algorithm. BER MAPC MAPC2 MAPC3 Fig. 6 BER performance of rectangular and linear LogMAP algorithm veru MAP0e algorithm.
5 V. CONCLUSIONS In the paper, a tudy of ome turbo decoding iterative algorithm: MAP, MaxLogMAP, LogMAP, wa preented. For the correction of the approximation ued in the MAxLogMAP algorithm, two method were propoed, obtaining two LogMAP algorithm variant. All algorithm variant have been imulated to make poible a comparion from the bit error rate point of view, in order to provide an optimization for each algorithm. VI. REFERENCES [] C. Berrou, A. Glavieux, P. Thitimajhima Near Shannon limit error-correcting coding and decoding: Turbo-code, Proc.ICC 93, Geneva, Switzerland, May 993, pp [2] L.Hanzo, T.H.Liew, B.L.Yeap, Turbo Coding, Turbo Equaliation and Space-Time Coding for Tranmiion over Fading Channel, John Wiley & Son Ltd, England, 2002 [3] P. Roberton, E.Villebrun, P.Hoeher, A Comparion of Optimal and Sub-Optimal MAP Decoding Algorithm Operating in the Log Domain, Proceeding of the International Conference on Communication, Seattle, USA, pag , iunie 995
Non-Binary Turbo Codes Interleavers
Non-Binary Turbo Codes Interleavers Maria KOVACI, Horia BALTA University Polytechnic of Timişoara, Faculty of Electronics and Telecommunications, Postal Address, 30223 Timişoara, ROMANIA, E-Mail: mariakovaci@etcuttro,
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationSoft Output Decoding Algorithm for Turbo Codes Implementation in Mobile Wi-Max Environment.
Available online at www.ciencedirect.com Procedia Technology 6 (202 ) 666 673 2nd International Conference on Communication, Comuting & Security [ICCCS-202] Soft Outut Decoding Algorithm for Turbo Code
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationOptimal M-BCJR Turbo Decoding: The Z-MAP Algorithm
Wireless Engineering and Technology, 2011, 2, 230-234 doi:10.4236/wet.2011.24031 Published Online October 2011 (http://www.scirp.org/journal/wet) Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm Aissa
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationCorrelation Models for Shadow Fading Simulation
Correlation Model for Shadow Fading Simulation IEEE 80.6 Preentation Submiion Template (Rev. 8.3) Document Number: IEEE S80.6m-07/060 Date Submitted: 007-03-3 Source: I-Kang Fu, Chi-Fang Li, E-mail: IKFu@itri.org.tw
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationA Study on Turbo Code Performance Based on AWGN Channel
Proceeding of the 2nd International Conference on Comuter Science and Electronic Engineering (ICCSEE 2013 A Study on Turbo Code Performance Baed on AWGN Channel Peng Zhu, Jun Zhu, iang Liu Key Laboratory
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More informationOn Peer-to-Peer Media Streaming Λ
On eer-to-eer Media Streaming Λ Dongyan Xu y, Mohamed Hefeeda, Suanne Hambruch, Bharat Bhargava Department of Computer Science urdue Univerity, Wet Lafayette, IN 797 fdxu, hefeeda, eh, bbg@c.purdue.edu
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationBottom Up parsing. Bottom-up parsing. Steps in a shift-reduce parse. 1. s. 2. np. john. john. john. walks. walks.
Paring Technologie Outline Paring Technologie Outline Bottom Up paring Paring Technologie Paring Technologie Bottom-up paring Step in a hift-reduce pare top-down: try to grow a tree down from a category
More informationVLSI Design 9. Datapath Design
VLSI Deign 9. Datapath Deign 9. Datapath Deign Lat module: Adder circuit Simple adder Fat addition Thi module omparator Shifter Multi-input Adder Multiplier omparator detector: A = 1 detector: A = 11 111
More informationISSCC 2003 / SESSION 8 / COMMUNICATIONS SIGNAL PROCESSING / PAPER 8.7
ISSCC 2003 / SESSION 8 / COMMUNICATIONS SIGNAL PROCESSING / PAPER 8.7 8.7 A Programmable Turbo Decoder for Multiple 3G Wireless Standards Myoung-Cheol Shin, In-Cheol Park KAIST, Daejeon, Republic of Korea
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationTracking High Speed Skater by Using Multiple Model
Vol. 2, No. 26 Tracing High Speed Sater by Uing Multiple Model Guojun Liu & Xianglong Tang School of Computer Science & Engineering Harbin Intitute of Technology Harbin 5000, China E-mail: hitliu@hit.edu.cn
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationImplementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost
Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationRepresentations and Transformations. Objectives
Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element
More informationNearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationTemporal Abstract Interpretation. To have a continuum of program analysis techniques ranging from model-checking to static analysis.
Temporal Abtract Interpretation Patrick COUSOT DI, École normale upérieure 45 rue d Ulm 75230 Pari cedex 05, France mailto:patrick.couot@en.fr http://www.di.en.fr/ couot and Radhia COUSOT LIX École polytechnique
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationUninformed Search Complexity. Informed Search. Search Revisited. Day 2/3 of Search
Informed Search ay 2/3 of Search hap. 4, Ruel & Norvig FS IFS US PFS MEM FS IS Uninformed Search omplexity N = Total number of tate = verage number of ucceor (branching factor) L = Length for tart to goal
More informationSpring 2012 EE457 Instructor: Gandhi Puvvada
Spring 2012 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 2/17/2012, Friday in SLH200 Calculator and Cadence Verilog Guide are allowed; Time: 10:00AM-12:45PM Cloed-book/Cloed-note Exam Total point:
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationVariable Resolution Discretization in the Joint Space
Variable Reolution Dicretization in the Joint Space Chritopher K. Monon, David Wingate, and Kevin D. Seppi {c,wingated,keppi}@c.byu.edu Computer Science, Brigham Young Univerity Todd S. Peteron peterto@uvc.edu
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationAvailable Bandwidth-Based Association in IEEE Wireless LANs
Available Bandwidth-Baed Aociation in IEEE 82. Wirele LAN Heeyoung Lee, Seongkwan Kim, Okhwan Lee, Sunghyun Choi, Sung-Ju Lee 2 School of Electrical Engineering & INMC, Seoul National Univerity, Seoul,
More informationSPHERE DECODING FOR MULTIPROCESSOR ARCHITECTURES. Q. Qi, C. Chakrabarti
SPHERE DECODING FOR MULIPROCESSOR ARCHIECURES Q. Qi, C. Chakrabarti Arizona State Univerity Department of Electrical Engineering {qi,chaitali}@au.edu ABSRAC Motivated by the need for high throughput phere
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More informationUsing Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images
2009 10th International Conference on Document Analyi and Recognition Uing Moue Feedback in Computer Aited Trancription of Handwritten Text Image Verónica Romero, Alejandro H. Toelli, Enrique Vidal Intituto
More informationExercise 4: Markov Processes, Cellular Automata and Fuzzy Logic
Exercie 4: Marko rocee, Cellular Automata and Fuzzy Logic Formal Method II, Fall Semeter 203 Solution Sheet Marko rocee Theoretical Exercie. (a) ( point) 0.2 0.7 0.3 tanding 0.25 lying 0.5 0.4 0.2 0.05
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationFinite Elements Method in Split Hopkinson Pressure Bar developing process
6th WSEAS International Conference on SYSTEM SCIENCE and SIMULATION in ENGINEERING, Venice, Italy, November 1-3, 007 63 Finite Element Method in Split Hopkinon Preure Bar developing proce ROTARIU ADRIAN
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
More informationIntegrated Single-arm Assembly and Manipulation Planning using Dynamic Regrasp Graphs
Proceeding of The 2016 IEEE International Conference on Real-time Computing and Robotic June 6-9, 2016, Angkor Wat, Cambodia Integrated Single-arm Aembly and Manipulation Planning uing Dynamic Regrap Graph
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More informationAn Active Stereo Vision System Based on Neural Pathways of Human Binocular Motor System
Journal of Bionic Engineering 4 (2007) 185 192 An Active Stereo Viion Sytem Baed on Neural Pathway of Human Binocular Motor Sytem Yu-zhang Gu 1, Makoto Sato 2, Xiao-lin Zhang 2 1. Department of Advanced
More informationSECTOR BASED MULTICAST ROUTING ALGORITHM FOR MOBILE AD-HOC NETWORKS
SECTOR BASED MULTICAST ROUTING ALGORITHM OR MOBILE AD-HOC NETWORKS Murali Paramewaran 1 and Chittaranjan Hota 2 1 Department of Computer Science & Information Sytem, BITS-Pilani, Pilani, India 2 Department
More informationComparison of Decoding Algorithms for Concatenated Turbo Codes
Comparison of Decoding Algorithms for Concatenated Turbo Codes Drago Žagar, Nenad Falamić and Snježana Rimac-Drlje University of Osijek Faculty of Electrical Engineering Kneza Trpimira 2b, HR-31000 Osijek,
More informationWavelet Decomposition for Denoising GPS/INS Outputs in Vehicular Navigation System
Wavelet Decompoition for Denoiing GPS/INS Output in Vehicular Navigation Syem SALAM ISMAEEL 1 and AYMAN AL-KHAZRAJI 2 Department of Computer Science Ryeron Univerity 35 Victoria St, Toronto, ON M5B 2K3
More informationThe Implementation of an Adaptive Mechanism in the RTP Packet in Mobile Video Transmission
2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Pre, Singapore DOI: 10.7763/IPCSIT.2012.V52.91 The Implementation of an Adaptive
More informationOptimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Optimal Multi-Robot Path Planning on Graph: Complete Algorithm and Effective Heuritic Jingjin Yu Steven M. LaValle Abtract arxiv:507.0390v [c.ro] Jul 05 We tudy the problem of optimal multi-robot path
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
113 New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory, Univerity of Nebraka-Lincoln {yzheng,choueiry}@ce.unl.edu Abtract.
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationCompiler Construction
Compiler Contruction Lecture 6 - An Introduction to Bottom- Up Paring 3 Robert M. Siegfried All right reerved Bottom-up Paring Bottom-up parer pare a program from the leave of a pare tree, collecting the
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More information