Sign In to Follow Application
View All Documents & Correspondence

Wavelength Based Modulation Of Orthogonal Frequencies

Abstract: Abstract Wavelength-based Modulation of Orthogonal Frequencies The invention related to a method for transmitting a signal using wavelength-based modulation in a network. In one embodiment this can be accomplished by identifying a fundamental frequency (f0) of the signal provided by the network, and using the same to form one or more of higher harmonic frequencies. The identified frequencies are orthogonal to each other over a time interval of 1/f0 seconds. Identifying wavelength of each of the harmonic frequencies and modulating each of the identified wavelength with a symbol. Summing all the modulated harmonics and transmit over channel or store the same for further processing. Figure 2 (For publication)

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
31 March 2017
Publication Number
40/2018
Publication Type
INA
Invention Field
COMMUNICATION
Status
Email
afsar@krishnaandsaurastri.com
Parent Application
Patent Number
Legal Status
Grant Date
2024-06-05
Renewal Date

Applicants

Tejas Networks Limited
Plot No. 25, JP Software Park, Electronics City, Phase-1, Hosur Road, Bengaluru-560100, Karnataka, India

Inventors

1. Vinod Kumar Madaiah
201, B Block, Vintage Elite, Vijaya Bank Layout, Bannerghatta road, Kodichikanahalli bengaluru, karnataka 560076, India
2. Dr. Kumar Nellicherry Sivarajan
Viswanatha Nivas, #1595,2nd cross, Nagappa block, Bangalore, Karnataka 560021, India

Specification

