公开(公告)号：US20160353489A1

公开(公告)日：2016-12-01

申请号：US14746442

申请日：2015-06-22

Applicant: Broadcom Corporation

Inventor： Andrew Blanksby ,  David Garrett ,  Matthias Korb

IPC: H04W76/02 ,  H04W8/00

CPC classification number: H04W72/1205 ,  H04W8/005 ,  H04W48/12 ,  H04W48/14 ,  H04W48/18 ,  H04W76/16 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/146 ,  Y02D70/162 ,  Y02D70/166

Abstract: Methods, systems, and apparatuses for opportunistic data transfer (ODT) are provided. ODT improves network coverage, reliability and/or efficiency by permitting data transfer consumers and network access providers to take advantage of communication opportunities that may be mutually beneficial. Fixed and mobile, personal or business, wired or wireless devices, may participate as ODT network operators, providers and/or consumers. ODT participants may be motivated to participate, for example, to reduce battery consumption and improve network coverage, reduce network congestion and interference. A phone, for example, may be enabled to send data to an Internet destination by ODT in lieu of a cellular network in particular circumstances, such as cellular network unavailability, with less costly data transfer and/or less battery power consumption. ODTs may be ad hoc or preauthorized and may be tracked, accounted, and compensated for, such as according to ODT service terms selected by each provider.

Abstract translation: 提供了机会数据传输（ODT）的方法，系统和设备。 ODT通过允许数据传输消费者和网络接入提供商利用可能互利的通信机会来改善网络覆盖，可靠性和/或效率。 固定和移动，个人或商业，有线或无线设备可以作为ODT网络运营商，提供商和/或消费者参与。 例如，ODT参与者可能有动力参与，以减少电池消耗并改善网络覆盖，减少网络拥塞和干扰。 例如，可以使手机能够通过ODT代替蜂窝网络在诸如蜂窝网络不可用性等特定情况下将数据发送到因特网目的地，具有较便宜的数据传输和/或更少的电池功率消耗。 ODT可以是特定的或预先授权的，并且可以被跟踪，记账和补偿，例如根据每个提供商选择的ODT服务条款。

公开(公告)号：US20160365873A1

公开(公告)日：2016-12-15

申请号：US14734749

申请日：2015-06-09

Applicant: Broadcom Corporation

Inventor： Matthias KORB ,  Andrew Blanksby

IPC: H03M13/11

CPC classification number: H03M13/1114 ,  H03M13/1111 ,  H03M13/1117 ,  H03M13/1171

Abstract: The present disclosure is directed to an apparatus and method for decoding non-binary LDPC codes over non-associative finite division near rings. A non-associative finite division near ring is a type of algebraic structure that includes a finite set of elements on which the operations of addition and multiplication are defined. The operation of addition is commutative, associative, and closed, and may have an additive identity for all elements in the finite set. The operation of multiplication is closed but not commutative or associative, and has a multiplicative inverse but not a multiplicative identity for all elements in the finite set. The two operations of addition and multiplication may be related by the distributive property.

Abstract translation: 本公开涉及一种用于在非关联有限划分近环上解码非二进制LDPC码的装置和方法。 环附近的非关联有限分割是一种代数结构，其包括限定加法和乘法运算的有限元素集合。 加法的操作是可交换的，关联的和关闭的，并且可以对有限集合中的所有元素具有加性标识。 乘法的操作是关闭的，但不是交换的或相关的，并且对于有限集合中的所有元素具有乘法反相但不是乘法的身份。 加法和乘法的两个操作可能与分配属性有关。

公开(公告)号：US20160227437A1

公开(公告)日：2016-08-04

申请号：US15013653

申请日：2016-02-02

Applicant: Broadcom Corporation

Inventor： Andrew Blanksby ,  Matthias Korb ,  Ron Porat ,  Dignus-Jan Moelker

IPC: H04W28/06 ,  H04L29/06

CPC classification number: H04L12/6418 ,  H04L1/00 ,  H04L1/0083 ,  H04L12/00 ,  H04L69/22

Abstract: Methods, systems, and apparatuses are described for providing device(s) with additional processing time to process a packet received wirelessly while still meeting the legacy SIFS time constraint. The additional processing time may be achieved by adding, by a device transmitting the packet, padding and/or a packet extension to the last symbol of the packet. The additional processing time provided to the device(s) advantageously reduces the amount of extra hardware that would normally be added to meet the SIFS time constraint. The amount of padding and/or packet extension to be added to the last symbol is balanced to minimize the complexity of the device(s) against the reduction in system efficiency incurred by the device(s).

Abstract translation: 描述了用于向设备提供额外的处理时间来处理在无线状态下接收的分组的方法，系统和装置，同时仍满足传统SIFS时间约束。 附加处理时间可以通过将发送分组的设备，填充和/或分组扩展添加到分组的最后一个符号来实现。 提供给设备的附加处理时间有利地减少了通常将被添加以满足SIFS时间约束的额外硬件的量。 对要添加到最后一个符号的填充和/或分组扩展的量进行平衡，以最小化设备的复杂性，从而降低由设备引起的系统效率。