Talk:Multi-carrier code-division multiple access

Telecommunications B‑class Low‑importance

	Telecommunication portal This article is within the scope of WikiProject Telecommunications, a collaborative effort to improve the coverage of Telecommunications on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.TelecommunicationsWikipedia:WikiProject TelecommunicationsTemplate:WikiProject TelecommunicationsTelecommunications
B	This article has been rated as B-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-importance on the project's importance scale.

MC-CDMA

MC-CDMA was born in February 1993, Nathan Yee proposed the original MC-CDMA system in \cite{Yee/Linnartz/Fettweis:1993} where serial to parallel converted bits are directly fed into the input of IFFT processor after coding applied, such that the number of subcarriers in the OFDM system equals to the code length of applied code. It can be seen that the same data symbol is duplicated in multiple carriers of OFDM symbol with the application of assigned code.

User $u_{0}$ take the code sequence $\textbf{C}_{0}$ where $\textbf{C}_{0} {}={} [c_{0,0},c_{0,1},\ldots,c_{0,M-1}]$ and the number of subcarriers of OFDM symbol $M_{d}$ in this case is equal to $M$.  — Preceding unsigned comment added by Nuwankumara (talk • contribs) 08:51, 1 August 2011 (UTC)[reply]

CDMA/OFDM

In September 1993 Fazel proposed a new MC-CDMA scheme \cite{Fazel:1993} and it was called CDMA/OFDM. It was implemented with a high end OFDM multiplexer compared to the complexity of spreading code were used. It was given two examples, in the first one it was considered $B$ length of data block from each user with $M_{d}$ number of subcarriers of OFDM multiplexer with $M_{d} = B \times G_{MC}$ where $G_{MC}$ is the processing gain due to spreading which is equal to the length of the spreading code $K$ in our notations.