H.323协议栈中ASN.1模块的设计与实现

对ASN．1及PER编码规则作了简要介绍，接着提出了一种ASN．1编解码模块在H．323协议栈中的设计与实现的方案。     

基于BER的ASN．1编解码原理与设计实现

本文介绍了ASN．1和BER基本编码规则，分析了7号信令协议栈的TCAP层消息结构和ASN．1之间的关系，详细介绍了应用于信令中继系统中的ASN．1编解码模块的设计和实现。     

LTE协议栈中ASN.1模块的设计与实现

开发长期演进(LTE)协议必须实现针对无线资源控制(RRC)消息的ASN.1编解码模块,但传统的ASN.1编解码方案函数调用频繁,编码效率较低。为此,分析LTE协议栈的软件需求,提出一种ASN.1编解码模块设计与实现方案。该方案采用模块化设计,从而简化函数调用、提高编码效率。在TD-LTE无线综合测试仪的协议栈软件中实现并进行测试,结果表明,该方案可实现对RRC消息的编解码。     

基于面向对象方法的XER编解码的设计与实现

ASN．1作为多种协议在表示层的抽象语法记法，应用在多媒体通信、协议测试等领域，可扩展标记语言XML是一种新的Web开发语言，在Internet／Intranet上发挥着日益重要的作用。文章分析研究了ASN．1最新标准X．693中XER编解码原理，利用面向对象的方法对其进行了实现，通过开发C 类库实现了ASN．1与XML的数据映射。     

数据编码、解码的Java实现

描述了基于SNMP协议的常用数据类型的种类及特性，按照ASN．1语法对MIB（管理信息库）中被管对象编码、解码的基本规则，用Java语言给予了实现。     

简单网络管理协议分析仪的设计与实现

文章介绍了简单网络管理协议(Simple Network Management Protocol,SNMP)以及该协议分析仪的设计与实现过程。该协议分析仪采用ASN．1语法的基本编码规则对SNMP报文进行编码,通过对该编码信息的扩充设计完成了对SNMP报文的分段与解析功能。     

IP电话中ASN.1 PER编解码模块实现机制的研究

IP电话对ASN.1编解码模块的要求,提出一种优良的ASN.1PER编解码模块的实现机制,并分析其性能。     

ASN.1及其PER编码在视频会议系统中的应用研究

抽象语法表符号1（ASN.1）在多媒体网络通信中起着非常重要的作用.ASN.1被用于描述基于H.323协议的视频会议系统的信令消息.介绍了ASN.1的基本概念、数据类型和数据表示方法,详细分析了ASN.1在网络传输编码中使用的分组编码规则（PER）,并结合H.323协议中所常用的数据类型举例说明了其信令消息的PER编码过程.     

网络电话中ASN.1编解码器的实现研究

简要介绍了抽象语法标记语言ASN.1,以及BER和PER编码规则,阐述了网络电话中H.323协议栈的ASN.1编解码器的设计与实现。     

DSRC协议ASN.1模块的设计与实现

通过研究专用短程通信（DSRC）协议栈中的应用层部分,针对其中的ASN.1 PER编解码模块,设计并实现了一种编解码框架,框架包括ASN.1映射规则、通用编解码流程以及符合小设备应用的内存管理机制。良好的模块划分使得此框架具有较好的通用性。测试结果表明,此实现框架具有良好的性能,满足协议的实时性要求。     

优化TLV编码规则

抽象语法标记ASN．1是一种ISO／ITU-T标准,描述了一种对数据进行表示、编码、传输和解码的数据格式。ISO协议体系中的应用层协议使用了ASN．1来描述它们所传输的协议数据单元。ASN．1取得成功的一个主要原因是它与几个标准化编码规则（如基本编码规则BER）相关。TLV编码是指先对Tag编码,再对Length编码,最后对Value编码。BER编码确定的编码方式就是这样的。在实际的通信中,通常特定类型编码中数据的长度是已知的,在数据字典中有明确的标识。提出了一种优化TLV编码的方法,使用一个比特的标志位,将长度字段作为编码中一个可选择的项目,而不是必须存在的项目,以此来缩短TLV编码的长度。在满足需求的前提下,优化后的TLV编码可以大幅度地提高数据传输效率。     

Extending EASE with new ASN.1 encoding rules

