We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Am...
Abstract--Frame detection and timing acquisition are challenging tasks in orthogonal frequency-division multiplexing systems plagued by narrowband interference (NBI). Most existing...
Luca Sanguinetti, Michele Morelli, H. Vincent Poor
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
The use of block transforms for coding intra-frames in video coding may preclude higher coding performance due to residual correlation across block boundaries and insufficient en...
— This paper introduces broadcasting relay nodes for orthogonal multiuser channels. The underlying idea is that a single relay node is shared by multiple source-destination pairs...