Browsing by Subject "Computational complexity"
Now showing items 1-5 of 5
-
Fast and efficient circuit topologies for finding the maximum of n k-bit numbers
(IEEE, 2014-08-01)Finding the value and/or index of the maximum (or minimum) element of a set of n numbers (each with k-bits) is a fundamental arithmetic operation and is needed in many applications. This paper proposes several maximum-finder ... -
A fast circuit topology for finding the maximum of n k-bit numbers
(IEEE, 2013)Finding the value and/or address (position) of the maximum element of a set of binary numbers is a fundamental arithmetic operation. Numerous systems, which are used in different application areas, require fast (low-latency) ... -
Fast-decodable MIMO HARQ systems
(IEEE, 2015-05)This paper presents a comprehensive study on the problem of decoding complexity in a Multi-Input Multi-Output (MIMO) Hybrid Automatic Repeat reQuest (HARQ) system based on Space-Time Block Codes (STBCs). We show that there ... -
Low-complexity interference reduction for gfdm systems using corrective coefficients
(IEEE, 2022)Generalized Frequency Division Multiplexing (GFDM) is a promising multi-carrier modulation scheme for next-generation wireless communication systems. GFDM uses a non-orthogonal pulse shape, which leads to self-interference ... -
Two classes of quadratic assignment problems that are solvable as linear assignment problems
(Elsevier, 2011-08)The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...
Share this page