Field of the Invention The present invention related to a wireless communication and, more particularly to a method for transmitting a signal using wavelength-based modulation in a network. Background of the Invention In order to increase the information carrying capacity for any type of communications highway, requires an understanding of the basic theory underlying channel capacity as developed by Claude Shannon and Ralph Hartley. The Shannon-Hartley Theorem is an application of the noisy channel coding Theorem to the archetypal case of a continuous-time analog communications channel subject to Gaussian noise. The theorem establishes channel capacity, a bound on the maximum amount of error-free digital data (pulse based information) that can be transmitted over a communication link, with a specified bandwidth and in the presence of the noise interference. The theorem is based on the assumption that the signal power is bounded and the Gaussian noise process is characterized by a known power or power spectral density. To achieve this goal, conventional methods attempt to increase the number of bits per single modulating frequency using efficient technology enhancements. The improvement is limited since noise on the channel remains the same. Considering all possible multi-level and multi-phase encoding techniques, the Shannon-Hartley theorem states that the channel capacity C, meaning the theoretical upper bound on the rate of clean (error free) data that can be sent with a given average signal power S through an analog communication channel subject to additive white Gaussian noise of power N is given by C=B log2(1+S/N) where C is the channel capacity in bits per second, B is the bandwidth of the channel in hertz, S is the total signal power over the bandwidth, measured in watts, N is the total noise power over the bandwidth, measured in watts, and S/N is the signal-to-noise ratio (SNR) of the communication signal to the Gaussian noise interference, expressed as a straight power ratio. The Shannon-Hartley Theorem has been applied to all conventional communications systems and provides maximum data rate supported given the bandwidth of the channel and the Signal to Noise Ratio. The limitation in the Shannon-Hartley Theorem is to communicate more bits for same signal power „S‟ and same bandwidth „B‟. In view of the above, there is a need in the art for a method and system for transmitting a signal in a network which can provide surplus spectral efficiency. Summary of the Invention An aspect of the present invention is to address at least the above-mentioned problems and/or disadvantages and to provide at least the advantages described below. Accordingly, an aspect of the present invention is to provide a method for transmitting an information signal in a network. The method including the steps of transmission of the signals in the form of bits (0,1) from a transmitter to a receiver. The method further identifies a fundamental frequency (f0) of the signal provided by the network, and using the same to form a plurality of other higher harmonic frequencies (f1, f2, f3….fn), where the identified frequency are orthogonal to each other over a time interval of 1/f0 seconds. The method furthermore identifies wavelength of each of the harmonic frequencies. Modulating each of the identified wavelength with a symbol, where the symbol includes binary or m-Ary. Summing all the modulated harmonics for further processing, including but not limited to transmission over channel or storing in memory for discrete-time signal processing. Other aspects, advantages, and salient features of the invention will become apparent to those skilled in the art from the following detailed description, which, taken in conjunction with the annexed drawings, discloses exemplary embodiments of the invention. Brief description of the drawings For a better understanding of the solution, embodiments will now be described, purely by way of example, with reference to the accompanying drawings, in which: FIG. 1 is an exemplary block diagram depicting a wireless communication system. FIG. 2 is a flow chart of a method for transmitting an information signal in a network, according to one embodiment of the present invention. FIG. 3 is an implementation at the transmitter of wavelength-modulation, according to one embodiment of the present invention. FIG. 4 shows example illustration of the implementation of wavelength modulation of Figure 3. FIG. 5 shows an implementation of matched filter at the Receiver. Persons skilled in the art will appreciate that elements in the figures are illustrated for simplicity and clarity and may have not been drawn to scale. For example, the dimensions of some of the elements in the figure may be exaggerated relative to other elements to help to improve understanding of various exemplary embodiments of the present disclosure. Throughout the drawings, it should be noted that like reference numbers are used to depict the same or similar elements, features, and structures. Detail description of the Invention The following description with reference to the accompanying drawings is provided to assist in a comprehensive understanding of exemplary embodiments of the invention as defined by the claims and their equivalents. It includes various specific details to assist in that understanding but these are to be regarded as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness. The terms and words used in the following description and claims are not limited to the bibliographical meanings, but, are merely used by the inventor to enable a clear and consistent understanding of the invention. Accordingly, it should be apparent to those skilled in the art that the following description of exemplary embodiments of the present invention are provided for illustration purpose only and not for the purpose of limiting the invention as defined by the appended claims and their equivalents. It is to be understood that the singular forms “a,” “an,” and “the” include plural referents unless the context clearly dictates otherwise. Thus, for example, reference to “a component surface” includes reference to one or more of such surfaces. By the term “substantially” it is meant that the recited characteristic, parameter, or value need not be achieved exactly, but that deviations or variations, including for example, tolerances, measurement error, measurement accuracy limitations and other factors known to those of skill in the art, may occur in amounts that do not preclude the effect the characteristic was intended to provide. Figures, discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way that would limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged communications system. The terms used to describe various embodiments are exemplary. It should be understood that these are provided to merely aid the understanding of the description, and that their use and definitions, in no way limit the scope of the invention. Terms first, second, and the like are used to differentiate between objects having the same terminology and are in no way intended to represent a chronological order, unless where explicitly stated otherwise. A set is defined as a non-empty set including at least one element. A wireless communication system regarding one example environment of the invention will be set forth by referring to FIG. 1. A transmitter 110 has one or more transmit antenna and a receiver 120 has one or more receive antenna. A system in FIG. 1 is typically used for a cellular communication system, but it is not limited to such a system. It is also possible for the system in FIG. 1 to be applied to a wireless LAN, a fixed wireless access network, etc. The transmitter has a function to modulate user data to convert it into a radio frequency (RF) signal in order to transmit the user data to the receiver wirelessly. The RF signal transmitted from the one or more transmit antennas arrives at the receive antenna of the receiver through one or more channels 130 (propagation paths). The receive antenna receives a signal in which the signal transmitted from the one or more antenna are mixed. The receiver performs a demodulation process to the received signal from the receive antenna to reproduce the user data. Often modulation and demodulation may be performed in multiple stages for implementation ease and low cost. FIG. 2 is a flow chart of a method for transmitting an information signal in a network, according to one embodiment of the present invention. At step 210, the method transmit one or more signals, where each signal is in the form of bits (0,1). At step 220, the method identifies a fundamental frequency (f0) of the transmitted signal provided and uses the same to form a plurality of other higher harmonic frequencies (f1, f2, f3….fn). The identified frequencies are orthogonal to each other over a time interval of 1/f0 seconds, and the higher harmonic frequencies are for example f1 = 2*f0 (Hz), f2=3*f0 (Hz), etc. Assuming, the total orthogonal frequencies may be N. At step 230, the method identifies wavelength of each of the harmonic frequencies (i.e.) identifying each wavelength of the N frequencies. The identified wavelength of each frequency are used to send bit or symbol such that each bit or symbol are sent on sequential number of wavelengths. At step 240, the method modulates each of the identified wavelength with a symbol, where the symbol includes binary or m-ary. In an example embodiment, the modulating wavelength including multiplying each bit or symbol with a single wavelength of frequency f0 and transmit a waveform of X0(t). The subsequent wavelength is multiplied by one bit with first wavelength of a frequency f1=2*f0 and multiply another bit with second wavelength of the same frequency f1 and transmit a waveform X1(t), and so on. Furthermore, the fundamental period is based on inverse of fundamental orthogonal frequency, f0, so that modulation of one symbol per wavelength is achieved. The time-duration for which each symbol is applied on any particular input-line is equally distributed between all the bits in that particular input-line. At step 250, the method sums all the modulated harmonics and store the same for further processing. Adding of all the modulated harmonics (all cycles) i.e. all the waveforms X0(t), X1(t), …XN(t) and summing the same to transmit onto the channel to one or more receiver. Assuming if there are N orthogonal frequencies, then there are N*(N+1)/2 wavelengths and therefore N*(N+1)/2 symbols can be transmitted over time-interval of 1/f0 seconds. Further, if each wavelength had Signal-to-Noise-Ratio as value of SNR, then the capacity of the channel is given by i.e. C = N*(N+1)/2*f0*log(1+SNR), where f0 is the fundamental frequency. It can be appreciated that this capacity is (N+1)/2 times more than Shannon Hartley Theorem for the same SNR. If N takes a value of 1000, then this new capacity is about 500 times more. In view of the above, the Channel Capacity Limit Formula is: R

