公开(公告)号：US20140079162A1

公开(公告)日：2014-03-20

申请号：US14030338

申请日：2013-09-18

Applicant: Texas Instruments Incorporated

Inventor： Mohamed Farouk Mansour ,  Srinath Hosur ,  JuneChul Roh

IPC: H04L1/00

CPC classification number: H04L1/0054 ,  H04L27/3405 ,  H04L27/38

Abstract: Embodiments of the invention provide a method of decoding of hexagonal constellations. The decoding methods exploit the inherent structure of the hexagonal grid to eliminate/minimize the requirements for distance computations. A constellation which has unused constellation points is received. A plurality of lookup tables is used for indicating whether a particular constellation point is used. The lookup tables are indexed using the two integers u and v. An initial estimate of u and v is found. The euclidean distance to an immediate four neighbors resulting in the immediate upper and lower integers for ū and v. The upper or lower integer that corresponds to the smalling distance is selected and all other immediate neighbors are computed. Assignment of constellation points on the hexagonal grid for a given constellation size is provided which exploits the inherent redundancy provided by the hexagonal grid. Assignment of codewords to the available constellation points to minimize the Hamming distance between adjacent codewords is also provided.

Abstract translation: 本发明的实施例提供了一种对六角形星座进行解码的方法。 解码方法利用六角网格的固有结构来消除/最小化距离计算的要求。 接收到具有未使用的星座点的星座。 多个查找表用于指示是否使用特定的星座点。 查找表使用两个整数u和v进行索引，找到u和v的初始估计。 欧几里德到立即四个邻居的距离，导致ū和v的立即上下整数。选择与小距离对应的上或下整数，并计算所有其他直接邻居。 提供给定星座大小的六边形网格上的星座点的分配，其利用由六边形网格提供的固有冗余。 还提供了将码字分配给可用的星座点以最小化相邻码字之间的汉明距离。

公开(公告)号：US08787477B2

公开(公告)日：2014-07-22

申请号：US14030338

申请日：2013-09-18

Applicant: Texas Instruments Incorporated

Inventor： Mohamed Farouk Mansour ,  Srinath Hosur ,  JuneChul Roh

IPC: H04L5/12 ,  H04L27/36

CPC classification number: H04L1/0054 ,  H04L27/3405 ,  H04L27/38

Abstract: Embodiments of the invention provide a methods for the assignment of codewords to the available constellation points to minimize the Hamming distance between adjacent codewords. An hexagonal constellation is modeled as a two-dimensional trellis with an horizontal axis varying across a plurality of constellation points and a vertical axis varying across a plurality of codewords [0, 1, . . . , N−1]. A best path through the trellis is found to select a single constellation point per each codeword where a codeword is to be assigned. A each state in the transition across the trellis diagram, a current score and the best path that leads to the state is stored in a memory. Each codeword is assigned to the selected constellation point. The hexagonal constellation is used for transmitting data in a communication system.

Abstract translation: 本发明的实施例提供了一种用于将码字分配给可用的星座点以使相邻码字之间的汉明距离最小化的方法。 六边形星座被建模为具有在多个星座点上变化的水平轴和在多个码字[0,1]上变化的垂直轴线）的二维网格。 。 。 ，N-1]。 发现通过网格的最佳路径是为每个码字选择一个单一的星座点，其中要分配码字。 跨越格状图的过渡中的每个状态，当前分数和导致状态的最佳路径被存储在存储器中。 每个码字被分配给所选择的星座点。 六边形星座用于在通信系统中传输数据。