| 1. |
|
|
| 2. |
- Anderson, John B, et al.
(författare)
-
New Trellis source codes based on linear congruential recursions
- 2003
-
Ingår i: Proc., 2003 IEEE International Symposium on Information Theory, Yokohama. - 0780377281 ; , s. 170-170
-
Konferensbidrag (refereegranskat)abstract
- We evaluate a new class of rate-distortion codes based on simple linear congruential recursions. Codes are demonstrated for the uniform and Gaussian sources, whose performance exceeds that so far reported in the literature, including that reported for TCQ codes. The results also point to a new correlation relationship that apparently must exist for trellis codes.
|
|
| 3. |
|
|
| 4. |
- Bokolamulla, Dhammika, 1973, et al.
(författare)
-
Low-Complexity Iterative Detection Based on Bi-Directional Trellis Search
- 2003
-
Ingår i: Proccedings. IEEE International Symposium on Information Theory, Yokohama, 29 June-4 July 2003. - 0780377281 ; , s. 396-
-
Konferensbidrag (refereegranskat)abstract
- A new algorithm to reduce the computational complexityof iterative decoding is proposed. The algorithm carries out a bi-directional trellis search in a relatively smaller trellis (compared with the full-complexity trellis structure) to find two sets of sequences: the forward sequence set and the backward sequence set. The soft information is generated by considering a window of W trellis sections and the forward and the backward sequences entering it. To assess the performance, numericalresults for serially concatenated convolutional codes, transmitted over an intersymbol interference channel, disturbed by additive white gaussian noise are presented. The simulation results show that for the considered system, the algorithm can obtain bit error rate performances close to that of full-complexity iterativedecoding with much lower complexity.
|
|
| 5. |
- Brännström, Fredrik, 1974, et al.
(författare)
-
Optimal scheduling for iterative decoding
- 2003
-
Ingår i: IEEE International Symposium on Information Theory (ISIT '03), Yokohama, Japan, June/July 2003. - 0780377281 ; , s. 350-
-
Konferensbidrag (refereegranskat)abstract
- We propose an algorithm for findingthe optimal decoder activation order in a system withmore than two concatenated codes. Optimality is de-fined as the order that yields convergence using thelowest computational complexity, guided by the extrinsicinformation transfer (EXIT) charts of the componentcodes. We also describe how the convergencethreshold for the system can be visualized by combiningseveral multi-dimensional EXIT charts into onetwo-dimensional EXIT chart.
|
|
| 6. |
- Giese, Jochen, et al.
(författare)
-
Space-time constellations for unknown frequency-selective channels
- 2003
-
Ingår i: 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, NEW FRONTIERS IN TELECOMMUNICATIONS. - NEW YORK : IEEE. - 0780377281 ; , s. 2583-2587
-
Konferensbidrag (refereegranskat)abstract
- We consider the design of space-time constellations for communication over frequency-selective fading channels where neither the transmitter nor the receiver has any channel state information. The design is based on the asymptotic union bound on error probability as design criterion and the optimization is carried out using a gradient search algorithm. Full multi-antenna multi-path diversity gains are demonstrated to be achieved by the designed codes. Compared to other constellations proposed by Hochwald et al., power savings of up to 2 dB are shown to be possible.
|
|
| 7. |
|
|
| 8. |
- Höst, Stefan, et al.
(författare)
-
On coded OFDM over frequency selective channels using woven convolutional codes
- 2003
-
Ingår i: Proceedings 2003 IEEE International Symposium on Information Theory. ISIT 2003 (Cat. No.03CH37432). - 0780377281 ; , s. 36-36
-
Konferensbidrag (refereegranskat)abstract
- A communication system with woven convolutional codes and OFDM is considered. With coherent reception and iterative decoding this combination seems promising over frequency selective channels. The robustness of the considered class of schemes is illustrated by simulation results for specific fixed channel transfer functions and AWGN
|
|
| 9. |
- Johansson, Thomas, et al.
(författare)
-
A linear distinguishing attack on Scream
- 2003
-
Ingår i: Proceedings 2003 IEEE International Symposium on Information Theory. ISIT 2003 (Cat. No.03CH37432). - 0780377281 ; , s. 164-164
-
Konferensbidrag (refereegranskat)abstract
- A linear distinguishing attack on the for stream cipher Scream is proposed. The attack uses approximately 2100 output words and has complexity of a similar size
|
|
| 10. |
- Pavlushkov, Victor, et al.
(författare)
-
On the burst error detecting and erasure correcting capabilities of convolutional codes
- 2003
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. - 0780377281 ; , s. 422-422
-
Konferensbidrag (refereegranskat)abstract
- In this paper it is shown how a convolutional code can be used either to detect errors or to correct erasures. The erasure correction is related to the error detection. Using the active burst distance lower bounds on the error and erasure correction as well as error detection are obtained for convolutional codes.
|
|
