期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
Huffman并行解码算法的改进与实现
1
作者 周艳娥 葛海波 林界 《微型机与应用》 2013年第11期84-86,共3页
为了提高Huffman解码的效率和实时性,采用并行处理技术和改进的Huffman并行解码算法,设计基于现场可编程门阵列FPGA的Huffman并行解码器。在不考虑Huffman编码长度的情况下,解码器通过插入流水线结构的方法将Huffman码流的码流头和信息... 为了提高Huffman解码的效率和实时性,采用并行处理技术和改进的Huffman并行解码算法,设计基于现场可编程门阵列FPGA的Huffman并行解码器。在不考虑Huffman编码长度的情况下,解码器通过插入流水线结构的方法将Huffman码流的码流头和信息码流分开,同时进行解码。硬件仿真结果表明,在一个时钟节拍内解码器处理的数据位数与解码效率成正比,位数越多,实时性越好。 展开更多
关键词 Huffman解 并行解 码流头 水线结构
下载PDF
Huffman并行解码结构及硬件实现 被引量:2
2
作者 方婵婵 叶兵 吴彪 《合肥工业大学学报(自然科学版)》 CAS CSCD 北大核心 2007年第7期854-858,共5页
介绍了一种应用在JPEG解码器下采用并行方式实现的Huffman解码方式,这种结构的解码器把Huffman的头码流分析和解码分开工作,可以在同一时间进行解码;这种方式通过增加流水线和结构的复杂性对硬件资源的占用,来获得对码流解码的高吞吐量... 介绍了一种应用在JPEG解码器下采用并行方式实现的Huffman解码方式,这种结构的解码器把Huffman的头码流分析和解码分开工作,可以在同一时间进行解码;这种方式通过增加流水线和结构的复杂性对硬件资源的占用,来获得对码流解码的高吞吐量;它不同于传统的串行结构,将码流逐位地输入解码器中,然后解码器又通过逐位地匹配实现码流的解码。 展开更多
关键词 可变长 分析 并行解
下载PDF
Modeling of container terminal logistics system based on multi-agent
3
作者 李斌 李文锋 +1 位作者 张煜 张敏 《Journal of Southeast University(English Edition)》 EI CAS 2007年第S1期146-150,共5页
The similarities and differences between the container terminal logistics system(CTLS)and the Harvard-architecture computer system are compared in terms of organization and architecture.The mapping relation and the mo... The similarities and differences between the container terminal logistics system(CTLS)and the Harvard-architecture computer system are compared in terms of organization and architecture.The mapping relation and the modeling framework of the CTLS are presented based on multi-agent,and the successful algorithms in the computer domain are applied to the modeling framework,such as the dynamic priority and multilevel feedback scheduling algorithm.In addition,a model and simulation on a certain quay at Shanghai harbor is built up on the AnyLogic platform to support the decision-making of terminal on service cost.It validates the feasibility and creditability of the above systematic methodology. 展开更多
关键词 container terminal logistics system Harvard architecture multi-agent system SCHEDULING
下载PDF
Assessment of Investment Risk in Greek Short Sea Shipping: A Ro-Ro Passenger Ferry Case
4
作者 Dimitrios V. Lyridis Panayotis G. Zacharioudakis 《Journal of Shipping and Ocean Engineering》 2012年第1期36-44,共9页
The purpose of this paper is to introduce an innovative methodology in shipping investment evaluation based on simulation of a project cash flow. It concerns a complementary approach to current practices and its aim i... The purpose of this paper is to introduce an innovative methodology in shipping investment evaluation based on simulation of a project cash flow. It concerns a complementary approach to current practices and its aim is to provide more information mainly to ship-owners that consider the feasibility of deploying Ro-Ro Passenger ferries. The paper examines a typical semi-conventional RoPax ferry operating in the Aegean Sea. It addresses important economic, operational and procedural issues concerning risk evaluation. The current status is that risk is a notion still strange to main stakeholders. The Greek practice in performing a feasibility study for a project draws on investor's experience and feeling aided by a preliminary economic study. The main thesis of this paper is that there are alternative techniques to evaluate investment risk and measure profitability of a project. A Monte Carlo simulation in collaboration with a typical Ro-Ro cash-flow model is implemented to reveal the extent of risk and provide a useful tool for the assessment of future investments in Greek Short Sea Shipping. 展开更多
关键词 Greek Short Sea Shipping investment risk passenger ferries Ro-Ro feasibility study.
下载PDF
FCSR PERIODIC MULTISEQUENCES WITH MAXIMAL JOINT N-ADIC COMPLEXITY AND LARGE k-ERROR JOINT N-ADIC COMPLEXITY OVER Z/(N)
5
作者 LI Fulin HU Honggang ZHU Shixin 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2014年第2期370-381,共12页
Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic m... Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z/(N), and establishes the existence of periodic N-adic multisequences over Z/(N) which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multisequences over Z/(N) with maximal joint N-adic complexity logN(NT- 1)have a k-error joint N-adic complexity close to logN(NT- 1). 展开更多
关键词 Cryptography N-adic numbers joint N-adie complexity k-error joint N-adic complexity stream cipher.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部