The Joint Video Team (JVT) of ISO/IEC MPEG and ITU-T VCEG are finalising a new standard for the coding (compression) of natural video images. The new standard [1] will be known as H.264 and also MPEG-4 Part 10, “Advanced Video Coding”. The standard specifies two types of entropy coding: Context-based Adaptive Binary Arithmetic Coding (CABAC) and Variable-Length Coding (VLC). The Variable-Length Coding scheme, part of the Baseline Profile of H.264, is described in this document.
标签： finalising standard Joint ITU-T
上传时间： 2013-12-21
上传用户：yuzsu
As the Hardware Description Language (HDL) enhancement activities have increased over the past year, so too has the complexity in determining which language(s) are the best tools for designers and organizations to continue using or to adopt. Many designers and organizations are contemplating whether they should switch from one HDL to another.
标签： Description enhancement activities the
上传时间： 2015-12-15
上传用户：sunjet
As the Hardware Description Language (HDL) enhancement activities have increased over the past year, so too has the complexity in determining which language(s) are the best tools for designers and organizations to continue using or to adopt. Many designers and organizations are contemplating whether they should switch from one HDL to another.
标签： Description enhancement activities the
上传时间： 2015-12-15
上传用户：SimonQQ
New users and old of optimization in MATLAB will find useful tips and tricks in this document, as well as examples one can use as templates for their own problems. Use this tool by editing the file optimtips.m, then execute blocks of code in cell mode from the editor, or best, publish the file to HTML. Copy and paste also works of course. Some readers may find this tool valuable if only for the function pleas - a partitioned least squares solver based on lsqnonlin. This is a work in progress, as I fully expect to add new topics as I think of them or as suggestions are made. Suggestions for topics I ve missed are welcome, as are corrections of my probable numerous errors. The topics currently covered are listed below
标签： optimization and document MATLAB
上传时间： 2015-12-24
上传用户：佳期如梦
#if !defined(AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_) #define AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_ #if _MSC_VER > 1000 #pragma once #endif // _MSC_VER > 1000 class CGAQueen { public: CGAQueen(int nPopulation,int nIteration,float Mutation,int mChBoard) virtual ~CGAQueen() void Clear() // to clear chess board with 0 value void InitialPopulation() // to create the first and initial randompopulation void FillArea(int index) // to fill chess board with desired chromosome int CostFunc(int index) // determine the cost of matrix[index][index] void PopulationSort() // to sort population from the best to the worst void GenerateCrossOverMatrix() // a way to create children from parent is CcrossOver void Mating() // to create children from parents void Ap
标签： AFX_GAQUEEN_H INCLUDED defined define
上传时间： 2015-12-27
上传用户：wuyuying
This paper examines the asymptotic (large sample) performance of a family of non-data aided feedforward (NDA FF) nonlinear least-squares (NLS) type carrier frequency estimators for burst-mode phase shift keying (PSK) modulations transmitted through AWGN and flat Ricean-fading channels. The asymptotic performance of these estimators is established in closed-form expression and compared with the modified Cram`er-Rao bound (MCRB). A best linear unbiased estimator (BLUE), which exhibits the lowest asymptotic variance within the family of NDA FF NLS-type estimators, is also proposed.
标签： performance asymptotic examines non-data
上传时间： 2015-12-30
上传用户：225588
Surface profile measurement by noncontact optical methods has been extensively studied because of its importance in automated manufacturing, component quality control, medicine, and robotics. In most of these methods a known periodic pattern,
标签： measurement extensively noncontact Surface
上传时间： 2016-01-02
上传用户：561596
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
Visual C++ Windows Shell Programming Welcome to Visual C++ Windows Shell Programming! With this book, you ll learn how to program the Windows Shell, customize its behavior and integrate your applications with it. You ll discover how to use and modify its features to best effect, and the way to call shell API functions whose documentation is scant. Programming the shell isn t difficult, but few books explain the subject in its entirety.
标签： Programming Windows Visual Shell
上传时间： 2014-11-27
上传用户：zhangjinzj
This the second tutorial of the Writing Device Drivers series. There seems to be a lot of interest in the topic, so this article will pick up where the first left off. The main focus of these articles will be to build up little by little the knowledge needed to write device drivers. In this article, we will be building on the same example source code used in part one. In this article, we will expand on that code to include Read functionality, Handle Input/Ouput Controls also known as IOCTLs, and learn a bit more about IRPs.
标签： the interest tutorial Drivers
上传时间： 2016-01-28
上传用户：lmeeworm