Documents

Application Documents

# Name Date
1 Form 5 [31-03-2017(online)].pdf 2017-03-31
2 Form 3 [31-03-2017(online)].pdf 2017-03-31
3 Form 1 [31-03-2017(online)].pdf 2017-03-31
4 Drawing [31-03-2017(online)].pdf 2017-03-31
5 Description(Complete) [31-03-2017(online)].pdf_344.pdf 2017-03-31
6 Description(Complete) [31-03-2017(online)].pdf 2017-03-31
7 Form 26 [10-04-2017(online)].pdf 2017-04-10
8 Correspondence By Agent_Form26_13-04-2017.pdf 2017-04-13
9 201741011888-FORM-26 [28-03-2018(online)].pdf 2018-03-28
10 201741011888-FORM FOR SMALL ENTITY [28-03-2018(online)].pdf 2018-03-28
11 201741011888-CERTIFIEDCOPIESTRANSMISSIONTOIB [27-04-2018(online)].pdf 2018-04-27
12 201741011888-FORM 3 [11-05-2018(online)].pdf 2018-05-11
13 201741011888-FORM 18 [08-02-2021(online)].pdf 2021-02-08
14 201741011888-FER.pdf 2022-01-11
15 201741011888-FER_SER_REPLY [11-07-2022(online)].pdf 2022-07-11
16 201741011888-DRAWING [11-07-2022(online)].pdf 2022-07-11
17 201741011888-COMPLETE SPECIFICATION [11-07-2022(online)].pdf 2022-07-11
18 201741011888-CLAIMS [11-07-2022(online)].pdf 2022-07-11
19 201741011888-ABSTRACT [11-07-2022(online)].pdf 2022-07-11
20 201741011888-PatentCertificate05-06-2024.pdf 2024-06-05
21 201741011888-IntimationOfGrant05-06-2024.pdf 2024-06-05

Search Strategy

1 SearchHistory(49)E_28-12-2021.pdf

ERegister / Renewals

3rd: 30 Aug 2024

From 31/03/2019 - To 31/03/2020

4th: 30 Aug 2024

From 31/03/2020 - To 31/03/2021

5th: 30 Aug 2024

From 31/03/2021 - To 31/03/2022

6th: 30 Aug 2024

From 31/03/2022 - To 31/03/2023

7th: 30 Aug 2024

From 31/03/2023 - To 31/03/2024

8th: 30 Aug 2024

From 31/03/2024 - To 31/03/2025

9th: 22 Mar 2025

From 31/03/2025 - To 31/03/2026