Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “decoding complexity”

Complexity of decoding Gabidulin codes

Maximilien Gadouleau, Zhiyuan Yan · 2008

In this paper, we analyze the complexity of decoding Gabidulin codes using the analogs in rank metric codes of the extended Euclidean algorithm or the Berlekamp-Massey algorithm. We show that a subclass of Gabidulin codes reduces the complexity and the memory requirements of the decoding algorithm. We also simplify an existing algorithm for finding roots of linearized polynomials for decoding Gabidulin codes. Finally we analyze and compare the asymptotic complexities of different decoding algorithms for Gabidulin codes.

Cited by 35

Complexity modeling of scalable video decoding

Zhan Ma, Yao Wang · Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing · 2008

This paper addresses the computational complexity of scalable video decoding using emerging scalable extension of H.-264/AVC (SVC) standard compliant decoder. Scalable functionalities provided by SVC standard encompass temporal, spatial, quality enhancements and their combinations. The complexity model for decoding a bit stream with only temporal, spatial, or quality scalability are developed first. We then extend to a more general model for decoding a bit stream with arbitrarily combined scalability. Comparison with the number of clock cycles used in SVC decoding on a PC shows that the proposed model is very accurate.

Cited by 16

Complexity Scalable Learning-Based Image Decoding

Md Tahsir Ahmed Munna, João Ascenso · 2023

Recently, learning-based image compression has attracted a lot of attention, leading to the development of a new JPEG AI standard based on neural networks. Typically, this type of coding solution has much lower encoding complexity compared to conventional coding standards such as HEVC and VVC (Intra mode) but has much higher decoding complexity. Therefore, to promote the wide adoption of learning-based image compression, especially to resource-constrained (such as mobile) devices, it is important to achieve lower decoding complexity even if at the cost of some coding efficiency. This paper proposes a complexity scalable decoder that can control the decoding complexity by proposing a novel procedure to learn the filters of the convolutional layers at the decoder by varying the number of channels at each layer, effectively having simple to more complex decoding networks. A regularization loss is employed with pruning after training to obtain a set of scalable layers, which may use more or fewer channels depending on the complexity budget. Experimental results show that complexity can be significantly reduced while still allowing a competitive rate-distortion performance.

Cited by 5

DIA: A complexity-effective decoding architecture

Santana Jaria, Oliverio J., Falcón Samper, Ayose Jesus, Ramírez Bellido, Alejandro et al. · RECERCAT (Consorci de Serveis Universitaris de Catalunya)

Fast instruction decoding is a true challenge for the design of CISC microprocessors implementing variable-length instructions. A well-known solution to overcome this problem is caching decoded instructions in a hardware buffer. Fetching already decoded instructions avoids the need for decoding them again, improving processor performance. However, introducing such special--purpose storage in the processor design involves an important increase in the fetch architecture complexity. In this paper, we propose a novel decoding architecture that reduces the fetch engine implementation cost. Instead of using a special-purpose hardware buffer, our proposal stores frequently decoded instructions in the memory hierarchy. The address where the decoded instructions are stored is kept in the branch prediction mechanism, enabling it to guide our decoding architecture. This makes it possible for the processor front end to fetch already decoded instructions from the memory instead of the original nondecoded instructions. Our results show that using our decoding architecture, a state-of-the-art superscalar processor achieves competitive performance improvements, while requiring less chip area and energy consumption in the fetch architecture than a hardware code caching mechanism.

Cited by 0Open access

On the complexity of sphere decoding

Ernesto Zimmermann, Wolfgang Rave, Gerhard Fettweis · 2004

Abstract — Recently, sphere detection has emerged as a powerful means of finding the maximum likelihood solution to the detection problem for multiple-antenna (MIMO) systems. In this paper, we analyze the performance and computational complexity of different sphere detectors and compare it with that of already known MIMO receiver techniques, in uncoded as well as coded transmission 1. We propose a number of techniques that allow for reducing the complexity of sphere detection – some at the expense of bit error performance. Our results confirm that for uncoded transmission and low target BERs, sphere detectors outperform all other known receiver techniques with only minor additional complexity. For coded transmission, the complexity of sphere detection essentially scales with the number of candidates, motivating for further research to find techniques that provide good soft outputs with very low numbers of candidates. I.

Cited by 0

Topological decoding of biomolecular fold complexity

Scalvini, B. · Leiden Repository (Leiden University) · 2023

Biological polymers, including proteins and the genome, undergo folding processes crucial for their proper functioning. Even slight changes in the folding structure of these biopolymers can have significant implications, leading to the development of various pathological conditions, such as neurodegenerative diseases and cancer. In this thesis, we leverage the theoretical framework of Circuit Topology and expand its application to real-world scenarios. By employing this approach, we quantify the folding patterns of biological polymers, offering valuable insights for detecting harmful misfolds. Furthermore, this research holds the potential to provide fundamental design principles for molecular engineering in the realm of pharmaceutical applications. <table><tbody><tr><td> </td></tr></tbody></table>

Cited by 0Open access

Decoding Complexity in Structure-Sensitive Reactions

Toyin Omojola · ChemRxiv · 2021

