Method for scheduling heterogeneous traffic in b3g/4g cellular network with multiple channels
    112.
    发明专利
    Method for scheduling heterogeneous traffic in b3g/4g cellular network with multiple channels 有权
    在具有多个通道的B3G / 4G蜂窝网络中调度异构传输的方法

    公开(公告)号:JP2008289127A

    公开(公告)日:2008-11-27

    申请号:JP2008057600

    申请日:2008-03-07

    Abstract: PROBLEM TO BE SOLVED: To provide a method and apparatus for scheduling heterogeneous traffic in B3G/4G cellular networks. SOLUTION: A method includes tracking average user throughput or the like for every user that is serviced; determining a potential schedule set responsive to user requirements responsive to minimum rate guarantee for data flows and maximum tolerable delay and jitter guarantees for voice flows; with multiple flows for each user, first determining contending flow for each user responsive to aggregate rate feedback; obtaining search space for the user requirements of rate, delay and jitter responsive to corresponding optimizing strategies; determining individual rate, delay and jitter related schedules providing maximum incremental or marginal utility; and calculating final schedule of users on channels providing maximum incremental or marginal utility among parameter specific schedules from the determining step. COPYRIGHT: (C)2009,JPO&INPIT

    Abstract translation: 要解决的问题:提供一种用于调度B3G / 4G蜂窝网络中的异构业务的方法和装置。 解决方案:一种方法包括跟踪所服务的每个用户的平均用户吞吐量等; 响应于数据流的最小速率保证和语音流的最大容许延迟和抖动保证来确定响应于用户需求的潜在调度集; 每个用户具有多个流,首先响应于总体速率反馈确定每个用户的竞争流; 响应于相应的优化策略,获得用户对速率,延迟和抖动的要求的搜索空间; 确定提供最大增量或边际效用的个人速率,延迟和抖动相关时间表; 以及计算来自确定步骤的参数特定时间表中提供最大增量或边际效用的频道上用户的最终进度。 版权所有(C)2009,JPO&INPIT

    Test data compression method for system-on-chip using re-seed for linear feedback shift register
    113.
    发明专利
    Test data compression method for system-on-chip using re-seed for linear feedback shift register 有权
    用于线性反馈移位寄存器的再片式系统芯片的测试数据压缩方法

    公开(公告)号:JP2008070367A

    公开(公告)日:2008-03-27

    申请号:JP2007235569

    申请日:2007-09-11

    CPC classification number: G06F11/2236

    Abstract: PROBLEM TO BE SOLVED: To provide test data compression method applicable to System-on Chip (SoC) which can attain maximum compression, while shortening the test run time. SOLUTION: The test data compression method comprises a step for acquiring equivalent core of plural cores in the System-on Chip circuit, and a step for applying reseeding of linear feedback shift register (LFSR) for test data compression of the equivalent core. COPYRIGHT: (C)2008,JPO&INPIT

    Abstract translation: 要解决的问题:提供适用于可实现最大压缩的系统级芯片(SoC)的测试数据压缩方法,同时缩短测试运行时间。 解决方案:测试数据压缩方法包括在片上片上电路中获取多个核的等效核的步骤,以及用于对等效核的测试数据压缩应用线性反馈移位寄存器(LFSR)的再补充步骤 。 版权所有(C)2008,JPO&INPIT

    Method and apparatus for distributed data replication
    115.
    发明专利
    Method and apparatus for distributed data replication 审中-公开
    分布式数据复制的方法和装置

    公开(公告)号:JP2007202146A

    公开(公告)日:2007-08-09

    申请号:JP2007008771

    申请日:2007-01-18

    CPC classification number: H04L63/0428 H04L12/1881

    Abstract: PROBLEM TO BE SOLVED: To provide a data replication technique for providing erasure encoded replication of large data sets over a geographically distributed replica set. SOLUTION: The technique utilizes a multicast tree to store, forward, and erasure encode the data set. The erasure encoding of data may be performed at various locations within the multicast tree, including the source, intermediate nodes, and destination nodes. In one embodiment, the system comprises a source node for storing the original data set, a plurality of intermediate nodes, and a plurality of leaf nodes for storing the unique replica fragments. The nodes are configured as a multicast tree to convert the original data into the unique replica fragments by performing distributed erasure encoding at a plurality of levels of the multicast tree. COPYRIGHT: (C)2007,JPO&INPIT

    Abstract translation: 要解决的问题:提供数据复制技术,用于在地理分布的副本集上提供大数据集的擦除编码复制。 解决方案:该技术利用组播树来存储,转发和擦除对数据集的编码。 可以在多播树内的各个位置执行数据的擦除编码,包括源,中间节点和目的地节点。 在一个实施例中,系统包括用于存储原始数据集的源节点,多个中间节点和用于存储唯一副本片段的多个叶节点。 这些节点被配置为多播树,以通过在多播树的多个级别执行分布式擦除编码来将原始数据转换成唯一的副本片段。 版权所有(C)2007,JPO&INPIT

    Admission control method and device for radio packet data services
    116.
    发明专利
    Admission control method and device for radio packet data services 有权
    无线电数据包服务的接纳控制方法和设备

    公开(公告)号:JP2007159131A

    公开(公告)日:2007-06-21

    申请号:JP2006324424

    申请日:2006-11-30

    Abstract: PROBLEM TO BE SOLVED: To accomplish a call admission control method and device extremely suitable for a radio system providing real-time services on a shared downlink. SOLUTION: A call admission control technique takes into account both multiplexing and a multi-user diversity gain. The multi-user diversity gain is accurately determined by measuring resource allocation for each user so as to conveniently maximize not only a location dependent resource availability restriction but also a user accommodation capability under the quality of service (QoS). In a further embodiment, the call approval control technique is combined with delay-based scheduling effectively balancing system efficiency (channel usage rate) and a user expected value (e.g., QoS). A system realizing described call admission control and scheduling technique is capable of achieving conveniently efficient real-time services and keeps robustness for different loads varied by system dynamics and/or user mobility. COPYRIGHT: (C)2007,JPO&INPIT

    Abstract translation: 要解决的问题:完成一种非常适合于在共享下行链路上提供实时业务的无线电系统的呼叫准入控制方法和装置。 解决方案:呼叫准入控制技术考虑了复用和多用户分集增益。 通过测量每个用户的资源分配来准确地确定多用户分集增益,以便不仅方便地最大限度地最大限度地最大限度地利用位置相关的资源可用性限制,而且还可以在服务质量(QoS)下的用户容纳能力。 在另一个实施例中,呼叫批准控制技术与基于延迟的调度相结合,有效地平衡系统效率(信道使用率)和用户期望值(例如,QoS)。 实现所描述的呼叫接纳控制和调度技术的系统能够实现方便有效的实时业务,并保持由系统动态和/或用户移动性变化的不同负载的鲁棒性。 版权所有(C)2007,JPO&INPIT

    Multiple input and multiple output (mimo) channel detection reduced in complexity due to serial monte carlo
    117.
    发明专利
    Multiple input and multiple output (mimo) channel detection reduced in complexity due to serial monte carlo 有权
    多输入和多输出(MIMO)通道检测由于串行单体CARLO而降低复杂度

    公开(公告)号:JP2006238426A

    公开(公告)日:2006-09-07

    申请号:JP2006013548

    申请日:2006-01-23

    CPC classification number: H04L1/005 H04B7/04

    Abstract: PROBLEM TO BE SOLVED: To provide a detecting system and a detecting method employing a serial Monte Carlo technique in a multiple input and multiple output system (MIMO).
    SOLUTION: In the detecting system and its detecting method, a Monte Carlo sample weighted with respect to the establishment distribution of a first symbol component of a modified symbol and another Monte Carlo sample weighted with respect to the establishment distribution of a second symbol component are sampled separately to estimate the value of probability thereafter. According to this method, the number of symbol hypothesises and complexity on the computation in the system are reduced.
    COPYRIGHT: (C)2006,JPO&NCIPI

    Abstract translation: 要解决的问题:提供一种在多输入多输出系统(MIMO)中采用串行蒙特卡罗技术的检测系统和检测方法。 解决方案:在检测系统及其检测方法中,相对于修改符号的第一符号分量的建立分布加权的蒙特卡罗样本和相对于第二符号的建立分布加权的另一蒙特卡洛样本 分量进行采样分析,以估算其后的概率值。 根据这种方法,减少了系统中符号假设的数量和计算的复杂性。 版权所有(C)2006,JPO&NCIPI

    Compression system and method
    118.
    发明专利
    Compression system and method 审中-公开
    压缩系统和方法

    公开(公告)号:JP2006092725A

    公开(公告)日:2006-04-06

    申请号:JP2005270284

    申请日:2005-09-16

    CPC classification number: H03M7/30 H03M7/3084

    Abstract: PROBLEM TO BE SOLVED: To disclose a new compression and decompression (defrosting) architecture for performing fast matching during compression by advantageously using a plurality of parallel content addressable memories of different sizes.
    SOLUTION: This compression architecture is provided with two or three more content addressable memories 114, 116, 118 which have the different sizes each other, and are arranged so as to operate in parallel with respect to parts of the different sizes in an input stream 100, and a selection logic 120 for selecting one among coincident content addressable memories when the coincident entries of one or more than two are existent in the associative memories 114, 116, 118 so that one of the parts of the different sizes among the input streams 100 is replaced to a compressive expression for specifying the selected content addressable memory and the coincident entry in a compressive output stream 150.
    COPYRIGHT: (C)2006,JPO&NCIPI

    Abstract translation: 要解决的问题:公开一种新的压缩和解压缩(除霜)架构,用于通过有利地使用不同尺寸的多个并行内容可寻址存储器来进行压缩期间的快速匹配。 解决方案:该压缩架构具有两个或三个更多的内容可寻址存储器114,116,118,它们具有彼此不同的尺寸,并且被布置成在相同尺寸的 输入流100,以及选择逻辑120,用于在一个或多于一个的符合条目存在于关联存储器114,116,118中时,在一致的内容可寻址存储器中选择一个存储器,以使得不同大小的部分之一 输入流100被替换为用于指定所选择的内容可寻址存储器和压缩输出流150中的重合条目的压缩表达式。(C)2006年,JPO和NCIPI

Patent Agency Ranking