Instructions for Preparation and Submission of

CT216 Project Report

CT216 Group N∗† ,
∗Dhirubhai Ambani University (DAU), Gandhinagar, India
Email (provide email of only one of the group members): † 202401001@[Link]

Abstract—This is a template for the preparation of CT216 to take to eventually publish a paper at a reputed conference
project report. Only electronic submissions in the form of or a journal.
a Portable Document Format (PDF) file will be accepted Organization: Describe how you have organized your report
generated using this LATEXtemplate. The LATEX style file is
([Link]). Your project will be evaluated on the basis of in this section. For example, Section II describes the proposed
the quality of the manuscript of this report that you will submit. approach.
The manuscript should not exceed FIVE pages. Notations: If you are using some mathematical notations
consistently in the report, define them here so that the reader
I. I NTRODUCTION
can refer to this paragraph and quickly understand your
All submitted reports will be judged based on their quality. mathematical notations. For example RN ×1 denotes a real-
Please review several papers under the Popular tab of IEEE valued space of N × 1 real-valued vectors and CM ×N denotes
Communication Letters. Your paper should have the “look and a space of matrices of size M × N with complex-valued
feel” of such papers. elements. The notation X ∼ CN(µ, σ 2 ) denotes complex
Introduction section should begin with a general introduc- Gaussian distribution with mean µ and variance σ 2 , etc.
tion to the subject you have investigated. This section should
be like a funnel - broad at the beginning (describing broad II. P ROPOSED A PPROACH
contours and outlines of the general research domain) but A. Signal Model
gradually narrowing down and getting focused at the end on The matrix of received signal from M antennas over L
the specific topic you have researched. symbols at the input to our proposed algorithm is written as
Related Works: This is the subsection under Introduction
section that describes all the relevant literature you have stud- Y = A S + N, (1)
ied. You should use the IEEE style of citations, for example, where A ∈ C M ×K
is a matrix whose element Am,k on the
you can cite Shannon’s paper as [1]. Similarly, other path- mth row and the kth column is the coefficient of the channel
breaking papers are cited as [2],[3],[4], [5],[6], etc. Update to the mth receive antenna from the kth transmitter.
the bibtex file “CT216 paper [Link]” provided to you by The above shows how to write a mathematical equation and
populating it with the BibTex citation entries of all the papers how to label it so that you can later refer to it as (1).
you have studied and you would like to include in this related Sometimes you may want to write a multiline equation. You
works subsection. can use the following way. Let a correlation matrix RL ∈
Contributions: You can begin this section by stating CM ×M be defined as
“Amidst the above backdrop, the contributions of our work L
are as follows:” or “To address the limitations of the prior ∆ 1 1 X
RL = Y YH = (A Sℓ + Nℓ )(A Sℓ + Nℓ )H
related works outlined above, we propose in this paper so-and- LM LM
ℓ=1
so, and these are the novelties of our proposal.” Subsequently, a
= A R̃S,L AH /M + R̃n,L + C̃n,s,L = UL ΛL UH
L , (2)
you should list the novelties using the bulleted environment
of the LaTex as follows. Refer to [Link] file to understand all the LaTex
1) Describe first novelty, why no one has thought of this shortcuts you can use.
before
B. Analysis and Insights
2) Describe your second clever idea, why it was difficult to
solve and what innovation you brought in to solve this You can insert bulletized lists as
problem. • Item 1
3) Describe quantitatively how your research extends the • Item 2
existing state of the art. • Etc.
4) Etc. and bulletized lists with headings as
It is okay if you do not have any ground-breaking novel idea by Item 1 this is item 1.
the time you submit this report. However, remember that this Item 2 this is item 2.
report is just an initial step out of several that you would need Item 3 etc.
 10 0

Probability of Bit Error Avg. over 3 users

10 -1

10 -2

ZF detector (Pilot-based CE, non-orthogonal UE)

Proposed method (Pilot-based CE, non-orthogonal UE)
Proposed method(Ideal CE, non-orthogonal UE)
10 -3 ZF detector (Ideal CE, non-orthogonal UE)
ZF detector (Pilot-based CE, orthogonal UE)
Proposed method (Pilot-based CE, orthogonal UE)
Proposed method(Ideal CE, orthogonal UE)
ZF detector (Ideal CE, orthogonal UE)
10 -4
0 2 4 6 8 10 12
SNR (dB)

Fig. 1. Average BER over K = 3 UE for orthogonal and non-orthogonal

channel matrices as a function of SNR, with M = 32, L = 100, Lp = 3
and pilot symbol power Pp = 0dB.

III. N UMERICAL R ESULTS

Provide your results in this section.
To include a figure, you can use the following construction.
Here, you can control the size of the figure (3.0) for the
above in the first bracket, provide the name in the second
bracket, provide the title of the figure in the third, and provide
a lable in the fourth bracket so that you can later refer to the
figure as Fig. 1.
IV. C ONCLUSION
Conclusions and next steps go here.
ACKNOWLEDGMENT
We thank everyone who helped us in any way.
H ONOR C ODE
Provide the honor code here, signed by all the group
members.
Use the sixth page only for the honor code and the Refer-
ences list.
R EFERENCES
[1] C. E. Shannon, “A mathematical theory of communication,” Bell System
Technical Journal, vol. 27, no. 3, pp. 379–423, 1948.
[2] R. E. Kalman, “A new approach to linear filtering and prediction
problems,” Journal of Basic Engineering, vol. 82, no. 1, pp. 35–45, 1960.
[3] R. G. Gallager, Low-Density Parity-Check Codes. PhD thesis, Mas-
sachusetts Institute of Technology, 1960.
[4] D. J. C. MacKay and R. M. Neal, “Good error-correcting codes based
on very sparse matrices,” in Proceedings of the 5th IMA Conference on
Cryptography and Coding, pp. 100–111, 1995.
[5] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near shannon limit error-
correcting coding and decoding: Turbo-codes,” in Proceedings of ICC ’93
- IEEE International Conference on Communications, vol. 2, pp. 1064–
1070, 1993.
[6] E. Arıkan, “Channel polarization: A method for constructing capacity-
achieving codes for symmetric binary-input memoryless channels,” IEEE
Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009.