EASE (R. Lai, A. Lo, EASE: a software environment for automatic implementation of application protocol, Software—Practice and Experience, 26(1) (1996) 83–103) is a software tool that integrates Estelle and ASN.1 (Abstract Syntax Notation One) specifications to produce an integrated specification for application layer protocol, from which an automatic implementation can be generated. EASE, though a new tool, is already outdated because of the recent changes, including new syntaxes, and additions of encoding rules, to the 1994 ASN.1 standard. Building a complete compiler that supports the full ASN.1:94 standard is a huge task; many researchers and developers only implement a subset of the standard that meets their requirements, while others use tools for building certain stages of such a compiler. For EASE to keep in line with the 1994 standard, it is a big task and requires a major rewrite; the only two encoding rules that could be added to EASE without implementing the full 1994 ASN.1 syntaxes are the canonical encoding rules (CER) and the distinguished encoding rules (DER). This paper describes how EASE has been extended to include these new rules, and aims to provide researchers and developers with the lessons learned from this work, and with some pointers to developing an ASN.1 compiler that complies with the 1994 standard.     

Integrated Estelle and ASN.1 specification approach to automatic implementation of application protocol

Estelle currently does not support ASN.1 and encoding and decoding rules. Tools developed for Estelle and ASN.1 have been developed independently of each other. As such, ASN.1 tools do not support Estelle and vice versa. At present, due to these two separate specifications, implementation is time consuming. It is imperative to find a way for ASN.1 and Estelle specifications to be efficiently integrated to facilitate fully automatic implementation. This paper describes how Estelle and ASN.1 can be integrated to give a unified specification which can then be fed into a software environment to produce a truly automatic implementation of an application protocol, including encoding and decoding of protocol data units, when application layer protocols are specified in Estelle and in ASN.1. The integration approach is based on the powerful programming concept, Data Abstraction. The software that implements this integrated specification approach to automatic implementation of application protocol is called EASE (Estelle and ASN.1 Software Environment). To demonstrate the viability of the approach, the unified specification of the ISO ACSE and Presentation protocols are also presented.     

The design and implementation of an ASN.1-C compiler

Abstract syntax notation one (ASN.1) has been widely used in international standard specification: its transfer-syntax, the basic encoding rules (BER), is used as the external data representation. A BER implementation called the ED library is presented. The ED library includes a number of encoding and decoding routines that may be used as primitive functions to compose encoders and decoders for arbitrarily complicated ASN.1 data types. Based on the ED library an ASN.1-C compiler, called CASN1, is designed and implemented to free the protocol implementers from the arduous work of translating protocol-defined data-types and constructing their encoders and decoders. Given an ASN.1 protocol specification, CASN1 automatically translates the input ASN.1 modules into C and generates the BER encoders and decoders for the protocol defined data-types. The CASN1 design principles, user interface, and some example applications are discussed. The performance of the ED library and generated CASN1 code is also measured and discussed     

OSI／MMS系统中ASN.1编／解码器的设计与实现

ＡＳＮ．１是一种标准的抽象语法定义描述语言，它提供了定义复杂数据类型以及确定这些数据类型值的方法，许多ＯＳＩ应用协议标准都采用ＡＳＮ．１作为数据结构定义描述工具，尤其用来定义各各应用协议数据单元的结构。本文首先介绍ＡＳＮ．１数据类型和基本编码规则，接着详细讨论ＭＭＳ通信系统中ＡＳＮ．１编／解码器的设计与实现，此编／解码器用于ＭＭＳ协议数据单元的ＡＳＮ．１抽象语法和传送语法之间的转换，以实现ＭＭＳ在     

基于BER的ASN.1语法编译器及编解码器实现与应用

介绍了ASN.1标记语言和BER基本编码规则。结合其在移动通信国际漫游话单中的应用场景,详细介绍了应用于移动通信国际漫游话单处理系统中的ASN.1语法编译器和BER编解码模块的设计与实现。     

Homogenous spiking neural P systems with anti-spikes

Spiking neural P systems with anti-spikes (ASN P systems, for short) are a class of neural-like computing models in membrane computing, which are inspired by neurons communication through both excitatory and inhibitory impulses (spikes). In this work, we consider a restricted variant of ASN P systems, called homogeneous ASN P systems, where any neuron has the same set of spiking and forgetting rules. As a result, we prove that such systems can achieve Turing completeness. Specifically, it is proved that two categories of pure form of spiking rules (for a spiking rule, if the language corresponding to the regular expression that controls its application is exactly the form of spikes consumed by the rule, then the rule is called pure) are sufficient to compute and accept the family of sets of Turing computable natural numbers.