公开(公告)号：US5703911A

公开(公告)日：1997-12-30

申请号：US516217

申请日：1995-08-17

申请人： Mao-Chao Lin ,  Jia-Yin Wang

发明人： Mao-Chao Lin ,  Jia-Yin Wang

IPC分类号： H03M13/41 ,  H04L27/18 ,  H03M13/12 ,  H04L1/00

CPC分类号： H03M13/256 ,  H03M13/41 ,  H04L27/186

摘要： This invention is a decoding method for a special class of trellis codes which have large free distances. The encoding of the trellis code to be decoded can be implemented by employing a single binary convolutional code followed by more than one processor. The decoding can be implemented by using the trellis of the binary convolutional code and additional processors.

摘要翻译： 本发明是一种具有较大空闲距离的特殊级格码格式的解码方法。 要解码的网格码的编码可以通过采用单个二进制卷积码，后跟多于一个的处理器来实现。 可以通过使用二进制卷积码的网格和附加处理器来实现解码。

公开(公告)号：US5570391A

公开(公告)日：1996-10-29

申请号：US398797

申请日：1995-03-06

申请人： Mao-Chao Lin ,  Jia-Yin Wang

发明人： Mao-Chao Lin ,  Jia-Yin Wang

IPC分类号： H03M13/25 ,  H04L27/18 ,  H04L27/36 ,  H03M13/12

CPC分类号： H03M13/256 ,  H03M13/25 ,  H04L27/186

摘要： This invention is a multilevel trellis coding method which employs a single binary convolutional code and is called a single-stage and multilevel trellis coding. This invention can be generalized by combining several single-stage multilevel codings together to form a multilevel trellis coding for which the number of stages is less than the number of coding levels. New trellis coded modulation systems and binary trellis coding systems which are designed by the aforementioned trellis coding method are better than the currently known coding systems if the communication channels are additive white Gaussian noise (AWGN) channels.

摘要翻译： 本发明是采用单个二进制卷积码并被称为单级和多级网格编码的多级网格编码方法。 本发明可以通过将几个单级多级编码组合在一起来形成多级网格编码，其级数小于编码级数。 如果通信信道是加性白高斯噪声（AWGN）信道，则通过上述网格编码方法设计的新网格编码调制系统和二进制网格编码系统比当前已知的编码系统更好。

公开(公告)号：US5805642A

公开(公告)日：1998-09-08

申请号：US771266

申请日：1996-12-20

申请人： Ruey-Yi Wei ,  Mao-Chao Lin

发明人： Ruey-Yi Wei ,  Mao-Chao Lin

IPC分类号： H04L25/03 ,  H04L27/22 ,  H04L27/38

CPC分类号： H04L27/22 ,  H04L25/03178 ,  H04L27/38

摘要： This invention is a method for the detecting received signal sequences of a communication system transmitting a differentially encoded MPSK (Multiple Phase Shift Keying) or a differentially encoded 2MAPSK (2M-level Amplitude/Phase Shift Keying) signal sequence. The operation of detecting the currently received signal sample is based on a signal reference which is recursively generated by two or more previously generated signal references.

摘要翻译： 本发明是用于检测发送差分编码的MPSK（多相移键控）或差分编码的2MAPSK（2M级幅度/相移键控）信号序列的通信系统的接收信号序列的方法。 检测当前接收到的信号样本的操作是基于由两个或更多个先前产生的信号参考递归地产生的信号参考。

公开(公告)号：US20060126748A1

公开(公告)日：2006-06-15

申请号：US11184681

申请日：2005-07-19

申请人： Mao-Chao Lin ,  Shang-Kang Deng

发明人： Mao-Chao Lin ,  Shang-Kang Deng

IPC分类号： H04K1/10

CPC分类号： H04L27/2624

