The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider a window decoding scheme for Braided Convolutional Codes (BCCs) based on the BCJR algorithm. We describe the principle of this decoding scheme and show that BCCs with window decoding exhibit excellent performance. The tradeoff between performance and decoding latency is examined and, to reduce decoding complexity, both uniform and nonuniform message passing schedules within the decoding...
The enhanced version of Soft Input Decryption (SID) method for the correction of the messages secured by their cryptographic check values (digital signatures and/or MACs and H-MACs) are presented. The soft output values of SISO convolutional decoder (so called |L|-values) which are driven to the input of decryptor are now used in a more efficient way. By introducing the decision threshold, the process...
Add - Compare - Select (ACS) unit forms the kernel of Viterbi decoder. High speed ACS unit design for convolutional codes is the research focus at high data rate communication applications. In this paper, we proposed a high-speed ACS architecture based on 4:2 compression arrays. By using 4:2 compressors, the compare operations are concurrent with add operations in ACS unit. With the proposed concurrent...
A threshold analysis of terminated braided block codes (BBCs) is presented for the binary erasure channel. Protograph based BBCs (PG-BBCs) are considered, which can be derived by lifting the Tanner graph of a tightly braided block code. They can be interpreted as GLDPC convolutional codes that are structured in a particular way. It is shown that the terminated PG-BBCs have better thresholds than their...
Turbo Convolutional Codes (TCC) are excellent error correcting codes. However, TCC decoders require large number of computations. Recently, a class of low complexity modified Turbo codes termed as Low Complexity Hybrid Turbo Codes (LCHTC) and Improved Low Complexity Hybrid Turbo Codes (ILCHTC) have been proposed. Simulation results show that the proposed codes achieve performance close to that of...
Turbo convolutional codes (TCC) are excellent error correcting codes as they show near Shannon capacity performance in communication systems. However, turbo decoders are computationally complex. Recently, a class of modified turbo codes called low complexity hybrid turbo codes (LCHTC) is proposed with bit error rate (BER) which is almost same as that of turbo codes. In this paper improved low complexity...
In this paper, we present a new multiple access scheme using OFDM modulation which we call braided code division multiple access (BCDMA). The principle behind this novel multiple access technique is to combine in one single scheme a very efficient error correction code, interleaving for channel diversity exploitation and, simultaneously, a multiple access method for a large number of users. BCDMA...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.