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.
Polar code was proposed by Erdal Arikan as an incentive idea splitting input channels to increase its transition performance. The proposed code that is related to the recursive construction of Reed-Muller codes on the basis of 2-order square matrix G2, can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels. It has already been mentioned that in principle larger matrices...
We consider the iterative decoding of the Turbo-LDPC and Polar code. By using iterative decoding algorithm, we can get good performance and of new research programs. Turbo codes were introduced by Berrou. Polar codes were proposed by Arikan which can achieve the capacity of arbitrary symmetric binary-input channels. LDPC codes could be decoded in a similar manner to Turbo codes and polar codes, and...
In this paper, a new approach to construct LDMC codes is introduced. The new codes can be encoded efficiently at the transmitter side and support both of the inner-iterations and outer-iterations at the receiver side. Furthermore they can achieve the design rates and perform very well over MIMO channels.
In this paper, a simple cooperative diversity scheme in M + 2 relay network with low-density parity-check (LDPC) codes is proposed. By allocating random interleavers to each relay node, the interleaved sequences provide M copies of received vector to achieve the cooperative diversity. An efficiently iterative coding algorithm is proposed with low complexity. The complexity involved grows linearly...
In order to reduce the computation complexity in flops for multiple symbol differential unitary space-time modulation systems, this paper presents a new algorithm called M-BID algorithm. This algorithm uses the BID to search the best part branches firstly, and then computes their decision metrics to each retained node in the M algorithm that differs from the M algorithm which need compute decision...
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.