会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Methods and apparatus for control of optical switching arrays that minimize bright state switching
    • 用于控制光开关阵列的方法和装置,其使亮状态切换最小化
    • US07050668B2
    • 2006-05-23
    • US10464929
    • 2003-06-19
    • Krishnan KumaranNachi K. NithiCarl Jeremy Nuzman
    • Krishnan KumaranNachi K. NithiCarl Jeremy Nuzman
    • G02B6/26G02B6/42
    • H04Q11/0005H04Q2011/0049
    • Techniques and systems for control of optical switching arrays are described. A switch array controller according to an aspect of the present invention operates so as to achieve reduced power consumption and maintain crosstalk within acceptable limits. Various rules are applied in order to insure that the desired criteria are met. In order to reduce transient effects, switching from one output to another is accomplished in a sequence chosen to maximize the number of transitions occurring in those portions of the array not carrying a signal, and to minimize the number of transitions that occur in portions of the array carrying the signal. Transitions are made in the portion of the array to which the signal will be directed, then a switch is transitioned between the old and new signal paths, and finally further transitions are made in the portion of the array within which the signal was previously directed.
    • 描述了用于控制光学开关阵列的技术和系统。 根据本发明的一个方面的开关阵列控制器的操作是为了实现降低的功耗并将串扰保持在可接受的限度内。 应用各种规则以确保满足期望的标准。 为了减少瞬态效应,从一个输出到另一个输出的切换是按照选择的序列来实现的,以使不发生信号的阵列的这些部分中发生的转换次数最大化,并且最小化在 阵列携带信号。 在信号将被引导到的阵列的部分中进行转换,然后在旧信号路径和新信号路径之间转换开关,并且最后在阵列的先前指向信号的部分中进行进一步的转换。
    • 9. 发明授权
    • Method for operating a wireless telecommunications system
    • US6094584A
    • 2000-07-25
    • US48443
    • 1998-03-26
    • Sanjeev KhannaKrishnan Kumaran
    • Sanjeev KhannaKrishnan Kumaran
    • H04B7/26H04W16/10H04B7/00H04Q7/20
    • H04W16/10H04W28/16
    • A method for operating a wireless telecommunications system whereby communication channels are efficiently allocated to cells of the system is provided. In accordance with an illustrative embodiment of the present method, call demand information is obtained for each cell in the wireless system and converted to a channel demand. Once the channel demand for each cell is known, a tentative channel allocation is performed. Call demand information can be obtained as frequently as desired to update channel allocation throughout the wireless system. In some embodiments, the method for channel allocation described herein can be used alone to allocate channels. In other embodiments, the present method for channel allocation can be used on an hourly, daily, or other temporal basis, as appropriate, to provide a channel allocation which is then updated on a substantially continuous basis by any conventional dynamic channel allocation scheme. To allocate channels, an "interference graph" that relates interfering cells to one another is defined. When nearest-cell interference is considered, an initial step is performed wherein three channels are iteratively allocated to all cells in the system to remove all groupings within the interference graph comprising three mutually-interfering cells. During the initial step, the allocation of three channels reduces channel demand by one in every cell. Once the interference graph is free of such three-membered groupings, channel demand is reduced more efficiently wherein no more than five channels are allocated to satisfy two units of channel demand. To do so, a decomposition/reconstruction operation is performed wherein the interference graph is segregated into groupings of cells to which channels are allocated. The operation for allocating channels to cells when nearest- and next-to-nearest-cell interference is considered does not use the initial step of allocating three channels. It does, however, proceed in a manner analogous to the decomposition/reconstruction process mentioned above, although the operation is performed on a cell-by-cell basis, rather than with groupings of cells.