摘要： A method for reducing the peak-to-average power ratio of the time-domain signal in a communication system using multi-carrier modulation is provided herein. The present invention is based on the method of recursive clipping and filtering to reduce the peak-to-average power ratio and out-of-band spectrum, but during the recursive process, the distortion of the multi-carrier modulated signal is controlled to be bounded within a specific region. In an additive white Gaussian noise channel with high signal-to-noise ratio, the present invention could achieve significantly lower error rate and the error floor phenomenon is almost completely removed. Therefore the power amplifier could be operated at higher average output power and a smaller range of linearity.

摘要翻译： 本文提供了一种减少使用多载波调制的通信系统中的时域信号的峰均功率比的方法。 本发明是基于减少峰均功率比和带外频谱的递归削减和滤波的方法，但是在递归处理过程中，多载波调制信号的失真被控制为 在特定地区范围内。 在具有高信噪比的加性白高斯噪声信道中，本发明可以实现显着降低的误码率，并且几乎完全消除了误差平台现象。 因此，功率放大器可以在更高的平均输出功率和较小的线性范围内运行。

公开(公告)号：US08156412B2

公开(公告)日：2012-04-10

申请号：US12568673

申请日：2009-09-29

申请人： Mao-Chao Lin ,  Chia-Fu Chang

发明人： Mao-Chao Lin ,  Chia-Fu Chang

IPC分类号： H03M13/03

CPC分类号： H03M13/3977 ,  H03M13/13 ,  H03M13/3944 ,  H03M13/45

摘要： A tree decoding method for decoding a linear block code is provided. According to the tree decoding method, an estimated path metric of node v is f(v)=g(v)+h(v), where g(v) represents a sum of bit metrics of all bits on a path from the root node to the node v, and h(v) represents a lowest bound of estimated accumulated bit metrics from the node v to the goal node. The present invention creatively improves the approach for calculating h(v). According to the present invention, some parity bits are only related to a part of the information bits, according to which the edge metric h(v) of the parity bits can be preliminarily incorporated into the path metric of the part of the information bits. As such, some nodes having inferior path metric could be eliminated in advance, thus minimizing the searching range and simplifying the decoding complexity.

摘要翻译： 提供了用于解码线性块码的树解码方法。 根据树解码方法，节点v的估计路径度量为f（v）= g（v）+ h（v），其中g（v）表示从根的路径上的所有比特的比特度量的和 节点到节点v，并且h（v）表示从节点v到目标节点的估计的累积比特度量的最低界限。 本发明创造性地改进了计算h（v）的方法。 根据本发明，一些奇偶校验位仅与信息比特的一部分有关，根据该比特，奇偶校验位的边沿度量h（v）可以预先并入信息比特的一部分的路径度量。 因此，可以预先消除具有较差路径度量的一些节点，从而最小化搜索范围并简化解码复杂度。

公开(公告)号：US08027398B2

公开(公告)日：2011-09-27

申请号：US12142462

申请日：2008-06-19

申请人： Mao-Chao Lin ,  Shang-Kang Deng ,  Tien-Hui Chen ,  Yu-Hung Lo

发明人： Mao-Chao Lin ,  Shang-Kang Deng ,  Tien-Hui Chen ,  Yu-Hung Lo

IPC分类号： H04K1/10 ,  H04L27/28 ,  H04L25/00

CPC分类号： H04L27/2614 ,  H04L27/2615

摘要： The method contains the following steps. First, in a MCM system with N sub-carriers, the baseband signal blocks Xj, j=1, 2, . . . ,B are supplemented with zeros and processed with LN-point IFFT, respectively, to obtain L-time oversampled time-domain signal blocks xj, j=1,2, . . . ,B. Then, xj undergoes Q Time Domain Circular Shifts or Frequency Domain Circular Shifts to obtain Q signal blocks {tilde over (x)}j(ij), ij=1, Λ, Q. Subsequently, a B×B unitary transform is performed against ( x1, {tilde over (x)}2(i2), . . . , {tilde over (x)}B(iB)). After the unitary transform, for each (i2, . . . , iB) a combination having B time-domain signal blocks is obtained as follows: ({tilde over (y)}1(i2, . . . , iB), {tilde over (y)}2(i2, . . . , iB), . . . , {tilde over (y)}B(i2, . . . ,iB))=( x1, {tilde over (x)}2(i2), . . . , {tilde over (x)}B(iB)) cU where U is the B×B unitary matrix, and c is an arbitrary constant (c≠0). Finally, the total QB−1 combinations are compared against each other to select a best candidate for transmission that could produce the lowest peak value, or the smallest PAPR, or the lowest clipping noise power.

