• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.435-449
• /
• 1997

In this paper, a new metric, universal metric, is Proposed for sequential decoding of convolutional decoding. The complexity of Fano metric for Fano's sequential decoding algorithm is compared with that of the proposed universal metric. Since the Fano metric assumes that it has previous knowledge of channel transition probability, the complexity of Fano metric increases as the assumed channel error probability does not coincide with the true channel error probability. However, the universal metric dose not require the previous knowledge of the channel transition probability since it is estimated on a branch by branch basis. It is shown that the complexity of universal metric is much less than that of the Fano metric for bursty noisy channel.

• The Pure and Applied Mathematics
• /
• v.29 no.4
• /
• pp.401-419
• /
• 2022

In this paper, we introduce the notion of partial S-metric space and prove a common fixed point theorem in the respective setting. An example is presented to show the effectiveness of this approach.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.197-213
• /
• 2009

In this paper, we give some new denitions of $\cal{L}^*_\cal{M}$-fuzzy metric spaces and we prove a common xed point theorem for two mappings in complete $\cal{L}^*_\cal{M}$-fuzzy metric spaces. We get some improved versions of several xed point theorems in complete $\cal{L}^*_\cal{M}$-fuzzy metric spaces.

• Communications of the Korean Mathematical Society
• /
• v.22 no.3
• /
• pp.429-440
• /
• 2007

In this paper, a common fixed point theorem for weak compatible maps in complete fuzzy metric spaces is proved.

• Communications of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.399-410
• /
• 2012

We prove common fixed point theorems for weakly compatible mappings satisfying strict contractive conditions in fuzzy metric spaces using property (E.A). Our theorems extend a theorem of [1].

• Communications of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.347-356
• /
• 2012

In this paper, we present a common fixed point theorem for multivalued maps on $M$-complete fuzzy metric spaces. Also, the single valued case and an illustrative example are given.

• Communications of the Korean Mathematical Society
• /
• v.24 no.4
• /
• pp.581-594
• /
• 2009

In this paper, we establish a common fixed point theorem in complete fuzzy metric spaces which generalizes some results in [9].

• The Pure and Applied Mathematics
• /
• v.28 no.1
• /
• pp.1-13
• /
• 2021

In this note we use a generalization of coincidence point(a property which was defined by [1] in symmetric spaces) to prove common fixed point theorem on S-metric spaces for weakly compatible maps. Also the results are used to achieve the solution of an integral equation and the bounded solution of a functional equation in dynamic programming.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.583-586
• /
• 2004

Transition jitter noise is one of major sources of detection errors in high density recording channels. Implementation complexity of the optimal detector for such channels is high due to the data dependency and correlated nature of the jitter noise. In this paper, two types of hardware efficient sub-optimal detectors are derived by modifying branch metric of Viterbi algorithm and applied to partial response (PR) channels combined with run length limited modulation coding. The additional complexity over the conventional Viterbi algorithm to incorporate the modified branch metric is either a multiplication or an addition for each branch metric in the Viterbi trellis.

• Journal of Korea Society of Industrial Information Systems
• /
• v.2 no.2
• /
• pp.219-228
• /
• 1997

The Fano metric is the maximum likelihood decoding choice for convlutional code for binary symmetric channel. The Fano metric assumes that it has previous knowledge of channel error probability. However, the bit errors in real channel occur in bursts and the channel error probability can not be known exactly. Thus, the Fano metric is not the maximum likelihood choice for bursty-noise channel. In this paper universal metri which dose not require the previous knowlege of the channel transition probability is used for sequential decoding. It is shown that the complexity of the universal is much less than that of the Fano metric bursty-noise channel, since it is estimated on a branch by branch basis.