公开(公告)号：US20050022101A1

公开(公告)日：2005-01-27

申请号：US10622742

申请日：2003-07-21

申请人： Peter Malm ,  John Anderson

发明人： Peter Malm ,  John Anderson

IPC分类号： H03M13/29 ,  H04L1/00 ,  H04L1/18 ,  G06F11/00 ,  H03M13/00

CPC分类号： H04L1/0051 ,  H03M13/2975 ,  H04L1/0055 ,  H04L1/1812

摘要： Turbo encoded information that comprises first systematic bits, first parity bits, second systematic bits, and second parity bits is decoded by supplying the first systematic bits and the first parity bits to a first decoder; supplying the second systematic bits and the second parity bits to a second decoder; and operating the first and second decoders in parallel for a number, m, of half-iterations, wherein m≧1. For each of the m half-iterations, the first decoder utilizes soft information supplied as an output from the second decoder in a preceding half-iteration, and the second decoder utilizes soft information supplied as an output from the first decoder in the preceding half-iteration. An early iteration termination decision is made by, after one or more of the m half-iterations, deciding whether to stop operating the first and second decoders by comparing an output from the first decoder with an output from the second decoder.

摘要翻译： 通过将第一系统比特和第一奇偶校验位提供给第一解码器来解码包括第一系统比特，第一奇偶校验位，第二系统比特和第二奇偶校验比特的Turbo编码信息; 将第二系统位和第二奇偶校验位提供给第二解码器; 以及并行操作所述第一和第二解码器数m，半迭代，其中m> = 1。 对于m个半迭代中的每一个，第一解码器利用在前一半迭代中作为来自第二解码器的输出提供的软信息，并且第二解码器利用作为前一半迭代中的第一解码器的输出提供的软信息， 迭代。 在m个半迭代中的一个或多个之后，通过将来自第一解码器的输出与来自第二解码器的输出进行比较来决定是否停止操作第一和第二解码器，进行早期迭代终止判定。

公开(公告)号：US07213189B2

公开(公告)日：2007-05-01

申请号：US10520044

申请日：2003-06-27

申请人： Peter Malm

发明人： Peter Malm

IPC分类号： H04L1/18

CPC分类号： H04L1/0051 ,  H03M13/2975 ,  H03M13/6306 ,  H04L1/16 ,  H04L1/1607 ,  H04L1/1812 ,  H04L1/1816 ,  H04L1/1845 ,  H04L1/1848

摘要： A method for scheduling a decoding process of coded data blocks transmitted over a link in a communication network. According to the method the coded data block is stored in a queue (71) if all decoders of a cluster (72) of iterative parallel decoders are unavailable. When any of the decoders of the cluster (72) is available the first coded block of the queue (71) is moved to that decoder. Also, according to the method it is possible to combine a stored coded block with a retransmitted coded block, which is decoded with an increased probability for successful decoding. Also, the invention relates to a communication apparatus adapted for carrying out the method according to the invention.

摘要翻译： 一种用于调度通过通信网络中的链路传输的编码数据块的解码处理的方法。 根据该方法，如果迭代并行解码器的集群（72）的所有解码器都不可用，则编码数据块被存储在队列（71）中。 当群集（72）的任何解码器可用时，队列（71）的第一编码块被移动到该解码器。 此外，根据该方法，可以将存储的编码块与重新发送的编码块组合，其以成功解码的增加概率进行解码。 此外，本发明涉及一种适于实现根据本发明的方法的通信设备。

公开(公告)号：US20050044473A1

公开(公告)日：2005-02-24

申请号：US10645560

申请日：2003-08-22

申请人： Wensheng Huang ,  Raymond Toy ,  Peter Malm

发明人： Wensheng Huang ,  Raymond Toy ,  Peter Malm

IPC分类号： H04L1/18 ,  H03D1/00 ,  H03M13/03 ,  H04L27/06

CPC分类号： H04L1/1845 ,  H04L1/1819 ,  H04L1/1835

