# US 8,543,867 B2 · Transmission of acknowledgement and negative acknowledgement in a wireless communication system > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,543,867 B2 - Document ID: US8543867B2 - Status: Granted - Kind: B2 - Application number: 12/753,421 - Filed: 2010-04-02 - Published: 2011-10-06 - Granted: 2013-09-24 - Earliest claimed: 2010-04-02 - Assignees: Sharp Laboratories of America, Inc. - Applicants: Ahmad Khoshnevis; Lizhong Zheng; John M. Kowalski - Inventors: Ahmad Khoshnevis; Lizhong Zheng; John M. Kowalski - Web page: https://patentgrep.com/patent/US8543867B2 ## CPC - H04L 1/0073: {Special arrangements for feedback channel} - H04L 1/1614: {using bitmaps} - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A communication device configured for transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK) is described. The communication device includes a processor and instructions stored in memory. The communication device determines one or more thresholds based on a size of one or more code words and generates a compressed ACK/NACK sequence. The compressed ACK/NACK sequence identifies one or more correctly received code words and one or more incorrectly received code words if the number of incorrectly received code words is less than the threshold. If the number of incorrectly received code words is greater than the threshold, the compressed ACK/NACK sequence indicates that all of the one or more code words were incorrectly received. ## Claims ### Claim 1 A communication device configured for compression and transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK), comprising: a processor; memory in electronic communication with the processor; instructions stored in the memory, the instructions being executable to: determine one or more thresholds based on a size of one or more code words; generate a compressed ACK/NACK sequence, wherein: the compressed ACK/NACK sequence identifies one or more correctly received code words and one or more incorrectly received code words if the number of incorrectly received code words is less than a first threshold of the one or more thresholds; and the compressed ACK/NACK sequence indicates that all of the one or more code words were incorrectly received if the number of incorrectly received code words is greater than the first threshold; wherein the communication device is selected from the group consisting of a wireless communication device and a base station. ### Claim 2 (depends on 1) The communication device of claim 1, wherein the instructions are further executable to receive a signal including one or more code words. ### Claim 3 (depends on 1) The communication device of claim 1, wherein the instructions are further executable to transmit the compressed ACK/NACK sequence. ### Claim 4 (depends on 1) The communication device of claim 1, wherein the compressed ACK/NACK sequence identifies one or more correctly received code words and one or more incorrectly received code words if the number of incorrectly received code words is equal to the first threshold. ### Claim 5 (depends on 1) The communication device of claim 1, wherein the compressed ACK/NACK sequence indicates each incorrectly received code word and at least one correctly received code word as an incorrectly received code word if the number of incorrectly received code words is equal to the threshold. ### Claim 6 (depends on 1) The communication device of claim 1, wherein the instructions are further executable to: partition an uncoded ACK/NACK sequence; and generate a compressed ACK/NACK sequence for each partition, wherein each partition uses one of the one or more thresholds. ### Claim 7 (depends on 1) The communication device of claim 1, wherein one of the group consisting of stronger code and unequal error protection is applied to one or more ACK/NACK bits corresponding to one or more designated code words. ### Claim 8 (depends on 7) The communication device of claim 7, wherein the one or more designated code words carry more sensitive information than other code words. ### Claim 9 (depends on 7) The communication device of claim 7, wherein the one or more designated code words are larger than other code words. ### Claim 10 (depends on 1) The communication device of claim 1, wherein the instructions are further executable to communicate threshold information with at least one other communication device. ### Claim 11 (depends on 1) The communication device of claim 1, wherein the instructions are further executable to format the compressed ACK/NACK sequence such that an ACK/NACK bit is sent only at times corresponding to bit transitions. ### Claim 12 (depends on 1) The communication device of claim 1, wherein the status of only one code word is reported for two or more code words if a spectral correlation between channels corresponding to the two or more code words is greater than a spectral threshold. ### Claim 13 (depends on 1) The communication device of claim 1, wherein the status of only one code word is reported for two or more code words if a spatial correlation between channels corresponding to the two or more code words is greater than a spatial threshold. ### Claim 14 (depends on 1) The communication device of claim 1, wherein the instructions are further executable to channel code the compressed ACK/NACK sequence. ### Claim 15 A communication device configured for balancing and transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK), comprising: a processor; memory in electronic communication with the processor; instructions stored in the memory, the instructions being executable to: receive an ACK/NACK sequence; balance the ACK/NACK sequence, wherein balancing comprises modifying the ACK/NACK sequence such that the ACK/NACK sequence has a more even distribution of ones and zeros; and transmit the ACK/NACK sequence. ### Claim 16 (depends on 15) The communication device of claim 15, wherein the ACK/NACK sequence is balanced using a scrambling sequence that is specific to the communication device. ### Claim 17 (depends on 16) The communication device of claim 16, wherein the scrambling sequence is selected from the group consisting of a static scrambling sequence, a semi-dynamic scrambling sequence and a dynamic scrambling sequence. ### Claim 18 (depends on 15) The communication device of claim 15, wherein the ACK/NACK sequence is balanced using Gray coding. ### Claim 19 (depends on 18) The communication device of claim 18, wherein the Gray coding is based on one selected from the group consisting of an algorithm and a look-up table. ### Claim 20 (depends on 15) The communication device of claim 15, wherein the ACK/NACK sequence is balanced using distribution shaping using a non-linear transformation. ### Claim 21 (depends on 20) The communication device of claim 20, wherein the distribution shaping is based on one selected from the group consisting of an algorithm and a look-up table. ### Claim 22 (depends on 15) The communication device of claim 15, wherein the ACK/NACK sequence is a compressed ACK/NACK sequence. ### Claim 23 (depends on 15) The communication device of claim 15, wherein the instructions are further executable to channel code the ACK/NACK sequence. ### Claim 24 (depends on 15) The communication device of claim 15, further comprising channel coding, on the communication device, the ACK/NACK sequence. ### Claim 25 A method for compression and transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK), comprising: determining, on a communication device, one or more thresholds based on a size of one or more code words; generating, on the communication device, a compressed ACK/NACK sequence, wherein: the compressed ACK/NACK sequence identifies one or more correctly received code words and one or more incorrectly received code words if the number of incorrectly received code words is less than a first threshold of the one or more thresholds; and the compressed ACK/NACK sequence indicates that all of the one or more code words were incorrectly received if the number of incorrectly received code words is greater than the first threshold; wherein the communication device is selected from the group consisting of a wireless communication device and a base station. ### Claim 26 (depends on 25) The method of claim 25, further comprising receiving, by the communication device, a signal including one or more code words. ### Claim 27 (depends on 25) The method of claim 25, further comprising transmitting, from the communication device, the compressed ACK/NACK sequence. ### Claim 28 (depends on 25) The method of claim 25, wherein the compressed ACK/NACK sequence identifies one or more correctly received code words and one or more incorrectly received code words if the number of incorrectly received code words is equal to the first threshold. ### Claim 29 (depends on 25) The method of claim 25, wherein the compressed ACK/NACK sequence indicates each incorrectly received code word and at least one correctly received code word as an incorrectly received code word if the number of incorrectly received code words is equal to the first threshold. ### Claim 30 (depends on 25) The method of claim 25, further comprising: partitioning, on the communication device, an uncoded ACK/NACK sequence; and generating, on the communication device, a compressed ACK/NACK sequence for each partition, wherein each partition uses one of the one or more thresholds. ### Claim 31 (depends on 25) The method of claim 25, wherein one of the group consisting of stronger code and unequal error protection is applied to one or more ACK/NACK bits corresponding to one or more designated code words. ### Claim 32 (depends on 31) The method of claim 31, wherein the one or more designated code words carry more sensitive information than other code words. ### Claim 33 (depends on 31) The method of claim 31, wherein the one or more designated code words are larger than other code words. ### Claim 34 (depends on 25) The method of claim 25, further comprising communicating threshold information with at least one other communication device. ### Claim 35 (depends on 25) The method of claim 25, further comprising formatting, on the communication device, the compressed ACK/NACK sequence such that an ACK/NACK bit is sent only at times corresponding to bit transitions. ### Claim 36 (depends on 25) The method of claim 25, wherein the status of only one code word is reported for two or more code words if a spectral correlation between channels corresponding to the two or more code words is greater than a spectral threshold. ### Claim 37 (depends on 25) The method of claim 25, wherein the status of only one code word is reported for two or more code words if a spatial correlation between channels corresponding to the two or more code words is greater than a spatial threshold. ### Claim 38 (depends on 25) The method of claim 25, further comprising channel coding, on the communication device, the compressed ACK/NACK sequence. ### Claim 39 (depends on 25) The method of claim 25, wherein the communication device is selected from the group consisting of a wireless communication device and a base station. ### Claim 40 A method for balancing and transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK), comprising: receiving, by a communication device, an ACK/NACK sequence; balancing, on the communication device, the ACK/NACK sequence, wherein balancing comprises modifying the ACK/NACK sequence such that the ACK/NACK sequence has a more even distribution of ones and zeros; and transmitting the ACK/NACK sequence from the communication device. ### Claim 41 (depends on 40) The method of claim 40, wherein the ACK/NACK sequence is balanced using a scrambling sequence that is specific to the communication device. ### Claim 42 (depends on 41) The method of claim 41, wherein the scrambling sequence is selected from the group consisting of a static scrambling sequence, a semi-dynamic scrambling sequence and a dynamic scrambling sequence. ### Claim 43 (depends on 40) The method of claim 40, wherein the ACK/NACK sequence is balanced using Gray coding. ### Claim 44 (depends on 43) The method of claim 43, wherein the Gray coding is based on one selected from the group consisting of an algorithm and a look-up table. ### Claim 45 (depends on 40) The method of claim 40, wherein the ACK/NACK sequence is balanced using distribution shaping using a non-linear transformation. ### Claim 46 (depends on 45) The method of claim 45, wherein the distribution shaping is based on one selected from the group consisting of an algorithm and a look-up table. ### Claim 47 (depends on 40) The method of claim 40, wherein the ACK/NACK sequence is a compressed ACK/NACK sequence. ### Claim 48 A non-transitory tangible computer-readable medium for compression and transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK) comprising executable instructions for: determining, on a communication device, one or more thresholds based on a size of one or more code words; generating, on the communication device, a compressed ACK/NACK sequence, wherein: the compressed ACK/NACK sequence identifies one or more correctly received code words and one or more incorrectly received code words if the number of incorrectly received code words is less than a first threshold of the one or more thresholds; and the compressed ACK/NACK sequence indicates that all of the one or more code words were incorrectly received if the number of incorrectly received code words is greater than the first threshold; wherein the communication device is selected from the group consisting of a wireless communication device and a base station. ### Claim 49 A non-transitory tangible computer-readable medium for balancing and transmission of Acknowledgement and Negative Acknowledgement (ACK/NACK) comprising executable instructions for: receiving an ACK/NACK sequence; balancing the ACK/NACK sequence, wherein balancing comprises modifying the ACK/NACK sequence such that the ACK/NACK sequence has a more even distribution of ones and zeros; and transmitting the ACK/NACK sequence.