Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this letter,  derive a low-complexity method for demodulating nonuniform PAM signals. With uniform Gray-coded M-PAM constellations, the reflective symmetry can be exploited to demodulate the signals with low complexity. Hover with nonuniform constellations, this symmetry is lost and more complicated computations are required.  derive an analytic expression for the max-log LLR functions and show that they are piecewise linear functions. Based on this,  devise a demodulation algorithm that has complexity   $\mathcal{O} \left(\log_2 M \right)$   as opposed to   $\mathcal{O} \left(M \right)$   for the exhaustive search.  also present an approximation with reduced complexity and only modest performance degradation.
['Magnus Sandell', 'Filippo Tosato', 'Amr Ismail']
I am writing a research paper on a idea Low Complexity Max-log LLR Computation for Nonuniform PAM Constellations
[{"from": "human", "value": "I am writing a research paper on a idea Low Complexity Max-log LLR Computation for Nonuniform PAM Constellations"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In this letter,  derive a low-complexity method for demodulating nonuniform PAM signals. With uniform Gray-coded M-PAM constellations, the reflective symmetry can be exploited to demodulate the signals with low complexity. Hover with nonuniform constellations, this symmetry is lost and more complicated computations are required.  derive an analytic expression for the max-log LLR functions and show that they are piecewise linear functions. Based on this,  devise a demodulation algorithm that has complexity   $\\mathcal{O} \\left(\\log_2 M \\right)$   as opposed to   $\\mathcal{O} \\left(M \\right)$   for the exhaustive search.  also present an approximation with reduced complexity and only modest performance degradation."}]