Elliptic Search of Self  Healing  Restoration on ATM Networks

Li Shiju  Mei Liubo  Dai Wenqi

您当前的位置：

首页 >

文章列表页 >

Elliptic Search of Self Healing Restoration on ATM Networks

更新时间：2024-10-14

- Elliptic Search of Self Healing Restoration on ATM Networks
- Issue 12, (1998)
- 作者机构：
  
  北京邮电大学
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN911.3
- Published：1998
- 稿件说明：
移动端阅览
[1]尹长川,乐光新.DMT调制系统中一种新的信道冲激响应最优缩短算法[J].通信学报,1998(12):67-71.

Li Shiju Mei Liubo Dai Wenqi. Elliptic Search of Self Healing Restoration on ATM Networks[J]. 1998, (12).
[1]尹长川,乐光新.DMT调制系统中一种新的信道冲激响应最优缩短算法[J].通信学报,1998(12):67-71. DOI：

Li Shiju Mei Liubo Dai Wenqi. Elliptic Search of Self Healing Restoration on ATM Networks[J]. 1998, (12). DOI：

摘要

在离散多音调制（ＤＭＴ）系统中，每个符号块在进行传输前通常要加入循环前缀（ＣＰ），以保证子信道之间的相互独立性，消除符号块间的干扰。ＣＰ的长度等于有效信道冲激响应的记忆长度。较长的ＣＰ大大降低了ＤＭＴ调制系统的传信率。为了避免采用较长的ＣＰ，通常在接收端采用有限冲激响应滤波器（ＦＩＲ）缩短有效信道冲激响应的长度。文献［１］给出了计算最优缩短冲激响应滤波器（ＳＩＲＦ）抽头系数的算法，但该算法要求ＳＩＲＦ抽头的长度必须小于或等于目标冲激响应的记忆长度。本文改进了这种算法，使其可计算任意长度ＳＩＲＦ的抽头系数。

Abstract

Based on analyses of self healing restoration

this paper presents the elliptic algorithm which reduces search fields of useless messages

and simulates the process of selfhealing restoration by computes Results show that the search region of ellipse is less than the region of mono and dual direction

the effects on nodes number are small and the search area can be rational set The cost is that it must be to construct the table of minimal search region in every node

关键词

Keywords

references

Views

597

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

AI问答

⁰