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.
This paper tackles the problem of the direction of arrival (DOA) estimation in turbo-coded systems. We derive for the first time the closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of the code-aided (CA) DOA estimates from arbitrary square-QAM modulated signals. We succeed in factorizing the likelihood function of the system into two analogous terms linearizing thereby all the derivation...
Turbo Convolutional Codes (TCC) are widely used to reduce Bit Error Rate (BER) for Second Generation (2G) and Third Generation (3G) wireless networks. However, TCC require large decoding complexity. Recently, Low Density Parity Check Codes (LDPC) have been included in standards for 3G wireless networks. But encoding complexity of LDPC is larger than that of TCC. Modified Turbo codes (MTC) are low...
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. We...
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...
The SNR values in conventional turbo decoding with the adaptive chase algorithm are pre-fixed, which is not practical in applications. To get rid of the deficiency, a novel decoding algorithm for block turbo codes was proposed, in which the channel levels of different SNR values were adaptively estimated. The proposed algorithm could tune the decoding complexity by using the relationship between the...
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.