-
公开(公告)号：US20180337812A1
公开(公告)日：2018-11-22
申请号：US15783198
申请日：2017-10-13
发明人： Naman Rajiv Mody
CPC分类号： H04L27/2627 , H03M13/015 , H03M13/611 , H04L27/04 , H04L27/20
摘要： A method for encoding K bits of data, wherein K is a multiple of N is provided. The method includes a first step of mapping N consecutive bits of the K bits of data, starting from either its least significant bit or its most significant bit, to a point within a quadrant out of 2N quadrants of an N-dimensional space. The method includes a second step of mapping the subsequent contiguous N consecutive bits of the K bits of data, to a point within a sub-quadrant out of 2N quadrants of the N dimensional space within the previous quadrant. The method includes repeating the second step until all K bits of data have been mapped. The method includes a third step of obtaining N coordinate values of N consecutive bits of the data mapped last, wherein the N coordinate values represent the encoded code word for the K bits of data.
-
公开(公告)号：US10326629B2
公开(公告)日：2019-06-18
申请号：US15783198
申请日：2017-10-13
发明人： Naman Rajiv Mody
摘要： A method for encoding K bits of data, wherein K is a multiple of N is provided. The method includes a first step of mapping N consecutive bits of the K bits of data, starting from either its least significant bit or its most significant bit, to a point within a quadrant out of 2N quadrants of an N-dimensional space. The method includes a second step of mapping the subsequent contiguous N consecutive bits of the K bits of data, to a point within a sub-quadrant out of 2N quadrants of the N dimensional space within the previous quadrant. The method includes repeating the second step until all K bits of data have been mapped. The method includes a third step of obtaining N coordinate values of N consecutive bits of the data mapped last, wherein the N coordinate values represent the encoded code word for the K bits of data.
-
搜索结果
2 条记录 (耗时 0.011 秒)
