Manton, Coral · Figshare · 2021
Shared Pasts: Decoding Complexity, is a practice-as-research project that investigates how spatial computing, data visualisation and augmented reality can be used to tell complex narratives about historic artefacts and places. This multi-component output spans two interrelated prototypes: ‘The Museum Collection Engine’ (2018) and ‘Shared Pasts: Decoding Complexity’ (2019).<br><b>This item contains documentation detailing the design process for the application.<br><br>All media and text documents courtesy of Coral Manton.<br>Used with permission.</b><br><br><b>The work is under copyright and may not be used without permission. Use of this repository acknowledges cooperation with its policies and relevant copyright law.</b><br>
Cited by 0Open access
D. Bokolamulla · Chalmers Publication Library (Chalmers University of Technology) · 2003
Cited by 3
Wilson Cheong Hin Hong, Joanne Yu, Roman Egger · Annals of Tourism Research · 2025
Cited by 2
Hironori Uchikawa, Kohsuke Harada, Yasuhiko Tanabe · 2008
We propose a complexity-reducing method for serial min-sum decoding that reduces the number of check nodes to process during an iteration. The check nodes to skip are chosen based on the reliability, a syndrome and a log-likelihood-ratio (LLR) value, of the incoming messages. The proposed method is evaluated by computer simulations and shown to reduce the decoding complexity up to 70 % compared with conventional serial min-sum decoding with small fractional decibel degradation in error correction performance.
Cited by 0
D. Bokolamulla, Tor Aulin · Chalmers Publication Library (Chalmers University of Technology) · 2003
A new algorithm to reduce the computational complexity\nof iterative decoding is presented. The algorithm reduces the complexity by removing certain branches from the corresponding trellis diagram. A threshold on a priori values is used as the elimination criterion. To assess the performance, numerical results for serially concatenated convolutional codes transmitted over an additive white gaussian noise channel is presented. The results show that for the system considered, the algorithm can reduce the complexity by one third with a negligible degradation\nin error performance.
Cited by 0
D. Seethaler, et al. · 2011
We analyze the (computational) complexity distribution of sphere decoding (SD) for random infinite lattices. In particular, we show that under fairly general assumptions on the statistics of the lattice basis matrix, the tail behavior of the SD complexity distribution is fully determined by the inverse volume of the fundamental regions of the underlying lattice. Particularizing this result to N ×M, N ≥ M, i.i.d. circularly symmetric complex Gaussian lattice basis matrices, we find that the corresponding complexity distribution is of Pareto-type with tail exponent given by N −M + 1. A more refined analysis reveals that the corresponding average complexity of SD is infinite for N =M and finite for N&gt; M. Finally, for i.i.d. circularly symmetric complex Gaussian lattice basis matrices, we analyze SD preprocessing techniques based on lattice-reduction (such as the LLL algorithm or layer-sorting according to the V-BLAST algorithm) and regularization. In particular, we show that lattice-reduction does not improve the tail exponent of the complexity distribution while regularization results in a SD complexity distribution with tails that decrease faster than polynomial.
Cited by 0
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung · ArXiv.org · 2006
In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a maximum-likelihood (ML) decoder for this MDC-QOSTBC, for any number of transmit antennas, only requires the joint detection of two real symbols. Assuming the use of a square or rectangular quadratic-amplitude modulation (QAM) or multiple phase-shift keying (MPSK) modulation for this MDC-QOSTBC, we also obtain the optimum constellation rotation angle, in order to achieve full diversity and optimum coding gain. We show that the maximum achievable code rate of these MDC-QOSTBC is 1 for three and four antennas and 3/4 for five to eight antennas. We also show that the proposed MDC-QOSTBC has several desirable properties, such as a more even power distribution among antennas and better scalability in adjusting the number of transmit antennas, compared with the coordinate interleaved orthogonal design (CIOD) and asymmetric CIOD (ACIOD) codes. For the case of an odd number of transmit antennas, MDC-QO-STBC also has better decoding performance than CIOD.
Cited by 0Open access
Cenk Albayrak, Kadir Türk · 2016
In this paper, the belief propagation (BP) based approximation methods which are introduced for low density parity check (LDPC) codes in literature are adapted to the Raptor decoder structure in order to reduce its computational complexity. The bit error rate (BER) performances of the algorithms over the additive white Gaussian noise (AWGN) channel are obtained by both theoretical works and simulations. The Monte-Carlo based density evolution (MC-DE) method is used for theoretical analysis. In addition to this, computational complexity analyses of the considered methods are presented. Results show that the computational complexity can be significantly decreased with a limited performance loss cost.
Cited by 0
A. Geyer, A. J. Han Vinck · 2003
We discuss the classical definition of equivalent convolutional codes. We extend the definition to allow delay over digits in a serial output description. Then we propose the definition of encoders that generate different codes but with the same code spectrum. We conclude with some examples of encoder implementations that do not give the same code but the same code spectrum for encoders with less memory elements.
Cited by 1
Peter Haase, Herman Rohling · Wireless Personal Communications · 2002
Cited by 2
Xinyuanmeng Yao, Xiao Ma · arXiv (Cornell University) · 2024
Successive cancellation list (SCL) decoding enables polar codes and their generalizations to deliver satisfactory performance in finite-length scenarios but it comes with high latency and complexity. To reduce latency, a partitioned SCL (PSCL) decoding algorithm, implemented over a PSCL decoding tree, can be utilized. In this work, we aim to lower down the complexity of the PSCL decoding, resulting in an efficient decoding algorithm with low latency and complexity for polar-like codes. To achieve this, we define two metrics at each level of the PSCL decoding tree. One is for evaluating the reliability of a path and the other is for estimating the probability of the correct path being included in a list of paths. Then, we propose a double-threshold strategy in the PSCL decoding process where unreliable valid paths are pruned based on the first metric, and then a list of surviving paths is selected based on the second metric. Simulation results demonstrate that when polar/CRC-polar/PAC codes are decoded using the proposed low-complexity PSCL decoder, both the sorting complexity and the computational complexity are reduced and significantly decrease as the signal-to-noise ratio (SNR) increases.
Cited by 0Open access
Peter Haase, Hermann Rohling · 2008
The concept of concatenated codes and turbo decoding is well known and leads to a remarkable good performance in many applications. The resulting signal processing for this concept shows high complexity relative to conventional viterbi decoding. Therefore, this paper considers an alternative concept of turbo decoding to reduce the computational complexity.
Cited by 0
Vandana Sharma, Karthik Swaminathan, Rammohan Shukla · International Journal of Molecular Sciences · 2024
Several types of mood disorders lie along a continuum, with nebulous boundaries between them. Understanding the mechanisms that contribute to mood disorder complexity is critical for effective treatment. However, present treatments are largely centered around neurotransmission and receptor-based hypotheses, which, given the high instance of treatment resistance, fail to adequately explain the complexities of mood disorders. In this opinion piece, based on our recent results, we propose a ribosome hypothesis of mood disorders. We suggest that any hypothesis seeking to explain the diverse nature of mood disorders must incorporate infrastructure diversity that results in a wide range of effects. Ribosomes, with their mobility across neurites and complex composition, have the potential to become specialized during stress; thus, ribosome diversity and dysregulation are well suited to explaining mood disorder complexity. Here, we first establish a framework connecting ribosomes to the current state of knowledge associated with mood disorders. Then, we describe the potential mechanisms through which ribosomes could homeostatically regulate systems to manifest diverse mood disorder phenotypes and discuss approaches for substantiating the ribosome hypothesis. Investigating these mechanisms as therapeutic targets holds promise for transdiagnostic avenues targeting mood disorders.
Cited by 7Open access
Pakdaman, Farhad, Adelimanesh, Mohammad Ali, Gabbouj, Moncef et al. · IEEE DataPort · 2020
While the next generation video compression standard, Versatile Video Coding (VVC), provides a superior compressing efficiency, its computational complexity dramatically increases. This dataset provides thoroughly analisis on complexity of both encoder and decoder of VVC Test Model 6.0. Encoding anddecoding operations have been performed for six video sequences of 720p, 1080p, and 2160p resolutions, and under Low-Delay (LD), Random-Access (RA), and All-Intra (AI) conditions (a total of 320 encoding/decoding operations). All operations were analyzed with Intel VTune 2019 and results of these analysis are collected and reported in this dataset.
Cited by 0Open access
Xinyuanmeng Yao, Xiao Ma · IEEE Transactions on Communications · 2025
Successive cancellation list (SCL) decoding enables polar codes and their generalizations to deliver satisfactory performance in finite-length scenarios but it comes with high latency and complexity. To reduce latency, a partitioned SCL (PSCL) decoding algorithm, implemented over a PSCL decoding tree, can be utilized. In this work, we aim to lower down the complexity of the PSCL decoding, resulting in an efficient decoding algorithm with low latency and complexity for polar-like codes. To achieve this, we define two metrics at each level of the PSCL decoding tree. One is for evaluating the reliability of a path and the other is for evaluating the reliability of a list of paths. Then, we propose a double-threshold strategy in the PSCL decoding process where unreliable valid paths are pruned based on the first metric, and then the smallest reliable list of paths is selected to continue based on the second metric. Simulation results demonstrate that when polar/CRC-polar/PAC codes are decoded using the proposed low-complexity PSCL decoder, both the sorting complexity and the computational complexity are reduced and significantly decrease as the signal-to-noise ratio (SNR) increases.
Cited by 1
2008
Abstract — It has been shown by Zehavi that the performance of coded modulation can be improved over a Rayleigh fading channel by bit-wise interleaving at the encoder output, and by using an appropriate soft-decision metric for a Viterbi decoder at the receiver. Caire et al presented the details of the theory behind bit-interleaved coded modulation (BICM). In this paper we show that for Gray encoded M-ary quadrature amplitude modulation (QAM) systems, the bit metrics of BICM can be further simplified. In QAM systems, the maximum likelihood (ML) detector for BICM uses the minimum distance between the received symbol and M/2 constellation points on the complex plane as soft-decision metrics. We show that softdecision bit metrics for the ML decoder can be further simplified to √ the minimum distance between the received symbol and 1 M/2 constellation points on the real line R. This reduces the number of calculations needed for each bit metric substantially, and therefore reduces the complexity of the decoder without compromising the performance. Simulation results for single carrier modulation (SCM), and multi-carrier modulation (MCM) systems over additive white Gaussian noise (AWGN) and Rayleigh fading channels agree with our findings. In addition, we tie this result to the decoding methods for bit interleaved convolutional code standards used in industry. I.
Cited by 0
Vladimir Sidorenko · mediaTUM (Technical University of Munich)
Cited by 0
Abdellatif Salah · HAL (Le Centre pour la Communication Scientifique Directe) · 2010
The use of MIMO antennas is a technique that allows to exploit in a very effective way the spatial and temporal diversity in certain systems of communication, of which the wireless communication systems. The main advantage of this technique is a good spectral efficiency. Nowadays, the mobile radio channel is increasingly used to transmit all type of information and methods allowing a more effective use of the spectrum have a fundamental importance. Today, the well-known reception algorithms are very complex, even as regards the MIMO systems with the simplest space-time codes. This complexity remains one of the main obstacles in the real exploitation of this technique. This thesis presents a detailed study of the complexity, the performance and the most interesting aspects of the behavior of the reception algorithms for MIMO decoding. This study presents a quick mean for a possible architectural conception adapted to this problem. Among the subjects presented in this thesis, an in-depth study of the performance and the complexity of these algorithms was realized, having for objective to acquire enough knowledge to be able to choose, among the large number of known algorithms, the best adapted to every particular system. Improvements in the known algorithms were also proposed and analyzed
Cited by 1Open access
Banihashemi, Amir H. · UWSpace (University of Waterloo) · 1997
Decoding operation i s the major obstacle associated with using a lat tice in communication applications.There are two general methods for lattice decoding: i) The integer programming method based on geometry of numbers, and ii) The trellis method.This thesis has contributions to both methods, and provides results which make the cornparison between the two methods possible-Regarding method (i), Kannan's algorithrn, which is currently known as the fastest methad for the decoding of a general lattice, is analyzed.Based on a geometrical interpretation of this algorithm, it is shown that it i s a specid case of a wider category of algorithms?called recursive cube search (RCS) algorithms.In this category, we improve Kaman's algorithm, and establish tight upper and lower bounds on the decoding complexity of lattices.The lower bounds prove that the 1 would like to appreciate the valuable efforts of Dr.
Cited by 3Open access
Yidan Pan, Jianping Li · 2023
Although the SCF algorithm can significantly avoid the impact of accumulated errors in the decoding process by flipping the first erroneous bit of the traditional SC algorithm, the computational complexity of that will also increase. Based on this disadvantage, a new polar code SCF method based on effective flip bits has been proposed, which can effectively reduce the computational complexity at low SNR by flipping the worst performing bits in the search channel. However, the limitation of this algorithm increases with the increase of SNR. In this letter, based on the limitation, an adaptive threshold is proposed to further reduce the complexity. The SCF-EF decoding algorithm under adaptive thresholds can effectively reduce unnecessary flipping of the original SCF decoding algorithm, and effectively reduce the complexity of the practical decoding operation, with the loss of the BLER performance can be negligible. Simulation results demonstrate that for practical code lengths (1024, 512), the adaptive SCF-EF(AD_EF) algorithm can achieve a complexity reduction in the range of 4% to 7% at SNR of 1.0/1.5dB with the loss of the BLER performance can be negligible.
Cited by 0