WO2020217253A1

WO2020217253A1 - Method and communication device for handling frame synchronization in asynchronous communication system

Info

Publication number: WO2020217253A1
Application number: PCT/IN2020/050371
Authority: WO
Inventors: Meenakshi SUNDARAM RAMAMOORTHY; Venkatesh RAMAIYAN; Devendra JALIHAL
Original assignee: INDIAN INSTITUTE OF TECHNOLOGY MADRAS (IIT Madras)
Priority date: 2019-04-26
Filing date: 2020-04-20
Publication date: 2020-10-29

Abstract

Accordingly, embodiments herein disclose a method for handling a frame synchronization in an asynchronous communication system. The method includes determining, by a communication device (100), a synchronization frame including a length based on a channel transition probability parameter and a distribution parameter. Further, the method includes configuring, by the communication device (100), a communication scheme based on the synchronization frame. Further, the method includes handling, by the communication device (100), the frame synchronization in the asynchronous communication system based on the communication scheme.

Description

Method and communication device for handling frame

synchronization in asynchronous communication system

FIELD OF INVENTION

[0001] The present disclosure relates to a wireless communication system, and more specifically related to the wireless communication system includes a transmitter and a receiver that communicate a random event, whose time of occurrence is not known. The present application is based on, and claims priority from an Indian Provisional Application Number 201941016696 filed on 26^th April, 2019 the disclosure of which is hereby incorporated by reference herein.

BACKGROUND

[0002] Some wireless sensor networks are employed to detect random events that occur over a vast time. Examples of such events include landslides, forest fires, intrusion and industrial manufacturing tasks. These fall in the area of machine type communication (MTC). In such event-driven systems, the information communicated is small, mostly to indicate the occurrence of the event. These systems require high reliability and a long battery life. As the events occur over a vast time, noise emulating a communication packet is as likely as the event itself, affecting reliable detection. This can be overcome by employing periodic messaging, as is the current practice, to reduce the uncertainty. This has the undesirable effect of reducing the battery life. Thus, the requirements of the system are in conflict.

[0003] The future of wireless communications is driven by applications demanding MTC, in addition to those demanding higher data rates. Prominent among such applications are Smart cities, Internet of Things (IoT) and Cyber Physical Systems (CPS). The MTC present several unique challenges to system design as the MTC are typically low rate systems, with strict constraints on delay, reliability and power. [0004] The communications in low rate systems typically involve short packets (few tens of bytes of application data) with relatively more metadata to perform among others, the task of frame synchronization. Also, the packets can occur infrequently, often in isolation, motivating the model of one shot communication. Here, due to noise, the detection of a small packet is hampered by the size of the transmission window it occurs in.

[0005] In the existing methods, synchronization (sync) word (or marker) designs and optimal receiver techniques based on the marker have been pursued independently. Further, a frame synchronization in low rate systems require joint design of sync words and receiver for achieving efficiency while supporting the required quality of service. In these applications, the use of maximum-likelihood detection would result in inordinate delay due to aperiodic transmission, hence sequential detection is preferred.

[0006] FIG. 1 illustrates probability of error in frame synchronization for some popular synchronization words in an asynchronous setup, according to an existing art as disclosed herein.

[0007] As shown in the FIG. 1, the system presents a probability of error in the frame synchronization for some popular sync words in an asynchronous setup (also known as one-shot communication) discussed below. The system transmits a sync frame of length N symbols (or slots) uniformly over a window of size A slots (where N « A). Consider the sync sequences used in here, the Barker sequences of length 7 and 13, { 1011000; 1111100110101], and a Neuman- Hofinan sequence of length 13, { 1111110011010] for the illustration. For a discrete-time additive white Gaussian noise (AWGN) channel and a simple correlation receiver in the FIG. 1, we plot the probability of error in frame synchronization as window size (A) increases. We note that the sync word is not suffixed with data and the correlation receiver is near optimal in such setups.

[0008] From the plots in FIG. 1(a) and FIG. 1(b), the probability of error, P(E), increases to one (for any sync word) as the window of the transmission A increases. Also, a target probability of error may be achieved by suitably adapting the sync word length and SNR (equivalently, symbol power) with A.

