• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.51-59
• /
• 2010

As more and more people are interest in mobile broadcasting, they want to use many kinds of mobile contents. On that account, DMB standard has been developed in Korea. Users can use various contents, because DMB System based on DAB System can provide not only audio service but also media service. However, as more contents increase, users will have to wait more to select Program List, which is why DMB System transports MPEG-2 TS contents by MSC. To solve this problem we propose that first we find major fields needed for generating program list, and then these fiends insert to FIC by extending UAI. We conduct some experiments to verify our proposed method is efficient. The results implies that our proposed method generate program list faster than that of previous method by 36.78%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3156-3167
• /
• 2020

One drawback of polar codes is that they are not universal, that is, to achieve optimal performance, different polar codes are required for different kinds of channel. This paper proposes a polar code construction scheme for Nakagami-m fading channel. The scheme fully considers the characteristics of Nakagami-m fading channel, and uses the optimized Bhattacharyya parameter bounds. The constructed code is applied to an orthogonal frequency division multiplexing (OFDM) system over Nakagami-m fading channel to prove the performance of polar code. Simulation result shows the proposed codes can get excellent bit error rate (BER) performance with successive cancellation list (SCL) decoding. For example, the designed polar code with cyclic redundancy check (CRC) aided SCL (L = 8) decoding achieves 1.1dB of gain over LDPC at average BER about 10^-5 under 4-quadrature amplitude modulation (4QAM) while the code length is 1024, rate is 0.5.

• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2024

Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.19-25
• /
• 2004

In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in terms of path metrics. Equivalently, multiple channel estimates are maintained and updated once a single symbol is received. Second, the best channel estimate from the above operation will be adopted to set up the whole trellis. The conventional adaptive Viterbi algorithm is then applied to detect the signal and further update the channel estimate alternately. A small delay is introduced for the symbol detection and the decision feedback to smooth the noise impact. An automatic switch between the above two operations is also proposed by exploiting the evolution of path metrics and the linear constraint inherent in the trellis mapping. Simulation has shown an overall excellent performance of the proposed scheme in terms of mean square error (MSE) for channel estimation, robustness to the initial channel guess, computational complexity, and channel equalization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.50-67
• /
• 2015

The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.642-648
• /
• 2009

In this paper, we use SA (Seysen's Algorithm) instead of LLL (Lenstra-Lenstra-Lovasz) to perform LRA (Lattice Reduction-Aided) detection. By using SA, the complexity of lattice reduction is reduced and the detection performance is improved Although the performance is improved using SA, there still exists a gap in the performance between SA-LRA and ML detection. To reduce the performance difference, we apply list of candidates scheme to SA-LRA. The list of candidates scheme finds a list of candidates. Then, the candidate with the smallest squared Euclidean distance is considered as the estimate of the transmitted signal. Simulation results show that the SA-LRA detection learn to quasi-ML performance. Moreover, the efficiency of the SA is shown to highly improve the channel matrix conditionality.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.1
• /
• pp.51-59
• /
• 2016

The progression of broadcasting technology changed the previous analogue broadcasting system into digital, which in result allowed several broadcasting programs to be transmitted as one stream by multiplexing. This multi channel environment interferes with audience to choose the program they want. EPG acts as supporter in this multi channel environment. The existing EPG system is limited in providing searching function with title, genre, date and Wish-list in multi-media environment. Thus, this thesis proposes new type EPG using PSIP information modification to respond with the change of broadcasting market. This type of EPG can be applied to several kinds of broadcasting systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6B
• /
• pp.358-366
• /
• 2007

Recently, FCC(Federal Communications Commission) has considered for that unlicensed device leases licensed devices' channel to overcome shortage of communication channels. Therefore, IEEE 802.22 WRAN(Wireless Regional Area Networks) working group progresses CR (Cognitive Radio) technique that is able to sense and adopt void channels that are not being occupied by the licensed devices. Channel selection is of the utmost importance because it can affect the whole system performance in CR network. Thus, we propose a policy-based dynamic channel selection architecture for cognitive radio network to achieve an efficient communication. We propose three kinds of method for channel selection; the first one is weighted channel selection, the second one is sequential channel selection, and the last one is combined channel selection. We can obtain the optimum channel list and allocates channels dynamically using the proposed protocol.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.475-479
• /
• 2010

The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

• BMB Reports
• /
• v.40 no.3
• /
• pp.302-314
• /
• 2007

N type calcium channels (CaV2.2) play a key role in the gating of transmitter release at presynaptic nerve terminals. These channels are generally regarded as parts of a multimolecular complex that can modulate their open probability and ensure their location near the vesicle docking and fusion sites. However, the proteins that comprise this component remain poorly characterized. We have carried out the first open screen of presynaptic CaV2.2 complex members by an antibody-mediated capture of the channel from purified rat brain synaptosome lysate followed by mass spectroscopy. 589 unique peptides resulted in a high confidence match of 104 total proteins and 40 synaptosome proteome proteins. This screen identified several known CaV2.2 interacting proteins including syntaxin 1, VAMP, protein phosphatase 2A, $G_{o\alpha}$, G$\beta$ and spectrin and also a number of novel proteins, including clathrin, adaptin, dynamin, dynein, NSF and actin. The unexpected proteins were classified within a number of functional classes that include exocytosis, endocytosis, cytoplasmic matrix, modulators, chaperones, and cell-signaling molecules and this list was contrasted to previous reports that catalogue the synaptosome proteome. The failure to detect any postsynaptic density proteins suggests that the channel itself does not exhibit stable trans-synaptic attachments. Our results suggest that the channel is anchored to a cytoplasmic matrix related to the previously described particle web.