会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • SCHEDULING WIRELESS COMMUNICATION
    • 调度无线通信
    • WO2008009300A1
    • 2008-01-24
    • PCT/EP2006/007054
    • 2006-07-18
    • FREESCALE SEMICONDUCTOR, INC.LIN, BoROUWET, Wim, J.
    • LIN, BoROUWET, Wim, J.
    • H04L12/56
    • H04L47/2416H04L47/14H04L47/2441H04L47/32H04L47/50H04L47/527H04L47/564H04L47/6225H04L47/626
    • A method of scheduling wireless communication for one or more data flows, wherein, for each data flow, there is: a corresponding queue (200) to store data of that data flow; one or more quality-of-service parameters associated with that data flow; and a flow type associated with that data flow, there being a plurality of possible flow types; characterised in that the method comprises, during each time frame of a sequence of time frames, the steps of: maintaining (S400), for each of the plurality of possible flow types, a queue list (300) that identifies the queues corresponding to data flows of that flow type; and processing the queue lists in a predetermined order, in which processing a queue list comprises, for each queue identified in that queue list, attempting to schedule (S406, S410, S422, S430, S436, S440, S444) the communication of data stored on that queue during a current time frame in dependence upon the one or more quality-of-service parameters associated with the corresponding data flow and an amount of bandwidth available for the wireless communication during the current time frame.
    • 一种为一个或多个数据流调度无线通信的方法,其中对于每个数据流,存在:存储该数据流的数据的相应队列(200); 与该数据流相关联的一个或多个服务质量参数; 以及与该数据流相关联的流类型,存在多个可能的流类型; 其特征在于,所述方法包括:在时间序列序列的每个时间帧期间,为所述多个可能的流类型中的每一个维护(S400)识别对应于数据的队列的队列列表(300) 流量类型; 并且以预定顺序处理队列列表,其中处理队列列表包括对于在该队列列表中识别的每个队列,尝试调度(S406,S410,S422,S430,S436,S440,S444)存储的数据的通信 在当前时间帧内,根据与当前时间帧相关联的一个或多个与相应数据流相关联的服务质量参数和可用于无线通信的带宽量在当前时间帧内。
    • 8. 发明申请
    • VECTOR CRC COMPUTATION ON DSP
    • DSP上的矢量CRC计算
    • WO2007003231A1
    • 2007-01-11
    • PCT/EP2005/053119
    • 2005-06-30
    • FREESCALE SEMICONDUCTOR, INCLIN, Bo
    • LIN, Bo
    • H03M13/09
    • H03M13/091H03M13/6569
    • A method of generating Cyclic Redundancy Checking codes based upon an N-bit binary string (200) comprises initially reducing the N-bit binary string (20C into a compressed string of bits (B', B'', B''') using a compression look-up table (202, 204). In a vector, subblocks are reduced in parallel by parallel table look-ups using the same table. The compressed string of bits (B', B''') is congruent with the N-bit binary string (200) and so share a same CRC code. Using the compressed string of bits, a conventional CRC generation technique employed to generate the CRC code. For processing on a SIMD vector DSP.
    • 一种基于N位二进制串(200)产生循环冗余校验码的方法包括:首先使用以下方式将N位二进制串(20C)减少为压缩的比特串(B',B“,B”') 压缩查找表(202,204),在向量中,使用相同的表,通过并行表查找并行地减少子块,压缩的位串(B',B“')与 N位二进制串(200)等共享相同的CRC码,使用压缩的比特串,用于生成CRC码的常规CRC生成技术,用于在SIMD向量DSP上进行处理。
    • 10. 发明申请
    • PRIORITY SEARCH TREES
    • 优先搜索
    • WO2010095004A1
    • 2010-08-26
    • PCT/IB2009/050721
    • 2009-02-23
    • FREESCALE SEMICONDUCTOR, INC.LIN, BoROUWET, Wim
    • LIN, BoROUWET, Wim
    • G06F17/30G06F17/00
    • G06F17/30961
    • An apparatus (100) arranged to implement a priority search tree to represent a plurality of data elements, the apparatus comprising: a memory (102); and a processor (104) comprising: a storage unit (110) for storing in the memory (100) for each of said data elements a corresponding data point (200) for the priority search tree, said the data point (200) having a first component value and a second component value; a tree-processing module (112) for performing at least one function operation on the data points (200), the at least one function operation involving using a comparison module (114) to perform a comparison operation to determine the relative positions of a first data point (200) and a second data point (200) in an ordering for the data points (200), the comparison operation comprising one of: (i) determining the relative positions of a first data point (200) and a second data point (200) based on a comparison of the respective first component values of the first and second data points (200) and, if the first component value of the first data point (200) equals the first component value of the second data point (200), based on a comparison of the respective second component values of the first and second data points (200); or (ii) determining the relative positions of a first data point (200) and a second data point (200) based on a comparison of the respective second component values of the first and second data points (200) and, if the second component value of the first data point (200) equals the second component value of the second data point (200), based on a comparison of the respective first component values of the first and second data points (200).
    • 一种被设置为实现优先搜索树以表示多个数据元素的装置(100),所述装置包括:存储器(102); 以及处理器(104),包括:存储单元(110),用于将每个所述数据元素存储在所述存储器(100)中,所述数据点(200)用于所述优先级搜索树,所述数据点(200)具有 第一分量值和第二分量值; 用于对所述数据点(200)执行至少一个功能操作的树处理模块(112),所述至少一个功能操作涉及使用比较模块(114)执行比较操作,以确定第一 数据点(200)和第二数据点(200),所述比较操作包括以下之一:(i)确定第一数据点(200)和第二数据(200)的相对位置 (200)的第一分量值与第一数据点(200)的第一分量值等于第二数据点(200)的第一分量值 200),基于第一和第二数据点(200)的各个第二分量值的比较; 或者(ii)基于第一和第二数据点(200)的相应第二分量值的比较来确定第一数据点(200)和第二数据点(200)的相对位置,如果第二分量 基于第一和第二数据点(200)的各个第一分量值的比较,第一数据点(200)的值等于第二数据点(200)的第二分量值。