際際滷shows by User: nbarraza / http://www.slideshare.net/images/logo.gif 際際滷shows by User: nbarraza / Mon, 16 Mar 2015 15:39:28 GMT 際際滷Share feed for 際際滷shows by User: nbarraza slides /slideshow/slides-45907543/45907543 2d9bd3e0-0f5a-4221-885e-a3b6fce78a4f-150316153928-conversion-gate01
]]>
]]> Mon, 16 Mar 2015 15:39:28 GMT /slideshow/slides-45907543/45907543 nbarraza@slideshare.net(nbarraza) slides nbarraza <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2d9bd3e0-0f5a-4221-885e-a3b6fce78a4f-150316153928-conversion-gate01-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br>
slides from Nestor Barraza
]]> 333 3 https://cdn.slidesharecdn.com/ss_thumbnails/2d9bd3e0-0f5a-4221-885e-a3b6fce78a4f-150316153928-conversion-gate01-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Performance of the Viterbi Algorithm on a Polya ChannelExample /slideshow/example-26429141/26429141 example-130922084324-phpapp01
he Performance of the Viterbi algo- rithm with a new Polya contagion noise process is an- alyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya chan- nel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a Gauss- Polya noise model is introduced this way in order to perform soft decision decoding. The behavior of the Viterbi algorithm on a given recursive sequential cir- cuit is analyzed under this special case of memor channel,]]>
he Performance of the Viterbi algo- rithm with a new Polya contagion noise process is an- alyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya chan- nel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a Gauss- Polya noise model is introduced this way in order to perform soft decision decoding. The behavior of the Viterbi algorithm on a given recursive sequential cir- cuit is analyzed under this special case of memor channel,]]> Sun, 22 Sep 2013 08:43:24 GMT /slideshow/example-26429141/26429141 nbarraza@slideshare.net(nbarraza) Performance of the Viterbi Algorithm on a Polya ChannelExample nbarraza he Performance of the Viterbi algo- rithm with a new Polya contagion noise process is an- alyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya chan- nel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a Gauss- Polya noise model is introduced this way in order to perform soft decision decoding. The behavior of the Viterbi algorithm on a given recursive sequential cir- cuit is analyzed under this special case of memor channel, <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/example-130922084324-phpapp01-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> he Performance of the Viterbi algo- rithm with a new Polya contagion noise process is an- alyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya chan- nel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a Gauss- Polya noise model is introduced this way in order to perform soft decision decoding. The behavior of the Viterbi algorithm on a given recursive sequential cir- cuit is analyzed under this special case of memor channel,
Performance of the Viterbi Algorithm on a Polya ChannelExample from Nestor Barraza
]]> 339 3 https://cdn.slidesharecdn.com/ss_thumbnails/example-130922084324-phpapp01-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 A new Algorithm to construct LDPC codes with large stopping sets /slideshow/presentacion-26429092/26429092 presentacion-130922083913-phpapp01
A new algorithm to construct good low-density parity-check (LDPC) codes with large stopping sets is presented. Since the minimum stop- ping set characterizes an LDPC code, searching for stopping sets in LDPC codes is an important issue. Large minimum stopping sets avoid the LDPC code to get trapped in cycles specially on the binary erasure channel. Dealing with stopping sets is not an easy task since their discovering is a well known NP hard prob- lem. Conversely, we propose an algorithm in order to construct an LDPC code from a stopping set which is demonstrated to be large. Results of simulations showing the performance of the LDPC code obtained this way are analyzed.]]>
A new algorithm to construct good low-density parity-check (LDPC) codes with large stopping sets is presented. Since the minimum stop- ping set characterizes an LDPC code, searching for stopping sets in LDPC codes is an important issue. Large minimum stopping sets avoid the LDPC code to get trapped in cycles specially on the binary erasure channel. Dealing with stopping sets is not an easy task since their discovering is a well known NP hard prob- lem. Conversely, we propose an algorithm in order to construct an LDPC code from a stopping set which is demonstrated to be large. Results of simulations showing the performance of the LDPC code obtained this way are analyzed.]]> Sun, 22 Sep 2013 08:39:13 GMT /slideshow/presentacion-26429092/26429092 nbarraza@slideshare.net(nbarraza) A new Algorithm to construct LDPC codes with large stopping sets nbarraza A new algorithm to construct good low-density parity-check (LDPC) codes with large stopping sets is presented. Since the minimum stop- ping set characterizes an LDPC code, searching for stopping sets in LDPC codes is an important issue. Large minimum stopping sets avoid the LDPC code to get trapped in cycles specially on the binary erasure channel. Dealing with stopping sets is not an easy task since their discovering is a well known NP hard prob- lem. Conversely, we propose an algorithm in order to construct an LDPC code from a stopping set which is demonstrated to be large. Results of simulations showing the performance of the LDPC code obtained this way are analyzed. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/presentacion-130922083913-phpapp01-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> A new algorithm to construct good low-density parity-check (LDPC) codes with large stopping sets is presented. Since the minimum stop- ping set characterizes an LDPC code, searching for stopping sets in LDPC codes is an important issue. Large minimum stopping sets avoid the LDPC code to get trapped in cycles specially on the binary erasure channel. Dealing with stopping sets is not an easy task since their discovering is a well known NP hard prob- lem. Conversely, we propose an algorithm in order to construct an LDPC code from a stopping set which is demonstrated to be large. Results of simulations showing the performance of the LDPC code obtained this way are analyzed.
A new Algorithm to construct LDPC codes with large stopping sets from Nestor Barraza
]]> 1224 3 https://cdn.slidesharecdn.com/ss_thumbnails/presentacion-130922083913-phpapp01-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Jaiio2010presentation /slideshow/jaiio2010presentation-5125215/5125215 jaiio2010presentation-12835472123831-phpapp01
Software Quality and Reliability]]>
Software Quality and Reliability]]> Fri, 03 Sep 2010 15:53:55 GMT /slideshow/jaiio2010presentation-5125215/5125215 nbarraza@slideshare.net(nbarraza) Jaiio2010presentation nbarraza Software Quality and Reliability <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/jaiio2010presentation-12835472123831-phpapp01-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Software Quality and Reliability
Jaiio2010presentation from Nestor Barraza
]]> 139 2 https://cdn.slidesharecdn.com/ss_thumbnails/jaiio2010presentation-12835472123831-phpapp01-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Empirical Bayes Estimator /slideshow/empirical-bayes-estimator/5001583 papermaxent2008-12821406716264-phpapp02
Paper presentation at 28th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, July 2008]]>
Paper presentation at 28th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, July 2008]]> Wed, 18 Aug 2010 09:14:23 GMT /slideshow/empirical-bayes-estimator/5001583 nbarraza@slideshare.net(nbarraza) Empirical Bayes Estimator nbarraza Paper presentation at 28th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, July 2008 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/papermaxent2008-12821406716264-phpapp02-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Paper presentation at 28th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, July 2008
Empirical Bayes Estimator from Nestor Barraza
]]> 703 3 https://cdn.slidesharecdn.com/ss_thumbnails/papermaxent2008-12821406716264-phpapp02-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 https://cdn.slidesharecdn.com/profile-photo-nbarraza-48x48.jpg?cb=1600985444 - Proficiency in Information Technologies, Software Design, development, performance analysis and maintenance, Signal and Image Processing, Data Mining and Business Intelligence. - Research on Communications, Software Enginnering, Statistics and Applied Probability, Information Theory. - More than twenty years of experience in teaching - Expertise in Information Technologies. - Professor. Subject: Information Theory and Coding - Author of scientific papers - Participant in International Conferences Specialties: c, c + +, client/server applications, database administration, decnet, fortran, signal/image processing, java, linux, mathematics, microvax, mysql, networking, Op... https://cdn.slidesharecdn.com/ss_thumbnails/2d9bd3e0-0f5a-4221-885e-a3b6fce78a4f-150316153928-conversion-gate01-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/slides-45907543/45907543 slides https://cdn.slidesharecdn.com/ss_thumbnails/example-130922084324-phpapp01-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/example-26429141/26429141 Performance of the Vit... https://cdn.slidesharecdn.com/ss_thumbnails/presentacion-130922083913-phpapp01-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/presentacion-26429092/26429092 A new Algorithm to con...