[0009] A sync word design based on uniform arrival distribution is suitable for all applications, although, in the presence of any prior knowledge of arrival, the design may not be optimal. Non-uniform prior is suited for systems where there is an inherent randomness in the source of communication, for example, a local event that is being monitored for decision making like monitoring forest fires. The information from fire weather index (FWI) that depends on time via temperature and moisture can be summarized as a non- uniform prior distribution and incorporated in sync word design. Similarly, other event-monitoring applications such as avalanche detection, land-slides, fault detection and structural monitoring, marine monitoring like tsunami, high tide and cyclone monitoring and other environment monitoring applications allow a non-uniform prior distribution.

[0010] These event-driven systems need to be energy sensitive, as the sensor life expectancy is in the order of a few years. As the communication cost dominates power consumption, the communication protocol plays a majority role in power saving. In low-rate systems, the sync word consumes most of the communication resources. Thus, the sync word design that exploits the prior knowledge has the potential to enhance the network life expectancy. A similar idea has been explored earlier where the fire monitoring sensors save energy by varying their activity according to the season.

[0011] In the existing systems, a Bayesian frame synchronization is considered. Uniform priors were considered while some works additionally exploited cross-layer information and some works performed joint frame synchronization and decoding. In another existing systems, a transmitter (sync word) design was also considered but without any reference to optimality. These works predominantly focused on the receiver.

[0012] The problem of optimal frame synchronization are studied in a discrete memoryless channel (DMC) for a packet transmitted in a large window. A low data rate regime is considered, where the packet transmission window size is exponential with respect to the size of the sync packet (the synchronization cost was shown to be insignificant in the high data regime). Most of the prior studies in asynchronous communication considered a uniform distribution for packet arrival. In the present application, a framework is generalized and studied where there is apriori information about packet arrival. In an earlier work, the problem of a general arrival distribution in the DMC presented a fixed length sync word that is not necessarily optimal for the setup.

[0013] In the existing methods, a tradeoff between the sync packet length and the synchronization threshold of a DMC is discussed when the sync packet arrival distribution is uniform. Here, the tradeoff under general arrival distribution and an application to the AWGN channel is discussed. The tradeoff permits the use of finite packet lengths for practical channels such as AWGN channel and wireless channels, where the symbol power can grow with asynchronism.

[0014] Thus, it is desired to address the above mentioned disadvantages or other shortcomings or at least provide a useful alternative.

OBJECT OF INVENTION

[0015] The principal object of the embodiments herein is to provide a method for handling a frame synchronization in an asynchronous communication system.

[0016] Another object of the embodiments herein is to determine a variable length of a synchronization frame based on an entropy parameter, a channel transition probability parameter (a matrix in the case of time-varying channels), and a distribution parameter

[0017] Yet, another object of the embodiments herein is to configure a communication scheme based on the variable length of the synchronization frame.

SUMMARY

[0018] Accordingly, embodiments herein disclose a method for handling a frame synchronization in an asynchronous communication system. The method includes determining, by a communication device, a synchronization frame including a length based on a channel transition probability parameter, and a function of a distribution parameter. Further, the method includes configuring, by the communication device, a communication scheme based on the synchronization frame. Further, the method includes handling, by the communication device, the frame synchronization in the asynchronous communication system based on the communication scheme. [0019] In an embodiment, determining, by the communication device, the variable length of the synchronization frame including the length based on the channel transition probability parameter, and the function of the distribution parameter includes transmitting the synchronization frame at a random time based on the channel transition probability parameter, and the function of the distribution parameter, and determining the variable length of the transmitted synchronization frame at the random time.

[0020] In an embodiment, the communication scheme is determined as a function of a time of transmission of the synchronization frame with length and the probability of an event occurring at that time instant.

[0021] In an embodiment, the length can be a variable length and.

[0022] In an embodiment, the length can be a constant length.

[0023] In an embodiment, the synchronization frame is based on a noise input symbol and a predefined best input symbol.

