CDMA寻呼信道负荷的计算(上)

首先分析了寻呼信道的特性和帧结构；然后通过分析寻呼信道发送的各种消息的内容，对每个内容的长度进行了计算，并得出了每种消息相对于寻呼信道总容量的寻呼信道占用率；最后给出了在一定假设条件下，一个寻呼区域中BHCA值和寻呼信道负荷的关系。     

长短信传递对CDMA信道调度工作的影响

在CDMA系统中,寻呼信道承载短信业务,单个消息体包含信息量的大小对寻呼信道的调度工作有一定影响。通过对寻呼信道的负荷计算和分析短信业务在寻呼信道上发送机制2个方面来阐述信道负荷与短信业务的发送之间的关系,从中找到短信业务发送的最佳长度与寻呼信道负荷之间的结合点,确定短信业务的单个消息体在寻呼信道上传送时的最佳信息量。     

寻呼信道负荷过高的问题研究

寻呼信道的高负荷已成为阻碍中国电信cDMA网络长远发展的因素之一,如何降低CDMA网络的寻呼信道负荷是中国电信网络优化的重要研究课题。文章主要研究了阿尔卡特朗讯CDMA网络中开销消息所产生的寻呼信道负荷,并以阿尔卡特朗讯业务区某大型城市为例,就如何降低寻呼信道负荷提出了几点建议。     

CDMA系统中寻呼信道的负荷及优化分析

寻呼信道不仅能够传送系统的寻呼消息,而且还能够传输系统消息并进行鉴权登记等,因此寻呼信道的性能对整个网络性能指标的提高起了极其重要的作用。文中针对寻呼信道中通用寻呼消息,开销消息,短消息等随着话务量的变化对寻呼信道容量产生的影响做出了分析,并进一步提出了优化意见。     

LTE网络下的寻呼消息及其监听算法

介绍了LTE网络下寻呼消息的用途以及用于承载寻呼消息的逻辑信道、传输信道和物理信道之间的映射关系,同时对其寻呼周期的非连续监听算法做了详细的分析。     

CDMA无线系统中的寻呼信道负荷与短消息承载之间的关系探讨

从寻呼信道的负荷计算和短信业务在寻呼信道上发送机制两个方面来阐述信道负荷与短信业务发送之间的关系;并以石家庄系统为例计算寻呼信道负荷,分析了短消息在寻呼信道上的发送算法。     

解决基站丢失寻呼消息的措施

经过对南宁基站丢失寻呼消息相关话务统计数据分析,阐述立即指派对寻呼的影响,以及通过试验修改MFRMS（寻呼复帧）参数确定减小MFRMS可以较大幅度的降低基站丢失寻呼消息的风险,最后指出了必须采取开源节流等优化措施才能从根本上解决CCCH（公共控制信道）拥塞问题,最终解决基站丢失寻呼消息问题。     

CS寻呼优先发送功能的实现

目前网络模式下,CS业务与PS业务都使用相同的公共控制信道（CCCH）来发送寻呼和信道的立即指派消息,在数据业务非常集中区域,就会出现由于PS业务的大量使用造成CCCH信道资源不足,导致CS寻呼拥塞,本文通过分析CCCH信道的结构和原理,引申出CS优先发送功能的实现机制,通过网络实验分析证明该功能对于解决CS寻呼拥塞起到重要作用。     

多径衰落信道下LDPC码初始译码消息研究

LDPC码初始译码消息是LDPC码密度演进研究的必要条件。本文简述了LDPC码的相关基础知识．重点研究了Rician衰落信道及Rayleigh信道下LDPC码的初始译码消息的概率密度．给出了译码消息的对称性和稳定性的表达，探讨了BP和BP_based两种译码方法的初始消息的概率密度形式，对于不同信道参数和译码算法下的初始消息的概率聚集函数（PMF：Probability Mass Function）进行了比较。     

高速寻呼的发展魅力

FLEX高速寻呼编码格式是由美国摩托罗拉公司于一九九三年在美国华盛顿举行的《寻呼未来》会议上首次向寻呼界推出的一种崭新的高速寻呼编码格式。FLEX编码具有编码速率高；信道用户客量大，支持全国乃至全球寻呼联网；抗干扰性强；寻呼机电池寿命长；兼客现有寻呼编码格式；支持综合信息服务等突出特点，并为寻呼新业务的发展，奠定了技术基础。     

Effective paging procedure for the optical feeder microcellular system

The paper considers a paging problem in the optical feeder microcellular system where group simulcasting and dynamic channel allocation technologies are incorporated. The objective is to propose an effective paging procedure whose performance is measured in terms of paging load, average paging delay, and paging success probability. In the paging procedure, paging signals are transmitted via group simulcasting, for which the control channel is allocated dynamically. The performance of the procedure is analyzed in an approximate queueing network model. The proposed procedure is then compared in performance with a simulation approach, from which the procedure is found to outperform any previous methods in the literature.     

Internet寻呼业务应用前景可观

随着Ｉｎｔｅｒｎｅｔ网络技术的发展,Ｉｎｔｅｒｎｅｔ用户和寻呼业务用户日益增多,Ｉｎｔｅｒｎｅｔ寻呼业务应运而生,Ｉｎｔｅｒｎｅｔ寻呼业务按使用方法可分为万维网寻呼和电子邮件寻呼两大类,目前提供电子邮件寻呼业务的公司较多。     

EV-DO Rev A快速寻呼接入研究

DO Rev A在前向链路采用多种包传输格式、子同步控制信道（SSCC）、动态寻呼周期等关键技术实现了前向快速寻呼;在反向链路采用高速接入信道、短接入包前导等关键技术实现了反向快速接入,从而改善了对时延敏感业务的支持。DO Rev A通过DOS协议实现了在控制信道和接入信道传送用户数据,从而支持PTT业务。本文介绍了DO Rev A上述关键技术,并分析它们对用户接入和寻呼的性能影响。     

Trade‐off analysis of forward link capacity in IS‐95‐based CDMA cellular systems

This paper provides an analytic method to determine how many paging channels can be simultaneously used with traffic channels in the same CDMA forward link. So far, since one or two paging channels are enough to convey control messages from bases to mobiles, little considerations have been given to the paging channel configuration. CDMA network operators, however, recently plan to provide optional services which highly utilize the paging channel. Thus, more paging channels are required for the latest situation. Since the total number of channels that can be used in the forward link is limited by the interfering cellular environments, less traffic channels should be used if additional paging channels are required. It is the objective of this paper to examine the capacity of forward link in terms of paging and traffic channels so as to determine the impact of introducing value‐added services via paging channels. Different capacity regions are presented for various cellular environments. This revised version was published online in August 2006 with corrections to the Cover Date.     

An improved hashing function for IS-2000 quick paging channel

Both mathematically and numerically, we prove that the hashing equation used to determine the second paging indicator bit of IS-2000 quick paging channel is not optimal. A new hashing equation is proposed that is more uniformly random, and thus improves the efficiency of the quick paging channel     

Trellis codes for periodic erasures

This paper describes techniques for the design and analysis of trellis codes that provide reliable communication over every channel in a specified set of possible channels, where each channel is characterized by additive white Gaussian noise with a distinct periodic variation in signal-to-noise ratio. An important practical application for such trellis codes is the periodic erasure channel produced by partial-band interference dispersed by a block interleaver. We present trellis codes that provide reliable communication over all periodic erasure patterns of a given period for which the number of unerased coded bits per period is at least equal to the number of information bits per period