摘要： In a packet-based data transmission including incremental redundancy (IR) protocols, the memory consumption of the IR protocol is reduced by compressing and storing failed data units in their punctured format. The failed data units are compressed using low complexity compression/decompression algorithms. The compression algorithm includes two parts: calculating and storing a scale factor for each transmission burst that estimates the soft values in the burst, and storing each soft values' sign in local memory instead of the complete soft value. If the currently received data unit is a retransmission, its compressed versions in the punctured format stored in the IR memory are decompressed, de-punctured and combined with the currently received data unit. The combined data unit is then decoded. The decompression restores an estimated soft-value by multiplying the sign value stored in the IR memory with its corresponding scale factor obtained from a mapping table.

公开(公告)号：US07852902B2

公开(公告)日：2010-12-14

申请号：US11241680

申请日：2005-09-30

申请人： Andres Reial ,  Peter Malm

发明人： Andres Reial ,  Peter Malm

IPC分类号： H04B1/00

CPC分类号： H04B1/712 ,  H04B1/7117 ,  H04B2201/70701 ,  H04B2201/709727

摘要： A method for use in receiving a spread-spectrum signal includes receiving an input signal. The input signal includes a first plurality of multipath components. The method also includes despreading the first plurality of multipath components. The step of despreading includes computing a plurality of corresponding delays. The method also includes computing a plurality of combining weights based, at least in part, on interference correlation between at least two of the first plurality of multipath components, selecting, according to at least one criterion, a subset of the plurality of combining weights, and despreading and combining a second plurality of multipath components using at least one quantity related to the selected plurality of combining weights and a plurality of delays and multipath components corresponding to the plurality of selected combining weights. This Abstract is provided to comply with rules requiring an Abstract that allows a searcher or other reader to quickly ascertain subject matter of the technical disclosure. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

摘要翻译： 一种用于接收扩频信号的方法包括接收输入信号。 输入信号包括第一多个多径分量。 该方法还包括解扩第一多个多路径分量。 解扩的步骤包括计算多个对应的延迟。 该方法还包括至少部分地基于第一多个多径分量中的至少两个之间的干扰相关来计算多个组合加权，根据至少一个准则，选择多个组合权重的子集， 以及使用与所选择的多个组合权重相关的至少一个数量和对应于所述多个选择的组合权重的多个延迟和多径分量来解扩和组合第二多个多径分量。 提供本摘要以符合要求摘要的规则，允许搜索者或其他读者快速确定技术公开内容的主题。 提交本摘要的理解是，它不会用于解释或限制权利要求的范围或含义。

公开(公告)号：US07480342B2

公开(公告)日：2009-01-20

申请号：US10506913

申请日：2003-02-26

申请人： Leif Wilhelmsson ,  Peter Malm

发明人： Leif Wilhelmsson ,  Peter Malm

IPC分类号： H04L25/34

CPC分类号： H04L27/38 ,  H04L25/067

摘要： A sub-optimal method is disclosed for calculating the reliability values (soft values) for the bits of a multilevel signal. The log-likelihood values are approximated using only the dominant terms, so called max-log approximation, that is for each bit position only the two closest signal symbols of opposite bit value (S8, S6) are considered in the sum. The used modulation scheme is 16-QAM together with Gray-labelling. Two versions of approximation are proposed: one version consists of using the two distances between the received value and the two closest symbols of opposite bit value (δ1 δ2 ). In order to simplify and speed up the calculation, the second version consists of using the distance between the two closest symbols (δ3 ) to approximate the distance between the second closest symbol and the received value. Furthermore, precalculated results are stored in look-up tables to speed up the calculation.

摘要翻译： 公开了一种用于计算多电平信号的位的可靠性值（软值）的次优方法。 对数似然值仅使用主要术语近似，所谓的最大对数近似，即对于每个位位置，只有相反位值的两个最近的信号符号（S6，S8）被考虑在和中。 所使用的调制方案是16-QAM和Gray标签。 提出了两个近似版本：一个版本包括使用接收值和相对位值的两个最接近的符号（delta1，delta2）之间的两个距离。 为了简化和加速计算，第二个版本包括使用两个最接近的符号（delta3）之间的距离近似第二个最接近的符号与接收的值之间的距离。 此外，预先计算的结果存储在查找表中以加快计算。

公开(公告)号：US07395079B2

