Method and apparatus related to assignment in wireless communications system
    2.
    发明专利
    Method and apparatus related to assignment in wireless communications system 有权
    与无线通信系统分配相关的方法与装置

    公开(公告)号:JP2012151884A

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

    申请号:JP2012058974

    申请日:2012-03-15

    CPC classification number: H04W72/042 H04W8/26

    Abstract: PROBLEM TO BE SOLVED: To provide a method and apparatus for communication resource assignment information and for using the assignment information in a wireless communications system.SOLUTION: A mobile is assigned an identifier and a mask value as a part of a state transition message. The mobile uses the assigned identifier and/or the assigned mask value in determining whether traffic channel assignment messages are directed to a wireless terminal. Predetermined associations between assigned slots, assigned segments, and/or the mask values are utilized to limit control signaling overhead. Different groups of segments are available for assignment to different wireless terminals as a function of mask values. Different types of assignment messages use different amounts of information bits to convey the assignment. Some types of assignments use a wireless terminal identifier, while other types of assignments use a wireless terminal identifier and a mask identifier.

    Abstract translation: 要解决的问题:提供一种用于通信资源分配信息和在无线通信系统中使用分配信息的方法和装置。 解决方案:将移动台分配为状态转换消息的一部分的标识符和掩码值。 移动台使用分配的标识符和/或分配的掩码值来确定业务信道分配消息是否被定向到无线终端。 分配的时隙,分配的段和/或掩码值之间的预定关联用于限制控制信令开销。 根据屏蔽值的不同,不同的片段组可用于分配给不同的无线终端。 不同类型的分配消息使用不同数量的信息位来传送分配。 一些类型的分配使用无线终端标识符,而其他类型的分配使用无线终端标识符和掩码标识符。 版权所有(C)2012,JPO&INPIT

    Beacon coding in wireless communications systems
    3.
    发明专利
    Beacon coding in wireless communications systems 有权
    无线通信系统中的信标编码

    公开(公告)号:JP2012050095A

    公开(公告)日:2012-03-08

    申请号:JP2011201978

    申请日:2011-09-15

    Abstract: PROBLEM TO BE SOLVED: To provide methodologies that facilitate transmitting beacon symbols of a beacon message such that a sequence of symbols can satisfy a linear constraint over a field where the field elements can be identified with carriers.SOLUTION: A coding scheme can be applied to a beacon message; the coding scheme can produce a plurality of beacon symbols to transmit on given subcarriers. A receiving device of the beacon symbols decodes a beacon message by receiving less than the total number of symbols in a beacon message and determining the remaining symbol subcarriers based on the linear constraint. Thus, more efficient decoding of beacons is facilitated as well as resolving beacon ambiguity by figuring out which symbols satisfy linear constraints for the symbols, and resolving time and frequency shift by detecting an offset that would result in satisfaction of the linear constraint.

    Abstract translation: 要解决的问题:提供便于发送信标消息的信标符号的方法,使得符号序列可以满足可以用载波识别场元素的场的线性约束。 解决方案:编码方案可应用于信标消息; 编码方案可以产生多个信标符号,以在给定子载波上进行传输。 信标符号的接收装置通过接收少于信标消息中的符号总数来解码信标消息,并且基于线性约束确定剩余符号子载波。 因此,有助于信标的更有效的解码以及通过找出哪些符号满足符号的线性约束来解析信标模糊度,以及通过检测将导致满足线性约束的偏移来解决时间和频率偏移。 版权所有(C)2012,JPO&INPIT

    Efficient automatic repeat request methods and apparatus
    4.
    发明专利
    Efficient automatic repeat request methods and apparatus 有权
    有效的自动重复请求方法和设备

    公开(公告)号:JP2011061810A

    公开(公告)日:2011-03-24

    申请号:JP2010228501

    申请日:2010-10-08

    Abstract: PROBLEM TO BE SOLVED: To efficiently utilize limited amounts of bandwidth for redundant information communication in improved ARQ mechanisms. SOLUTION: Different NAK signals are used to indicate different relative levels in regard to an unsuccessful attempt to decode a received signal. An ACK signal is used in the case of successful decoding. A device which generates and transmits the original encoded signal receives the NAK signal and selects a portion of redundant information, e.g., additional error correction bits, to be transmitted based on the value of the NAK signal. If the NAK signal indicates a low level decoding success, indicating a relatively large number of errors in the decoded signal, a large set of redundant information is selected and transmitted. If the NAK signal indicates a relatively successful decoding, e.g., relatively few errors, a small set of redundant information is selected and transmitted. When a small set of redundant information is transmitted, new information can be transmitted with the redundant information. COPYRIGHT: (C)2011,JPO&INPIT

    Abstract translation: 要解决的问题:在改进的ARQ机制中有效利用有限数量的带宽用于冗余信息通信。 解决方案:使用不同的NAK信号来表示不成功尝试解码接收信号的相对电平。 在成功解码的情况下使用ACK信号。 产生和发送原始编码信号的装置接收NAK信号,并根据NAK信号的值选择要发送的冗余信息的一部分,例如附加的纠错位。 如果NAK信号指示低电平解码成功,则指示解码信号中相对大量的错误,则选择并发送大量冗余信息。 如果NAK信号指示相对成功的解码,例如相对较少的错误,则选择并发送一小组冗余信息。 当发送一小组冗余信息时,可以使用冗余信息传输新信息。 版权所有(C)2011,JPO&INPIT

    Node processors for use in parity check decoders
    5.
    发明专利
    Node processors for use in parity check decoders 有权
    使用异常检查代码的节点处理器

    公开(公告)号:JP2012257287A

    公开(公告)日:2012-12-27

    申请号:JP2012166960

    申请日:2012-07-27

    Abstract: PROBLEM TO BE SOLVED: To provide techniques for implementing message passing decoders, e.g., LDPC decoders.SOLUTION: Messages are quantized to integer multiples of 1/2 ln2, and transformed between a more compact variable node message representation format and less compact constraint node message representation format. The variable node message format allows variable node message operations to be performed through simple additions and subtractions while the constraint node representation allows constraint node message processing to be performed through simple additions and subtractions. Variable and constraint nodes are implemented using an accumulator module 1302, a subtractor module 1304 and a delay pipeline 1306. The accumulator module 1302 generates and stores an accumulated message sum 1316, and then delayed input messages from the delay pipeline 1306 are subtracted from the accumulated message sum to generate output messages 1321.

    Abstract translation: 要解决的问题:提供用于实现消息传递解码器(例如LDPC解码器)的技术。 消息被量化为1/2 ln2的整数倍,并且在更紧凑的可变节点消息表示格式和较不紧凑的约束节点消息表示格式之间进行变换。 变量节点消息格式允许通过简单的加法和减法执行变量节点消息操作,而约束节点表示允许通过简单的加法和减法执行约束节点消息处理。 可变和约束节点使用累加器模块1302,减法器模块1304和延迟流水线1306来实现。累加器模块1302生成并存储累加的消息总和1316,然后从累积的缓冲流程1306中减去来自延迟流水线1306的延迟的输入消息 消息总和生成输出消息1321.版权所有:(C)2013,JPO&INPIT

    LDPC DECODING METHODS AND APPARATUS LDPC

    公开(公告)号:HK1150475A1

    公开(公告)日:2011-12-30

    申请号:HK11104472

    申请日:2011-05-05

    Applicant: QUALCOMM INC

    Abstract: A flexible and relatively hardware efficient LDPC decoder is described. The decoder can be implemented with a level of parallelism which is less than the full parallelism of the code structure used to control the decoding process. Each command of a relatively simple control code used to describe the code structure can be stored and executed multiple times to complete the decoding of a codeword. Different codeword lengths are supported using the same set of control code instructions but with the code being implemented a different number of times depending on the codeword length. The decoder can switch between decoding codewords of different lengths, without the need to change the stored code description information, by simply changing a code lifting factor that is indicative of codeword length and is used to control the decoding process.; When decoding codewords shorter than the maximum supported codeword length some block storage locations may go unused.

    7.
    发明专利
    未知

    公开(公告)号:AT528875T

    公开(公告)日:2011-10-15

    申请号:AT08006438

    申请日:2008-03-31

    Applicant: QUALCOMM INC

    Abstract: Systems and methodologies are described that facilitate identifying peers based upon encoded signals during peer discovery in a peer to peer network. For example, direct signaling that partitions a time-frequency resource into a number of segments can be utilized to communicate an identifier within a peer discovery interval; thus, a particular segment selected for transmission can signal a portion of the identifier, while a remainder can be signaled based upon tones communicated within the selected segment. Moreover, a subset of symbols within the resource can be reserved (e.g., unused) to enable identifying and/or correcting timing offset. Further, signaling can be effectuated over a plurality of peer discovery intervals such that partial identifiers communicated during each of the peer discovery intervals can be linked (e.g., based upon overlapping bits and/or bloom filter information).

    LDPC decoding methods and apparatus

    公开(公告)号:AU2010200778B2

    公开(公告)日:2011-03-10

    申请号:AU2010200778

    申请日:2010-03-02

    Applicant: QUALCOMM INC

    Abstract: A flexible and relatively hardware efficient LDPC decoder is described. The decoder can be implemented with a level of parallelism which is less than the full parallelism of the code structure used to control the decoding process. Each command of a relatively simple control code used to describe the code structure can be stored and executed multiple times to complete the decoding of a codeword. Different codeword lengths are supported using the same set of control code instructions but with the code being implemented a different number of times depending on the codeword length. The decoder can switch between decoding codewords of different lengths, without the need to change the stored code description information, by simply changing a code lifting factor that is indicative of codeword length and is used to control the decoding process.; When decoding codewords shorter than the maximum supported codeword length some block storage locations may go unused.

    LDPC decoding methods and apparatus

    公开(公告)号:AU2005329064B2

    公开(公告)日:2010-07-01

    申请号:AU2005329064

    申请日:2005-07-20

    Applicant: QUALCOMM INC

    Abstract: A flexible and relatively hardware efficient LDPC decoder is described. The decoder can be implemented with a level of parallelism which is less than the full parallelism of the code structure used to control the decoding process. Each command of a relatively simple control code used to describe the code structure can be stored and executed multiple times to complete the decoding of a codeword. Different codeword lengths are supported using the same set of control code instructions but with the code being implemented a different number of times depending on the codeword length. The decoder can switch between decoding codewords of different lengths, without the need to change the stored code description information, by simply changing a code lifting factor that is indicative of codeword length and is used to control the decoding process.; When decoding codewords shorter than the maximum supported codeword length some block storage locations may go unused.

Patent Agency Ranking