Zamazal, Zdeněk · Brno University of Technology Digital Library (Brno University of Technology) · 2008
Práce se zabývá využitím poznatků z oblasti kanálového kódování dat a zaměřuje se na možnosti dekódování stromových kódů. Popisuje několik způsobů dekódování a zjišťuje jejich výhody či nevýhody. V problematice stromových kódů je nutné znát základy teorie informace, způsoby vytváření kódů a definice kodérů. V práci jsou popsány kritéria výběru dekódovací metody a je uveden nástin jejich hodnocení vzhledem k požadavkům kladeným na protichybový kódový systém. Je vypracován návrh dekodéru pomocí vybrané metody na základě uvedených kritérií. Součástí práce je implementace dekodéru v simulačním prostředí Matlab Simulink. Funkce dekodéru je ověřena odsimulováním modelu protichybového kódového systému.
Cited by 0
Vlček, Peter · Brno University of Technology Digital Library (Brno University of Technology) · 2008
Convolutional codes belongs to among linear tree codes. There are codes used for channel coding. At build - up project, then comparison separate algorithms were gateway into the account Viterbiho algorithm, Stack algorithm, Stack- bucket algorithm, Fano algorithm and Feedback decoding. Was built-up suggestion convolutional encoder and decoder, which at his activities make use of Viterbiho algorithm and Stack algorithm, what serves for contrast of both methods. It turned out, that the Viterbiho algorithm get past in the main for codes with smaller compulsory longitude, because has stand-by cost quantity calculated effect. At Stack algorithms is quantity calculated effect dependent on longitude received sequence, what may result in much smaller number calculated effect, however at very noisy channel is able to state, that the calculated effect will much more as with Viterbiho algorithm. Nothing less is Stack algorithm or his variation Stack- bucket algorithm used primarily on codes with bigger compulsory longitude. Feedback decoding is gainst for simple construction decoder acceptable alternative toward decoding most likely and to sequential decoding.
Cited by 0
Dr. Kavita Nalini*, Rohan Kumar · Zenodo (CERN European Organization for Nuclear Research) · 2019
Conventional encoder is widely applied to lots of wireless communications including 3G/4G communication and digital video Broad casting (DVB), IOT (Internet of things) transmission and so on. A reconfigurable Viterbi decoder design is proposed for LTE-A, WiMAX, LTECDMA, GSM and TD-SCDMA. The proposed flexible architecture supports a polynomial reconfiguration. More over both tail biting and zero trellis terminating modes are supported. The transmitter encoder and receiver decoder are designed for verifying functionality .The purpose is to determine the feasible to design data error correcting to reduce the decoding latency and complexity it employs forward trace back method and sliding window technology.
Cited by 0Open access
Dr. Kavita Nalini*, Rohan Kumar · Zenodo (CERN European Organization for Nuclear Research) · 2019
Conventional encoder is widely applied to lots of wireless communications including 3G/4G communication and digital video Broad casting (DVB), IOT (Internet of things) transmission and so on. A reconfigurable Viterbi decoder design is proposed for LTE-A, WiMAX, LTECDMA, GSM and TD-SCDMA. The proposed flexible architecture supports a polynomial reconfiguration. More over both tail biting and zero trellis terminating modes are supported. The transmitter encoder and receiver decoder are designed for verifying functionality .The purpose is to determine the feasible to design data error correcting to reduce the decoding latency and complexity it employs forward trace back method and sliding window technology.
Cited by 0Open access
Carlo Murgia, Gaël Richard, P. Lockwood · HAL (Le Centre pour la Communication Scientifique Directe) · 2000
Cited by 0
Kenway Louie (4744719) · Figshare · 2022
Cited by 0Open access
Ramezani, Mahdi · University of Alberta Library · 2008
Cited by 0Open access
Rafael Trujillo-Rasúa, Antonio M. Vidal, Víctor M. García et al. · Lecture notes in computer science · 2008
Cited by 0
Luc T. Ikelle · Handbook of geophysical exploration. Section 1, Seismic exploration/Handbook of geophysical exploration. Seismic exploration · 2010
Cited by 1
Margreta Kuijper, Jan Willem Polderman · University of Twente Research Information · 2007
In this paper we show how ideas based on system theoretic modeling of linear behaviors may be used for decoding of linear codes. In particular we show how Sudan's bivariate interpolation approach to list decoding of RS codes allows a system theoretic interpretation.
Cited by 0Open access
Srinivasagan N. Subhashree, S. Sunoj, Oveis Hassanijalilian et al. · 2020
In this chapter the authors successfully demonstrate the decoding and reconstructing of the common machine learning classification methods, such as linear discriminant analysis and k-nearest neighbor, from the underlying mathematics behind these algorithms, applied to two agricultural applications (soybean aphids and weed species) using open source platforms like ImageJ and R through developed user-coded programs. The decoded ReliefF algorithm in each dataset (soybean aphids, weed species, and iris, for comparison) selected the most influential features, among 13 shape-based features, for developing the reconstructed classification algorithms. Features such as roundness, solidity, and circularity for soybean aphids; diameter range, Feret aspect ratio, and solidity for weed species; and sepal length, petal length, and petal width for irises emerged as the best, based on weights.
Cited by 1
Kevin L. Gunderson, Semyon Kruglyak, Michael S. Graige et al. · 2008
We have developed a simple and efficient algorithm to identify each member of a large collection of DNA-linked objects through the use of hybridization, and have applied it to the manufacture of randomly assembled arrays of beads in wells. Once the algorithm has been used to determine the identity of each bead, the microarray can be used in a wide variety of applications, including single nucleotide polymorphism genotyping and gene expression profiling. The algorithm requires only a few labels and several sequential hybridizations to identify thousands of different DNA sequences with great accuracy. We have decoded tens of thousands of arrays, each with 1520 sequences represented at ∼30-fold redundancy by up to ∼50,000 beads, with a median error rate of <1 × 10 −4 per bead. The approach makes use of error checking codes and provides, for the first time, a direct functional quality control of every element of each array that is manufactured. The algorithm can be applied to any spatially fixed collection of objects or molecules that are associated with specific DNA sequences. Microarray technology, devised for the analysis of complex biological systems, uses the ability of a DNA strand to hybridize specifically to its complement to extract 1000s of measurements at a time from a single sample (Watson and Crick 1953; Southern
Cited by 0
M. Hossein Taghavi, P.H. Siegel · IEEE Transactions on Information Theory · 2008
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we make a first step in studying this method, and show that by starting from a simple LP problem and adaptively adding the necessary constraints, the complexity of LP decoding can be significantly reduced. In particular, we observe that with adaptive LP decoding, the sizes of the LP problems that need to be solved become practically independent of the density of the parity-check matrix. We further show that adaptively adding extra constraints, such as constraints based on redundant parity checks, can provide large gains in the performance. </para>
Cited by 120
Hizer Leka, Azir Jusufi, Faton Kabashi · 2019
Cited by 0
Michael Allan · 2003
A new statistical image enhancement technique has been proposed for improving JPEG image decoding. The technique reduces blocking artifacts introduced by the Discrete Cosine Transform (DCT) used by JPEG, and improves overall image quality. A Bayesian approach is used to encode prior information about how we think an image should look, using it to better infer what the &quot;correct&quot; image should be. The prior information comes in the form of: 1) the prior probability distributions of the DCT coefficients, 2) the constraints imposed on the DCT coefficients by quantisation and 3) information about continuity at block edges. Since this is a decoding algorithm it will work with already compressed images. The prior distributions of the DCT coefficients were learned from real images and modelled using Gaussian Mixture Models (GMMs). Continuity was encoded by learning a distribution of the error between the extrapolated DCT basis functions (our prediction) and the groundtruth border-pixels for each 8x8 block, again modelled by GMMs. An optimal set of DCT coefficients is then obtained by using a standard scaled conjugate gradient search to minimise the negative log likelihood. Initial investigations were carried out on 8x8 patches, later progressing to larger regions. To avoid the need for an iterative scheme the ground-truth border-pixels of the patches were used as &quot;targets&quot; for improving continuity, since they can be fixed throughout the optimisation. A final investigation was carried out using a checkerboard iterative scheme on a region of 3x3 blocks which used the border-pixels of partially optimised neighbouring blocks rather than the ground-truth pixels. Visually, good results were obtained and compared to Gaussian, Wiener and median filter methods. Acknowledgements I would ...
Cited by 0
M. Moher · 2002
Previous work has identified iterative multiuser decoding techniques that are often only limited by theoretical channel capacity. These investigations usually dealt with the case where user waveforms are decorrelated to some degree. Investigations with identical waveforms indicate that the theoretical capacity limits are not always achieved. Performance has a threshold-like behaviour, as one might expect with a capacity limit, but the threshold is, in some cases, above the theoretical capacity for the channel under investigation. In this paper, an explanation for this behaviour is proposed.
Cited by 3
Siddharth Barman, Xishuo Liu, Stark C. Draper et al. · arXiv (Cornell University) · 2012
When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be used to decode error-correcting codes at bit-error-rates comparable to state-of-the-art belief propagation (BP) decoders, but with significantly stronger theoretical guarantees. However, LP decoding when implemented with standard LP solvers does not easily scale to the block lengths of modern error correcting codes. In this paper we draw on decomposition methods from optimization theory, specifically the Alternating Directions Method of Multipliers (ADMM), to develop efficient distributed algorithms for LP decoding. The key enabling technical result is a "two-slice" characterization of the geometry of the parity polytope, which is the convex hull of all codewords of a single parity check code. This new characterization simplifies the representation of points in the polytope. Using this simplification, we develop an efficient algorithm for Euclidean norm projection onto the parity polytope. This projection is required by ADMM and allows us to use LP decoding, with all its theoretical guarantees, to decode large-scale error correcting codes efficiently. We present numerical results for LDPC codes of lengths more than 1000. The waterfall region of LP decoding is seen to initiate at a slightly higher signal-to-noise ratio than for sum-product BP, however an error floor is not observed for LP decoding, which is not the case for BP. Our implementation of LP decoding using ADMM executes as fast as our baseline sum-product BP decoder, is fully parallelizable, and can be seen to implement a type of message-passing with a particularly simple schedule.
Cited by 5Open access
Adam Blažej · SHILAP Revista de lepidopterología · 2018
People have been fascinated by the charisma phenomenon since the very ancient times. What makes somebody charismatic, why do some people have it and others do not, and what is it all about? Charismatic people seem to have given something that others can only silently envy. Charismatic people can communicate in a way that others follow them and accept their opinions and values, sometimes even at the expense of their own. Which may seem rather unfair if we consider that other people can hardly do this. However, this article aims to summarize the facts about charisma to make it possible to identify the individual aspects that make it up. It is known that charisma does not refer to only one personality trait or facial feature but that it forms and affects a whole range of aspects. These aspects will be divided into several groups according to their common features. The essence of this division is both the clarification of the whole concept and the identification of tools or methods in relation to the development of a specific aspect of charisma. This article is therefore a systematic review which includes the previous empirical research (e. g. Cara et al., 2011; Cuddy, Wilmuth & Carney, 2012; Todorov et al., 2005) and also works with expert opinions (Leann, 2011; Hodgson, 2010; Robbins & Decenzo, 2001) with the aim of identifying and analyzing them. The criteria for including selected studies is their origin after 1950 and selected keywords. These are selected based on the definitions in the Theoretical Basics section and are: leadership, leader, embodiment, powerful, emotions, authority, self-esteem, self-determination, inner uncertainties, inspiration, motivation, communication, locus of control, behavior. The research will therefore summarize a great part of information and aspects that affects the phenomenon described. The summary conducts a wide range of these aspects (predominantly intrapsychological and interpsychological) and it can be maintained by a certain behavioral patterns or psychotherapeutic methods. These are listed at the end of the article in the summary section but described very briefly. More detail information can be found in the literature dealing with this specific problem. The output of the article is applicable to a variety of professions – from directors, teachers, trainers to any other person acting from the position of leader. Also a person interested in psychosocial development, because charisma, as is known, significantly contributes to social interactions and is also associated with the high self-confidence which the individual might find useful.
Cited by 0Open access
Roberta Lexier · New Directions for Teaching and Learning · 2025
ABSTRACT In this chapter, the author shares her journey and experiences with decolonization through the development of the Disrupting interview, collaborations with colleagues, and the re‐examination of disciplinary research and teaching practices.
Cited by 0Open access
RECERCAT (Consorci de Serveis Universitaris de Catalunya) · 2021
Cited by 0Open access