Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers
Index assignment (IA) is a low-complexity joint source-channel coding technique that has the potential for use in low-latency and low-power applications, such as wireless sensor networks (WSNs). Though binary IA has been extensively studied for assigning binary indices to quantized codewords (or sym...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Open Journal of the Communications Society |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10158332/ |
| _version_ | 1797782818642722816 |
|---|---|
| author | Yunxiang Yao Wai Ho Mow |
| author_facet | Yunxiang Yao Wai Ho Mow |
| author_sort | Yunxiang Yao |
| collection | DOAJ |
| description | Index assignment (IA) is a low-complexity joint source-channel coding technique that has the potential for use in low-latency and low-power applications, such as wireless sensor networks (WSNs). Though binary IA has been extensively studied for assigning binary indices to quantized codewords (or symbols) under the assumption of binary symmetric channels (BSCs), real-world scenarios often use <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary modulations. Directly applying binary IAs designed for BSCs to <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary modulations results in suboptimal performance. In this paper, we investigate the <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary IA, which assigns <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary labels to quantized codewords (or symbols), assuming the use of a equiprobable lattice quantizer. For such a system, we derive a tight performance bound and propose a near-optimal IA scheme based on a two-step design. In addition, we propose explicit IA constructions for practical modulation schemes, including PAM, QAM, and PSK. Our proposed IA design is rigorously proven to be optimal for 3-PSK and QPSK, whereas for larger modulation orders, the proposed IA constructions approach the bounds within small gaps. Our simulations show that the constructed IA scheme can achieve significant energy savings compared to the conventional binary IA scheme. Specifically, in some WSN scenarios, the proposed IA for 16-QAM is shown to achieve significant reductions in energy consumption relative to the conventional binary counterpart. |
| first_indexed | 2024-03-13T00:17:18Z |
| format | Article |
| id | doaj.art-5233bca766934af09c8282773f06adc6 |
| institution | Directory Open Access Journal |
| issn | 2644-125X |
| language | English |
| last_indexed | 2024-03-13T00:17:18Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of the Communications Society |
| spelling | doaj.art-5233bca766934af09c8282773f06adc62023-07-11T23:00:53ZengIEEEIEEE Open Journal of the Communications Society2644-125X2023-01-0141350137010.1109/OJCOMS.2023.328798610158332Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice QuantizersYunxiang Yao0https://orcid.org/0000-0002-4494-595XWai Ho Mow1https://orcid.org/0000-0003-1804-0476Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, New Territories, Hong KongDepartment of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, New Territories, Hong KongIndex assignment (IA) is a low-complexity joint source-channel coding technique that has the potential for use in low-latency and low-power applications, such as wireless sensor networks (WSNs). Though binary IA has been extensively studied for assigning binary indices to quantized codewords (or symbols) under the assumption of binary symmetric channels (BSCs), real-world scenarios often use <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary modulations. Directly applying binary IAs designed for BSCs to <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary modulations results in suboptimal performance. In this paper, we investigate the <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary IA, which assigns <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-ary labels to quantized codewords (or symbols), assuming the use of a equiprobable lattice quantizer. For such a system, we derive a tight performance bound and propose a near-optimal IA scheme based on a two-step design. In addition, we propose explicit IA constructions for practical modulation schemes, including PAM, QAM, and PSK. Our proposed IA design is rigorously proven to be optimal for 3-PSK and QPSK, whereas for larger modulation orders, the proposed IA constructions approach the bounds within small gaps. Our simulations show that the constructed IA scheme can achieve significant energy savings compared to the conventional binary IA scheme. Specifically, in some WSN scenarios, the proposed IA for 16-QAM is shown to achieve significant reductions in energy consumption relative to the conventional binary counterpart.https://ieeexplore.ieee.org/document/10158332/Discrete memoryless channelindex assignmentjoint source-channel codingquantization |
| spellingShingle | Yunxiang Yao Wai Ho Mow Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers IEEE Open Journal of the Communications Society Discrete memoryless channel index assignment joint source-channel coding quantization |
| title | Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers |
| title_full | Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers |
| title_fullStr | Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers |
| title_full_unstemmed | Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers |
| title_short | Near-Optimal Nonbinary Index Assignment for Equiprobable Lattice Quantizers |
| title_sort | near optimal nonbinary index assignment for equiprobable lattice quantizers |
| topic | Discrete memoryless channel index assignment joint source-channel coding quantization |
| url | https://ieeexplore.ieee.org/document/10158332/ |
| work_keys_str_mv | AT yunxiangyao nearoptimalnonbinaryindexassignmentforequiprobablelatticequantizers AT waihomow nearoptimalnonbinaryindexassignmentforequiprobablelatticequantizers |