Capacity bounds for diamond networks with an orthogonal broadcast channel
SS Bidokhti, G Kramer - IEEE Transactions on Information …, 2016 - ieeexplore.ieee.org
A class of diamond networks is studied where the broadcast component is orthogonal and
modeled by two independent bit-pipes. New upper and lower bounds on the capacity are …
modeled by two independent bit-pipes. New upper and lower bounds on the capacity are …
An upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity
In this paper, we study upper bounds on the sum capacity of the downlink multicell
processing model with finite backhaul capacity for the simple case of 2 base stations and 2 …
processing model with finite backhaul capacity for the simple case of 2 base stations and 2 …
Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl–Cocke–Jelinek–Raviv algorithm
IMM de Souza, M Alcoforado, VC da Rocha - Telecommunication Systems, 2018 - Springer
The main goal in this paper is an investigation of the Bahl–Cocke–Jelinek–Raviv (BCJR)
algorithm applied in a turbo decoding scheme. Binary product codes are employed in a …
algorithm applied in a turbo decoding scheme. Binary product codes are employed in a …