公开(公告)日：2008-07-01

申请号：US11016167

申请日：2004-12-17

申请人： Peter Malm

发明人： Peter Malm

IPC分类号： H04B15/00

CPC分类号： H04B1/7115 ,  H04B1/712 ,  H04B2201/70707

摘要： Simple and robust methods and apparatus for switching between different types of combining in a receiver in a communication system are disclosed that minimize Layer 1 processing overhead and power consumption. A method of selecting among a plurality of types of combining for received replicas of an information bitstream in a communication system includes the steps of determining a time offset between received replicas; determining a selection threshold; comparing the time offset with the selection threshold; and selecting one of the plurality of combining types based on the comparing step. The system may be a wideband code division multiple access system and the replicas may be included in a multimedia broadcast/multicast service.

摘要翻译： 公开了用于在通信系统中的接收机中的不同类型的组合之间进行切换的简单和鲁棒的方法和装置，其使第1层处理开销和功耗最小化。 一种在通信系统中的信息比特流的接收副本的多种类型的组合中进行选择的方法包括以下步骤：确定所接收的副本之间的时间偏移; 确定选择阈值; 将时间偏移与选择阈值进行比较; 以及基于所述比较步骤选择所述多个组合类型中的一个。 该系统可以是宽带码分多址系统，并且该副本可以被包括在多媒体广播/多播服务中。

公开(公告)号：US20070026803A1

公开(公告)日：2007-02-01

申请号：US10549694

申请日：2004-03-15

申请人： Peter Malm

发明人： Peter Malm

IPC分类号： H04B1/00

CPC分类号： H04L1/0033 ,  H04B17/21 ,  H04B17/336 ,  H04L1/0016 ,  H04L1/0026 ,  H04L1/20 ,  H04W52/16 ,  H04W52/223 ,  H04W52/24 ,  H04W52/241

摘要： A method and apparatus for providing a link quality report in a wireless communication system supporting link adaptation. An input signal carrying data blocks in one or several transmission intervals of a reporting interval is received by a receiver of the apparatus. A quality measurement unit provides a link quality measure of the current reporting interval. A correction unit corrects the link quality measure by determining a SIR loss of the link, which is induced by unmatched transmission parameter settings of a physical layer. Then, a link quality report for the current reporting interval is based on the corrected link quality measure and transmitted by the transmitter to the transmitting unit, which will adapt the setting of physical layer parameters accordingly.

摘要翻译： 一种用于在支持链路适配的无线通信系统中提供链路质量报告的方法和装置。 在该报告间隔的一个或几个传送间隔中承载数据块的输入信号由该装置的接收器接收。 质量测量单元提供当前报告间隔的链路质量测量。 校正单元通过确定由物理层的不匹配的传输参数设置引起的链路的SIR损耗来校正链路质量测量。 然后，当前报告间隔的链路质量报告基于校正的链路质量测量，并由发射机发射到发射单元，这将相应地适应物理层参数的设置。

公开(公告)号：US06981060B2

公开(公告)日：2005-12-27

申请号：US09735495

申请日：2000-12-14

申请人： Peter Malm

发明人： Peter Malm

IPC分类号： H03M7/30 ,  H03M13/41 ,  H03M13/45 ,  H04L1/18 ,  H04L29/06 ,  H04L29/08 ,  G06F15/16

CPC分类号： H03M13/6306 ,  H03M7/30 ,  H03M13/4146 ,  H03M13/45 ,  H03M13/6312 ,  H03M13/6505 ,  H03M13/658 ,  H04L1/1835 ,  H04L29/06 ,  H04L69/04 ,  H04L69/324

摘要： In a packet based data transmission including automatic repeat request (ARQ) protocols, the memory consumption of the ARQ protocol is reduced by compression/decompression of failed data block prior to combination with the retransmitted data blocks using low complexity compression/decompression algorithms. The compression algorithm includes of two parts: calculating and storing a scale factor that estimates the soft values in the data block, and storing the each soft values' sign in local memory instead of the complete soft value. Since one bit is sufficient to store the sign of each soft value, the memory consumption of a data block containing N soft values is N bits. Note, the scale factor increases the memory consumption, in bits, with the word length of the scale factor. However, the relative memory increase becomes smaller the larger the data block.