[0024] Accordingly, embodiments herein disclose a communication device for handling a frame synchronization in an asynchronous communication system. The communication device includes a processor coupled with a memory. The processor is configured to determine a synchronization frame including a length based on a channel transition probability parameter, and a function of the distribution parameter. Further, the processor configures a communication scheme based on the synchronization frame. Further, the processor is configured to handle the frame synchronization in the asynchronous communication system based on the communication scheme.

[0025] These and other aspects of the embodiments herein will be better appreciated and understood when considered in conjunction with the following description and the accompanying drawings. It should be understood, however, that the following descriptions, while indicating preferred embodiments and numerous specific details thereof, are given by way of illustration and not of limitation. Many changes and modifications may be made within the scope of the embodiments herein without departing from the spirit thereof, and the embodiments herein include all such modifications. BRIEF DESCRIPTION OF FIGURES

[0026] This method and system is illustrated in the accompanying drawings, throughout which like reference letters indicate corresponding parts in the various figures. The embodiments herein will be better understood from the following description with reference to the drawings, in which:

[0027] FIG. 1 illustrates probability of error in a frame synchronization for synchronization words in an asynchronous setup, according to an existing art;

[0028] FIG. 2 shows various hardware components of a communication device for handling a frame synchronization in an asynchronous communication system, according to an embodiment as disclosed herein;

[0029] FIG. 3 is a flow chart illustrating a method for handling the frame synchronization in the asynchronous communication system, according to an embodiment as disclosed herein;

[0030] FIG. 4 is an example illustration in which a discrete-time asynchronous communication model is depicted, according to an embodiment as disclosed herein;

[0031] FIG. 5 is an example illustration in which sync words $, for three consecutive positions is described, according to an embodiment as disclosed herein;

[0032] FIG. 6 is an example illustration in which a binary input binary output model for AWGN channel is depicted, according to an embodiment as disclosed herein;

[0033] FIG. 7 is an example illustration in which optimal average energy of different values of entropy (based on p, the parameter of geometric distribution) for the three distributions is depicted, according to an embodiment as disclosed herein;

[0034] FIG. 8 is an example illustration in which an upper bound of the missed detection and overlap error event probability for a communication link without symbol synchronization is depicted, according to an embodiment as disclosed herein; and

[0035] FIG. 9 illustrates when the shift sensitive part of the sequences overlap the trailing x (l)’s provide a Hamming distance between the sync words, according to an embodiment as disclosed herein. DETAILED DESCRIPTION OF INVENTION

[0036] The embodiments herein and the various features and advantageous details thereof are explained more fully with reference to the non-limiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. Descriptions of well- known components and processing techniques are omitted so as to not unnecessarily obscure the embodiments herein. Also, the various embodiments described herein are not necessarily mutually exclusive, as some embodiments can be combined with one or more other embodiments to form new embodiments. The term“of” as used herein, refers to a non- exclusive or, unless otherwise indicated. The examples used herein are intended merely to facilitate an understanding of ways in which the embodiments herein can be practiced and to further enable those skilled in the art to practice the embodiments herein. Accordingly, the examples should not be construed as limiting the scope of the embodiments herein.

[0037] As is traditional in the field, embodiments may be described and illustrated in terms of blocks which carry out a described function or functions. These blocks, which may be referred to herein as units or modules or the like, are physically implemented by analog or digital circuits such as logic gates, integrated circuits, microprocessors, microcontrollers, memory circuits, passive electronic components, active electronic components, optical components, hardwired circuits, or the like, and may optionally be driven by firmware and software. The circuits may, for example, be embodied in one or more semiconductor chips, or on substrate supports such as printed circuit boards and the like. The circuits constituting a block may be implemented by dedicated hardware, or by a processor (e.g., one or more programmed microprocessors and associated circuitry), or by a combination of dedicated hardware to perform some functions of the block and a processor to perform other functions of the block. Each block of the embodiments may be physically separated into two or more interacting and discrete blocks without departing from the scope of the invention. Likewise, the blocks of the embodiments may be physically combined into more complex blocks without departing from the scope of the invention.

