会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • Method for estimating a map size in a wireless mobile communication system
    • 用于估计无线移动通信系统中的地图大小的方法
    • US20070086474A1
    • 2007-04-19
    • US11580794
    • 2006-10-13
    • Hee-Kwang LeeJung-Won KimYoo-Seung Song
    • Hee-Kwang LeeJung-Won KimYoo-Seung Song
    • H04L12/413
    • H04W99/00H04L5/0044H04L5/006H04L5/0064H04W28/06H04W72/04H04W74/04
    • A method is provided for estimating the size of a MAP region according to data burst allocation in a wireless mobile communication system. A data burst region is divided into at least one sub-region. A downlink frame is constructed with at least one sub-region such that a power boosting process is performed according to a predefined power level. The data burst is allocated to a specific sub-region of the sub-region according to a carrier to interference and noise ratio (CINR) of the data burst. A slot occupancy rate of data bursts allocated to the specific sub-region is computed. A concatenation or non-concatenation of the data bursts is set according to a predetermined criterion when the slot occupancy rate is less than a predefined slot occupancy rate. A size of the MAP region to be occupied by allocation information of the data bursts to be concatenated or unconcatenated is set.
    • 提供了一种根据无线移动通信系统中的数据突发分配来估计MAP区域的大小的方法。 数据脉冲串区域被划分为至少一个子区域。 下行链路帧由至少一个子区域构成,使得根据预定功率电平执行功率提升处理。 数据脉冲串根据数据脉冲串的载波干扰和噪声比(CINR)分配给子区域的特定子区域。 计算分配给特定子区域的数据突发的时隙占用率。 当占用率小于预定的时隙占用率时,根据预定标准来设置数据突发的级联或非并置。 设置要被连接或不连接的数据突发的分配信息占用的MAP区域的大小。
    • 9. 发明申请
    • APPARATUS AND METHOD FOR UPDATING CHECK NODE OF LOW-DENSITY PARITY CHECK CODES
    • 检查低密度奇偶校验码代码的装置和方法
    • US20100037119A1
    • 2010-02-11
    • US12517455
    • 2007-12-05
    • Jong-Ee OhYu-Ro LeeChanho YoonMinho CheongSok-Kyu LeeYoo-Seung SongYounggyun Kim
    • Jong-Ee OhYu-Ro LeeChanho YoonMinho CheongSok-Kyu LeeYoo-Seung SongYounggyun Kim
    • H03M13/05G06F11/10
    • H03M13/1122H03M13/1117H03M13/112H03M13/6527H03M13/6544H03M13/6577H03M13/658H03M13/6583
    • An apparatus and method for updating a check node of a low-density parity check (LDPC) code in order to decode the LDPC code are provided. The method includes the operations of: (a) obtaining a first bit of a first minimum value among input values, the number of input values being equal to the number of degrees of the check node, by performing an AND operation on first bits of the input values, the first bits being most significant bits of the input values; (b) obtaining result values by switching and sequentially performing an XOR operation and an OR operation on the first bit of the first minimum value and each of the first bits of the input values; and (c) performing operations (a) and (b) on the result values set as input values and performing operations (a) and (b) a number of times corresponding to the number of bits of each input value, that is, repeating until last bits are set as input values, to thereby obtain the first minimum value, the last bits being least significant bits of the input values. Accordingly, the complexity of hardware is reduced, and super high-speed processing is possible.
    • 提供了一种用于更新低密度奇偶校验(LDPC)码的校验节点以便解码LDPC码的装置和方法。 该方法包括以下操作:(a)通过对所述校验节点的第一比特执行“与”运算,获得输入值中的第一最小值的第一比特,输入值的数目等于校验节点的度数。 输入值,第一位是输入值的最高有效位; (b)通过对所述第一最小值的所述第一位和所述输入值的所述第一位中的每一个进行切换和顺序执行异或运算和或运算来获得结果值; 和(c)对设置为输入值的结果值执行操作(a)和(b),并且执行操作(a)和(b)与每个输入值的位数相对应的次数,即重复 直到最后的位被设置为输入值为止,从而获得第一最小值,最后的位是输入值的最低有效位。 因此,硬件的复杂度降低,超高速处理成为可能。