摘要翻译： 该方法包含以下步骤。 首先，在具有N个子载波的MCM系统中，基带信号块Xj，j = 1,2。 。 。 ，B分别用零补充并用LN点IFFT进行处理，以获得L时间过采样时域信号块xj，j = 1,2。 。 。 ，B。 然后，xj经历Q时域循环移位或频域循环移位，以获得Q信号块{（i），ij = 1，Λ，Q）。随后，对B×B单位变换进行反对 （x1，{tilde over（x）} 2（i2），...，{tilde over（x）} B（iB））。 对于每个（i2，...，iB），对于每个（i2，...，iB），具有B个时域信号块的组合获得如下：（{tilde over（y）} 1（i2，...，iB） （y）} 2（i2，...，iB），...，{tilde over（y）} B（i2，...，iB））=（x1，{tilde over（x）} 2（i2），...，{tilde over（x）} B（iB））cU其中U是B×B酉矩阵，c是任意常数（c≠0）。 最后，将总QB-1组合彼此进行比较，以选择可产生最低峰值或最小PAPR或最低剪辑噪声功率的传输的最佳候选。

公开(公告)号：US20100318873A1

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

申请号：US12568673

申请日：2009-09-29

申请人： Mao-Chao Lin ,  Chia-Fu Chang

发明人： Mao-Chao Lin ,  Chia-Fu Chang

IPC分类号： H03M13/05 ,  G06F11/10 ,  H03M13/03 ,  G06F11/08

CPC分类号： H03M13/3977 ,  H03M13/13 ,  H03M13/3944 ,  H03M13/45

摘要： A tree decoding method for decoding a linear block code is provided. According to the tree decoding method, an estimated path metric of node v is f(y)=g(v)+h(v), where g(v) represents a sum of bit metrics of all bits on a path from the root node to the node v, and h(v) represents a lowest bound of estimated accumulated bit metrics from the node v to the goal node. The present invention creatively improves the approach for calculating h(v). According to the present invention, some parity bits are only related to a part of the information bits, according to which the edge metric h(v) of the parity bits can be preliminarily incorporated into the path metric of the part of the information bits. As such, some nodes having inferior path metric could be eliminated in advance, thus minimizing the searching range and simplifying the decoding complexity.

摘要翻译： 提供了用于解码线性块码的树解码方法。 根据树解码方法，节点v的估计路径度量为f（y）= g（v）+ h（v），其中g（v）表示从根的路径上的所有比特的比特度量的和 节点到节点v，并且h（v）表示从节点v到目标节点的估计的累积比特度量的最低界限。 本发明创造性地改进了计算h（v）的方法。 根据本发明，一些奇偶校验位仅与信息比特的一部分有关，根据该比特，奇偶校验位的边沿度量h（v）可以预先并入信息比特的一部分的路径度量。 因此，可以预先消除具有较差路径度量的一些节点，从而最小化搜索范围并简化解码复杂度。

公开(公告)号：US20090147870A1

公开(公告)日：2009-06-11

申请号：US12142462

申请日：2008-06-19

申请人： Mao-Chao LIN ,  Shang-Kang Deng ,  Tien-Hui Chen ,  Yu-Hung Lo

发明人： Mao-Chao LIN ,  Shang-Kang Deng ,  Tien-Hui Chen ,  Yu-Hung Lo

IPC分类号： H04L27/28

CPC分类号： H04L27/2614 ,  H04L27/2615