[0038] The accompanying drawings are used to help easily understand various technical features and it should be understood that the embodiments presented herein are not limited by the accompanying drawings. As such, the present disclosure should be construed to extend to any alterations, equivalents and substitutes in addition to those which are particularly set out in the accompanying drawings. Although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are generally only used to distinguish one element from another.

[0039] The present application discloses a variable length sync frame for general arrival distributions and characterizes the scaling needed of the average sync frame length, for optimal frame synchronization, as a function of the entropy of the arrival distribution. The practical aspects of numerical results are described. The energy savings obtained using a non-uniform prior, noting the savings even with imperfect prior knowledge is described numerically. The set up without symbol timing and comments on the associated costs are also described.

[0040] Accordingly, embodiments herein disclose a method for handling a frame synchronization in an asynchronous communication system. The method includes determining, by a communication device, a synchronization frame including a length based on a channel transition probability parameter, and a function of a distribution parameter. Further, the method includes configuring, by the communication device, a communication scheme based on the synchronization frame. Further, the method includes handling, by the communication device, the frame synchronization in the asynchronous communication system with a delay constraint based on the communication scheme. [0041] Unlike conventional methods, the proposed method utilizes event arrival statistics in a design of the communication scheme. The entropy of the arrival statistics, the key parameter employed in the design, is identified. In the case of time- varying channels (for example wireless channel), the codeword design includes the channel statistics. The method can be implemented for the DMC, AWGN and time- varying channels, however the method can be easily extended to other popular types of channels.

[0042] The method can be used to improve battery life. The method can be used to handle the frame synchronization in the asynchronous communication system in a reliable manner. The communication scheme is similar to power design with knowledge of channel statistics. Here, the energy of the transmitted packet is adapted to the arrival probability of the event. The efficient communication scheme is designed based on uncertainty in time of communication

[0043] The method can be used for characterization of the sync packet necessary for optimal frame synchronization for general arrival distributions. For a distribution {a_v}, the proposed method can be used to adapt the sync packets s, with the arrival probability a_v and the entropy H for optimal performance. The proposed method can be used seek to design the sync word at a transmitter that is optimal in length or energy while achieving reliable detection.

[0044] Based on the proposed methods, we can design asynchronous communication system that are used in detecting forest fires, intrusion, land-slides and industrial manufacturing tasks.

[0045] Referring now to the drawings, and more particularly to FIG. 2 through 9, where similar reference characters denote corresponding features consistently throughout the figures, there are shown preferred embodiments.

[0046] FIG. 2 shows various hardware components of a communication device (100) for handling a frame synchronization in an asynchronous communication system, according to an embodiment as disclosed herein. The communication device (100) can be, for example, but not limited to, a smart phone, a smart watch, a networked sensor, a battery powered network device, an internet of things, a machine type communication device or the like. In an embodiment, the communication device includes a processor (110) having a frame synchronization engine (110a), a communicator (120), and a memory (130). The processor (110) is coupled with the memory (130) and the communicator (120).

[0047] The processor (110) is configured to execute instructions stored in the memory (130) and to perform various processes. The communicator (120) is configured for communicating internally between internal hardware components and with external devices via one or more networks.

[0048] Further, the memory (130) also stores instructions to be executed by the processor (110). The memory (130) may include nonvolatile storage elements. Examples of such non-volatile storage elements may include magnetic hard discs, optical discs, floppy discs, flash memories, or forms of electrically programmable memories (EPROM) or electrically erasable and programmable (EEPROM) memories. In addition, the memory (130) may, in some examples, be considered a non-transitory storage medium. The term“non-transitory” may indicate that the storage medium is not embodied in a carrier wave or a propagated signal. However, the term“non-transitory” should not be interpreted that the memory (130) is non-movable. In some examples, the memory (130) can be configured to store larger amounts of information than the memory. In certain examples, a non-transitory storage medium may store data that can, over time, change (e.g., in Random Access Memory (RAM) or cache).

