G. Battail, C. Berrou and A. Glavieux, "Pseudo-Random Recursive Convolutional Coding for Near-Capacity Performance", Proceedings of IEEE GLOBECOM, Communication Theory Mini-Conference, pp. 23-7, Nov. 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....produce an infinite weight output sequence, with the exception of the the sequences u(D) which are a multiple of the feedback polynomial B(D) Note that this only includes a fraction 2 Gamman of all the possible input sequences. Furthermore, the degree of u(D) must be at least that of B(D) [16]. 2.3 Turbo Code Encoder The traditional Turbo Code encoder is built by concatenating two RSC encoders with an interleaver in between. Usually the systematic output of the second RSC encoder is omitted to increase the code rate. Figure 2.4 shows the Turbo Code encoder used in [1, 3] Due to the ....

G. Battail, C. Berrou and A. Glavieux, "Pseudo-Random Recursive Convolutional Coding for Near-Capacity Performance", Proceedings of IEEE GLOBECOM, Communication Theory Mini-Conference, pp. 23-7, Nov. 1993.

....lead to the optimization of the PCC for given system constraints such as delay or complexity. Question 3, in turn, is related to the importance of the interleaver optimization, a topic which has already received some cut and try attentions [17, 19, 18] Finally, question 4 has been discussed in [20] where the authors seem to believe that recursive convolutional codes have superior merits in themselves, rather than only when used as CC of a PCC. Formidable complexity obstacles discourage classical theoretical analyses of the PCCs. As an example, the code implemented in VLSI in [7] when ....

....required; however, it simplifies the decoder and has no effects on obtainable performance, so that we will limit ourselves to them. 6 Actually, this simple case is one of the very few where we can find two equivalent codes, one SR and the other SNR, with the same number of states. 7 In [20] the authors claim that RS convolutional encoders yield significantly lower error probabilities than SNR codes, even when they have the same transfer function, the key fact being the inapplicability of the Viterbi algorithm for decoding and of the transfer function bound for performance ....

G'erard Battail, Claude Berrou, and Alain Glavieux. "Pseudo-Random Recursive Convolutional Coding for Near-Capacity Performance ". In Proceedings of GLOBECOM '93, Communication Theory Mini-Conference, Houston, Texas, December 1993.

No context found.

G. Battail, C. Berrou and A. Glavieux, "Pseudo-Random Recursive Convolutional Coding for Near-Capacity Performance", Proceedings of the Comm. Theory MiniConference, Globecom '93, Houston, Texas, pp. 23--27, December 1993.

No context found.

G. Battail, C. Berrou and A. Glavieux, "Pseudo-Random Recursive Convolutional Coding for Near-Capacity Performance", Proceedings of the Comm. Theory Mini-Conference, Globecom '93, Houston, Texas, pp. 23--27, December 1993.

No context found.

G. Battail, C. Berrou, and A. Glavieux, "Pseudo-random recursive convolutional coding for near-capacity performance," in Proceedings of GLOBECOM'93, 1993.

No context found.

G. Battail, C. Berrou and A. Glavieux, "Pseudo--random recursive convolutional coding for near capacity performance," GLOBECOM 1993, Houston, Texas, USA, pp. 23--27, Dec. 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC