欢迎访问ic37.com |
会员登录 免费注册
发布采购

PM7325-TC 参数 Datasheet PDF下载

PM7325-TC图片预览
型号: PM7325-TC
PDF下载: 下载PDF文件 查看货源
内容描述: S / UNI - ATLAS -3200电信标准产品数据表初步 [S/UNI-ATLAS-3200 Telecom Standard Product Data Sheet Preliminary]
分类和应用: ATM集成电路SONET集成电路SDH集成电路电信电路异步传输模式
文件页数/大小: 432 页 / 2222 K
品牌: PMC [ PMC-SIERRA, INC ]
 浏览型号PM7325-TC的Datasheet PDF文件第75页浏览型号PM7325-TC的Datasheet PDF文件第76页浏览型号PM7325-TC的Datasheet PDF文件第77页浏览型号PM7325-TC的Datasheet PDF文件第78页浏览型号PM7325-TC的Datasheet PDF文件第80页浏览型号PM7325-TC的Datasheet PDF文件第81页浏览型号PM7325-TC的Datasheet PDF文件第82页浏览型号PM7325-TC的Datasheet PDF文件第83页  
S/UNI®-ATLAS-3200 Telecom Standard Product Data Sheet  
Preliminary  
Name  
Description  
other search sequences are supported by the flexibility of this bit.  
Left Leaf  
This flag indicates if this node is a leaf. If Left Leaf is a logic 1, the  
left branch is a leaf and the binary search terminates if the decision  
bit is a logic 1. If Left Leaf is a logic 0, the Left Branch value points to  
another node in the binary tree.  
Left Branch  
The pointer to the node accessed if the decision bit is a logic 1. If  
Left Leaf is a logic 1, Left Branch contains the 16-bit address  
identifying the VC Linkage Record and VC Table Record for that  
connection. If Left Leaf is a logic 0, Left Branch contains the (up to)  
17-bit address pointing to another Secondary Search Table entry.  
Right Leaf  
This flag indicates if this node is a leaf. If Right Leaf is a logic 1, the  
Right Branch is a leaf and the binary search terminates if the decision  
bit is a logic 0. If Right Leaf is a logic 0, the Right Branch field points  
to another node in the binary tree.  
Right Branch  
The pointer to the node accessed if the decision bit is a logic 0. If  
Right Leaf is a logic 1, Right Branch contains the 16-bit address  
identifying the VC Linkage Record and VC Table Address for that  
connection. If Right Leaf is a logic 0, Right Branch contains the 17-bit  
address pointing to another Secondary Search Table entry.  
The above encoding defines the binary search tree recursively.  
The following special cases must be respected:  
A binary tree with only one connection must have both the Left and Right Branches pointing to  
the solitary VC Table Record. Both the Left Leaf and Right Leaf flags must be a logic 1.  
If the Primary Search Table is not used (i.e. LPHY = LA = 0), then the primary key is considered to  
be all-zeroes, and the Primary Pointer at SA[16:0] = 0x00000 contains the root of the Secondary  
Search Tree.  
If the Primary Search Table is in use, no root node shall use location SA[16:0]=0x00000,  
although this location may be used for nodes at least one level down. A value of 0x00000 in the  
Primary Search Pointer represents a null pointer.  
10.3 VC Linkage Table  
The VC Linkage table occupies the top half of the external SRAM address space, and contains  
pointers to other context entries with which a VC is associated.  
Table 7 VC Linkage Table  
63  
1 PHYID (6)  
0
2
Reserved  
(16)  
PM 2  
Active  
(1)  
1
PM 2  
Address  
(8)  
PM 1  
Active  
(1)  
1
PM 1  
Address  
(8)  
VPC  
2
VPC  
Pointer  
Active  
(1)  
Pointer  
(16)  
Shaded fields are reserved, and must be programmed to logic 0 for proper operation.  
Proprietary and Confidential to PMC-Sierra, Inc., and for its Customers’ Internal Use  
Document ID: PMC-1990553, Issue 4  
79  
 复制成功!