Optimized HEVC encoding with complexity constraints

2016 ◽  
Author(s):  
Meiyuan Fang ◽  
Jiangtao Wen
Keyword(s):  
Complexity Constraints

Research on China Imaging Altimeter Planning Problem for Area Target Observation

2014 ◽  
Vol 667 ◽  
pp. 230-236
Author(s):  
Ya Mei Liu ◽  
Cong Min Lv ◽  
Hong Fei Wang
Keyword(s):  
Mathematical Model ◽  
Greedy Algorithm ◽  
Calculation Method ◽  
Constraint Propagation ◽  
Mission Planning ◽  
Planning Problem ◽  
Target Coverage ◽  
Propagation Algorithm ◽  
Complexity Constraints ◽  
Observation Period

The China Imaging Altimeter (CIALT) mission planning problem has complexity constraints. Overlap observation play a role in area target observation. Based on the analysis, the space gird was constructed. A calculation method for coverage percentage based on grid space statistic is proposed. A mathematical model of mission planning is established. A solving method combines constraint propagation algorithm and greedy algorithm is proposed. An area target mission with one month’s observation period was planned. The results showed that the method realized the goal that maximizing area target coverage in the shortest possible time and form the unique planning results at same observation requirements. It is applicable to CIALT area target observation planning.

Design and Implementation of a Low-Complexity Multiuser Vector Precoder

2012 ◽  
Vol 3 (1) ◽  
pp. 31-48 ◽  
Author(s):  
Maitane Barrenechea ◽  
Luis Barbero ◽  
Mikel Mendicute ◽  
John S. Thompson
Keyword(s):  
Mimo Systems ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Performance Loss ◽  
Dirty Paper Coding ◽  
Multiple Input ◽  
Input Multiple Output ◽  
The Cost ◽  
Complexity Constraints ◽  
Novel Design

Precoding techniques are used in the downlink of multiuser multiple-input multiple-output (MIMO) systems in order to separate the information data streams aimed at scattered user terminals. Vector precoding (VP) is one of the most promising non-linear precoding schemes, which achieves a performance close to the optimum albeit impractical dirty paper coding (DPC) with a feasible complexity. This contribution presents a novel design for the hardware implementation of a high-throughput vector precoder based on the Fixed Sphere Encoder (FSE) algorithm. The proposed fixed-complexity scheme greatly reduces the complexity of the most intricate part of VP, namely the search for the perturbing signal in an infinite lattice. Additionally, an optimized reduced-complexity implementation is presented which considerably reduces the resource usage at the cost of a small performance loss. Provided simulation results show the better performance of the proposed vector precoder in comparison to other fixed-complexity approaches, such as the K-Best precoder, under similar complexity constraints.

Sign in / Sign up

Export Citation Format

Share Document