Antoine Courtay, Emmanuel Boutillon, Johann Laurent · 2009
Interconnects are now considered as the bottleneck in the design of system-on-chip (SoC) since they introduce delay and power consumption. To deal with this issue, data-coding for interconnect power and timing optimization is a promising method. Based on some realistic observations on interconnect delay and power estimation, a new data-coding technique called ldquoConvolutional Encoder for Crosstalk Reductionrdquo (CECR) is proposed. It allows the reduction of delay, power consumption (including extra power consumption due to codecs) and noise for on-chip buses. The concept of the technique is to reduce the switching activity to its minimum considering the transmission of data on the encoded wires. Results show the technique efficiency for different technologies and bus lengths. The power consumption reduction can reach up to 12% for a 10 mm bus in the 65 nm technology and more if buses are longer. It also allows the acceleration of the data propagation of 20% and the reduction of the overall worst noise case transitions of 51%.
Cited by 0
Graell I Amat, A., Vogric, D., Benedetto, Sergio et al. · PORTO Publications Open Repository TOrino (Politecnico di Torino) · 2006
Cited by 0
Nykson da Silva, Plínio R. S. Vilela · Resumos do... · 2019
In the software development process, testing activities are responsible for identifying the presence of defects and allowing them to be repaired before delivery to the end user. Previous research on cost reduction strategies attributed to software testing, focused on test case prioritization techniques based on code size and complexity metrics in order to reduce the cost of software and still guarantee the ability to detect defects. However, these studies did not considered aspects related to the developer.
Cited by 0Open access
A.M. Michelson, Gail Rosen · 2002
Severely punctured versions of the well-known rate-1/2, constraint-length-seven convolutional code are considered. Severely punctured means that exactly half of the data normally transmitted is deleted, specifically, the entire output of one parity circuit or the other. Redundancy is conveyed only by the code tail. It is shown that, for maximum likelihood decoding of short to moderately long messages, significant coding gains can be achieved, 2 to 3.8 dB. Both simulation and analytical results are given. It is also shown that less severely punctured codes have minimum distance two, and, for one of the generators, the punctured codes are cyclic for certain message lengths.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 1
Young-Ok Park · Wireless Personal Communications · 1994
Cited by 1
Antoine Courtay, Emmanuel Boutillon, Laurent, Johann · HAL (Le Centre pour la Communication Scientifique Directe) · 2009
International audience
Cited by 0
Erika Kusumasari Rosita, Suwadi Suwadi, Achmad Ansori · Jurnal Teknik ITS · 2013
Dalam sistem komunikasi digital modern, dimana data ditransmisikan dalam bentuk bit-bit biner, dibutuhkan sistem yang tahan terhadap noise yang terdapat pada kanal transmisi, hal ini dibutuhkan agar data yang ditransmisikan tersebut dapat diterima dengan benar. Kesalahan dalam pengiriman atau penerimaan data merupakan permasalahan yang mendasar yang memberikan dampak yang sangat signifikan pada sistem komunikasi. Untuk mengatasinya, maka diperlukan suatu metode pengkodean kanal yang mampu mendeteksi kesalahan dan mengkoreksi kesalahan. Pada tugas akhir ini konvolusi code diimplementasikan pada sebuah DSP card seri TMS320C6416T untuk mengatasi masalah sistem komunikasi tersebut. Kode konvolusi merupakan teknik Error Control Coding untuk mendeteksi dan mengkoreksi error pada informasi akibat pengaruh noise. Analisis meliputi nilai BER yang diperoleh dengan mengubah parameter Eb/No pada blok AWGN, dan uji coba rangkaian menggunakan DSK TMS320C6416T. Hasil penelitian menunjukkan sistem yang menggunakan <em>konvolusi code</em> dan <em>viterbi decode</em> dapat menurunkan probabilitas error dibandingkan dengan sistem model yang tidak menggunakan <em>konvolusi code</em> dan <em>viterbi decode.</em>
Cited by 1Open access
Nilesh G. Nirmal, Gajanan U. Patil, Prafulla. P. Chaudhari et al. · 2012
Abstract—Convolutional encoding and decoding (Viterbi decoding) is a powerful method for forward error detection &amp; correction. It has been widely deployed in many communication systems to improve the limited capacity and code rate of the communication channels. The Viterbi algorithm, which is the most extensively employed decoding algorithm for convolutional codes. In this paper, we present a Simulation soft core implementation of Viterbi Decoder with a constraint length of three and a code rate of 2/3.
Cited by 0
Debasish Bera, Jaydip Sen · 2009
The channel encoder is incorporated in communication system to mitigate the effects of distortion, attenuation and fading as may be experienced by the transmitted signal. In this article we have discussed about circular recursive systematic convolutional (CRSC) based turbo codes and their bi-directional soft output viterbi algorithm (SOVA) decoding approach. The bi-directional SOVA [10] is considered in view of its better performance and implementation complexity trade-off. Necessary changes in basic message passing equations of bi-directional SOVA has been introduced, when the double binary CRSC codes are considered instead of the classical binary turbo codes. Double binary CRSC code provides significant error-correcting performance while not suffering from the well-known bit error rate (BER) floor of classical binary turbo codes. Decoding of these circular codes requires a prologue decoder, prior to the actual trellis decoding, to estimate the initial state. A prologue-decoding algorithm for double-binary CRSC code has also been proposed. Prologue decoding plays a very important role in assessing the circulation state of the encoder for a CRSC codes [4]. Efficient determination of circulation state through prologue decoding helps in achieving impressive error performance. Insight into the process of prologue decoding is also useful in reducing average power dissipation in digital implementation of such turbo codecs. The design issues related to prologue decoding and their effects on error performance have also been discussed in this paper. It has been shown that, the performance of prologue decoder does not depend much on prologue length. Adequate simulation results have been included.
Cited by 3
Shin Jihwan, Ho-Kyeong Lee · 2020
We consider a concatenated coding scheme which consists of the tail-biting convolutional code as an inner code and the hamming code as an outer code. They are separated by a block interleaver. The size of the row of the block interleaver is fixed to the length of the codeword of the hamming code. We select the interleaving depth, the size of the column of a block interleaver based on the burst error statistics of the outer convolutional code. We assume that the channel is correlated discrete Rayleigh fading channel which is modeled by using FSMC (Finite-State Markov Chain). Our simulation results show that the BER (Bit Error Rate) performance improvement of the convolutional code with the Hamming code.
Cited by 13
Jyoti Rathi, Surender Kumar Grewal · Knowledge-Based Systems · 2025
Cited by 0
Yunan Jiang · 2022 3rd International Conference on Electronic Communication and Artificial Intelligence (IWECAI) · 2022
In signal transmission processing, when the signal passes through the channel, it increases noise and causes the recovered signal to distort. Error codes can cause errors in the transmission of information. In order to reduce the bit error rate (BER) and improve the accuracy of receiving information at the receiving end, this paper uses BCH code, convolution code two kinds of coding methods, QPSK modulation for transmission, and no parity modulation is required. In the experiment, we change the signal-to-noise ratio of the signal to obtain different signal-to-noise ratio, the error rate corresponding to the different coding methods. By comparing the error rate, it can be concluded that for BCH code, the longer the code, the lower the BER, but the more spectrum resources will be used. For signals with a signal-to-noise ratio greater than or equal to 3dB, the transmission of (7,4) BCH codes is the optimal solution. For convolution code, the more bits the code generator has, the lower the BER. Soft decoding has a lower BER than hard decoding. When the two coding methods are in series, BER decreases.
Cited by 8
Alexander A Sidorenko · Journal of Physics Conference Series · 2024
Abstract An urgent task is to correct errors that occur during the transmission and storage of information. To solve this problem, various noise-resistant codes have recently been increasingly used. Turbo codes have the best correcting ability in data transmission channels with a high probability of an erroneous bit. To obtain the necessary characteristics, various combinations of codes and encoding and decoding methods are used. If another block of information bits is added to the codeword of a systematic block or systematic convolutional code, then it will be possible to implement decoding of such a codeword by a turbo code decoder. The disadvantage of the resulting combined code is its extremely low correcting ability in the presence of errors in the check bits of the codeword. The article shows that the correcting ability of the presented code can be significantly increased by multiplying the decoded values of the check bits by reduction factors.
Cited by 1Open access
Gabriel Iro, Rajeshwari Kabbinale · Lund University Publications Student Papers (Lund University) · 2017
A big challenge faced by the digital communication world today is increasing the reliability of information which is being transmitted. During the transmission of information, there is a possibility that the information is corrupted or distorted. If this distortion is considerably high, it becomes dicult to decode and retrieve the original information. To help mitigate this eect, the information bits are encoded and the induced errors can be reduced or completely removed after decoding. This process of protecting the information bits is called error control coding (ECC). It is introduced to provide reliable transmission of information over the channel and this is done by adding redundancy to the message that is to be transmitted. There are ongoing studies in dierent implementations of error control coding schemes based on both convolutional codes and block codes. One technique intro- duced to improve the performance of the codes is spatial coupling. This technique was rst introduced for low-density parity check codes (LDPC) codes, however, spatial coupling is a general concept, and it can be applied on other classes of error control codes such as turbo-like codes (TCs). There is research at the De- partment of Electrical and Information Technology at Lund University on dierent construction of spatially coupled turbo-like codes such as: spatially coupled paral- lel concatenated codes (SC-PCCs), braided convolutional codes (BCCs), spatially coupled serially concatenated codes (SC-SCCs) and spatially coupled hybrid con- catenated codes (SC-HCCs). These codes have shown to have asymptotically good performance, but their performances in the nite length regime is currently under investigation. In this thesis we investigated the performance of SCCs and HCCs under spatial coupling in the nite length regime. At the beginning of our investigation, we dened the spatially coupled ensembles, then, implemented these ensembles in Matlab and C++. Thereafter, we simulated the ensembles considering dierent puncturing patterns to obtain higher code rates. We then compare our results with those for BCC and SC-PCC which has been carried out previously in the department. The results show that all the investigated codes perform better when they are spatially coupled than when they are uncoupled. Among all the considered ensembles, BCC with spatial coupling is comparably the best performing code overall especially with an increased block length. Moreover, our results also shows that the pattern of puncturing applied on the code aects the performance of the code. The puncturing pattern which gives the better performance for uncoupled codes may not necessarily give the better performance for the coupled codes.
Cited by 2Open access
Jinjin He, Zhongfeng Wang, Huaping Liu · 2010
This paper presents a memory-reduced VLSI architecture for the decoding of double-binary convolutional Turbo code (DB CTC) using maximum a posteriori probability (MAP) algorithm. For such kind of soft-in soft-out (SISO) decoding, the branch metrics (BMs) γ become the dominant factor in determining the overall required memory size inside the SISO decoder. We propose to decompose each BM into a information metric and a parity metric, which leads to 50% reduction of the memory size for BMs. We further modify the MAP algorithm based on the new formulation of BMs. The new MAP algorithm reveals that: 1) the partitioning of BMs does not introduce any computational overhead when the MAP algorithm is modified; 2) the extrinsic metrics are independent from a posteriori log-likelihood ration, which is attractive for low-power SISO decoder design.
Cited by 7
Yu Dai, Shuna Yao, Shujing Wang et al. · 2024
With the increasing number of wireless devices, the demand for secure message transmission is growing. Ensuring reliable and secure transmission is a key goal in physical layer security. Traditional models use layered design with encryption and channel coding. Recent research focuses on secure error-correcting codes, which could be a candidate for post-quantum cryptography. The challenge lies in designing a code that combines encryption and error correction without compromising decoding performance, while balancing computational resources and reducing system delays. This paper proposes a simplified scheme that integrates encryption and coding based on serially concatenated convolutional codes. By using a two-dimensional chaotic map to control the permutation matrix, interleaver, and puncturing pattern, the coding generator achieves dynamic changes within the period. It also analyzes the security under chosen plaintext attacks and compares the decoding performance of this scheme with the original coding scheme. The proposed scheme achieves a balance between encryption and reliability without significant loss in decoding performance.
Cited by 0
Yinlong Shi, Kai Tao, Zitao Wei et al. · 2024
Employing FPGA emulations, we investigate the performance of the hybrid check generalized LDPC convolutional code, and reveal that a small proportion of generalized check nodes can not effectively decrease the error floor down to 10 -15 .
Cited by 2
Poulose Jacob,K, Shahana, T K, Sreela Sasi et al. · Dyuthi Digital Repository (Cochin University of Science and Technology) · 2014
The modern telecommunication industry demands higher capacity networks with high data rate. Orthogonal frequency division multiplexing (OFDM) is a promising technique for high data rate wireless communications at reasonable complexity in wireless channels. OFDM has been adopted for many types of wireless systems like wireless local area networks such as IEEE 802.11a, and digital audio/video broadcasting (DAB/DVB). The proposed research focuses on a concatenated coding scheme that improve the performance of OFDM based wireless communications. It uses a Redundant Residue Number System (RRNS) code as the outer code and a convolutional code as the inner code. The bit error rate (BER) performances of the proposed system under different channel conditions are investigated. These include the effect of additive white Gaussian noise (AWGN), multipath delay spread, peak power clipping and frame start synchronization error. The simulation results show that the proposed RRNS-Convolutional concatenated coding (RCCC) scheme provides significant improvement in the system performance by exploiting the inherent properties of RRNS.
Cited by 0
Rafael Santos, Daniel Castanheira, Adão Silva et al. · 2024
URLLC applications impose stringent latency and reliability requirements, making its compliance challenging due to the inherent trade-off between them. These applications typically involve the exchange of small information blocks. Convolutional codes (CC) exhibit near-optimal performance when encoding short blocks. To enable packet based transmissions, CCs require some kind of termination. A zero-terminated CC (ZTCC) enables efficient maximum likelihood (ML) decoding through the Viterbi algorithm, but suffers from a rate-loss particularly prominent in short blocks. A tail-biting CC (TBCC) avoids rateloss but entails significantly higher ML decoding complexity. Despite the ZTCC having lower ML decoding complexity and similar error performance, TBCC has received preference by wireless standards, essentially due to ZTCC rate-loss. This work proposes a novel distributed multiuser ZTCC (MU-ZTCC) coding scheme, which eliminates rate-loss by encoding multiple physically separated users over-the-air. Local user data undergoes standard ZTCC encoding followed by multiuser encoding via over-the-air summation. Due to its zero termination, ML decoding of MU-ZTCC is accomplished with a single Viterbi execution. The results reveal that the user error performance in MU-ZTCC approaches that of orthogonal transmissions as the SNR increases. This scheme can be viewed as a nonorthogonal multiple access scheme, whose structure enables ML joint detection and decoding with the complexity of standard Viterbi algorithm.
Cited by 0Open access
Zhengxu Zhou, Xunchao Li, Minghao Li et al. · ArXiv.org · 2025
The rapid scaling of Large Language Models (LLMs) elevates inference costs and compounds substantial deployment barriers. While quantization to 8 or 4 bits mitigates this, sub-3-bit methods face severe accuracy, scalability, and efficiency degradation. We propose Convolutional Code Quantization (CCQ), an inference-optimized quantization approach compressing LLMs to 2.0-2.75 bits with minimal accuracy loss. Departing from error-prone scalar quantization or slow vector quantization, CCQ integrates a hardware-aware bit-shift encoding and decoding solution with Convolutional Code, Hybrid Encoding, and Code Cluster, jointly overcoming accuracy-speed bottlenecks. We construct a lookup-free encoding space, enabling a linear mapping between the codebook and weight vectors, thereby optimizing inference performance. Meanwhile, by drawing on the concept of data mapping from vector quantization, we minimize the performance degradation of the model under extremely low-bit conditions. Experiments demonstrate that CCQ achieves outstanding performance on LLMs across various benchmarks. We compress DeepSeek-V3 (671B total parameters) to 184GB and ERNIE-4.5-300B-A47B to 89GB, enabling single-GPU deployment of ERNIE 4.5 and eliminating inter-card communication. The 2-bit ERNIE-4.5-300B-A47B model and inference engine have been open-sourced.
Cited by 0Open access