[0049] In an embodiment, the synchronization engine (110a) is configured to determine a variable length of a synchronization frame based on an entropy parameter, a channel transition probability parameter, and a distribution parameter. In an embodiment, the variable length of the synchronization frame is determined by transmitting the synchronization frame at a random time based on the entropy parameter, the channel transition probability parameter, and the distribution parameter. Further, the synchronization engine (110a) configures the communication scheme based on the variable length of the synchronization frame. In an embodiment, the communication scheme is determined as a function of a time of transmission of the variable length of the synchronization frame and a probability of an event at that time instant. Further, the synchronization engine (110a) is configured to handle the frame synchronization in the asynchronous communication system based on the communication scheme.

[0050] Although the FIG. 2 shows various hardware components of the communication device (100) but it is to be understood that other embodiments are not limited thereon. In other embodiments, the communication device (100) may include less or more number of components. Further, the labels or names of the components are used only for illustrative purpose and does not limit the scope of the invention. One or more components can be combined together to perform same or substantially similar function to handle the the frame synchronization in the asynchronous communication system.

[0051] FIG. 3 is a flow chart (300) illustrating a method for handling the frame synchronization in the asynchronous communication system, according to an embodiment as disclosed herein. The operations (302-306) are performed by the processor (110).

[0052] At 302, the method includes determining the synchronization frame including the length based on the channel transition probability parameter, and the function of the distribution parameter. At 304, the method includes configuring the communication scheme based on the synchronization frame. At 306, the method includes handling the frame synchronization in the asynchronous communication system based on the communication scheme.

[0053] The various actions, acts, blocks, steps, or the like in the flow chart (300) may be performed in the order presented, in a different order or simultaneously. Further, in some embodiments, some of the actions, acts, blocks, steps, or the like may be omitted, added, modified, skipped, or the like without departing from the scope of the invention.

[0054] FIG. 4 is an example scenario in which a discrete-time asynchronous communication model is depicted, according to an embodiment as disclosed herein.