摘要翻译： 在包括自动重发请求（ARQ）协议的基于分组的数据传输中，通过使用低复杂度压缩/解压缩算法与重传的数据块组合之前，通过压缩/解压缩失败的数据块来减少ARQ协议的存储器消耗。 压缩算法包括两部分：计算和存储估计数据块中的软值的比例因子，并将每个软值的符号存储在本地存储器中，而不是完整的软值。 由于一个位足以存储每个软值的符号，所以包含N个软值的数据块的存储器消耗是N位。 注意，比例因子以比例因子的字长增加存储器消耗（以位为单位）。 然而，数据块越大，相对存储器的增加越小。

公开(公告)号：US07302628B2

公开(公告)日：2007-11-27

申请号：US10911297

申请日：2004-08-04

申请人： Wensheng Huang ,  Raymond Toy ,  Peter Malm

发明人： Wensheng Huang ,  Raymond Toy ,  Peter Malm

IPC分类号： H04L1/18

CPC分类号： H04L69/04 ,  H03M7/30 ,  H03M13/6306 ,  H03M13/6312 ,  H03M13/6362 ,  H03M13/6505 ,  H04L1/1819 ,  H04L1/1835 ,  H04L1/1845 ,  H04L29/06 ,  H04L69/324

摘要： In a packet-based data transmission including incremental redundancy (IR) protocols, the memory consumption of the IR protocol is reduced by compressing and storing failed data units in their punctured format. The failed data units are compressed using low complexity compression/decompression algorithms. The compression algorithm includes two parts: calculating and storing a scale factor for each transmission burst that estimates the soft values in the burst, and storing each soft values' sign in local memory instead of the complete soft value. If the currently received data unit is a retransmission, its compressed versions in the punctured format stored in the IR memory are decompressed, de-punctured and combined with the currently received data unit. The combined data unit is then decoded. The decompression restores an estimated soft-value by multiplying the sign value stored in the IR memory with its corresponding scale factor obtained from a mapping table.

摘要翻译： 在包括增量冗余（IR）协议的基于分组的数据传输中，通过以破坏的格式压缩和存储失败的数据单元来减少IR协议的存储器消耗。 使用低复杂度压缩/解压缩算法压缩失败的数据单元。 压缩算法包括两部分：计算和存储用于估计突发中的软值的每个传输突发的比例因子，并将每个软值的符号存储在本地存储器中，而不是完整的软值。 如果当前接收到的数据单元是重传，则其存储在IR存储器中的打孔格式的压缩版本被解压缩，去穿孔并与当前接收的数据单元组合。 然后对组合的数据单元进行解码。 解压缩通过将存储在IR存储器中的符号值与从映射表获得的相应缩放因子相乘来恢复估计的软值。

公开(公告)号：US20070237266A1

公开(公告)日：2007-10-11

申请号：US11279287

申请日：2006-04-11

申请人： Andres Reial ,  Peter Malm

发明人： Andres Reial ,  Peter Malm

IPC分类号： H03D1/00 ,  H04B1/00

CPC分类号： H04B1/70755 ,  H04B1/7077

摘要： Hypothesis tests, such as maximum likelihood detections, are executed on symbol sequences received by, for example, a user equipment (UE) in a communication system. The hypothesis tester checks a received sequence against a group of predetermined sequences that possibly could have been sent to the UE. For received sequences that are matched or not matched by the hypothesis tester with high confidence, complete decoding, for example, with a Viterbi decoder, is not necessary. Instead, complete decoding is used as a “tie-breaker” for those sequences which the hypothesis tester cannot match or not match with desired confidence levels.

摘要翻译： 在例如通信系统中的用户设备（UE）接收的符号序列上执行诸如最大似然检测的假设检验。 假设测试者根据可能已经发送给UE的一组预定序列来检查接收到的序列。 对于具有高置信度的假设检验者匹配或不匹配的接收序列，例如使用维特比解码器，完全解码是不必要的。 相反，完全解码被用作假设检验者不能匹配或不符合期望置信水平的那些序列的“断路器”。