Integer-Forcing Linear Receiver Design with Slowest Descent Method
نویسندگان
چکیده
منابع مشابه
Solving Integer and Mixed Integer Linear Problems with ABS Method
Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory’s cuts) to narrow down the solution to the optimal integer solution. The ABS class of alg...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملThe IntSat Method for Integer Linear Programming
Conflict-Driven Clause-Learning (CDCL) SAT solvers can automatically solve very large real-world problems. To go beyond, and in particular in order to solve and optimize problems involving linear arithmetic constraints, here we introduce IntSat, a generalization of CDCL to Integer Linear Programming (ILP). Our simple 1400-line C++ prototype IntSat implementation already shows some competitivene...
متن کاملLinear Daes with Nonsmooth Forcing
State transfer functions are derived for linear time invariant differential-algebraic equations of arbitrary index subject to insufficient smoothness in the forcing functions. As a result, it is demonstrated that the problem of reinitialization after discontinuities is always fully and uniquely determined. Algorithmic implementations and extensions to the linear time varying and nonlinear cases...
متن کاملA Design of Near Perfect Reconstruction Linear-Phase QMF Banks Based on Hybrid Steepest Descent Method
In this paper, we propose a projection based design of near perfect reconstruction QMF banks. An advantage of this method is that additional design specifications are easily implemented by defining new convex sets. To apply convex projection technique, the main difficulty is how to approximate the design specifications by some closed convex sets. In this paper, introducing a notion of Magnitude...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2013
ISSN: 1536-1276
DOI: 10.1109/tcomm.2013.050613.120835