Turbo coding in the Slepian-Wolf and multi-access channel problems: issues of duality

Author(s):  
J. Bajcsy ◽  
Bo Xu ◽  
P. Mitran ◽  
C. Beainy
1986 ◽  
Vol 18 (02) ◽  
pp. 441-472 ◽  
Author(s):  
Guy Fayolle ◽  
Philippe Flajolet ◽  
Micha Hofri

We analyse a stack protocol of the Capetanakis–Tsybakov–Mikhailov type for resolving collisions in a random multiple-access channel. We obtain a functional equation for the generating function of the expected collision resolution interval (CRI) durations, which is non-local with a non-commutative iteration semigroup. Using Mellin transform techniques and geometric properties of the iteration semigroup we show that for arrival rates smaller than a fixed threshold, the mean CRI duration for n initial colliders is asymptotically proportional to n. Ergodicity conditions are also demonstrated.


1986 ◽  
Vol 18 (2) ◽  
pp. 441-472 ◽  
Author(s):  
Guy Fayolle ◽  
Philippe Flajolet ◽  
Micha Hofri

We analyse a stack protocol of the Capetanakis–Tsybakov–Mikhailov type for resolving collisions in a random multiple-access channel. We obtain a functional equation for the generating function of the expected collision resolution interval (CRI) durations, which is non-local with a non-commutative iteration semigroup. Using Mellin transform techniques and geometric properties of the iteration semigroup we show that for arrival rates smaller than a fixed threshold, the mean CRI duration for n initial colliders is asymptotically proportional to n. Ergodicity conditions are also demonstrated.


2009 ◽  
Vol E92-B (11) ◽  
pp. 3470-3477 ◽  
Author(s):  
Suhua TANG ◽  
Jun CHENG ◽  
Chen SUN ◽  
Ryu MIURA ◽  
Sadao OBANA

Sign in / Sign up

Export Citation Format

Share Document