摘要： The method contains the following steps. First, in a MCM system with N sub-carriers, the baseband signal blocks Xj, j=1, 2, . . . ,B are supplemented with zeros and processed with LN-point IFFT, respectively, to obtain L-time oversampled time-domain signal blocks xj, j=1,2, . . . ,B. Then, xj undergoes Q Time Domain Circular Shifts or Frequency Domain Circular Shifts to obtain Q signal blocks {tilde over (x)}j(ij), ij=1,Λ,Q. Subsequently, a B×B unitary transform is performed against ( x1,{tilde over (x)}2(i2), . . . ,{tilde over (x)}B(iB)). After the unitary transform, for each (i2, . . . ,iB) a combination having B time-domain signal blocks is obtained as follows: ({tilde over (y)}1(i2, . . . ,iB),{tilde over (y)}2(i2, . . . ,iB), . . . ,{tilde over (y)}B(i2, . . . ,iB)=( x1,{tilde over (x)}2(i2), . . . ,{tilde over (x)}B(iB)) cU where U is the B×B unitary matrix, and c is an arbitrary constant (c≠0). Finally, the total QB-1 combinations are compared against each other to select a best candidate for transmission that could produce the lowest peak value, or the smallest PAPR, or the lowest clipping noise power.

摘要翻译： 该方法包含以下步骤。 首先，在具有N个子载波的MCM系统中，基带信号块<οstyle=“single”> Xj，j = 1,2。 。 。 ，B分别用零补充并用LN点IFFT进行处理，以获得L时间过采样的时域信号块 xj，j = 1,2。 。 。 ，B。 然后， xj经历Q时域循环移位或频域循环移位，以获得Q信号块（波形符号（x）} j（i j ），ij = 1 ，Lambda，Q。 随后，针对（ x1，{tilde over（x）} 2（i 2 ），...，{tilde over（x） } B（i B ））。 在单位变换之后，对于每个（i2，...，iB），具有B个时域信号块的组合获得如下：（{tilde over（y）} 1（i 2 < 2，...，i B ），{tilde over（y）} 2（i B ）， ...，{tilde over（y）} B（i 2 ，...，i B ）=（ x1， （x）} 2（i 2 ），...，{tilde over（x）} B（i B ））cU其中U是BxB酉矩阵 ，并且c是任意常数（c <0），最后，将总QB-1组合相互比较，以选择可产生最低峰值或最小PAPR或最低PAPR的最佳传输候选 削减噪声功率。

公开(公告)号：US5841818A

公开(公告)日：1998-11-24

申请号：US587478

申请日：1996-01-17

申请人： Mao-Chao Lin ,  Jia-Yin Wang

发明人： Mao-Chao Lin ,  Jia-Yin Wang

IPC分类号： H03M13/25 ,  H03M13/41 ,  H03M13/12

CPC分类号： H03M13/6325 ,  H03M13/256 ,  H03M13/3961 ,  H03M13/41

摘要： A trellis code of a special class is encoded by employing a binary convolutional code with a small constraint length, followed by a convolutional processor and a signal mapper. The trellis code is decoded by the trellis of the binary convolutional code.

摘要翻译： 通过采用具有小约束长度的二进制卷积码来编码特殊类的网格码，随后是卷积处理器和信号映射器。 网格码由二进制卷积码的网格解码。

公开(公告)号：US5822375A

公开(公告)日：1998-10-13

申请号：US654125

申请日：1996-05-28

申请人： Ruey-Yi Wei ,  Mao-Chao Lin

发明人： Ruey-Yi Wei ,  Mao-Chao Lin

IPC分类号： H04L27/233 ,  H03D3/22 ,  H04L27/22

CPC分类号： H04L27/2332

摘要： This invention is a method for detecting received signal sequences of a communication system transmitting differentially encoded MPSK (Multiple Phase Shift Keying) signal sequences. This invention uses previously received signal samples and previously decided data phases to generate a phase reference for the current operation of detecting the received signal sample. The phase reference can be easily generated by a recursive form.

摘要翻译： 本发明是用于检测发送差分编码的MPSK（多相移键控）信号序列的通信系统的接收信号序列的方法。 本发明使用先前接收到的信号样本和先前确定的数据相位来产生用于检测接收信号样本的当前操作的相位参考。 相位参考可以通过递归形式容易地生成。