会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 62. 发明申请
    • Method and apparatus for a high-capacity cellular network by improved sectorization and interleaved channel assignment
    • 通过改进的扇区化和交织的信道分配,高容量蜂窝网络的方法和装置
    • US20020019233A1
    • 2002-02-14
    • US09948816
    • 2001-09-10
    • AT&T Corp., New York, New York
    • Kin K. LeungLi-Chun Wang
    • H04Q007/20
    • H04W16/12H04W16/02H04W16/24H04W28/16
    • A method and apparatus for a high-capacity cellular network by improved sectorization and interleaved channel assignment is presented. Data transmission over a cellular network is carried out by implementation of a sectorization scheme, called the Narrow-Beam Quad-sector Cell (NBQC) sectorization scheme, and the corresponding Interleaved Channel Assignments (ICA). The NBQC sectorization scheme calls for each cell of a cellular network to be divided into four sectors, with each sector covered by a 60 degree antenna. Use of the NBQC sectorization scheme allows for implementation of the corresponding ICA, in which assignment of transmission channels to each cell is based on a re-use factor of Nnull2. Accordingly, the interleaved channel assignments allow for the use of the transmission channels in cells which are adjacent in the cellular network.
    • 提出了一种通过改进的扇区化和交织的信道分配来实现高容量蜂窝网络的方法和装置。 通过实现称为窄波束四分区小区(NBQC)扇区化方案和相应的交织信道分配(ICA)的扇区化方案来实现蜂窝网络上的数据传输。 NBQC扇区化方案要求将蜂窝网络的每个小区划分为四个扇区,每个扇区由60度天线覆盖。 使用NBQC扇区化方案允许实现相应的ICA,其中对每个小区的传输信道的分配基于N = 2的重用因子。 因此,交织的信道分配允许在蜂窝网络中相邻的小区中使用传输信道。
    • 63. 发明授权
    • Z-coder: a fast adaptive binary arithmetic coder
    • US6281817B2
    • 2001-08-28
    • US79539501
    • 2001-02-28
    • AT & T CORP
    • BENGIO YOSHUABOTTOU LEONHOWARD PAUL G
    • H03M7/40H03M9/00H03M7/34
    • H03M7/4006
    • A binary arithmetic coder and decoder provides improved coding accuracy due to improved probability estimation and adaptation. They also provide improved decoding speed through a "fast path" design wherein decoding of a most probable symbol requires few computational steps. Coded data represents data that is populated by more probable symbols ("MPS") and less probable symbols ("LPS"). In an embodiment, a decoder receives a segment of the coded data as a binary fraction C. It defines a coding interval of possible values of C, the interval extending from a variable lower bound A to a constant upper bound 1. For each position in the decoded symbol string, the decoder computes a test value Z that subdivides the coding interval into sub-intervals according to the relative probabilities that an MPS or an LPS occurs in the position. A first sub-interval extends from the lower bound A to the test value Z; the second sub-interval extending from the test value Z to 1. If C is greater than Z, the decoder emits an MPS for the current position in the decoded symbol string and sets the lower bound A to the test variable Z for use during decoding of the next position in the decoded symbol string. If C is less than Z, the decoder emits an LPS and computes a new lower bound A and a new binary fraction C for use during decoding of the next position in the decoded symbol string. The encoder operates according to analogous techniques to compose coded data from original data.