Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A computationally efficient and practically deployable adaptive reference code-based multiple access interference (MAI) cancellation scheme, in which the conventional transmitter-receiver architecture is minimally modified only at the receiver (and-or transmitter) end, is proposed for direct sequence code division multiple access (DS-CDMA) communication. Upon numerical and theoretical analyses, the proposed communications system is seen to always outperform the existing conventional communications system. The theoretical analyses and results as presented are generally useful and applicable to any situation wherein IS95 pseudo noise (PN) codes are employed towards multiple access. Copyright © 2009 John Wiley & Sons, Ltd.#R##N##R##N#Observation 2: (MAI Equation)#R##N##R##N#For arbitrary integer ${k}, k \geq 2$, primitive polynomial $({\rm over} {{GF}}(2)) {{{\phi}}}_{k}$, $J \subseteq \{ 0,1, \cdots ,P - 1\}$, $i \in J$ and complex numbers: $c_j (\forall j \in J)$, ${\bf d}_\alpha^{(i)}$, in reference to ${\cal P}{\cal N}({{k,{{\phi}}}}_{k})$, has the following properties: #R##N#${\left\langle {\sum\limits_{j \in J} {c_j {\bf{\rm s}}^{(j)} } ,{\bf d}_\alpha^{(i)} } \right\rangle = \left\langle {\sum\limits_{j = 0}^{P - 1} {c_j {\bf{\rm s}}^{(j)} } ,{\bf d}_\alpha^{(i)} } \right\rangle }\break { = \left\{ {\sum\limits_{j \in J,j \ne i}{c_j^* (1 + \alpha )} } \right\} +\left[ {c_i^* \left[ {\left( {P + 1} \right) - \left( {1 + \alpha } \right)} \right]} \right]}$.#R##N#$\left\langle {\sum\limits_{j \in J} {c_j {\bf{\rm s}}^{(j)} } ,{\bf d}_{ - 1}^{(i)} } \right\rangle = c_i^* \left( {P + 1} \right)$.#R##N#$\left\| {{\bf d}_\alpha^{(i)} } \right\|^2 \equiv \left\langle {{\bf d}_\alpha^{(i)} ,{\bf d}_\alpha^{(i)} } \right\rangle = P(1 + \alpha ^2 ) - 2\alpha$.#R##N##R##N##R##N##R##N#In Observation 1.1: $j \notin J:c_j = 0$. Observation 1.2 follows from Observation 1.1 by setting $\alpha = - 1$.#R##N##R##N#Observation 2: (MAI Performance of ${\rm PR}_i (\alpha )$) #R##N#$\tilde P_b^{\alpha ,i} \leq \tilde P_b^{0,i}$ if and if only $- 2{\rm SNR}_i /({\rm SNR}_i + {\rm SIR}_i )\, \leq \alpha \leq 0.$#R##N#$\tilde P_b^{\alpha ,i}$ is minimized with $\alpha = \alpha _i^{{\rm opt}} \equiv - {\rm SNR}_i /\break({\rm SNR}_i + {\rm SIR}_i ).$#R##N##R##N##R##N##R##N#Proof. The above propositions are easily proved by noting that $Q( \cdot )$ is a decreasing function.
['Jong Mook Won', 'Jung Soo Kim', 'Wang-Rae Kim']
I am writing a research paper on a idea Adaptive reference code-based MAI cancellation for DS-CDMA
[{"from": "human", "value": "I am writing a research paper on a idea Adaptive reference code-based MAI cancellation for DS-CDMA"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A computationally efficient and practically deployable adaptive reference code-based multiple access interference (MAI) cancellation scheme, in which the conventional transmitter-receiver architecture is minimally modified only at the receiver (and-or transmitter) end, is proposed for direct sequence code division multiple access (DS-CDMA) communication. Upon numerical and theoretical analyses, the proposed communications system is seen to always outperform the existing conventional communications system. The theoretical analyses and results as presented are generally useful and applicable to any situation wherein IS95 pseudo noise (PN) codes are employed towards multiple access. Copyright \u00a9 2009 John Wiley & Sons, Ltd.#R##N##R##N#Observation 2: (MAI Equation)#R##N##R##N#For arbitrary integer ${k}, k \\geq 2$, primitive polynomial $({\\rm over} {{GF}}(2)) {{{\\phi}}}_{k}$, $J \\subseteq \\{ 0,1, \\cdots ,P - 1\\}$, $i \\in J$ and complex numbers: $c_j (\\forall j \\in J)$, ${\\bf d}_\\alpha^{(i)}$, in reference to ${\\cal P}{\\cal N}({{k,{{\\phi}}}}_{k})$, has the following properties: #R##N#${\\left\\langle {\\sum\\limits_{j \\in J} {c_j {\\bf{\\rm s}}^{(j)} } ,{\\bf d}_\\alpha^{(i)} } \\right\\rangle = \\left\\langle {\\sum\\limits_{j = 0}^{P - 1} {c_j {\\bf{\\rm s}}^{(j)} } ,{\\bf d}_\\alpha^{(i)} } \\right\\rangle }\\break { = \\left\\{ {\\sum\\limits_{j \\in J,j \\ne i}{c_j^* (1 + \\alpha )} } \\right\\} +\\left[ {c_i^* \\left[ {\\left( {P + 1} \\right) - \\left( {1 + \\alpha } \\right)} \\right]} \\right]}$.#R##N#$\\left\\langle {\\sum\\limits_{j \\in J} {c_j {\\bf{\\rm s}}^{(j)} } ,{\\bf d}_{ - 1}^{(i)} } \\right\\rangle = c_i^* \\left( {P + 1} \\right)$.#R##N#$\\left\\| {{\\bf d}_\\alpha^{(i)} } \\right\\|^2 \\equiv \\left\\langle {{\\bf d}_\\alpha^{(i)} ,{\\bf d}_\\alpha^{(i)} } \\right\\rangle = P(1 + \\alpha ^2 ) - 2\\alpha$.#R##N##R##N##R##N##R##N#In Observation 1.1: $j \\notin J:c_j = 0$. Observation 1.2 follows from Observation 1.1 by setting $\\alpha = - 1$.#R##N##R##N#Observation 2: (MAI Performance of ${\\rm PR}_i (\\alpha )$) #R##N#$\\tilde P_b^{\\alpha ,i} \\leq \\tilde P_b^{0,i}$ if and if only $- 2{\\rm SNR}_i /({\\rm SNR}_i + {\\rm SIR}_i )\\, \\leq \\alpha \\leq 0.$#R##N#$\\tilde P_b^{\\alpha ,i}$ is minimized with $\\alpha = \\alpha _i^{{\\rm opt}} \\equiv - {\\rm SNR}_i /\\break({\\rm SNR}_i + {\\rm SIR}_i ).$#R##N##R##N##R##N##R##N#Proof. The above propositions are easily proved by noting that $Q( \\cdot )$ is a decreasing function."}]