[0055] In an embodiment in FIG. 4, the discrete time asynchronous communication between a transmitter and a receiver over a DMC is described. The DMC is characterized by a finite input alphabet set X, a finite output alphabet set Y and channel transition probabilities Q (YIX) defined for x e X and y e Y A sync packet S_v of length of N_v symbols (Sv=( s₁, s₂, ... SN_V) and Si e X for all i= 1, 2, ...N_v) is is transmitted at some random time V = v. We assume that a symbol occupies a single slot and the transmission of the sync packet occupies slots { v, v + 1, ... v + Nv -1 } (as illustrated in the FIG. 2). Then, the channel input, denoted by {x_n }, in the slots n e {v, v + 1, v + N_v - 1 } is X_n = Sn-v+i and assume that x_n = x (0) in the other slots (i.e., x (0) e c and could represent zero input. The channel output, denoted by {y_n] is now distributed as Q (._ls_n-v+1) for slots h e {n, n + l,..,v + Nv - 1} and as Q(.|x(0)) otherwise. The sync packet transmission instant V is distributed as

denote the entropy of the distribution.

[0056] The problem of frame synchronization where the receiver seeks to identify the instant of transmission of the sync packet v from the channel output {y_n} is studied. The receiver is assumed to have knowledge of the channel transition probabilities Q( |), the arrival distribution {a_v} and the code book {s_v}· Let V'denote the estimate of V at the receiver. The receiver employs a sequential decoder and the

A

decision V= t depends only on the output sequence till time t + N_t - 1, i.e., {yi, y2, ... . yri-M -l}·

[0057] A sequential decoder is considered instead of, say, a maximum a-priori (MAP) decoder as the MAP decoder could incur infinite delay for a general arrival distribution. Now, the probability of error in frame synchronization would be

[0058] The cost considered in the present application is the average length or the average transmission cost or the average energy of the sync frame. Thus, a characterization of the sync packet necessary for asymptotic error free frame synchronization is sought, i.e.,

-> 0 optimal in average length (or energy).

[0059] In the prior work, the sync packet needed for optimal frame synchronization has been characterized for the uniform arrival distribution. Let A denote the asynchronous interval length (a_v= 1/A for all v) e {1,..A. and let N denqte the sync packet length (N_v = N for all v). Then, it was shown that there exists a sync word s of length N symbols and a sequential decoder V^', for all A > 1 such that

as A the

synchronization threshold of the DMC and characterizes the scaling needed of the sync frame length N to support asynchronism A. The synchronization threshold of the DMC was shown to be

where

is the Kullback-Leibler distance between the distributions and In the present application, we

generalize the above setup and study the problem of optimal frame synchronization for a general arrival distribution { a_v}. In particular, we seek a characterization of the sync packet necessary for asynchronous frame synchronization as a function of the entropy H of the arrival distribution.

[0060] FIG. 5 is an example scenario in which sync words s_t for three consecutive positions is depicted, according to an embodiment as disclosed herein. As shown in the FIG. 5, the sync words s, for three consecutive positions t {v -2, v -1, v] is shown. Here, a_v-2 ³ a_v-i ³ a_v such that M_V-2 < M_v-i = M_v. Note that as each M_t is of the form 2m-l, M_v-1 ³ M_V-2. Thus, the shift sensitive part of the sequences of s_v-2 and s_v- 1 (and S_v) do not overlap.

[0061] FIG. 6 is an example scenario in which a binary input binary output model for AWGN channel is depicted, according to an embodiment as disclosed herein. In the embodiment in FIG. 6, the channel transition probabilities are

with the factor 0 < p < 1. The synchronization threshold of this channel

[0062] An illustrative design for the AWGN channel is presented here based on the above binary input binary output model. This design is helpful in realistic channels like Rayleigh employing finite-state machine channel model (FSMC). A target error probability (reliability) to be achieved, say 10^-3 is chosen. The knowledge of the event statistics {a_v} is assumed, and entropy H is computed. A sequence that is sensitive to shift/rotation (like MLSR) of length N symbols as the sync word s is considered. The total energy of the sync word I I s I I ² is varied according to the entropy and the probability of event occurrence at that position. The receiver has the knowledge of the distribution, sync word and employs a sequential receiver to detect the sync word. This method can improve battery life using both perfect and imperfect knowledge of the event statistics.

[0063] As shown in the FIG. 7, a numerical study illustrating the energy required for reliable detection under general arrival over an AWGN channel is presented in scenarios with finite support sets (truncated distributions) that occur in practice. The figure illustrates optimal average energy of different values of entropy (based on p, the parameter of geometric distribution) for three distributions, according to an embodiment as disclosed herein.

[0064] In the embodiment in FIG. 7, in the notation (a) of the FIG. 7, we report the optimal average energy (directly affecting battery life) for different values of entropy for three distributions. The uniform distribution represents the existing scheme without exploiting event

statistics. The distributions, represent schemes exploiting

perfect and imperfect knowledge of event statistics respectively. The distributions are plotted for fixed entropy in the notation (b) of the FIG. 7, when the parameter of geometric distribution, p=0.1. We observe energy savings when event statistics are exploited, maximizing battery life expectancy.

[0065] FIG. 8 illustrates an upper bound °f the missed

detection and overlap error event probability for a

communication link without symbol synchronization, according to an embodiment as disclosed herein. As shown in the FIG. 6, an upper bound °f the missed detection and overlap error event

probability for a communication link without symbol synchronization is disclosed. Here, the sync word has been designed to achieve a set false alarm probability while using N_sps samples per

symbol (oversampling). The result is compared with the error that occurs when a genie provides the symbol synchronization.

[0066] FIG. 9 illustrates a more robust design for general arrival distribution. Here, the sequence needs to be protected from overlap error both at the head and tail of the sequence.

[0067] As shown in FIG. 9, a more robust design for general arrival distribution that provides a Hamming distance between the sync words is disclosed. The sync word begins with a sequence of M_v x(0)’s is followed by a sequence of length M_v. (The sequence used is the same for all sync words with equal M_v.). The rest of the sync word is filled with symbol x(l), the symbol that achieves the synchronization threshold. The sync word for the general arrival distribution includes an additional 2*M_V symbols of x(l) at the end. The additional symbols would ensure a minimum Hamming distance of W(N_t) or W( N_u) between any two sync words S_t and s„ at positions t and u (as illustrated in the FIG. 7, where, (N_t, N_u) > N_v and M_t, = M_u = 2 M V · [0068] In another example, the packet design employing two symbols is described here as shown in the FIG. 9. The two symbols are: (1.) noise input symbol, x(0), that produces noise statistics and (2) the best input symbol, x(l), that differentiates itself best from noise statistics. We construct a sequence as shown in the FIG. 9 with the help of a sequence that can be used to differentiate from its shifted versions, like the MLSR sequence.

[0069] The embodiments disclosed herein can be implemented through at least one software program running on at least one hardware device and performing network management functions to control the elements.

[0070] The foregoing description of the specific embodiments will so fully reveal the general nature of the embodiments herein that others can, by applying current knowledge, readily modify and/or adapt for various applications such specific embodiments without departing from the generic concept, and, therefore, such adaptations and modifications should and are intended to be comprehended within the meaning and range of equivalents of the disclosed embodiments. It is to be understood that the phraseology or terminology employed herein is for the purpose of description and not of limitation. Therefore, while the embodiments herein have been described in terms of preferred embodiments, those skilled in the art will recognize that the embodiments herein can be practiced with modification within the spirit and scope of the embodiments as described herein.

Claims

STATEMENT OF CLAIMS

aim:

. A method for handling a frame synchronization in an asynchronousommunication system, comprising:

determining, by a communication device (100), a synchronization frameomprising a length based on a channel transition probability parameter and aunction of a distribution parameter;

configuring, by the communication device (100), a communication schemeased on channel parameters and the synchronization frame; and

handling, by the communication device (100), the frame synchronization inhe asynchronous communication system based on the communication scheme. The method as claimed in claim 1, wherein determining, by the communicationevice (100), the synchronization frame comprising the length based on thehannel transition probability parameter and the function of the distributionarameter comprises:

transmitting the synchronization frame at random time when an event occursased on the channel transition probability parameter, and the function of theistribution parameter; and

determining the transmitted synchronization frame at the random time.

he method as claimed in claim 1, wherein the communication scheme isetermined as a function of a time of transmission of the synchronization frameomprising the length and a probability of an event at that time instant.

The method as claimed in claim 1, wherein the function of the distributionarameter is determined with apriori knowledge as a probability of the randomvent and as a result, the transmission, occurring at each time instant.

he method as claimed in claim 1, wherein the function of the distributionarameter derives an entropy parameter, wherein the entropy parameter isetermined as a function of the distribution

he method as claimed in claim 1, wherein the channel transition probabilityarameter is determined at a transmitter and a receiver of the asynchronousommunication system based on a channel model.

he method as claimed in claim 1, wherein the length is one of a variable lengthnd a constant length. A communication device (100) for handling a frame synchronization in an synchronous communication system, comprising:

a memory (130); and

a frame synchronization engine (110a), coupled with the memory (130), onfigured to:

determine a synchronization frame comprising a length based on a channelransition probability parameter and a function of a distribution parameter,

configure a communication scheme based on the synchronization frame, nd

handle the frame synchronization in the asynchronous communication ystem based on the communication scheme.

The communication device (100) as claimed in claim 8, wherein determine the ariable length of the synchronization frame comprising the length based on the hannel transition probability parameter and the function of the distribution arameter comprises:

transmit the synchronization frame at a random time based on the channelransition probability parameter, and function of the distribution parameter; and determine the variable length of the transmitted synchronization frame at the andom time.

he communication device (100) as claimed in claim 8, wherein the ommunication scheme is determined as a function of a time of transmission ofhe length of the synchronization frame and a probability of an event at that timenstant.

he communication device (100) as claimed in claim 8, wherein the distribution arameter is determined with apriori knowledge as a probability of the random vent and as a result, the transmission, occurring at each time instant.

he communication device (100) as claimed in claim 8, wherein the function ofhe distribution parameter derives an entropy parameter wherein the entropy arameter is determined as a function of the distribution

log(a_v).

he communication device (100) as claimed in claim 8, wherein the channelransition probability parameter is determined at a transmitter and a receiver of the synchronous communication system based on a channel model. he communication device (100) as claimed as claimed in claim 8, wherein theength is one of a variable length and a constant length.