Structure-sensitive reactions involving the Mars and van Krevelen mechanism over metal and metal oxide catalysts are ubiquitous in reaction kinetics and engineering. The kinetic equations of such reactions are re-written to account for modern operando spectroscopy and microscopy observations. Emphasis is placed on reactions with nucleophilic (lattice) oxygen, oxygen reduction reversibility, an interconversion scheme, non-linear water adsorption, remote-control model, and non-uniform sites. The multiplicity of propane conversion over MoVTeNbOx catalysts is proven through a combination of non-linear competitive water adsorption, the presence of multiple active sites, a re-structuring active site, and oxygen adsorption. The modified remote-control kinetics for the Mars and van Krevelen mechanism can account for the observations of steady-state multiplicities and hysteresis. The results have implications for improving catalytic activity, reducing operating process costs, and active site engineering of selective oxidation catalysis.

Cited by 1Open access

Reduced-Complexity Syndrome-Based TTCM Decoding

Zunaira Babar, Soon Xin Ng, Lajos Hanzo · IEEE Communications Letters · 2013

The iterative decoder of Turbo Trellis Coded Modulation (TTCM) exchanges extrinsic information between the constituent TCM decoders, which imposes a high computational complexity at the receiver. Therefore we conceive the syndrome-based block decoding of TTCM, which is capable of reducing the decoding complexity by disabling the decoder, when syndrome becomes zero. Quantitatively, we demonstrate that a decoding complexity reduction of at least 17% is attained at high SNRs, with at least 20% and 45% reduction in the 5^{th} and 6^{th} iterations, respectively.

Cited by 8

Low complexity decoding of cyclic codes.

Hai Pang Ho · Surrey Research Insight Open Access (The University of Surrey) · 1998

This thesis presents three novel low complexity decoding algorithms for Cyclic codes. These algorithms are the Extended Kasami Algorithm (EKA), Permutation Error Trapping (PET) and the Modified Dorsch Algorithm (MDA). The Extended Kasami Algorithm is a novel decoding algorithm combining the Error Trapping Algorithm with cover polynomial techniques. With a revised searching method to locate the best combination of cover positions, the Extended Kasami Algorithm can achieve bounded distance performance with complexity many times lower than other efficient decoding algorithms. In comparison with the Minimum Weight Decoding (MWD) Algorithm on (31,16) BCH codes, the complexity of EKA is only 5% of MWD at 0 dB Eb/No. Comparing EKA with the Kasami Algorithm on the (23,12) Golay code, EKA reduces the complexity consistently for all values of Eb/No. When dealing with Reed Solomon codes, it is found that the additional complexity incurred by finding the error values is a function that increases exponentially with the number of bits in each symbol. To eliminate the problem of finding the error values, Permutation Error Trapping uses a specific cyclic code property to re-shuffle symbol positions. This complements well the Error Trapping approach and most decodable error patterns can be trapped by using this simple approach. PET achieves performance close to that of MWD on the (15,9) RS code with much lower complexity. For more complex codes, like the four-symbol-error correcting (15,7) RS code. Modified Permutation Error Trapping combines part of the cover polynomial approach of EKA with PET resulting in retaining good performance with low complexity. For attempting to decode Reed Solomon codes using soft decision values, the application of a modified Dorsch Algorithm to Reed Solomon codes on various issues has been evaluated. Using a binary form of Reed Solomon codes has been found to be able to achieve near maximum likelihood performance with very few decodings.

Cited by 0

Towards Low-Complexity Linear-Programming Decoding

Pascal O. Vontobel, R. Koetter · ArXiv.org · 2006

We consider linear-programming (LP) decoding of low-density parity-check (LDPC) codes. While it is clear that one can use any general-purpose LP solver to solve the LP that appears in the decoding problem, we argue in this paper that the LP at hand is equipped with a lot of structure that one should take advantage of. Towards this goal, we study the dual LP and show how coordinate-ascent methods lead to very simple update rules that are tightly connected to the min-sum algorithm. Moreover, replacing minima in the formula of the dual LP with soft-minima one obtains update rules that are tightly connected to the sum-product algorithm. This shows that LP solvers with complexity similar to the min-sum algorithm and the sum-product algorithm are feasible. Finally, we also discuss some sub-gradient-based methods.

Cited by 97Open access

On adaptive reduced-complexity iterative decoding

Philippa A. Martin, D.P. Taylor · 2002

This paper develops an adaptive approach to iterative decoding of block turbo codes. The method developed in this paper allows the receiver to adapt to the conditions of the channel, the codes and the modulation scheme. The approach yields improved performance especially in early iterations, for a very small increase in complexity.

Cited by 15

Low Complexity Decoding of BICM STBC

E. Akay, E. Ayanoglu · 2005

It was shown earlier that the combination of bit interleaved coded modulation (BICM) with space time block codes (STBC) for OFDM systems leads to the maximum diversity order in space and frequency. In this paper we present low complexity decoding of BICM-STBC systems. First, the maximum likelihood (ML) bit metric calculations are simplified from a distance on the complex plane to a distance on the real line. Furthermore, we present log-likelihood-ratio (LLR) approximations to maximum likelihood (ML) decoding metrics to achieve easier to implement soft decision bit metrics with the same high performance. The LLR bit metrics are specifically calculated for M-ary QAM signal constellations used in IEEE 802.1la/g networks. Simulation results also show that while achieving a substantial improvement in decoder complexity, the proposed bit metrics achieve the same high performance.

Cited by 0

Low complexity decoding for convolutional codes

H. Vinck · 2003

Several attempts to reduce the decoding complexity for convolutional codes are described. Although most of the attempts were unsuccessful, the author gained interesting insight which helped in understanding the theory of convolutional codes and led to further studies. It is concluded that the performance of the standard v=6 Viterbi decoder is hard to beat. The author gives a concatenated coding scheme using the same v=6 code and a distance 2 code to obtain an almost ML decoding algorithm with the performance of a d/sub free/=20 code.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 0